Road network studies attracted unprecedented and overwhelming interest in recent years due to the clear relationship between human existence and city evolution. Current studies cover many aspects of a road network, for example, road feature extraction from video/image data, road map generalisation, traffic simulation, optimisation of optimal route finding problems, and traffic state prediction. However, analysing road networks as a complex graph is a field to explore. This study presents comparative studies on the Porto, in Portugal, road network sections, mainly of Matosinhos, Paranhos, and Maia municipalities, regarding degree distributions, clustering coefficients, centrality measures, connected components, k-nearest neighbours, and shortest paths. Further insights into the networks took into account the community structures, page rank, and small-world analysis. The results show that the information exchange efficiency of Matosinhos is 0.8, which is 10 and 12.8% more significant than that of the Maia and Paranhos networks, respectively. Other findings stated are: (1) the studied road networks are very accessible and densely linked; (2) they are small-world in nature, with an average length of the shortest pathways between any two roads of 29.17 units, which as found in the scenario of the Maia road network; and (3) the most critical intersections of the studied network are 'Avenida da Boavista, 4100-119 Porto (latitude: 41.157944, longitude: - 8.629105)', and 'Autoestrada do Norte, Porto (latitude: 41.1687869, longitude: - 8.6400656)', based on the analysis of centrality measures.

The paper introduces mixed networks, a new graphical model framework for expressing and reasoning with probabilistic and deterministic information. The motivation to develop mixed networks stems from the desire to fully exploit the deterministic information (constraints) that is often present in graphical models. Several concepts and algorithms specific to belief networks and constraint networks are combined, achieving computational efficiency, semantic coherence and user-interface convenience. We define the semantics and graphical representation of mixed networks, and discuss the two main types of algorithms for processing them: inference-based and search-based. A preliminary experimental evaluation shows the benefits of the new model.

Social networks like Twitter, Facebook have recently become the most widely used communication platforms for people to propagate information rapidly. Fast diffusion of information creates accuracy and scalability issues towards topic detection. Most of the existing approaches can detect the most popular topics on a large scale. However, these approaches are not effective for faster detection. This article proposes a novel topic detection approach - Node Significance based Label Propagation Community Detection (NSLPCD) algorithm, which detects the topic faster without compromising accuracy. The proposed algorithm analyzes the frequency distribution of keywords in the collection of tweets and finds two types of keywords: topic-identifying and topic-describing keywords, which play an important role in topic detection. Based on these defined keywords, the keyword co-occurrence graph is built, and subsequently, the NSLPCD algorithm is applied to get topic clusters in the form of communities. The experimental results using the real data of Twitter, show that the proposed method is effective in quality as well as run-time performance as compared to other existing methods.

In this paper, we investigate a novel physician scheduling problem in the Mobile Cabin Hospitals (MCH) which are constructed in Wuhan, China during the outbreak of the Covid-19 pandemic. The shortage of physicians and the surge of patients brought great challenges for physicians scheduling in MCH. The purpose of the studied problem is to get an approximately optimal schedule that reaches the minimum workload for physicians on the premise of satisfying the service requirements of patients as much as possible. We propose a novel hybrid algorithm integrating particle swarm optimization (PSO) and variable neighborhood descent (VND) (named as PSO-VND) to find the approximate global optimal solution. A self-adaptive mechanism is developed to choose the updating operators dynamically during the procedures. Based on the special features of the problem, three neighborhood structures are designed and searched in VND to improve the solution. The experimental comparisons show that the proposed PSO-VND has a significant performance increase than the other competitors.