Abstract
Web search engines have marked everyone's life by transforming how one searches and accesses information. Search engines give special attention to the user interface, especially search engine result pages (SERP). The well-known "10 blue links"list has evolved into richer interfaces, often personalized to the search query, the user, and other aspects. More than 20 years later, the literature has not adequately portrayed this development. We present a study on the evolution of SERP interfaces during the last two decades using Google Search as a case study. We used the most searched queries by year to extract a sample of SERP from the Internet Archive. Using this dataset, we analyzed how SERP evolved in content, layout, design (e.g., color scheme, text styling, graphics), navigation, and file size. We have also analyzed the user interface design patterns associated with SERP elements. We found that SERP are becoming more diverse in terms of elements, aggregating content from different verticals and including more features that provide direct answers. This systematic analysis portrays evolution trends in search engine user interfaces and, more generally, web design. We expect this work will trigger other, more specific studies that can take advantage of our dataset.

Abstract
Web Search Engine Results Pages (SERP) are one of the most well-known and used web pages. These pages have started as simple "10 blue links"pages, but the information in SERP currently goes way beyond these links. Several features have been included in these pages to complement organic and sponsored results and attempt to provide answers to the query instead of just pointing to websites that might deliver that information. In this work, we analyze the appearance and evolution of SERP features in the two leading web search engines, Google Search and Microsoft Bing. Using a sample of SERP from the Internet Archive, we analyzed the appearance and evolution of these features. We found that SERP are becoming more diverse in terms of elements, aggregating content from different verticals and including more features that provide direct answers.

Abstract
Educational chatbots are digital tools designed to assist learners in various educational settings. These chatbots use natural language processing (NLP) and machine learning algorithms to simulate human conversation and respond to user queries in a way that facilitates learning. They can be integrated into various educational platforms such as learning management systems, educational apps, and websites to provide learners with a personalized and interactive learning experience. Our paper discusses different scenarios for educational purposes and suggests in total four scenarios for educational needs.

Abstract

Abstract
In the past few years, the genetic programming approach (GP) has been successfully used by researchers to design priority rules for the resource-constrained project scheduling problem (RCPSP) thanks to its high generalization ability and superior performance. However, one of the main drawbacks of the GP is that the fitness evaluation in the training process often requires a very high computational effort. In order to reduce the runtime of the training process, this research proposed four different surrogate models for the RCPSP. The experiment results have verified the effectiveness and the performance of the proposed surrogate models. It is shown that they achieve similar performance as the original model with the same number of evaluations and better performance with the same runtime. We have also tested the performance of one of our surrogate models with seven different population sizes to show that the selected surrogate model achieves similar performance for each population size as the original model, even when the searching space is sufficiently explored. Furthermore, we have investigated the accuracy of our proposed surrogate models and the size of the rules they designed. The result reveals that all the proposed surrogate models have high accuracy, and sometimes the rules found by them have a smaller size compared with the original model.

Abstract
The branch-and-bound (B&B) procedure is one of the most widely used techniques to get optimal so-lutions for the resource-constrained project scheduling problem (RCPSP). Recently, various components from the literature have been assembled by Coelho and Vanhoucke (2018) into a unified search algo-rithm using the best performing lower bounds, branching schemes, search strategies, and dominance rules. However, due to the high computational time, this procedure is only suitable to solve small to medium-sized problems. Moreover, despite its relatively good performance, not much is known about which components perform best, and how these components should be combined into a procedure to maximize chances to solve the problem. This paper introduces a structured prediction approach to rank various combinations of components (configurations) of the integrated B&B procedure. More specifically, two regression methods are used to map project indicators to a full ranking of configurations. The objec-tive is to provide preference information about the quality of different configurations to obtain the best possible solution. Using such models, the ranking of all configurations can be predicted, and these predic-tions are then used to get the best possible solution for a new project with known network and resource values. A computational experiment is conducted to verify the performance of this novel approach. Fur-thermore, the models are tested for 48 different configurations, and their robustness is investigated on datasets with different numbers of activities. The results show that the two models are very competitive, and both can generate significantly better results than any single-best configuration.