Conceptual distance refers to the degree of proximity between two concepts within a conceptualization. It is closely linked with semantic similarity and relationship, but its computation relies entirely on the context of the given concepts. The DIS-C algorithm, which requires using search algorithms such as Breadth First Search, represents an advance in computing the semantic similarity/relation regardless of the type of knowledge structure and semantic relationships. The shortest path algorithm facilitates the determination of the semantic closeness between two indirectly connected concepts in an ontology by propagating local distances. This process is implemented for each concept pair to establish the most effective and efficient paths to connect these concepts. The algorithm identifies the shortest path between the concepts, allowing for the inference of the most relevant relationships between them. This approach contributes to developing a comprehensive understanding of the ontology and enhances the accuracy and precision of the semantic representation of the concepts. However, one of the critical issues is associated with the computational complexity due to the nature of the algorithm, which is errorn3. This paper studies alternatives to accelerate the DIS-C based on approximation and optimized algorithms, focusing on Dijkstra, pruned Dijkstra, and Sketched-based algorithms to compute conceptual distance. Based on the experiments, we discovered that the bottleneck can be avoided using the proposed 2-hop coverages, bringing DIS-C almost linearity.

At the beginning of 2019, the petroleum crisis impacted many economies dependent on this industry. The Mexican government started programs to identify points and government officials involved in the gasoline stealing from PEMEX (Petróleos Mexicanos), the country’s leading government petroleum company. The programs consisted of supervising and monitoring the Mexican country network of gasoline ducts to detect points where gasoline was being stolen. Consequently, large urban regions faced a lack and shortage of gasoline. This situation generated several reactions in social media and many open data in news media. Although the government provided open data about stealing gasoline locations related to crimes, it did not analyze the collected data to identify patterns, insights, and the spatio-temporal characterization of this phenomenon. This paper presents a study to deal with the regional semantics described in the social media locations of gasoline stealing. Thus, a framework to discover the trends that emerge from social media and how it is correlated with the government’s open data is also presented—the proposed methodology used machine learning techniques based on linguistic and semantic technologies. The analysis was applied to a dataset of 24,317 geo-referenced tweets. The obtained results reflected the Mexican thinking opinion regarding discovered social topics, polarization maps, and regional insights. According to discovered trends, there were long fuel lines between 1.5 and 5 kilometers (on average) at fuel stations in different Mexican states.

Anticipating and planning for the urgent response to large-scale disasters is critical to increase the probability of survival in these events. These incidents present various challenges that complicate the response, such as unfavorable weather conditions, difficulties in accessing affected areas, and the geographical spread of the victims. Furthermore, local socioeconomic factors such as insufficient prevention education, limited disaster assets, and inadequate coordination between public and private emergency services may complicate these situations. In large-scale emergencies, multiple hotspots are usually observed, which requires efforts to coordinate the strategic allocation of human and material resources in different geographical areas. Therefore, the precise management of these resources based on the specific needs of each area becomes fundamental. To address these complexities, this paper proposes a methodology that models these scenarios as an optimization problem, focusing on the location and allocation of resources in mass casualty incidents. The proposed case study is Mexico City in a post-earthquake scenario, using voluntary geographic information, open government data, and historical data from the September 19, 2017 earthquake. Additionally, it is assumed that the resources that require optimal location and allocation are ambulances, which focus on medical issues that affect the survival of victims. The designed solution involves the use of a metaheuristic optimization technique, along with a parameter tuning technique, to find configurations that perform at different instances of the problem, i.e., different hypothetical scenarios that can be used as a reference for future possible situations. Finally, the objective is to present the different solutions graphically, accompanied by relevant information to facilitate the decision-making process of the authorities responsible for the practical implementation of these solutions.