教学课程资源库 更多>>

关键词： Task analysis   Optimization   Knowledge transfer   Knowledge acquisition   Evolutionary computation   Computer science   Vehicle routing   Evolutionary computation (EC)   evolutionary many-task optimization (EMaTO)   evolutionary multitask optimization (EMTO)   knowledge transfer   structure-preserved knowledge   tree-based knowledge propagation (TKP)  

摘要： As a challenging research topic in evolutionary multitask optimization (EMTO), evolutionary many-task optimization (EMaTO) aims at solving more than three tasks simultaneously. The design of the EMaTO algorithm generally needs to consider two major open issues, which are how to obtain useful knowledge from similar source tasks and how to effectively transfer knowledge to the target task. In this article, we discover that knowledge structure plays a significant role in dealing with these two issues and propose a novel knowledge structure preserving-based evolutionary algorithm (KSP-EA) to efficiently solve many-task optimization problems. KSP-EA aims to achieve two goals, which are first to obtain useful structure-preserved knowledge from similar source tasks and second to effectively transfer both direct and indirect knowledge to the target task. To achieve the first goal, we propose a local-structure-preserved knowledge acquisition strategy that projects the knowledge of similar source tasks into a unified subspace without loss of the knowledge structure, thus enhancing the quality of the obtained knowledge. To achieve the second goal, we propose a tree-based knowledge propagation strategy that constructs a knowledge propagating tree to connect all the tasks and propagates knowledge along the edges of this tree. This way, the target task can obtain both direct and indirect knowledge, improving the effectiveness of knowledge transfer. We conduct extensive experiments on CEC19 and WCCI22 many-task optimization test suites and a real-world application scenario to evaluate the performance of KSP-EA. The experimental results show that our KSP-EA generally outperforms state-of-the-art algorithms.

关键词： Quantum entanglement   Routing   Quantum computing   Photonics   Optical switches   Repeaters   Throughput   Qubit   Optimization   Computer science   Quantum networks   entanglement routing   EPS assignment   all-optical switching  

摘要： Entanglement routing plays a vital role in distributed quantum computing and quantum networks. Previous works on entanglement routing have addressed several design challenges due to limited quantum resources, failures to establish entanglement, and decoherence of established entanglement, but considered neither the limitations imposed by having a limited number of entangled photon sources (EPSes), nor the benefits of using all-optical (or quantum) switching to distribute entangled photons. In this paper, we first explore the problem of jointly optimizing entanglement routing and EPS assignment, assuming no all-optical switching capability. In other words, a pair of entangled photons generated by one EPS can be distributed to two neighboring quantum nodes. We then relax the above assumption so as to allow a pair of entangled photons generated by one EPS to be distributed to non-adjacent nodes using all-optical switching. We propose two corresponding solutions, namely, entanglement routing and EPS assignment (or ERSA), and ERSAwith all-optical switching-based distribution (or ERSA $+$ D) that aim to maximize the number of entanglement connections between the given set of source-destination (SD) pairs while avoiding starvation and achieving fairness among the SD pairs. In order to obtain efficient solutions in a large discrete solution space in a timely manner, we first formulate each optimization problem as an Integer Linear Programming (ILP), and then propose efficient algorithms to derive near-optimal solutions based on relaxation, Lagrangian decomposition, duality iteration, and rounding techniques. Extensive simulations show that ERSA $+$ Dcan increase network throughput by up to 1652% and 113%, respectively, thanks to EPS assignment optimization, and all-optical switching based entanglement distribution.

关键词： expectation   practical programming tasks   probability courses  

摘要： The concept of expectation is fundamental in computer science education, especially for analyzing the time efficiency of algorithms. However, the gap between theoretical knowledge and practical application can make it challenging for students to appreciate the importance of expectation in real-world contexts. This paper seeks to bridge that gap by highlighting the relationship between expectation and the population mean. To accomplish this, two experiments are presented, with tasks specifically designed to engage students in hands-on learning experiences in practical problem-solving. The first experiment focuses on the number of successes of the careless clerk, while the second experiment involves searching for all occurrences of a value in a randomly selected array, addressing the key question of the algorithm's expected time complexity. By presenting tasks that demonstrate the practical application of expectation, we aim to equip students with the tools needed to make informed decisions when designing and optimizing algorithms.

关键词： Information management  

摘要： In the past few decades, the life sciences have experienced an unprecedented accumulation of data, ranging from genomic sequences and proteomic profiles to heavy-content imaging, clinical assays, and commercial biological products for research. Traditional static databases have been invaluable in providing standardized and structured information. However, they fall short when it comes to facilitating exploratory data interrogation, real-time query, multidimensional comparison and dynamic visualization. Interactive databases aiming at supporting user-driven data queries and visualization oLer promising new avenues for making the best use of the vast and heterogeneous data streams collected in biological research. This article discusses the potential of interactive databases, highlighting the importance of implementing this model in the life sciences, while going through the state-of-the-art in database design, technical choices behind modern data management systems, and emerging needs in multidisciplinary research. Special attention is given to data interrogation strategies, user interface design, and comparative analysis capabilities, along with challenges such as data standardization and scalability in data-heavy applications. Conceptual features for developing interactive databases along diverse life science domains are then presented in the user case of cell line selection for in vitro research to bridge the gap between research data generation, actionable biological insight, subsequent meaningful experimental design, and clinical relevance. © 2025, CC BY.

关键词： Computer circuits  

摘要： We review four areas of theoretical computer science which share technical or philosophical ideas with the work of Belnap on his useful four-valued logic. Perhaps surprisingly, the inspiration by Belnap–Dunn logic is acknowledged only in the study of d-frames. The connections of Belnap’s work and linear logic, Blame Calculus or the study of LVars are not openly admitted. The key to three of these connections with Belnap’s work go via the twist-product representation of bilattices. On the one hand, it allows us to view a large class of models of linear logic as based on Belnap–Dunn logic. On the other hand, d-frames admit two twist-product representation theorems and, also, the key theorem in Blame Calculus is essentially a twist-product representation theorem too, albeit with a strong proof-theoretic flavour. © 2025, CC BY-SA.

关键词： Contrastive Learning  

摘要： Developing competency in artificial intelligence is becoming increasingly crucial for computer science (CS) students at all levels of the CS curriculum. However, most previous research focuses on advanced CS courses, as traditional introductory courses provide limited opportunities to develop AI skills and knowledge. This paper introduces an introductory CS course where students learn computational thinking through computer vision, a sub-field of AI, as an application context. The course aims to achieve computational thinking outcomes alongside critical thinking outcomes that expose students to AI approaches and their societal implications. Through experiential activities such as individual projects and reading discussions, our course seeks to balance technical learning and critical thinking goals. Our evaluation, based on pre-and post-course surveys, shows an improved sense of belonging, self-efficacy, and AI ethics awareness among students. The results suggest that an AI-focused context can enhance participation and employability, student-selected projects support self-efficacy, and ethically grounded AI instruction can be effective for interdisciplinary audiences. Students’ discussions on reading assignments demonstrated deep engagement with the complex challenges in today’s AI landscape. Finally, we share insights on scaling such courses for larger cohorts and improving the learning experience for introductory CS students. © 2025, CC BY.

关键词： Computer science   Engineering   Energy engineering  

摘要： This study addresses the challenge of virtual machine (VM) placement in cloud computing to improve resource utilization and energy efficiency. We propose a mixed integer linear programming (MILP) model incorporating G-robustness theory to handle uncertainties in VM usage, optimizing both performance and energy consumption. A heuristic algorithm is developed for large-scale VM allocation. Experiments with Huawei Cloud data demonstrate significant improvements in resource utilization and energy efficiency.

关键词： Computer science   Social sciences   Psychology  

摘要： Social status, which represents the relative dominance structure in societies, forms the backdrop against which most social decisions are made. Effective social decision-making demands flexible integration of decision attribute weight (importance of an attribute) and attribute latency (when attributes start to affect decisions). However, current understanding of how attribute weight and latency are influenced by relative social status is limited. In three experiments, we dynamically manipulated subjects' relative social status before they engaged in an altruistic decision task and found that their altruistic behavior was better explained by a time-varying drift diffusion model, in which relative social status selectively modulated attribute latency but not attribute weights. Furthermore, prosocial subjects exhibited higher sensitivity to attribute latency in response to changes in relative social status compared with individualistic subjects. Our results introduce a new dimension to the computational mechanisms underlying the intricate interplay between relative social status and attribute integration.

关键词： Computer science   Condensed-matter physics   Quantum information  

摘要： Analysis pokes holes in protocol that underpins Microsoft’s claim to have created the first topological qubits.