Search

Academic genealogy (AG) provides valuable insights into the transmission of knowledge from mentors to mentees, revealing the evolution of knowledge within the academic community. This study explores the intricate dynamics of knowledge evolution within academic genealogies, utilizing on a dataset comprising 16,852 computer science researchers, 613,277 papers, and 11,988 mentorship relationships. By focusing on small-scale knowledge units, our analysis aims to uncover patterns of knowledge inheritance and mutation across different subfields of computer science and highlights several aspects of knowledge evolution in computer science. Firstly, computer science is characterized by strong mentorship ties, indicating the significance of knowledge transmission within the field. Additionally, there is a mix of foundational and developing areas, suggesting a field that is growing and diversifying rather than declining, as indicated by linear regression outcomes. Secondly, our research reveals a surge in collaborative knowledge exchange in computer science since 2000, with fields such as Computer-Communication Networks and Software Engineering leading in terms of output and impact. Furthermore, areas like Computer Graphics and Artificial Intelligence stand out for their depth and novelty. Thirdly, we categorize researchers into three types: roots, branches, and leaves, reflecting their role in knowledge transmission. Branch researchers tend to innovate, while leaf researchers show a combination of traditional knowledge uptake and new contributions, illustrating the dynamic flow of ideas within the field. Future research endeavors are encouraged to embrace larger datasets and further fortify our understanding of the topic. [ABSTRACT FROM AUTHOR]

The seven papers included in this special issue represent a selection of extended contributions presented at the 16th International Conference on Soft Computing Models in Industrial and Environmental Applications, SOCO 2021, held in Bilbao, Spain, September 22nd-24th, 2021, and organized by the BISITE group and the University of Deusto. The SOCO 2021 international conference represents a collection or set of computational techniques in machine learning, computer science and some engineering disciplines that investigate, simulate, and analyse very complex issues and phenomena. This special issue is aimed at practitioners, researchers, and postgraduate students who are engaged in developing and applying advanced intelligent systems principles to solve real-world problems in the mentioned fields. [ABSTRACT FROM AUTHOR]

Combinatorial optimization problem (COP) is an NP-hard problem for which finding an optimal solution is difficult, especially as the problem size increases. The Traveling Salesman Problem (TSP), one of the COPs that can be formulated over a graph, is a well-researched area in operations research and computer science. Deep Reinforcement Learning (DRL) is now regarded as a promising approach for solving TSP and other NP hard problems. In this paper, we propose a novel Gated Deep Graph Attention Network (G-DGANet) which builds upon the existing Graph Neural Network (GNN) to solve TSP. The proposed G-DGANet uses gating mechanism between subsequent layers of the network to extract representations of nodes deeper in the network without loss in performance. G-DGANet also designs a novel aggregator to construct global graph embeddings from different embedding preferences. In addition, to effectively learn underlying structure of a graph, G-DGANet integrates node and edge information of the graph while updating node representations in the message passing mechanism. We used proximal policy optimization (PPO) to train G-DGANet on randomly generated instances. We conducted an experiment on randomly generated instances and on real-world road network data generated from digital maps to verify the performance of G-DGANet. The findings from experiments demonstrate that G-DGANet outperforms most traditional heuristics and existing DRL approaches, with high generalization abilities from random instance training to random instance testing and real-world road network instance testing. [ABSTRACT FROM AUTHOR]

Fair division of indivisible resources is a fundamental problem in many disciplines, including computer science, economy, operations research, etc. The existence of PMMS allocations of goods is a major open problem in fair division, even for additive valuations. At the state of the art, there is no identified setting where PMMS allocations are deemed impossible, and the known existing results regarding their existence are limited to highly constrained settings. In this paper, we provide an algorithm for computing a PMMS allocation for identical variant. We also use the algorithm to find the PMMS allocations for 3 agents in line graphs. Moreover, we show that a 4 5 -PMMS allocation can be computed in polynomial time when agents agree on the ordinal ranking of the goods. A quantitative gauge for assessing the impact on social welfare is known as the price of fairness , which quantifies the maximum possible reduction in social welfare due to the imposition of fairness constraints. Originally explored in the context of divisible goods, the concept of the price of fairness continues to be a pivotal metric for evaluating the effect of fairness considerations on overall social welfare. Consequently, we study the efficiency decrease under PMMS allocations and prove a tight upper bound on the price of PMMS allocations. • We present an algorithm to compute a PMMS allocation if agents' valuation functions are identical. • We analyze an existing algorithm terminates with a 4 5 -PMMS allocation in polynomial time when agents have identical ordinal ranking values of the goods. • We also examine the efficiency loss associated with PMMS allocations and establish their precise price bound. [ABSTRACT FROM AUTHOR]

Artificial neural networks, inspired by the biological networks of the human brain, have become game-changing computing models in modern computer science. Inspired by their wide scope of applications, synthetic biology strives to create their biological counterparts, which we denote synthetic biological neural networks (SYNBIONNs). Their use in the fields of medicine, biosensors, biotechnology, and many more shows great potential and presents exciting possibilities. So far, many different synthetic biological networks have been successfully constructed, however, SYNBIONN implementations have been sparse. The latter are mostly based on neural networks pretrained in silico and being heavily dependent on extensive human input. In this paper, we review current implementations and models of SYNBIONNs. We briefly present the biological platforms that show potential for designing and constructing perceptrons and/or multilayer SYNBIONNs. We explore their future possibilities along with the challenges that must be overcome to successfully implement a scalable in vivo biological neural network capable of online learning. [ABSTRACT FROM AUTHOR]

In natural language processing (NLP), transformer based models have surpassed recurrent neural networks (RNN) as state of the art, being introduced specifically to address the limitations of RNNs originating from its sequential nature. As a similar sequence modeling problem, transformer methods can be readily adapted for deep learning time series prediction. This paper proposes a sparse transformer based approach for electricity load prediction. The layers of a transformer addresses the shortcomings of RNNs and CNNs by applying the attention mechanism on the entire time series, allowing any data point in the input to influence any location in the output of the layer. This allows transformers to incorporate information from the entire sequence in a single layer. Attention computations can also be parallelized. Thus, transformers can achieve faster speeds, or trade this speed for more layers and increased complexity. In experiments on public datasets, the sparse transformer attained comparable accuracy to an RNN-based SOTA method (Liu et al., 2022) while being up to 5× faster during inference. Moreover, the proposed model is general enough to forecast the load from individual households to city levels as shown in the extensive experiments conducted. [ABSTRACT FROM AUTHOR]

Recent improvements in the accessibility of mapping tools and an increased recognition of the importance of leveraging data to inform public health operations has led to enthusiasm among public health departments to rapidly evolve their ability to analyze and apply data to programs. As the COVID-19 pandemic made evident, many health department data systems have been neglected for decades and data literacy among staff low. Significant federal dollars have been allocated to local health departments to modernize health systems. This case study recounts the effort to equip the Pima County Health Department with a highly sophisticated "COVID-19 Vaccines Solutions Dashboard" in 2021-2022, quantifying community vulnerability in the midst of the COVID-19 pandemic and shares key successes and challenges in process and outcomes that can guide other such dashboard initiatives. The experience informed the development of Pima' County Health Department's Data & Informatics Team as well as efforts to cultivate a more robust data culture throughout the department. Many health departments around the United States are in a similar position, and these lessons learned are widely applicable. [ABSTRACT FROM AUTHOR]

In human-human and human-robot interaction, the counterpart influences the human's affective state. Contrary to humans, robots inherently cannot respond empathically, meaning non-beneficial affective reactions cannot be mitigated. Thus, to create a responsible and empathetic human-robot interaction (HRI), involving anthropomorphic service robots, the effect of robot behavior on human affect in HRI must be understood. To contribute to this understanding, we provide the new comprehensive data set AFFECT-HRI, including, for the first time, physiological data labeled with human affect (i.e., emotions and mood) gathered from a conducted HRI study. Within the study, 146 participants interacted with an anthropomorphic service robot in a realistic and complex retail scenario. The participants' questionnaire ratings regarding affect, demographics, and socio-technical ratings are provided in the data set. Five different conditions (i.e., neutral, transparency, liability, moral, and immoral) were considered during the study, eliciting different affective reactions and allowing interdisciplinary investigations (e.g., computer science, law, and psychology). Each condition includes three scenes: a consultation regarding products, a request for sensitive personal information, and a handover. [ABSTRACT FROM AUTHOR]

In recent years, education has undergone a profound transformation process, having gone from relying only on the traditional lecture to making full use of digital formats. This gradual process, accelerated by the COVID‐19 pandemic in the last years, has triggered innovative changes in the educational process. Within this context, many lecturers have adopted the flipped classroom instructional model, aiming to improve the motivation and involvement of the students. In this model, students must acquire certain theoretical knowledge at home, and the classes, with the help of the lecturer, are used for the more practical part. This article presents the results obtained when the flipped classroom model was implemented in the computer science degree. Specifically, during 2020–2021 and 2021–2022 courses, this instructional model was assessed in 15 subjects. Results show that the flipped classroom instructional model can be stated that it has improved the students' perception of the learning experience, students' dedication and engagement has been improved, students' perception of their understanding of the subject has improved. The faculty considers that the teaching experience has improved and is in favor of continuing with the experience in future courses. We have implemented a flipped classroom experience in the computer science degree. We have involved 11 subjects of different courses. We describe our experience and share our results that will help another universities that want to improve their education experience. [ABSTRACT FROM AUTHOR]

Educational technologists and practitioners have made substantial strides in developing affordable digital and tangible resources to support both formal and informal computer science instruction. However, there is a lack of research on practice-based assignments, such as Internet of Things (IoT) projects, that allow undergraduate students to design and demonstrate educational robots using digital or physical assistance, especially when it comes to computational thinking (CT) and programming skills development in association with their psycho-emotional experience. This study compares the impact of Scratch and LEGO® WeDo robotic kits on students' CT and programming skills development. A quasi-experimental approach was conducted, involving two hundred forty-six participants (n = 246), who were equally divided between Scratch and LEGO® WeDo groups. Results indicate that the LEGO® WeDo group showed greater improvement in CT and programming skills development, while designing and presenting IoT projects. Nevertheless, no significant association between motivation, grit, and CT skills was observed. The findings highlight the potential of tangible robotics in facilitating students' hands-on learning and enhancing motivation to foster CT and programming skills. This study provides a wide range of implications for instructional designers on how to use tangible robotics to support hands-on IoT projects in computer science courses. [ABSTRACT FROM AUTHOR]

Background: Maintaining good quality of healthcare data at various levels is a critical challenge in developing countries. The barriers to healthcare data quality remain largely unexplored in eastern Ethiopia. Objective: This studyaimed to assess the barriers toqualityof healthcare data in urban public health facilities in the Dire Dawa city administration from7 April to 7 May 2019. Methods: An institutional-based qualitative exploratory approach was used among 17 purposefully selected key informants. In-depth interviews were inductively coded using the ATLAS.ti 7.5.4 version software. Inductive analysis was used by semantically analyzing the explicit content of the data to determine our themes. Results: Several key themes and subthemes with different barriers, some of which are mutually non-exclusive, were identified. These include: Organizational Barriers: Lack of an adequate health management information system and data clerk staff, poor management commitment, lack of post-training follow-up, work overload, frequent duty rotation, lack of incentives for good performers, lack of targeted feedback, and poor culture of information use. Behavioral/Individual Barriers: Gaps in the skill of managers and health professionals, lack of adequate awareness of each indicator and its definitions, inadequate educational competence, lack of feeling of ownership, poor commitment, lack of daily tallying, and lack of value for data. Technical Barriers: Lack of a standard form, diverse and too many data entry formats, manual data collection, shortage of supplies, failure to repair system break down in a timely manner, interruption in electricity and network, delay in digitizing health information systems, lack of post-training follow-up, and inadequate supervision. External Barriers: Poor collaboration between stakeholders, dependence on the software program of non-governmental organizations, and very hot weather conditions. Conclusion: Diverse and complex barriers to maintenance of data quality were identified. Developing standardized health management information system implementation plans, providing advanced supervisory-level training, supportive supervision, and site-level mentorship may be very effective in identifying and resolving bottleneck data quality issues. Healthcare managers should understand the imperative of data quality and accept responsibility for its improvement and maintenance. Interventions targeted only at supplies will not fully overcome limitations to data quality. Motivation of staff and recognition of best performance can motivate others and can create cooperation among staff. [ABSTRACT FROM AUTHOR]

Digital computers were invented in the 1940s. They are sophisticated and versatile machines whose functioning is grounded in elaborate theory. Advances in theory and the availability of computers helped computer science to develop as an academic discipline, and university departments for the same started coming up in the 1960s. Computer science covers all phenomenon related to computers and consists primarily of man-made laws governing building, programming, and using computers. Computational thinking is a way of thinking influenced by computers and computer science. There are two schools of thought on computational thinking. The first school sees computational thinking as the use of computers to explore the world, while the other sees computational thinking as the application of concepts from computer science to solve real-world problems. Scholars typically agree that computational thinking has four essential components, viz., abstraction, decomposition, algorithm design, and generalization. Computational thinking is often feted by computer scientists as a useful skill that can be used by anybody anywhere. However, it is necessary to find out ways for successfully using computational thinking in domains other than computer science before it can be declared a universal skill. [ABSTRACT FROM AUTHOR]

In common with other omics technologies, mass spectrometry (MS)-based proteomics produces ever-increasing amounts of raw data, making efficient analysis a principal challenge. A plethora of different computational tools can process the MS data to derive peptide and protein identification and quantification. However, during the last years there has been dramatic progress in computer science, including collaboration tools that have transformed research and industry. To leverage these advances, we develop AlphaPept, a Python-based open-source framework for efficient processing of large high-resolution MS data sets. Numba for just-in-time compilation on CPU and GPU achieves hundred-fold speed improvements. AlphaPept uses the Python scientific stack of highly optimized packages, reducing the code base to domain-specific tasks while accessing the latest advances. We provide an easy on-ramp for community contributions through the concept of literate programming, implemented in Jupyter Notebooks. Large datasets can rapidly be processed as shown by the analysis of hundreds of proteomes in minutes per file, many-fold faster than acquisition. AlphaPept can be used to build automated processing pipelines with web-serving functionality and compatibility with downstream analysis tools. It provides easy access via one-click installation, a modular Python library for advanced users, and via an open GitHub repository for developers. Mass spectrometry-based proteomics faces the challenge of processing vast data amounts. Here, the authors introduce AlphaPept, an open-source, Python-based framework that offers high speed analysis and easy integration for large-scale proteome analysis. [ABSTRACT FROM AUTHOR]

As ethical issues involving computer technologies and social media become more common, there is increasing interest in what role ethics should play in computer science education. As a result, computer science departments worldwide have ramped up their efforts to examine relevant ethical issues in undergraduate computer science classes to prepare emerging professionals to face relevant issues when they enter the computing workforce. As part of these efforts, a public R-1 Hispanic-Serving Institution located on the United States–Mexico border piloted a leadership course based on the Relational Leadership Model (Komives et al., 2013). This model provides a broad idea of leadership that focuses on leaders developing and exercising their ethical awareness by engaging in discussions of ethical issues. The pilot course was organized around the implementation of a cooperative pedagogical tool known as structured academic controversy (Johnson et al., 1996). We describe in detail the strategy for implementing this approach, discuss key elements of students' final reflections about their participation in the academic controversy, and present the quantitative results to examine students' understanding of leadership and satisfaction with the pilot course. [ABSTRACT FROM AUTHOR]

Decision problems in physics have been an active field of research for quite a few decades resulting in some interesting findings in recent years. However, such research investigations are based on a priori knowledge of theoretical computer science and the technical jargon of set theory. Here, I discuss a particular, but a significant, instance of how decision problems in physics can be realised without such specific prerequisites. I expose a hitherto unnoticed contradiction, that can be posed as as decision problem, concerning the oil drop experiment, thereby resolve it by refining the notion of 'existence' in physics. This consequently leads to the undecidability of the charge spectral gap through the notion of 'undecidable charges' which is in tandem with the completeness condition of a theory as was stated by Einstein, Podolsky and Rosen in their seminal work. Decision problems can now be realised in connection with basic physics, in general, rather than quantum physics, in particular, as per some recent claims. [ABSTRACT FROM AUTHOR]

Engineering education has continually evolved to embrace Project–Based Learning (PBL), a dynamic classroom approach emphasizing learning through engagement in real–world projects. The study conducts a comparative analysis of multidisciplinary Capstone Senior Design Projects across Electrical Engineering, Mechanical Engineering, and Computer Science at Texas A&M University at Texarkana. The research emphasizes understanding the dynamics of student collaboration within these disciplines and scrutinizes the impact of industry and faculty sponsorship on these projects. The methodology involves a comprehensive comparative analysis, employing diverse performance metrics to evaluate the effectiveness of different sponsorship models. This approach aims to uncover the influence of these models on project outcomes and students' educational experiences. The results reveal notable differences between industry–sponsored and faculty–sponsored projects. Industry sponsorship leads to higher performance in overall project execution and professional skills development. In contrast, faculty–sponsored projects are more effective in nurturing teamwork and communication abilities among students. The findings suggest that each sponsorship type presents unique benefits and challenges. Industry–sponsored projects provide valuable hands–on problem–solving experience, though they may suffer from inconsistencies in mentorship and varying expectations. Faculty–sponsored projects offer a more stable and consistent educational environment but might lag slightly in performance metrics. Integrating elements from both sponsorship models could provide students with a more balanced and enriching learning experience. [ABSTRACT FROM AUTHOR]

Hollywood screenwriters worry about Artificial Intelligence (AI) replacements taking over their jobs. Famous museums litigate to protect their art from AI infringement. A major retailer scraps a machinelearning based recruitment program that was biased against women. These are just a few examples of how AI is affecting the world of work, learning, and living. MIS and computer science students are among the professional groups who are embarking into careers with nebulous frontiers obscured by the outcroppings brought on by AI. Computer Science and Information System curriculum task forces have recognized the increasing ethical and professional implications developers’ work can have beyond the scope of the programmers’ code. In this article, the authors examine the professional, legal, and ethical implications of copyrights and algorithmic bias resulting from development of AI-enhanced applications and offer suggestions for addressing these topics in courses considering changes to the CC2020 and IS2020 Model Curriculum frameworks. [ABSTRACT FROM AUTHOR]

Software engineering (SE) and computer science (CS) programs in universities worldwide are marked by a gender gap, which subsequently translates into a gender gap at the industry level. However, there are positive activities that can help attract more women to these male-dominant professions. This study maps the literature related to the achievement of gender balance in SE and CS university-level education and identifies future research directions. More specifically, this article reports on a systematic mapping study of female-inclusive SE and CS tertiary education programs. The authors collected 882 publications between 2015 and 2022 from five databases (ACM, IEEE, Scopus, Web of Science, and Science Direct), selecting 143 peer-reviewed papers for further analysis. The results showed that the main academic contributors were researchers from the USA. The majority of the publications contained observations and explanations regarding the gender gap in computing education. However, an important part of the literature considered proposals and practical activities for achieving gender balance in SE and CS programs. Finally, the authors classified the literature related to female-inclusive SE and CS tertiary education programs, identified the main research focuses and regional distribution, and considered ideas for future research.

The application of computer science in management and economics is a rapidly growing field that combines the analytical and technological capabilities of computer science with the strategic and operational needs of management and economics. The main aim of this research paper is to analyze the main academic contributors, sources, and international collaborations from 2014 to 2022 in computer science in the areas of management and economics, as well as to analyze the main subtopics developed over time. Bibliometric techniques were used to carry out the literature review, which allows an objective analysis of the academic literature through quantitative indicators. The results reveal a significant shift towards data-driven decision making in management, with artificial intelligence and machine learning improving predictive analytics, operational efficiency, and economic forecasting and modeling, highlighting the essential role of digital transformation in these disciplines, with significant implications for researchers, practitioners and decision-makers. It concludes that all stakeholders should work to develop a more informed and innovative approach to maximize the exploitation of the potential offered by computational sciences in different contexts. This includes the integration of advanced computational tools to improve decision making and operational efficiency, or the exploitation of computational models for more effective forecasting and policy decision making, as well as the continuous analysis of emerging areas in this field, being aware of the ethical, privacy and security challenges presented by these technologies, in order to ensure a responsible and equitable application.

Nash equilibrium is one of the most influential solution concepts in game theory. With the development of computer science and artificial intelligence, there is an increasing demand on Nash equilibrium computation, especially for Internet economics and multi-agent learning. This paper reviews various algorithms computing the Nash equilibrium and its approximation solutions in finite normal-form games from both theoretical and empirical perspectives. For the theoretical part, we classify algorithms in the literature and present basic ideas on algorithm design and analysis. For the empirical part, we present a comprehensive comparison on the algorithms in the literature over different kinds of games. Based on these results, we provide practical suggestions on implementations and uses of these algorithms. Finally, we present a series of open problems from both theoretical and practical considerations. • A classification on Nash equilibrium algorithms in the literature with basic ideas on design and analysis presented. • A comprehensive comparison on Nash equilibrium algorithms in the literature over different kinds of games. • Practical suggestions on implementations and uses of Nash equilibrium algorithms. [ABSTRACT FROM AUTHOR]

The Boolean satisfiability problem, a renowned NP-complete challenge in computer science, has recently garnered interest in the Discrete Hopfield Neural Network - Satisfiability model. This model adeptly integrates logical rules into Hopfield networks, excelling in locating global minima for traditional SAT problems. However, it faces efficiency challenges when dealing with SAT problems characterized by dynamic evolution constraints due to its static network architecture. During dynamic evolution iterations, there is a significant exponential increase in the computational costs due to redundant and repetitive computations. In order to address this challenge, this paper introduces a dynamic evolution variant of the Discrete Hopfield Neural Network - Satisfiability model. In extensive simulation experiments, we progressively augmented the number of constraint clauses from 1 to 1500, seeking global minima for CNF problems. The proposed model exhibited congruent performance with the traditional model, achieving a Global Minimum Ratio of 1 and a Hamming distance of 0. Crucially, the proposed model minimized CPU utilization and neared zero error metrics, while the traditional model experienced exponential CPU and error metric escalation. These outcomes affirm the proposed model's robust global search capabilities and high precision, aligning with the traditional model. Furthermore, owing to this model's incorporation of not only temporal constraint increment operator but also innovative real-time learning techniques and clever integration methods, along with the establishment of a novel real-time decision mechanism, the proposed model effectively addresses the issues of redundancy and repeated calculations inherent in traditional models. This results in a stable and significantly improved computational speed. Additionally, this model's dynamic evolution network architecture is specifically designed to accommodate arbitrary and efficient extensions of dynamic constraints, while also featuring a built-in preprocessing function to filter out duplicate variables. In the future, as a dynamic evolution processor, this model exhibits immense potential for solving large-scale SAT problems with dynamic evolution constraints and holds broad application prospects in emerging fields such as automated reasoning, intelligent recommendation systems, and machine learning. [ABSTRACT FROM AUTHOR]

• 32 identified articles concerning game-based approach in computer science in primary education. • There is no standardized methodology for designing games. • The focus should be put on designing a game as a pedagogical strategy. • Only few computer science topics are covered through game-based approach. • More data to evaluate the effectiveness of the game-based approach are needed. This paper reviews the current situation concerning the implementation of game-based learning in computer science in primary education, providing insight into current trends, identifying strengths and potential research topics. Articles published in four databases from 2017 to 2021 are included in the analysis and an in-depth analysis of 32 articles is done. Different types of games, implemented in various educational contexts, are presented in these articles. Most of them describe implemented methodology, game-based environment or are evaluating the effectiveness of the created game or the approach. The possibility of implementing a game-based approach while learning other computer science topics or measuring the effectiveness of learning by designing a game as a pedagogical strategy are some areas for future research. [ABSTRACT FROM AUTHOR]

Event sequence data is increasingly available. Many business operations are supported by information systems that record transactions, events, state changes, message exchanges, and similar elements. This observation also applies to various industries, including production, logistics, healthcare, financial services, and education. The variety of application areas explains that techniques for event sequence data analysis have been developed rather independently in different fields of computer science. Most prominent are contributions from information visualization and from process mining. So far, the contributions from these two fields have neither been compared nor have they been mapped to an integrated framework. Such intransparency is problematic since it bears the risk of opportunities of integration are missed and concepts established in one field are independently reinvented in the other one. In this paper, we develop the Event Sequence Visualization framework (ESeVis) that gives due credit to the traditions of both fields. Our mapping study provides an integrated perspective on both fields and identifies potential for synergies for future research. • We propose the ESeVis Framework to categorize visualizations of event sequence data. • We review the literature of event sequence data visualizations. • Instance representations of event sequences are mostly from information visualization. • Process mining focuses on generating formal models. • Potential for synergy of process mining and information visualization. [ABSTRACT FROM AUTHOR]