Katherine Mao, Sharon Ferguson, James Magarian, Alison Olechowski
The growing field of machine learning (ML) and artificial intelligence (AI) presents a unique and unexplored case within persistence research, meaning it is unclear how past findings from engineering will apply to this developing field. We conduct an exploratory study to gain an initial understanding of persistence in this field and identify fruitful directions for future work. One factor that has been shown to predict persistence in engineering is belonging; we study belonging through the lens of confidence, and discuss how attention to social belonging confidence may help to increase diversity in the profession. In this research paper, we conduct a small set of interviews with students in ML/AI courses. Thematic analysis of these interviews revealed initial differences in how students see a career in ML/AI, which diverge based on interest and programming confidence. We identified how exposure and initiation, the interpretation of ML and AI field boundaries, and beliefs of the skills required to succeed might influence students' intentions to persist. We discuss differences in how students describe being motivated by social belonging and the importance of close mentorship. We motivate further persistence research in ML/AI with particular focus on social belonging and close mentorship, the role of intersectional identity, and introductory ML/AI courses.
{"title":"\"Just a little bit on the outside for the whole time\": Social belonging confidence and the persistence of Machine Learning and Artificial Intelligence students","authors":"Katherine Mao, Sharon Ferguson, James Magarian, Alison Olechowski","doi":"arxiv-2311.10745","DOIUrl":"https://doi.org/arxiv-2311.10745","url":null,"abstract":"The growing field of machine learning (ML) and artificial intelligence (AI)\u0000presents a unique and unexplored case within persistence research, meaning it\u0000is unclear how past findings from engineering will apply to this developing\u0000field. We conduct an exploratory study to gain an initial understanding of\u0000persistence in this field and identify fruitful directions for future work. One\u0000factor that has been shown to predict persistence in engineering is belonging;\u0000we study belonging through the lens of confidence, and discuss how attention to\u0000social belonging confidence may help to increase diversity in the profession.\u0000In this research paper, we conduct a small set of interviews with students in\u0000ML/AI courses. Thematic analysis of these interviews revealed initial\u0000differences in how students see a career in ML/AI, which diverge based on\u0000interest and programming confidence. We identified how exposure and initiation,\u0000the interpretation of ML and AI field boundaries, and beliefs of the skills\u0000required to succeed might influence students' intentions to persist. We discuss\u0000differences in how students describe being motivated by social belonging and\u0000the importance of close mentorship. We motivate further persistence research in\u0000ML/AI with particular focus on social belonging and close mentorship, the role\u0000of intersectional identity, and introductory ML/AI courses.","PeriodicalId":501310,"journal":{"name":"arXiv - CS - Other Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138523323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Chrysostomos Mylonas, Maria Stavara, Evangelos Mitsakis
Intelligent Transport Systems are crucial in the digital transformation of transportation. The EC mandates the establishment of National Access Points (NAPs) in each Member State, serving as common national interfaces for ITS data exchange. While progress has been made in standardizing NAP data, integration with operational ITS practices remain limited. This paper presents five NAP use cases from the NAPCORE (National Access Point Coordination Organization for Europe) CEF funded project. The first one outlines a National Virtual Traffic Management Center offering real time visualized KPIs supporting motorway traffic operations. The second focuses on NAP enabled Cooperative ITS and dynamic traffic management services. Next use case involves a Pan European interface, providing visualizations of data availability. The fourth use case enhances the digitization of traffic management plans, among different TMC. Finally, the fifth use case demonstrates a technical interface combining NAP traffic data with meteorological information for KPIs on extreme weather impacts on traffic.
{"title":"All you need is data: the added value of National Access Points as backbone European ITS data exchange infrastructures","authors":"Chrysostomos Mylonas, Maria Stavara, Evangelos Mitsakis","doi":"arxiv-2310.14054","DOIUrl":"https://doi.org/arxiv-2310.14054","url":null,"abstract":"Intelligent Transport Systems are crucial in the digital transformation of\u0000transportation. The EC mandates the establishment of National Access Points\u0000(NAPs) in each Member State, serving as common national interfaces for ITS data\u0000exchange. While progress has been made in standardizing NAP data, integration\u0000with operational ITS practices remain limited. This paper presents five NAP use\u0000cases from the NAPCORE (National Access Point Coordination Organization for\u0000Europe) CEF funded project. The first one outlines a National Virtual Traffic\u0000Management Center offering real time visualized KPIs supporting motorway\u0000traffic operations. The second focuses on NAP enabled Cooperative ITS and\u0000dynamic traffic management services. Next use case involves a Pan European\u0000interface, providing visualizations of data availability. The fourth use case\u0000enhances the digitization of traffic management plans, among different TMC.\u0000Finally, the fifth use case demonstrates a technical interface combining NAP\u0000traffic data with meteorological information for KPIs on extreme weather\u0000impacts on traffic.","PeriodicalId":501310,"journal":{"name":"arXiv - CS - Other Computer Science","volume":"44 15-16","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138523329","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper aims to provide insights related to the impact assessment and evaluation results from the use of CITS services in the Greek pilot of the CRoads Greece project, i.e., Attica Tollway and Egnatia Odos Tollway. The impact assessment and evaluation of the CITS services includes aspects related to user acceptance, real world pilot logs collected from the two pilots, and simulation experiments that were conducted for the impact assessment of the CITS services. The paper concludes with a roadmap and guidelines for the extended deployment of CITS services in the Greek highway and urban road networks.
{"title":"Large scale deployment of C-ITS: Impact assessment results of the C-Roads Greece pilots","authors":"Areti Kotsi, Evangelos Mitsakis","doi":"arxiv-2311.10734","DOIUrl":"https://doi.org/arxiv-2311.10734","url":null,"abstract":"This paper aims to provide insights related to the impact assessment and\u0000evaluation results from the use of CITS services in the Greek pilot of the\u0000CRoads Greece project, i.e., Attica Tollway and Egnatia Odos Tollway. The\u0000impact assessment and evaluation of the CITS services includes aspects related\u0000to user acceptance, real world pilot logs collected from the two pilots, and\u0000simulation experiments that were conducted for the impact assessment of the\u0000CITS services. The paper concludes with a roadmap and guidelines for the\u0000extended deployment of CITS services in the Greek highway and urban road\u0000networks.","PeriodicalId":501310,"journal":{"name":"arXiv - CS - Other Computer Science","volume":"18 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138523332","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Fleet management systems have been one of the most important research fields in transportation science. Nowadays the enhancement of fleet management systems with technologies such as the Cooperative Intelligent Transport System (CITS) that allows fleets to communicate with their environment, with other vehicles or with the road infrastructure, resulting in safer and more efficient road travel. This paper aims to present the CTMaaS platform, a tool which integrates CITS services and traffic management processes to manage vehicle fleets. Starting with a literature review, the paper presents various fleet management systems, that have been developed in the last years, and the most typical CITS services. The next chapters present the CTMaaS platform, use cases, and methodology.
{"title":"CTMaaS: An innovative platform for C-ITS-enabled dynamic Traffic and Fleet Management as a Service","authors":"Areti Kotsi, Vasileia Klimi, Evangelos Mitsakis","doi":"arxiv-2310.14052","DOIUrl":"https://doi.org/arxiv-2310.14052","url":null,"abstract":"Fleet management systems have been one of the most important research fields\u0000in transportation science. Nowadays the enhancement of fleet management systems\u0000with technologies such as the Cooperative Intelligent Transport System (CITS)\u0000that allows fleets to communicate with their environment, with other vehicles\u0000or with the road infrastructure, resulting in safer and more efficient road\u0000travel. This paper aims to present the CTMaaS platform, a tool which integrates\u0000CITS services and traffic management processes to manage vehicle fleets.\u0000Starting with a literature review, the paper presents various fleet management\u0000systems, that have been developed in the last years, and the most typical CITS\u0000services. The next chapters present the CTMaaS platform, use cases, and\u0000methodology.","PeriodicalId":501310,"journal":{"name":"arXiv - CS - Other Computer Science","volume":"780 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138523328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Turker Tuncer, Sengul Dogan, Mehmet Baygin, Prabal Datta Barua, Abdul Hafeez-Baig, Ru-San Tan, Subrata Chakraborty, U. Rajendra Acharya
The generative pre-trained transformer (GPT)-based chatbot software ChatGPT possesses excellent natural language processing capabilities but is inadequate for solving arithmetic problems, especially multiplication. Its GPT structure uses a computational graph for multiplication, which has limited accuracy beyond simple multiplication operations. We developed a graph-based multiplication algorithm that emulated human-like numerical operations by incorporating a 10k operator, where k represents the maximum power to base 10 of the larger of two input numbers. Our proposed algorithm attained 100% accuracy for 1,000,000 large number multiplication tasks, effectively solving the multiplication challenge of GPT-based and other large language models. Our work highlights the importance of blending simple human insights into the design of artificial intelligence algorithms. Keywords: Graph-based multiplication; ChatGPT; Multiplication problem
{"title":"Solving the multiplication problem of a large language model system using a graph-based method","authors":"Turker Tuncer, Sengul Dogan, Mehmet Baygin, Prabal Datta Barua, Abdul Hafeez-Baig, Ru-San Tan, Subrata Chakraborty, U. Rajendra Acharya","doi":"arxiv-2310.13016","DOIUrl":"https://doi.org/arxiv-2310.13016","url":null,"abstract":"The generative pre-trained transformer (GPT)-based chatbot software ChatGPT\u0000possesses excellent natural language processing capabilities but is inadequate\u0000for solving arithmetic problems, especially multiplication. Its GPT structure\u0000uses a computational graph for multiplication, which has limited accuracy\u0000beyond simple multiplication operations. We developed a graph-based\u0000multiplication algorithm that emulated human-like numerical operations by\u0000incorporating a 10k operator, where k represents the maximum power to base 10\u0000of the larger of two input numbers. Our proposed algorithm attained 100%\u0000accuracy for 1,000,000 large number multiplication tasks, effectively solving\u0000the multiplication challenge of GPT-based and other large language models. Our\u0000work highlights the importance of blending simple human insights into the\u0000design of artificial intelligence algorithms. Keywords: Graph-based\u0000multiplication; ChatGPT; Multiplication problem","PeriodicalId":501310,"journal":{"name":"arXiv - CS - Other Computer Science","volume":"48 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138523321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper will explore ways of computationally accounting for the metacognitive threshold -- the minimum amount of stimulus needed for a mental state to be perceived -- and discuss potential cognitive mechanisms by which this threshold can be influenced through metacognitive training and meditation.
{"title":"Metacognitive threshold: a computational account","authors":"Brendan Conway-Smith, Robert L. West","doi":"arxiv-2310.13005","DOIUrl":"https://doi.org/arxiv-2310.13005","url":null,"abstract":"This paper will explore ways of computationally accounting for the\u0000metacognitive threshold -- the minimum amount of stimulus needed for a mental\u0000state to be perceived -- and discuss potential cognitive mechanisms by which\u0000this threshold can be influenced through metacognitive training and meditation.","PeriodicalId":501310,"journal":{"name":"arXiv - CS - Other Computer Science","volume":"44 11-12","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138523330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In reliability engineering, we need to understand system dependencies, cause-effect relations, identify critical components, and analyze how they trigger failures. Three prominent graph models commonly used for these purposes are fault trees (FTs), decision trees (DTs), and binary decision diagrams (BDDs). These models are popular because they are easy to interpret, serve as a communication tool between stakeholders of various backgrounds, and support decision-making processes. Moreover, these models help to understand real-world problems by computing reliability metrics, minimum cut sets, logic rules, and displaying dependencies. Nevertheless, it is unclear how these graph models compare. Thus, the goal of this paper is to understand the similarities and differences through a systematic comparison based on their (i) purpose and application, (ii) structural representation, (iii) analysis methods, (iv) construction, and (v) benefits & limitations. Furthermore, we use a running example based on a Container Seal Design to showcase the models in practice. Our results show that, given that FTs, DTs and BDDs have different purposes and application domains, they adopt different structural representations and analysis methodologies that entail a variety of benefits and limitations, the latter can be addressed via conversion methods or extensions. Specific remarks are that BDDs can be considered as a compact representation of binary DTs, since the former allows sub-node sharing, which makes BDDs more efficient at representing logical rules than binary DTs. It is possible to obtain cut sets from BDDs and DTs and construct a FT using the (con/dis)junctive normal form, although this may result in a sub-optimal FT structure.
{"title":"Fault Trees, Decision Trees, And Binary Decision Diagrams: A Systematic Comparison","authors":"L. A. Jimenez-Roa, T. Heskes, M. Stoelinga","doi":"arxiv-2310.04448","DOIUrl":"https://doi.org/arxiv-2310.04448","url":null,"abstract":"In reliability engineering, we need to understand system dependencies,\u0000cause-effect relations, identify critical components, and analyze how they\u0000trigger failures. Three prominent graph models commonly used for these purposes\u0000are fault trees (FTs), decision trees (DTs), and binary decision diagrams\u0000(BDDs). These models are popular because they are easy to interpret, serve as a\u0000communication tool between stakeholders of various backgrounds, and support\u0000decision-making processes. Moreover, these models help to understand real-world\u0000problems by computing reliability metrics, minimum cut sets, logic rules, and\u0000displaying dependencies. Nevertheless, it is unclear how these graph models\u0000compare. Thus, the goal of this paper is to understand the similarities and\u0000differences through a systematic comparison based on their (i) purpose and\u0000application, (ii) structural representation, (iii) analysis methods, (iv)\u0000construction, and (v) benefits & limitations. Furthermore, we use a running\u0000example based on a Container Seal Design to showcase the models in practice.\u0000Our results show that, given that FTs, DTs and BDDs have different purposes and\u0000application domains, they adopt different structural representations and\u0000analysis methodologies that entail a variety of benefits and limitations, the\u0000latter can be addressed via conversion methods or extensions. Specific remarks\u0000are that BDDs can be considered as a compact representation of binary DTs,\u0000since the former allows sub-node sharing, which makes BDDs more efficient at\u0000representing logical rules than binary DTs. It is possible to obtain cut sets\u0000from BDDs and DTs and construct a FT using the (con/dis)junctive normal form,\u0000although this may result in a sub-optimal FT structure.","PeriodicalId":501310,"journal":{"name":"arXiv - CS - Other Computer Science","volume":"27 4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138523331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sebastian Pohl, Nourhan Elfaramawy, Kedi Cao, Birte Kehr, Matthias Weidlich
Scientific workflows automate the analysis of large-scale scientific data, fostering the reuse of data processing operators as well as the reproducibility and traceability of analysis results. In exploratory research, however, workflows are continuously adapted, utilizing a wide range of tools and software libraries, to test scientific hypotheses. Script-based workflow engines cater to the required flexibility through direct integration of programming primitives but lack abstractions for interactive exploration of the workflow design by a user during workflow execution. To derive requirements for such interactive workflows, we conduct an empirical study on the use of Snakemake, a popular Python-based workflow engine. Based on workflows collected from 1602 GitHub repositories, we present insights on common structures of Snakemake workflows, as well as the language features typically adopted in their specification.
{"title":"How do users design scientific workflows? The Case of Snakemake","authors":"Sebastian Pohl, Nourhan Elfaramawy, Kedi Cao, Birte Kehr, Matthias Weidlich","doi":"arxiv-2309.14097","DOIUrl":"https://doi.org/arxiv-2309.14097","url":null,"abstract":"Scientific workflows automate the analysis of large-scale scientific data,\u0000fostering the reuse of data processing operators as well as the reproducibility\u0000and traceability of analysis results. In exploratory research, however,\u0000workflows are continuously adapted, utilizing a wide range of tools and\u0000software libraries, to test scientific hypotheses. Script-based workflow\u0000engines cater to the required flexibility through direct integration of\u0000programming primitives but lack abstractions for interactive exploration of the\u0000workflow design by a user during workflow execution. To derive requirements for\u0000such interactive workflows, we conduct an empirical study on the use of\u0000Snakemake, a popular Python-based workflow engine. Based on workflows collected\u0000from 1602 GitHub repositories, we present insights on common structures of\u0000Snakemake workflows, as well as the language features typically adopted in\u0000their specification.","PeriodicalId":501310,"journal":{"name":"arXiv - CS - Other Computer Science","volume":"48 2","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138523322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This work examines the interconnections between logic, epistemology, and sciences within the Naturalist tradition. It presents a scheme that connects logic, mathematics, physics, chemistry, biology, and cognition, emphasizing scale-invariant, self-organizing dynamics across organizational tiers of nature. The inherent logic of agency exists in natural processes at various levels, under information exchanges. It applies to humans, animals, and artifactual agents. The common human-centric, natural language-based logic is an example of complex logic evolved by living organisms that already appears in the simplest form at the level of basal cognition of unicellular organisms. Thus, cognitive logic stems from the evolution of physical, chemical, and biological logic. In a computing nature framework with a self-organizing agency, innovative computational frameworks grounded in morphological/physical/natural computation can be used to explain the genesis of human-centered logic through the steps of naturalized logical processes at lower levels of organization. The Extended Evolutionary Synthesis of living agents is essential for understanding the emergence of human-level logic and the relationship between logic and information processing/computational epistemology. We conclude that more research is needed to elucidate the details of the mechanisms linking natural phenomena with the logic of agency in nature.
{"title":"Morphological Computing as Logic Underlying Cognition in Human, Animal, and Intelligent Machine","authors":"Gordana Dodig-Crnkovic","doi":"arxiv-2309.13979","DOIUrl":"https://doi.org/arxiv-2309.13979","url":null,"abstract":"This work examines the interconnections between logic, epistemology, and\u0000sciences within the Naturalist tradition. It presents a scheme that connects\u0000logic, mathematics, physics, chemistry, biology, and cognition, emphasizing\u0000scale-invariant, self-organizing dynamics across organizational tiers of\u0000nature. The inherent logic of agency exists in natural processes at various\u0000levels, under information exchanges. It applies to humans, animals, and\u0000artifactual agents. The common human-centric, natural language-based logic is\u0000an example of complex logic evolved by living organisms that already appears in\u0000the simplest form at the level of basal cognition of unicellular organisms.\u0000Thus, cognitive logic stems from the evolution of physical, chemical, and\u0000biological logic. In a computing nature framework with a self-organizing\u0000agency, innovative computational frameworks grounded in\u0000morphological/physical/natural computation can be used to explain the genesis\u0000of human-centered logic through the steps of naturalized logical processes at\u0000lower levels of organization. The Extended Evolutionary Synthesis of living\u0000agents is essential for understanding the emergence of human-level logic and\u0000the relationship between logic and information processing/computational\u0000epistemology. We conclude that more research is needed to elucidate the details\u0000of the mechanisms linking natural phenomena with the logic of agency in nature.","PeriodicalId":501310,"journal":{"name":"arXiv - CS - Other Computer Science","volume":"33 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138523327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Marta Baldomero-Naranjo, Víctor Blanco, Sergio García, Ricardo Gázquez, Jörg Kalcsics, Luisa I. Martínez-Merino, Juan M. Muñoz-Ocaña, Francisco Temprano, Alberto Torrejón
The International Workshop on Locational Analysis and Related Problems will take place during September 7-8, 2023 in Edinburgh (United Kingdom). It is organized by the Spanish Location Network and the Location Group GELOCA from the Spanish Society of Statistics and Operations Research (SEIO). The Spanish Location Network is a group of more than 140 researchers from several Spanish universities organized into 7 thematic groups. The Network has been funded by the Spanish Government since 2003. The current project is RED2022-134149-T. One of the main activities of the Network is a yearly meeting aimed at promoting the communication among its members and between them and other researchers, and to contribute to the development of the location field and related problems. As a proof of the internationalization of this research group, this will be the first time that the meeting is held out of Spain. The topics of interest are location analysis and related problems. This includes location models, networks, transportation, logistics, exact and heuristic solution methods, and computational geometry, among others.
{"title":"Proceedings of the XII International Workshop on Locational Analysis and Related Problems","authors":"Marta Baldomero-Naranjo, Víctor Blanco, Sergio García, Ricardo Gázquez, Jörg Kalcsics, Luisa I. Martínez-Merino, Juan M. Muñoz-Ocaña, Francisco Temprano, Alberto Torrejón","doi":"arxiv-2309.08337","DOIUrl":"https://doi.org/arxiv-2309.08337","url":null,"abstract":"The International Workshop on Locational Analysis and Related Problems will\u0000take place during September 7-8, 2023 in Edinburgh (United Kingdom). It is\u0000organized by the Spanish Location Network and the Location Group GELOCA from\u0000the Spanish Society of Statistics and Operations Research (SEIO). The Spanish\u0000Location Network is a group of more than 140 researchers from several Spanish\u0000universities organized into 7 thematic groups. The Network has been funded by\u0000the Spanish Government since 2003. The current project is RED2022-134149-T. One\u0000of the main activities of the Network is a yearly meeting aimed at promoting\u0000the communication among its members and between them and other researchers, and\u0000to contribute to the development of the location field and related problems. As\u0000a proof of the internationalization of this research group, this will be the\u0000first time that the meeting is held out of Spain. The topics of interest are\u0000location analysis and related problems. This includes location models,\u0000networks, transportation, logistics, exact and heuristic solution methods, and\u0000computational geometry, among others.","PeriodicalId":501310,"journal":{"name":"arXiv - CS - Other Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138523326","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：