Context-aware Self-Optimization in Small-Cell Networks

Most mobile communications take place at indoor environments, especially in commercial and corporate scenarios. These places normally present coverage and capacity issues due to the poor signal quality, which degrade the end-user Quality of Experience (QoE). In these cases, mobile operators are offering small cells to overcome the indoor issues, being femtocells the main deployed base stations. Femtocell networks provide significant benefits to mobile operators and their clients. However, the massive integration and the particularities of femtocells, make the maintenance of these infrastructures a challenge for engineers. In this sense, Self-Organizing Networks (SON) techniques play an important role. These techniques are a key feature to intelligently automate network operation, administration and management procedures. SON mechanisms are based on the analysis of the mobile network alarms, counters and indicators. In parallel, electronics, sensors and software applications evolve rapidly and are everywhere. Thanks to this, valuable context information can be gathered, which properly managed can improve SON techniques performance. Within possible context data, one of the most active topics is the indoor positioning due to the immediate interest on indoor location-based services (LBS). At indoor commercial and corporate environments, user densities and traffic vary in spatial and temporal domain. These situations lead to degrade cellular network performance, being temporary traffic fluctuations and focused congestions one of the most common issues. Load balancing techniques, which have been identified as a use case in self-optimization paradigm for Long Term Evolution (LTE), can alleviate these congestion problems. This use case has been widely studied in macrocellular networks and outdoor scenarios. However, the particularities of femtocells, the characteristics of indoor scenarios and the influence of users’ mobility pattern justify the development of new solutions. The goal of this PhD thesis is to design and develop novel and automatic solutions for temporary traffic fluctuations and focused network congestion issues in commercial and corporate femtocell environments. For that purpose, the implementation of an efficient management architecture to integrate context data into the mobile network and SON mechanisms is required. Afterwards, an accurate indoor positioning system is developed, as a possible inexpensive solution for context-aware SON. Finally, advanced self-optimization methods to shift users from overloaded cells to other cells with spare resources are designed. These methods tune femtocell configuration parameters based on network information, such as ratio of active users, and context information, such as users’ position. All these methods are evaluated in both a dynamic LTE system-level simulator and in a field-trial

Text Similarity Between Concepts Extracted from Source Code and Documentation

Context: Constant evolution in software systems often results in its documentation losing sync with the content of the source code. The traceability research field has often helped in the past with the aim to recover links between code and documentation, when the two fell out of sync. Objective: The aim of this paper is to compare the concepts contained within the source code of a system with those extracted from its documentation, in order to detect how similar these two sets are. If vastly different, the difference between the two sets might indicate a considerable ageing of the documentation, and a need to update it. Methods: In this paper we reduce the source code of 50 software systems to a set of key terms, each containing the concepts of one of the systems sampled. At the same time, we reduce the documentation of each system to another set of key terms. We then use four different approaches for set comparison to detect how the sets are similar. Results: Using the well known Jaccard index as the benchmark for the comparisons, we have discovered that the cosine distance has excellent comparative powers, and depending on the pre-training of the machine learning model. In particular, the SpaCy and the FastText embeddings offer up to 80% and 90% similarity scores. Conclusion: For most of the sampled systems, the source code and the documentation tend to contain very similar concepts. Given the accuracy for one pre-trained model (e.g., FastText), it becomes also evident that a few systems show a measurable drift between the concepts contained in the documentation and in the source code.</p

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words