1{"work_id": 2808541536, "title": "Meet-continuity and locally compact sober dcpos", "abstract": "In this thesis, we investigate meet-continuity over dcpos. We give different equivalent descriptions of meet-continuous dcpos, among which an important characterisation is given via forbidden substructures. By checking the function space of such substructures we prove, as a central contribution, that any dcpo with a core-compact function space must be meet-continuous. As an application , this result entails that any cartesian closed full subcategory of quasicontinuous domains consists of continuous domains entirely. That is to say , both the category of continuous domains and that of quasicontinuous domains share the same cartesian closed full subcategories. \\nOur new characterisation of meet-continuous dcpos also allows us to say more about full subcategories of locally compact sober dcpos which are generalisations of quasicontinuous domains. After developing some theory of characterising coherence and bicompleteness of dcpos, we conclude that any cartesian closed full subcategory of pointed locally compact sober dcpos is entirely contained in the category of stably compact dcpos or that of L-dcpos. \\nAs a by-product, our study of coherence of dcpos enables us to characterise Lawson-compactness over arbitrary dcpos. \\n"}2{"work_id": 1486707681, "title": "Sequence distance embeddings", "abstract": "Sequences represent a large class of fundamental objects in Computer Science sets, strings, vectors and permutations are considered to be sequences. Distances between sequences measure their similarity, and computations based on distances are ubiquitous: either to compute the distance, or to use distance computation as part of a more complex problem. This thesis takes a very specific approach to solving questions of sequence distance: sequences are embedded into other distance measures, so that distance in the new space approximates the original distance. This allows the solution of a variety of problems including: Fast computation of short sketches in a variety of computing models, which allow sequences to be compared in constant time and space irrespective of the size of the original sequences. Approximate nearest neighbor and clustering problems, significantly faster than the naive exact solutions. Algorithms to find approximate occurrences of pattern sequences in long text sequences in near linear time. Efficient communication schemes to approximate the distance between, and exchange, sequences in close to the optimal amount of communication. Solutions are given for these problems for a variety of distances, including fundamental distances on sets and vectors; distances inspired by biological problems for permutations; and certain text editing distances for strings. Many of these embeddings are computable in a streaming model where the data is too large to store in memory, and instead has to be processed as and when it arrives, piece by piece. The embeddings are also shown to be practical, with a series of large scale experiments which demonstrate that given only a small space, approximate solutions to several similarity and clustering problems can be found that are as good as or better than those found with prior methods."}3{"work_id": 4406080942, "title": "Artificial lemming algorithm: a novel bionic meta-heuristic technique for solving real-world engineering optimization problems", "abstract": "The advent of the intelligent information era has witnessed a proliferation of complex optimization problems across various disciplines. Although existing meta-heuristic algorithms have demonstrated efficacy in many scenarios, they still struggle with certain challenges such as premature convergence, insufficient exploration, and lack of robustness in high-dimensional, nonconvex search spaces. These limitations underscore the need for novel optimization techniques that can better balance exploration and exploitation while maintaining computational efficiency. In response to this need, we propose the Artificial Lemming Algorithm (ALA), a bio-inspired metaheuristic that mathematically models four distinct behaviors of lemmings in nature: long-distance migration, digging holes, foraging, and evading predators. Specifically, the long-distance migration and burrow digging behaviors are dedicated to highly exploring the search domain, whereas the foraging and evading predators behaviors provide exploitation during the optimization process. In addition, ALA incorporates an energy-decreasing mechanism that enables dynamic adjustments to the balance between exploration and exploitation, thereby enhancing its ability to evade local optima and converge to global solutions more robustly. To thoroughly verify the effectiveness of the proposed method, ALA is compared with 17 other state-of-the-art meta-heuristic algorithms on the IEEE CEC2017 benchmark test suite and the IEEE CEC2022 benchmark test suite. The experimental results indicate that ALA has reliable comprehensive optimization performance and can achieve superior solution accuracy, convergence speed, and stability in most test cases. For the 29 10-, 30-, 50-, and 100-dimensional CEC2017 functions, ALA obtains the lowest Friedman average ranking values among all competitor methods, which are 1.7241, 2.1034, 2.7241, and 2.9310, respectively, and for the 12 CEC2022 functions, ALA again wins the optimal Friedman average ranking of 2.1667. Finally, to further evaluate its applicability, ALA is implemented to address a series of optimization cases, including constrained engineering design, photovoltaic (PV) model parameter identification, and fractional-order proportional-differential-integral (FOPID) controller gain tuning. Our findings highlight the competitive edge and potential of ALA for real-world engineering applications. The source code of ALA is publicly available at https://github.com/StevenShaw98/Artificial-Lemming-Algorithm ."}4{"work_id": 1491280261, "title": "Grammatical bias for evolutionary learning", "abstract": "A framework for declarative bias, based on the genetic programming paradigm (GP), is presented. The system, CFG-GP, encapsulates background knowledge, inductive bias and program structure. A context-free grammar is used to create a population of programs, represented by their corresponding derivation trees. These computer programs evolve using the principle of Darwinian selection. The grammar biases the form of language that is expressible and the inductive hypotheses that are generated. Using a formal grammar to define the space of legal statements allows a declarative language bias to be stated. The defined language may express knowledge in the form of program structure and incorporate explicit beliefs about the structure of possible solutions. Additionally, the form of the initial population of programs may be explicitly biased using a merit selection operation. This probabilistically biases particular statements generated from the grammar.\r\nThe program induction system, CFG-GP, represents search bias with three operators, namely selective crossover, selective mutation and directed mutation. Each of these operators allows a bias to be explicitly defined in terms of how programs are modified and how the search for a solution proceeds. Hence, both a search and language bias are declaratively represented in an evolutionary framework.\r\nThe use of a grammar to define language bias explicitly separates this bias from the learning system. Hence, the opportunity exists for the learning system to modify this bias as an additional strategy for learning. A general technique is described to modify the initial grammar while the evolution for a solution proceeds. Feedback between the evolving grammar and the population of programs is shown to improve the convergence of the learning system. The generalising properties of the learnt grammar are demonstrated by incrementally adapting a grammar for a class of problems.\r\nA theoretical framework, based on the schema theorem for Genetic Algorithms (GA), is presented for CFG-GP. The formal structure of a grammar allows a clear and concise definition of a building block for a general program. The result is shown to be a generalisation of both fixed-length (GA) and variable-length (GP) representations within the one framework."}5{"work_id": 3122335070, "title": "Design and development of a mobile learning system for computer science education in Nigerian higher education context", "abstract": "This research focuses on the development of a mobile learning system in the context of Nigerian higher education institution.Mobile learning is an important component of the digital-age educational sector, and plays a key role in ubiquitous learning.Similarly, mobile learning is an increasingly important area in computer science discipline.Although several defenitions of the term mobile learning exist, in this research mobile learning refers to teaching and learning approach that employs wireless technologies and mobile devices to support access to learning resources, promotes student direct engagement and interaction regardless of time, place, and context.The changes experienced by mobile learning over the past decade remain unprecedented.However, practical development and contextualization of mobile learning systems are rather inadequate.Recent developments in mobile learning have heightened the need for a mobile learning application that will aid the pedagogy of several topics in computer science education.Moreover, developing countries such as Nigeria have a shortage of mobile learning environments.Therefore, this dissertation seeks to explain the development of mobile learning system for computer science education in Nigerian context.The study stimulates good practice and promotes theoretical underpinning of mobile learning.Part of the aim of this study is to develop an application that will support learning of computing courses on mobile devices and offer guiding principles for integrating mobile learning into mainstream education.This dissertation follows a design science research, with indepth analysis of existing systems, development of a mobile learning application, MobileEdu, testing the application in concrete settings and evaluation of the system for state-of-the-art.After several initial exploratory studies and systematic literature survey, MobileEdu was developed to aid teaching and learning of computer science courses on mobile devices.The concrete settings for both demonstration and evalu-providing the wisdom, knowledge, and inspiration to conduct this research.I would like to express my profound gratitude to my supervisor Dr. Jarkko Suhonen for the incessant support, guidance, counselling, patience, enormous knowledge, and motivation during the time of my Ph.D study and related research.His constructive ideas and huge experiences in this field helped me to obtain a nice experience through the rigorous research process.Dr. Jarkko"}6{"work_id": 2121903617, "title": "Introduction to evolutionary algorithms", "abstract": "Since they are gleaned from the model of organic evolution, all basic instances of evolutionary algorithms share a number of common properties, which are mentioned here to characterize the prototype of a general evolutionary algorithm: (i) Evolutionary algorithms utilize the collective learning process of a population of individuals. Usually, each individual represents (or encodes) a search point in the space of potential solutions to a given problem. Additionally, individuals may also incorporate further information; for example, strategy parameters (Sections 16.2 and 32.2) of the evolutionary algorithm."}7{"work_id": 2900179285, "title": "The Reachability Problem for Petri Nets Is Not Elementary", "abstract": "Petri nets, also known as vector addition systems, are a long established model of concurrency with extensive applications in modelling and analysis of hardware, software and database systems, as well as chemical, biological and business processes. The central algorithmic problem for Petri nets is reachability: whether from the given initial configuration there exists a sequence of valid execution steps that reaches the given final configuration. The complexity of the problem has remained unsettled since the 1960s, and it is one of the most prominent open questions in the theory of verification. Decidability was proved by Mayr in his seminal STOC 1981 work, and the currently best published upper bound is non-primitive recursive Ackermannian of Leroux and Schmitz from LICS 2019. We establish a non-elementary lower bound, i.e. that the reachability problem needs a tower of exponentials of time and space. Until this work, the best lower bound has been exponential space, due to Lipton in 1976. The new lower bound is a major breakthrough for several reasons. Firstly, it shows that the reachability problem is much harder than the coverability (i.e., state reachability) problem, which is also ubiquitous but has been known to be complete for exponential space since the late 1970s. Secondly, it implies that a plethora of problems from formal languages, logic, concurrent systems, process calculi and other areas, that are known to admit reductions from the Petri nets reachability problem, are also not elementary. Thirdly, it makes obsolete the currently best lower bounds for the reachability problems for two key extensions of Petri nets: with branching and with a pushdown stack."}8{"work_id": 3139085460, "title": "Reorienting machine learning education towards tinkerers and ML-engaged citizens", "abstract": "Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, September, 2020"}9{"work_id": 3086066649, "title": "The role of digital learning toward students' satisfaction and university brand image at educational institutes of Pakistan: a post-effect of COVID-19", "abstract": "Purpose This study is undertaken to examine the role of information and communication technology (ICT), e-service quality and e-information quality towards brand image of universities by concentrating on students\u2019 e-learning, e-word of mouth and satisfaction. Design/methodology/approach The target population was the students of public and private universities in Pakistan. Data collected using an e-questionnaire by 408 students were subjected to PLS-SEM for analysis. Findings Findings revealed that ICT, e-service quality and e-information quality are positively contributed toward students' e-learning which ultimately leads to create positive e-word of mouth and students' satisfaction. Meanwhile, results also identified that e-word of mouth and students' satisfaction lead to generate a positive brand image of universities. Practical implications This study has unique implications for universities to develop an e-learning platform to facilitate their students in this situation of COVID-19. It provides guidelines for educational institutions to implement the learning management system effectively with a view to facilitate the students with education. Originality/value This study has novel contribution in literature in the domain of digital learning. It is unique in a way to integrate the usage of technology with students' e-learning and satisfaction that ultimately create brand image of universities."}10{"work_id": 4377102915, "title": "Challenges, opportunities, and prospects of adopting and using smart digital technologies in learning environments: An iterative review", "abstract": "The adoption of smart digital technologies in the education system has grown exponentially over the years, creating new possibilities to improve teaching and enhance learning. Against this backdrop, the 'brick-and-mortar' education approach survives on life support, with digital technologies promoting ubiquitous teaching and learning. Through complexity theory, this study uses an iterative review research approach comprising of nine steps to frame the study of smart digital education. The complexity theory lens provides an appropriate framework to reason about the complexities that surface due to interactions of the elements of smart digital technologies in the education system. The complementary strength of the adopted methodological approach led to multiple discourses on technology-enabled and technology-enhanced learning environments. In particular, four broad themes emerged, which demonstrated the prevalence of various technologies and how they interact as a means of making sense of the emerging digitally-enabled education environment. Through these themes, this paper highlights digitalisation affordances (which include multimodality, a/synchronicity, and new forms of engagement), discusses the key challenges and complexities of digitally enabled education, and advances the discourse on how digitalisation can support and promote inclusivity amidst historic challenges. Finally, it discusses how the advancement of technologies provides a new paradigm of learning, revolutionises knowledge construction, and extends and enriches the 'brick-and-mortar' learning environment to enhance the educational experience. As a future research agenda, this paper recommends comprehensive end-to-end programmes and innovative ways to conceptualise and execute digitally-enabled education that provides equity-oriented opportunities for cognitive development."}11{"work_id": 3183881215, "title": "Introduction to Algorithms", "abstract": "We briefly discussed what we mean by algorithms in Chapter 1 , but perhaps it bears repeating; algorithms are recipes for solving a specific computational problem. They describe the steps you (or more usually your computer) must take to get from input to output and should guarantee you that if you follow the instructions exactly, you will (1) finish after a finite number of steps and (2) your output will be a solution to the problem they should solve, given the input you had."}12{"work_id": 4394806711, "title": "Artificial intelligence and social media on academic performance and mental well-being: Student perceptions of positive impact in the age of smart learning", "abstract": "The advancement of artificial intelligence (AI) and the ubiquity of social media have become transformative agents in contemporary educational ecosystems. The spotlight of this inquiry focuses on the nexus between AI and social media usage in relation to academic performance and mental well-being, and the role of smart learning in facilitating these relationships. Using partial least squares-structural equation modeling (PLS-SEM) on a sample of 401 Chinese university students. The study results reveal that both AI and social media have a positive impact on academic performance and mental well-being among university students. Furthermore, smart learning serves as a positive mediating variable, amplifying the beneficial effects of AI and social media on both academic performance and mental well-being. These revelations contribute to the discourse on technology-enhanced education, showing that embracing AI and social media can have a positive impact on student performance and well-being."}13{"work_id": 7133302269, "title": "AI-assisted learning tools and student learning outcomes: A cognitive load theory perspective", "abstract": "Artificial intelligence (AI) is transforming higher education, yet its impact on students' learning outcomes depends on how effectively these tools are used, perceived, and supported within learning environments. Guided by Cognitive Load Theory (CLT), this study examines how AI-Assisted Learning Tools Usage (AIALTU) and the Perceived Usefulness of AI in Education (PUAIE) influence university students\u2019 Learning Outcomes (LO), with Student Engagement (SE) as a mediator and Digital Readiness (DR) as a moderator. Data were collected from 400 students across top Saudi universities using a validated bilingual survey instrument and analyzed using Partial Least Squares Structural Equation Modeling (PLS-SEM). Results show that both AIALTU and PUAIE significantly enhance learning outcomes, and SE partially mediates both relationships, highlighting engagement as a key cognitive mechanism through which AI tools contribute to academic success. DR significantly strengthens the effect of perceived usefulness on learning outcomes but does not alter the influence of actual tool usage, suggesting that intuitive AI design reduces dependence on digital skills. These findings extend CLT by demonstrating how technological, cognitive, and learner-readiness factors jointly shape learning effectiveness in AI-supported settings. The study offers practical insights for universities aiming to align AI integration with Vision 2030 goals by prioritizing student engagement, intuitive tool design, and digital readiness development. Overall, the results underscore the importance of combining advanced AI technologies with supportive learning strategies to achieve meaningful improvements in student learning outcomes."}14{"work_id": 2112641412, "title": "A Dynamic Survey of Graph Labeling", "abstract": "A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the mid-1960s. In the intervening years over 200 graph labelings techniques have been studied in over 3000 papers. Finding out what has been done for any particular kind of labeling and keeping up with new discoveries is difficult because of the sheer number of papers and because many of the papers have appeared in journals that are not widely available. In this survey, I have collected everything I could find on graph labeling. For the convenience of the reader, the survey includes a detailed table of contents and index. This edition has 267 new references that are identified with the reference number and the word \"new\" in the right margin."}15{"work_id": 7122741622, "title": "Recent Advances in Digital Fringe Projection Profilometry (2022\u20132025): Techniques, Applications, and Metrological Challenges\u2014A Review", "abstract": "Digital fringe projection profilometry (DFPP) is a widely used technique for full-field, non-contact 3D surface measurement, offering precision from the sub-micrometer-to-millimeter scale depending on system geometry and fringe design. This review provides a consolidated synthesis of advances reported between 2022 and 2025, covering projection and imaging architectures, phase formation and unwrapping strategies, calibration approaches, high-speed implementations, and learning-based reconstruction methods. A central contribution of this review is the integration of these developments within a metrological perspective, explicitly relating phase\u2013height transformation, fringe parameters, system geometry, and calibration to dominant uncertainty sources and error propagation. Recent progress highlights trade-offs between sensitivity, robustness, computational complexity, and applicability to non-ideal surfaces, while learning-based and hybrid optical\u2013computational approaches demonstrate substantial improvements in reconstruction reliability under challenging conditions. Remaining challenges include measurements on reflective or transparent surfaces, dynamic scenes, environmental instability, and real-time operation. The review outlines emerging research directions such as physics-informed learning, digital twins, programmable optics, and autonomous calibration, providing guidance for the development of next-generation DFPP systems for precision metrology."}16{"work_id": 7155156112, "title": "Gray langurs optimizer: a multi-group bio-inspired optimization algorithm", "abstract": "Many real-world problems are optimizable in nature. These problems often have numerous decision variables and constraints, making it difficult to optimize their objective function. To solve these problems, a group of algorithms known as metaheuristic algorithms has been introduced, which, considering the problem constraints, can find the optimal values of the decision variables in a reasonable amount of time to optimize the value of the objective function(s). Due to the importance and high application of these algorithms, a new metaheuristic optimization algorithm called Gray Langurs Optimizer (GLO) has been introduced in this research. The fundamental inspiration for the GLO is the group behavior of gray langurs in nature. The gray langurs are observed in three groups: one-male, multi-male, and all-male groups. The GLO mathematically simulates the group behavior and social hierarchy of gray langurs in all three groups. The migration of gray langurs between groups due to the death of the alpha or other group members, mate finding, and puberty is formulated by GLO. Additionally, the GLO models the arbitrary behavior of gray langurs within their territory. The GLO is tested on twenty-three classical test functions, including unimodal, multimodal, and fixed-dimension benchmarks, as well as twenty-seven CEC17 test functions, which comprise shifted, rotated, and composite benchmarks. The GLO is also applied to six real-world applications, and its results are compared with those of eight state-of-the-art algorithms both numerically and visually. The experimental results demonstrate the high capability of GLO in optimizing the various test functions and real-world applications. The MATLAB and Python implementations of GLO are available at https://nimakhodadadi.com ."}17{"work_id": 2207864362, "title": "Properties of some algebraically defined digraphs", "abstract": "This thesis is concerned with the study of a family of digraphs defined by systems of polynomial equations over finite fields. We explore the connectivity and diameter of some special classes of these digraphs, along with the structure of their isomorphism classes."}18{"work_id": 4285092328, "title": "A Note on Two Problems in Connexion with Graphs", "abstract": "chapter Share on A Note on Two Problems in Connexion with Graphs Author: E. W. Dijkstra View Profile Authors Info & Claims Edsger Wybe Dijkstra: His Life,Work, and LegacyJuly 2022 Pages 287\u2013290https://doi.org/10.1145/3544585.3544600Published:13 July 2022Publication History 1citation11DownloadsMetricsTotal Citations1Total Downloads11Last 12 Months11Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access"}19{"work_id": 4241184911, "title": "Two-Dimensional Cellular Automata", "abstract": "This chapter presents an exploratory study of two-dimensional cellular automata. The extension to two dimensions is significant for comparisons with many experimental results on pattern formation in physical systems. The chapter considers primarily square lattices, with the two neighborhood structures. It describes a phenomenological study of typical two-dimensional cellular automata. Its approach is largely experimental in character: cellular automaton rules are selected and their evolution from various initial states is traced by direct simulation. The chapter reports evidence that certain global properties of two-dimensional cellular automata are very similar to those of one-dimensional cellular automata. It discusses the evolution of two-dimensional cellular automata from simple \"seeds,\" consisting of a few nonzero initial sites. The chapter considers evolution from typical disordered initial states. It discusses some quantitative characterizations of the global properties of two-dimensional cellular automata. The chapter discusses patterns formed by the evolution of cellular automata from simple seeds. It presents an exploratory study of two-dimensional cellular automata."}20{"work_id": 4311415873, "title": "Fast Kd-Trees for the Kullback-Leibler Divergence and Other Decomposable Bregman Divergences", "abstract": "The contributions of the paper span theoretical and implementational results. First, we prove that Kd-trees can be extended to \u211d^d with the distance measured by an arbitrary Bregman divergence. Perhaps surprisingly, this shows that the triangle inequality is not necessary for correct pruning in Kd-trees. Second, we offer an efficient algorithm and C++ implementation for nearest neighbour search for decomposable Bregman divergences. The implementation supports the Kullback-Leibler divergence (relative entropy) which is a popular distance between probability vectors and is commonly used in statistics and machine learning. This is a step toward broadening the usage of computational geometry algorithms. Our benchmarks show that our implementation efficiently handles both exact and approximate nearest neighbour queries. Compared to a linear search, we achieve two orders of magnitude speedup for practical scenarios in dimension up to 100. Our solution is simpler and more efficient than competing methods."}21{"work_id": 4405348595, "title": "Positive Definite Matrices", "abstract": "placeholder notes"}22{"work_id": 3119051141, "title": "The Arithmetic Optimization Algorithm", "abstract": "This work proposes a new meta-heuristic method called Arithmetic Optimization Algorithm (AOA) that utilizes the distribution behavior of the main arithmetic operators in mathematics including (Multiplication (M), Division (D), Subtraction (S), and Addition (A)). AOA is mathematically modeled and implemented to perform the optimization processes in a wide range of search spaces. The performance of AOA is checked on twenty-nine benchmark functions and several real-world engineering design problems to showcase its applicability. The analysis of performance, convergence behaviors, and the computational complexity of the proposed AOA have been evaluated by different scenarios. Experimental results show that the AOA provides very promising results in solving challenging optimization problems compared with eleven other well-known optimization algorithms. Source codes of AOA are publicly available at and ."}23{"work_id": 2003494253, "title": "Algorithms+Data Structures = Programs", "abstract": "Learn with confidence with this hands-on undergraduate textbook for CS2 courses. Active-learning and real-world projects underpin each chapter, briefly reviewing programming fundamentals then progressing to core data structures and algorithms topics including recursion, lists, stacks, trees, graphs, sorting, and complexity analysis. Creative projects and applications put theoretical concepts into practice, helping students master the fundamentals. Dedicated project chapters supply further programming practice using real-world, interdisciplinary problems which students can showcase in their own online portfolios. Example Interview Questions sections prepare students for job applications. The pedagogy supports self-directed and skills-based learning with over 250 'Try It Yourself' boxes, many with solutions provided, and over 500 progressively challenging end-of-chapter questions. Written in a clear and engaging style, this textbook is a complete resource for teaching the fundamental skills that today's students need. Instructor resources are available online, including a test bank, solutions manual, and sample code."}24{"work_id": 2891784792, "title": "Improving Online Algorithms via ML Predictions", "abstract": "In this work we study the problem of using machine-learned predictions to improve the performance of online algorithms. We consider two classical problems, ski rental and non-clairvoyant job scheduling, and obtain new online algorithms that use predictions to make their decisions. These algorithms are oblivious to the performance of the predictor, improve with better predictions, but do not degrade much if the predictions are poor."}25{"work_id": 2905177801, "title": "Optimal trees for prediction and prescription", "abstract": "Thesis: Ph. D., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2018."}26{"work_id": 2957144896, "title": "Factors Determining the Behavioral Intention to Use Mobile Learning: An Application and Extension of the UTAUT Model", "abstract": "This study developed and empirically tested a model to predict the factors affecting students' behavioral intentions toward using mobile learning (m-learning). This study explored the behavioral intention to use m-learning from the perspective of consumers by applying the extended unified theory of acceptance and use of technology (UTAUT) model with the addition of perceived enjoyment, mobile self-efficacy, satisfaction, trust, and perceived risk moderators. A cross-sectional study was conducted by employing a research model based on multiple technology acceptance theories. Data were derived from an online survey with 1,562 respondents and analyzed using structural equation modeling. Partial least squares (PLS) regression was used for model and hypothesis testing. The results revealed that (1) behavioral intention was significantly and positively influenced by satisfaction, trust, performance expectancy, and effort expectancy; (2) perceived enjoyment, performance expectancy, and effort expectancy had positive associations with behavioral intention; (3) mobile self-efficacy had a significantly positive effect on perceived enjoyment; and (4) perceived risk had a significantly negative moderating effect on the relationship between performance expectancy and behavioral intention. Our findings correspond with the UTAUT model and provide a practical reference for educational institutions and decision-makers involved in designing m-learning for implementation in universities."}27{"work_id": 4294558607, "title": "Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks", "abstract": "Identifying a maximum independent set is a fundamental NP-hard problem. This problem has several real-world applications and requires finding the largest possible set of vertices not adjacent to each other in an undirected graph. Over the past few years, branch-and-bound and branch-and-reduce algorithms have emerged as some of the most effective methods for solving the problem exactly. Specifically, the branch-and-reduce approach, which combines branch-and-bound principles with reduction rules, has proven particularly successful in tackling previously unmanageable real-world instances. This progress was largely made possible by the development of more effective reduction rules. Nevertheless, other key components that can impact the efficiency of these algorithms have not received the same level of interest. Among these is the branching strategy, which determines which vertex to branch on next. Until recently, the most widely used strategy was to choose the vertex of the highest degree. In this work, we present a graph neural network approach for selecting the next branching vertex. The intricate nature of current branch-and-bound solvers makes supervised and reinforcement learning difficult. Therefore, we use a population-based genetic algorithm to evolve the model\u2019s parameters instead. Our proposed approach results in a speedup on 73% of the benchmark instances with a median speedup of 24%."}28{"work_id": 3111526966, "title": "Introduction to Algorithms", "abstract": "This chapter looks at a number of different algorithms to get some practice in tracing and trying to understand algorithms. Algorithms play an extremely important role in both computer science and mathematics. Algorithms are detailed instructions on how to carry out some specific task. Computer programs are implementations of algorithms, so it is very important that computer science majors and programmers have a good understanding of how algorithms work. Designing an algorithm is one of the first steps in writing a computer program. In order to make algorithms easier for understand they are written in a form of English called pseudocode. Algorithms use something called control structures to tell the algorithm what to do at different times. These are instructions that control how the algorithm works. Conditional controls give conditions for the execution of an algorithm step. Loop controls tell how many times a step in the algorithm should be executed."}29{"work_id": 7128526706, "title": "Glider snake optimizer (GSO): a nature-inspired metaheuristic algorithm for global and engineering optimization problems", "abstract": "Abstract The rapid expansion of complex engineering and real-world optimization problems necessitates the development of efficient, adaptable, and computationally lightweight metaheuristic algorithms. In this study, a novel nature-inspired algorithm called glider snake optimization (GSO) is proposed, which draws behavioral inspiration from the gliding and serpentine locomotion patterns of arboreal snakes to enhance solution exploration and convergence control. The GSO algorithm incorporates a multi-segment movement mechanism, a flexible gliding path generator, and an elite guidance model to ensure effective balance between exploration and exploitation. Extensive experimental validation is conducted using a comprehensive set of 23 classical benchmark functions, high-dimensional test cases (100D, and 500D), the CEC 2019 benchmark suite, and several constrained engineering design problems. The results demonstrate that GSO outperforms or matches 13 state-of-the-art algorithms, including particle swarm optimization (PSO), grey wolf optimizer (GWO), whale optimization algorithm (WOA), and differential evolution (DE) in terms of accuracy, convergence speed, computational cost, and robustness. The algorithm also exhibits exceptional stability across parameter variations, as confirmed through sensitivity analysis and statistical significance testing. These findings highlight the potential of GSO as a powerful and efficient tool for solving complex optimization problems in both theoretical and practical domains. Additionally, GSO achieves leading performance on most benchmark functions, with error reductions of up to 90% compared with competing algorithms. GSO also demonstrates faster convergence and lower variance across repeated trials, confirming its robustness. These quantitative outcomes further reinforce the effectiveness of the proposed algorithm. The MATLAB and Python implementations of GSO are available at https://nimakhodadadi.com ."}30{"work_id": 4386113651, "title": "Cheap Correlate or Discriminating Property? An Executable Validation Protocol for Consciousness- and Cognition-Theoretic Claims about AI", "abstract": "Claims that an AI system \"instantiates\" a consciousness- or cognition-theoretic construct are often supported by a cheap correlate: aggregate dependence read as irreducible integration, ordinary shared-store efficiency read as global access, or a confidence-labelled signal read as metacognitive monitoring. Such inferences trade on a construct's appearance while omitting the property that carries the theory's content. The concern is not ours: the validation requirement (an indicator must be both sensitive and specific) is Seth and Bayne's (2022), the indicator-property programme is Butlin et al.'s (2023; 2026), and the proxy-can-be-gamed worry is Birch's (2022). We turn this desideratum into a prospective six-step protocol and audit how far one transparent chess-engine study actually satisfies it. Static feature dependence missed its specified support rule. A corrected 119-position temporal analysis missed its locally specified majority target, although a secondary post-hoc Bonferroni min-p test rejected the global no-departure null for both SI and Phi* (p = .0238). Shared-table configuration reduced wall time and total work, but this was an implementation effect and did not test a global-workspace construct. The internal signal provided no evidence of the specified directional ranking of later move persistence (AUROC .467), while its critic channel was nearly invariant, limiting the instrument. These are bounded case findings, not three independent datasets and not three definitive construct falsifications. The protocol therefore requires prospective theory-to-measure mapping, explicit nulls, sensitivity and specificity checks, power, and claim boundaries. Its generality remains a hypothesis until a second prospective substrate is studied. Status of this preprint. This is a working paper. The author's own gate for journal submission is HOLD/PIVOT: the protocol has not yet been applied to a second prospective substrate, and the theory-to-measure mapping has not yet been adjudicated by outcome-blind experts. It is deposited because the protocol (Section 4) and the reviewer checklist (Section 7.2) are usable independently of those two steps. Sections 1 to 4 and 7 are the proposed contribution; Section 5 is a bounded, single-substrate case audit. Changes in v3.4 (2026-09-27). Status correction only: version 3.3 described the related manuscript P1 as \"under review\"; it had been submitted to a journal. The scientific content and numerical results are unchanged."}31{"work_id": 2979043732, "title": "ETH-tight algorithms for geometric network problems", "abstract": "promotoren en de samenstelling van de promotiecommissie is als volgt"}32{"work_id": 1513303009, "title": "Cellular Automata And Complexity: Collected Papers", "abstract": "Primary Papers * Statistical Mechanics of Cellular Automata * Algebraic Properties of Cellular Automata * Universality and Complexity in Cellular Automata * Computation Theory of Cellular Automata * Undecidability and Intractability in Theoretical Physics * Two-Dimensional Cellular Automata * Origins of Randomness in Physical Systems * Thermodynamics and Hydrodynamics of Cellular Automata * Random Sequence Generation by Cellular Automata * Approaches to Complexity Engineering * Minimal Cellular Automaton Approximations to Continuum Systems * Cellular Automaton Fluids: Basic Theory Additional And Survey Papers * Cellular Automata * Computers in Science and Mathematics * Geometry of Binomial Coefficients * Twenty Problems in the Theory of Cellular Automata * Cryptography with Cellular Automata * Complex Systems Theory * Cellular Automaton Supercomputing Appendices * Tables of Cellular Automaton Properties * Scientific Bibliography of Stephen Wolfram"}33{"work_id": 2146101030, "title": "Communication complexity of document exchange", "abstract": "We have two users, A and B, who hold documents x and y respectively. Neither of the users has any information about the other's document. They exchange messages so that B computes x; it may be required that A compute y as well. Our goal is to design communication protocols with the main objective of minimizing the total number of bits they exchange; other objectives are minimizing the number of rounds and the complexity of internal computations. An important notion which determines the efficiency of the protocols is how one measures the distance between x and y. We consider several metrics for measuring this distance, namely the Hamming metric, the Levenshtein metric (edit distance), and a new LZ metric, which is introduced in this paper. We show how to estimate the distance between x and y using a single message of logarithmic size. For each metric, we present the first communication-efficient protocols, which often match the corresponding lower bounds. A consequence of these are error-correcting codes for these error models which correct up to d errors in n characters using O(d log n) bits. Our most interesting methods use a new histogram transformation that we introduce to convert edit distance to L1 distance."}34{"work_id": 73572444, "title": "Complexity Theory and the Social Sciences", "abstract": "This expanded and updated edition of Complexity Theory and the Social Sciences: The State of the Art revisits the use of complexity theory across the social sciences and demonstrates how complexity informs approaches to various contemporary issues in the context of the COVID-19 pandemic, widening social inequality, and impending social and ecological catastrophe wrought by global warming. The book reviews complexity theory in the practice of the social sciences and at their interface with ecological science. It outlines how social theory can be reconciled with complexity thinking and presents a review of the way research can be done using complexity theory. The book suggests how complexity theory can be used to understand and evaluate governance processes, particularly with regard to social inequality and the climate crisis. The impact of the COVID-19 pandemic is also examined through a complexity lens, reviewing how complexity thinking has been employed in relation to the pandemic and how implementing a complexity framework can transform health and social care. The book concludes with a call to action and the use of complexity theory to inform critical thinking in the education system. This textbook will be immensely useful to students and researchers interested in social research methods, social theory, business and organization studies, health, education, urban studies, and development studies."}35{"work_id": 7127964361, "title": "Turning Knowledge into Innovation: The Systemic Role of Knowledge Management Capability, Intellectual Capital, and Knowledge Utilization", "abstract": "In the dynamic and service-intensive context of the tourism and hospitality industry, organizational innovation performance (OIP) is a critical determinant of competitiveness. This study investigates the systemic role of knowledge management capability (KMC) in driving OIP, with a focus on the mediating effects of intellectual capital (IC) and knowledge utilization (KU). Drawing on Dynamic Capabilities Theory and the Knowledge-Based View, KMC is conceptualized as a higher-order capability that facilitates the accumulation, coordination, and application of knowledge resources, thereby shaping both organizational knowledge assets and their practical enactment. Data were collected from senior managers across five-star hotels in Greater Cairo, Egypt, and analyzed using Partial Least Squares Structural Equation Modeling (PLS-SEM). Results indicate that KMC positively influences OIP directly and indirectly through the development of IC and the effective utilization of knowledge. Both IC and KU are found to mediate the relationship between KMC and innovation performance, highlighting the importance of transforming knowledge resources into actionable and value-creating organizational capabilities. The study advances theoretical understanding by elucidating the systemic mechanisms linking knowledge management, intellectual capital, and knowledge utilization to innovation outcomes, and provides practical insights for hospitality managers seeking to leverage knowledge-driven strategies to enhance competitiveness and service excellence."}36{"work_id": 4406215947, "title": "Digital Transformation and Innovation Performance in Small- and Medium-Sized Enterprises: A Systems Perspective on the Interplay of Digital Adoption, Digital Drive, and Digital Culture", "abstract": "Small- and medium-sized enterprises (SMEs) face complex systemic challenges in managing digital transformation while pursuing innovation in an increasingly interconnected business environment. This study adopts a systems theory perspective to investigate how digitalization enhances Innovation Performance by examining the dynamic interrelationships among digital adoption, digital drive, digital culture, and Innovation Performance. Through an empirical analysis of 201 Chinese SMEs using PLS-SEM, IPMA, and ANFIS approaches, we reveal that digital drive fully mediates the relationship between digital adoption and Innovation Performance, highlighting the systemic nature of digital transformation processes. Digital culture emerges as a critical moderator, positively influencing the relationships between digital adoption and digital drive, as well as between digital drive and Innovation Performance. These findings demonstrate how different elements of digital transformation form an integrated system where components interact to produce innovation outcomes. This study contributes to systems theory by illuminating the complex interdependencies in digital transformation and offers practical implications for managing systemic change in SMEs."}37{"work_id": 2955897898, "title": "Wireless Communications and Applications Above 100 GHz: Opportunities and Challenges for 6G and Beyond", "abstract": "Frequencies from 100 GHz to 3 THz are promising bands for the next generation of wireless communication systems because of the wide swaths of unused and unexplored spectrum. These frequencies also offer the potential for revolutionary applications that will be made possible by new thinking, and advances in devices, circuits, software, signal processing, and systems. This paper describes many of the technical challenges and opportunities for wireless communication and sensing applications above 100 GHz, and presents a number of promising discoveries, novel approaches, and recent results that will aid in the development and implementation of the sixth generation (6G) of wireless networks, and beyond. This paper shows recent regulatory and standard body rulings that are anticipating wireless products and services above 100 GHz and illustrates the viability of wireless cognition, hyper-accurate position location, sensing, and imaging. This paper also presents approaches and results that show how long distance mobile communications will be supported to above 800 GHz since the antenna gains are able to overcome air-induced attenuation, and present methods that reduce the computational complexity and simplify the signal processing used in adaptive antenna arrays, by exploiting the Special Theory of Relativity to create a cone of silence in over-sampled antenna arrays that improve performance for digital phased array antennas. Also, new results that give insights into power efficient beam steering algorithms, and new propagation and partition loss models above 100 GHz are given, and promising imaging, array processing, and position location results are presented. The implementation of spatial consistency at THz frequencies, an important component of channel modeling that considers minute changes and correlations over space, is also discussed. This paper offers the first in-depth look at the vast applications of THz wireless products and applications and provides approaches for how to reduce power and increase performance across several problem domains, giving early evidence that THz techniques are compelling and available for future wireless communications."}38{"work_id": 4408441779, "title": "Enhancing Creativity and Sustainable Competitive Advantage Through Data-Driven Decision-Making and Digital Leadership", "abstract": "Digital transformation is essential for businesses to maintain creativity and competitiveness. This study explores how digital transformation impacts corporate creativity and competitive advantage in SMEs by leveraging the TOE framework and RBT. Our model integrates both internal and external factors, focusing on data-driven decision-making and digital leadership. Data from 537 SMEs were analyzed using PLS-SEM, IPMA, and fsQCA. Results indicate that technological competence, organizational support, and government support positively influence digital integration, enhancing data-driven decision-making. This decision-making process significantly boosts sustainable competitive advantage and organizational creativity. Digital leadership positively moderates these relationships. Our findings provide actionable insights for SMEs leveraging digital transformation for sustained competitive advantage and creativity. The unique long-term value of this research lies in its comprehensive examination of how digital transformation facilitates both creativity and sustainablecompetitive advantage in SMEs. This study offers a novel theoretical model and empirical evidence that can guide international practitioners and scholars in understanding and implementing effective digital transformation strategies."}39{"work_id": 7125913058, "title": "Multiresource-Constrained Flexible Job Shop Scheduling With Fixture Pallets and Setup Stations Under Pallet Automation Systems", "abstract": "Pallet automation systems (PASs) are critical in flexible manufacturing for their ability to integrate diverse production resources, such as machines, fixture pallets (FPs), and setup stations (STs). In traditional flexible manufacturing systems (FMSs), loading/unloading typically occurs at machines, limiting the machines\u2019 capacity. To address this, in PASs, workpieces are loaded and unloaded from the machines at a limited number of STs, so loading, processing, and unloading are three separate segments. However, the research on PASs is limited, and existing studies mainly focused on machines while overlooking FPs and STs. A critical challenge is the tight coupling between resource selection and operation sequencing. To address this gap, we investigate a multiresource-constrained flexible job shop scheduling problem (MRFJSP) with FPs and STs under PASs (MRFFS). First, a mixed-integer programming model is proposed to minimize makespan. Second, a four-layer encoding scheme and a new decoding method with time period insertion based on the intersection of available time of multiple resources (TPI-IARs) are presented to obtain feasible schedule solutions and shrink the search space. Third, a new search algorithm based on critical paths and points mutation (SACP) is developed to effectively balance exploration and exploitation. Finally, four case studies are designed to demonstrate the validity and effectiveness of this work."}40{"work_id": 7118096636, "title": "A modified starfish optimization algorithm (M-SFOA) for global optimization problems and its application to heart disease risk prediction", "abstract": null}41{"work_id": 4233225156, "title": "Introduction to Algorithms", "abstract": null}42{"work_id": 1638203394, "title": "An Introduction to Kolmogorov Complexity and Its Applications", "abstract": null}43{"work_id": 2402846924, "title": "Particle Swarm Optimization", "abstract": null}44{"work_id": 3148190347, "title": "Introduction to Graph Theory", "abstract": null}45{"work_id": 3139484821, "title": "Aquila Optimizer: A novel meta-heuristic optimization algorithm", "abstract": null}46{"work_id": 4254202520, "title": "On Computable Numbers, with an Application to the Entscheidungsproblem (1936)", "abstract": null}47{"work_id": 4391177866, "title": "Computational Complexity", "abstract": null}48{"work_id": 4372046852, "title": "Introduction to Algorithms", "abstract": null}49{"work_id": 7160425037, "title": "Solving SAT by restricted spiking neural P systems with temporal division rules", "abstract": null}50{"work_id": 4396808240, "title": "Parameterized Complexity", "abstract": null}51