检索结果-内蒙古大学图书馆

The Impact of Dual Objective Optimization Model Combining Non-Dominated Genetic Algorithm on Rural Industrial Ecological Economy

引用

INTERNATIONAL JOURNAL OF ADVANCED computer science AND APPLICATIONS 2024年第5期15卷 271-280页

作者： Wang, Ying Shaanxi Tech Coll Finance & Econ Sch Accounting Xianyang 712000 Peoples R China

Due to the development of industrial economy, it has caused serious damage to the ecological environment. Based on the industrial structure and production scale, rural industrial economic parks are planned to analyze the quantity and weight of pollutants emitted from the original industries. The results showed that the quantity and weight of hydrogen sulfide in the coking industry were 10kg/t and 94, respectively. The weight of smoke and carbon monoxide in the steelmaking industry was relatively high, with 54 and 34, respectively. Non-dominated sorting genetic algorithm and multi-objective programming model are used to optimize the comprehensive benefits and industrial structure of rural industrial ecological economy. According to the experimental results, when the scale of the coking industry was 135600 tons, the steelmaking industry was 314900 tons, the ironmaking industry was 148100 tons, and the underground coal gasification industry was 424.76 million Nm3. The comprehensive economic benefits of the industry reached the optimal level of 0.6415. The environmental and comprehensive benefits generated by the increased power generation industry were 64.98 and 40.87, respectively. Therefore, it indicates that the dual objective programming model combining non-dominated sorting genetic algorithm can improve the rural industrial ecological economy.

关键词： Industrial chain production mode ecological economy environmental benefits non-dominated sorting genetic algorithm dual objective programming model

来源：评论

学校读者我要写书评

暂无评论

Transformed by Transformers: Navigating the AI Coding Revolution for Computing Education An ITiCSE Working Group Conducted by Humans 2023

Transformed by Transformers: Navigating the AI Coding Revolu...

引用

28th Annual Conference on Innovation and Technology in computer science Education (ITiCSE)

作者： Prather, James Denny, Paul Leinonen, Juho Becker, Brett A. Albluwi, Ibrahim Caspersen, Michael E. Craig, Michelle Keuning, Hieke Kiesler, Natalie Kohn, Tobias Luxton-Reilly, Andrew MacNeil, Stephen Petersen, Andrew Pettit, Raymond Reeves, Brent N. Savelka, Jaromir Abilene Christian Univ Abilene TX 79601 USA Univ Auckland Auckland New Zealand Univ Coll Dublin Dublin Ireland Princess Sumaya Univ Technol Amman Jordan Aarhus Univ Aarhus Denmark Univ Toronto Toronto ON Canada Univ Utrecht Utrecht Netherlands DIPF Leibniz Inst Res & Informat Educ Frankfurt Germany TU Wien Vienna Austria Temple Univ Philadelphia PA USA Univ Toronto Mississauga Toronto ON Canada Univ Virginia Charlottesville VA USA Abilene Christian Univ Abilene TX USA Carnegie Mellon Univ Pittsburgh PA USA

ISBN: (纸本)9798400701399

The recent advent of highly accurate and scalable large language models (LLMs) has taken the world by storm. From art to essays to computer code, LLMs are producing novel content that until recently was thought only humans could produce. Recent work in computing education has sought to understand the capabilities of LLMs for solving tasks such as writing code, explaining code, creating novel coding assignments, interpreting programming error messages, and more. However, these technologies continue to evolve at an astonishing rate leaving educators little time to adapt. This working group seeks to document the state-of-the-art for code generation LLMs, detail current opportunities and challenges related to their use, and present actionable approaches to integrating them into computing curricula.

关键词： AI artificial intelligence code generation Codex computer programming Copilot CS1 GitHub GPT large language models LLM novice programming OpenAI pedagogical practices

来源：评论

学校读者我要写书评

暂无评论

Beamforming Optimization for Continuous Aperture Array (CAPA)-based Communications

引用

IEEE Transactions on Wireless Communications 2025年第6期24卷 5099-5113页

作者： Wang, Zhaolin Ouyang, Chongjun Liu, Yuanwei Queen Mary University of London School of Electronic Engineering and Computer Science LondonE1 4NS United Kingdom The University of Hong Kong Department of Electrical and Electronic Engineering China Kyung Hee University Department of Electronic Engineering Yongin-si17104 Korea Republic of

The beamforming optimization in continuous aperture array (CAPA)-based multi-user communications is studied. In contrast to conventional spatially discrete antenna arrays, CAPAs can exploit the full spatial degrees of freedom (DoFs) by emitting information-bearing electromagnetic (EM) waves through continuous source current distributed across the aperture. Nevertheless, such an operation renders the beamforming optimization problem as a non-convex integral-based functional programming problem, which is challenging for conventional discrete optimization methods. A couple of low-complexity approaches are proposed to solve the functional programming problem. 1) Calculus of variations (CoV)-based approach: Closed-form structure of the optimal continuous source patterns are derived based on CoV, inspiring a low-complexity integral-free iterative algorithm for solving the functional programming problem. 2) Correlation-based zero-forcing (Corr-ZF) approach: Closed-form ZF source current patterns that completely eliminate the inter-user interference are derived based on the channel correlations. By using these patterns, the original functional programming problem is transformed to a simple power allocation problem, which can be solved using the classical water-filling approach with reduced complexity. Our numerical results validate the effectiveness of the proposed designs and reveal that: i) compared to the state-of-the-art Fourier-based discretization approach, the proposed CoV-based approach not only improves communication performance but also reduces computational complexity by up to hundreds of times for large CAPA apertures and high frequencies, and ii) the proposed Corr-ZF approach achieves asymptotically optimal performance compared to the CoV-based approach. © 2025 IEEE. All rights reserved.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

A Model Towards Enabling Tutors to Fulfil a Role in Attenuating Source Code Plagiarism 53rd

A Model Towards Enabling Tutors to Fulfil a Role in Attenuat...

引用

53rd Southern African computer Lecturers Association Meeting

作者： Smit, Imelda North West Univ Unit Data Sci & Comp Vanderbijlpark South Africa

ISBN: (纸本)9783031824777;9783031824784

Source-code plagiarism has been a persistent problem in the academic computing environment, but its prevalence intensified due to the disruption caused by the emergency remote teaching and learning that the COVID-19 pandemic enforced. This is especially a concern in the context of teaching novice programmers to code. The pandemic compelled residential universities to accommodate students in ways previously unheard of, even in the context of non-residential establishments. Students found themselves in an environment where preparation for assessments was not necessary since they had access to material, peers and whatever help they could line up to pass. The pandemic is a distant memory, but academia will not return to its pre-Covid status, and to add to this situation, generative artificial intelligence emerged in 2023 as a playmate on this very playground. In this context, tutoring is of utmost importance when teaching novice programmers to code, and therefore it makes sense to learn from past approaches to guide this support function in future. With this premise in mind, an interpretivist perspective was adopted, and qualitative data were gathered, centering on focus group interviews, as well as interviews with tutors unavailable for focus group sessions. These tutors supported classes of introductory programming students over a period of three years. Within this setting, the lecturer-as-researcher reflects on mitigating source code plagiarism holistically. This paper has as its goal proposing a model to enable and support tutors in their role to attenuate source code plagiarism.

关键词： Academic integrity Novice programming Source code plagiarism Tutoring

来源：评论

学校读者我要写书评

暂无评论

User-Friendly Tools for New Digital Education in computer Sience 22

User-Friendly Tools for New Digital Education in Computer Si...

引用

22nd International Conference on Emerging eLearning Technologies and Applications, ICETA 2024

作者： Kanalikova, Alžbeta Rakovská, Eva University of Žilina Department of Control and Information Systems Žilina Slovakia University of Economics in Bratislava Department of Applied Informatics Bratislava Slovakia

ISBN: (纸本)9798331527716

In today's world of pandemic era, it is important to develop new ways of e-learning. E-learning is also associated with finding creative innovation as a part of digital learning, which includes a variety of IT tools as multimedia and smart tools. The article is focused on preparing and implementing innovative tools in computer science teaching. computer science teaching is traditionally based on explicit exact knowledge. It leads to memorizing the steps or searching the ready solutions on websites from the students' side. In the article, we analyse the problems of computer science teaching online and the experience of using a few innovative elements in e-learning courses last year. Based on gained experience we choose appropriate tools for collaboration, interactivity, tools that record the sequence of steps, and tools for creating scenarios, focusing on gamification in teaching. The aim of the article comes from such experience and shows examples of how to implement multimedia and tools in a creative way for algorithmization and programming. We also try to use the interaction with the chatbot, which responds directly to the students' suggestions and helps them with basic terms. The specific results of our analyses and practical use are discussed and supported with figures. © 2024 IEEE.

关键词： Algorithmization Chatbot computer science teaching Digital learning programming

来源：评论

学校读者我要写书评

暂无评论

Fluid Intelligence and Mental Effort during Block programming: What the Eyes Can Tell Us 24

Fluid Intelligence and Mental Effort during Block Programmin...

引用

16th Annual ACM Symposium on Eye Tracking Research and Applications (ETRA)

作者： Appel, Tobias Leifheit, Luzia Univ Tubingen Hector Res Inst Educ Sci & Psychol Tubingen Germany Univ Educ Schwabisch Gmund Schwabisch Gmund Germany

ISBN: (纸本)9798400706073

programming skills are becoming increasingly important in our digital age. Here, block-based programming languages offer a great way for novices to learn programming, as their drag-and-drop mechanic makes the assembly of code very intuitive. In this study we wanted to answer the question whether fluid intelligence helps with learning to program and what influence it has on the amount of effort needed to succeed in block-programming tasks. We used eye tracking to look into physiological measures of mental effort, focusing on pupil diameter, fixation characteristics, and blinks. Our results suggest that the mental effort needed to successfully complete block-programming tasks is not linked to fluid intelligence and all learners have to invest similar amounts of effort in order to succeed. Additionally, we found that high fluid intelligence speeds up the completion of basic block-programming tasks, but does not influence the time it takes to solve more complex block-programming tasks.

关键词： Eye tracking STEM education Task difficulty computer science didactics

来源：评论

学校读者我要写书评

暂无评论

A Fast Combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints 24th

A Fast Combinatorial Algorithm for the Bilevel Knapsack Prob...

引用

24th International Conference on Integer programming and Combinatorial Optimization (IPCO)

作者： Weninger, Noah Fukasawa, Ricardo Univ Waterloo Waterloo ON Canada

ISBN: (纸本)9783031327254;9783031327261

We consider the bilevel knapsack problem with interdiction constraints, a fundamental bilevel integer programming problem which generalizes the 0-1 knapsack problem. In this problem, there are two knapsacks and n items. The objective is to select some items to pack into the first knapsack such that the maximum profit attainable from packing some of the remaining items into the second knapsack is minimized. We present a combinatorial branch-and-bound algorithm which outperforms the current state-of-the-art solution method in computational experiments by 4.5 times on average for all instances reported in the literature. On many of the harder instances, our algorithm is hundreds of times faster, and we solved 53 of the 72 previously unsolved instances. Our result relies fundamentally on a new dynamic programming algorithm which computes very strong lower bounds. This dynamic program solves a relaxation of the problem from bilevel to 2n-level where the items are processed in an online fashion. The relaxation is easier to solve but approximates the original problem surprisingly well in practice. We believe that this same technique may be useful for other interdiction problems.

关键词： Bilevel programming Interdiction Knapsack problem Combinatorial algorithm Dynamic programming Branch and bound

来源：评论

学校读者我要写书评

暂无评论

Socialist AI? Societal Use, Economic Implementation, and the Tensions of Applied computer science in Late Socialist GDR

引用

IEEE ANNALS OF THE HISTORY OF COMPUTING 2023年第3期45卷 66-79页

作者： Schmitt, Martin Tech Univ Darmstadt D-64283 Darmstadt Germany

AI research and development in the German Democratic Republic (GDR) can be seen as paradigmatic for the phase of late socialism. The imperatives of the socialist project and its economic ramifications in the endgame of the Cold War left a distinct imprint on AI. The GDR adopted a pragmatic approach to AI, which this article examines. It highlights the various strands and applications of late socialist AI research, encompassing both everyday applications and advanced scientific endeavors. Moving beyond the prevailing focus on U.S. research within the military-industrial complex, this article situates AI research within the broader history of the GDR, Central, and Eastern Europe. This study employs methods from science and technology studies to analyze AI objects, particularly chess computers, as indicators of the proliferation of AI within the everyday practices of the GDR. Through a thorough examination of a widely circulated computer magazine, this overview illustrates the diverse range of AI applications in the GDR, spanning areas such as planning, industrial management, state administration, science, public health, and pervasive surveillance. In this context, high-tech solutions were deployed alongside decaying industrial infrastructure, while utopian visions of intelligent machines intersected with ideological exhaustion, and health care applications were juxtaposed with fleeing doctors. These ambivalences reflect the complex state of the GDR in late socialism. Nevertheless, researchers and engineers worked on prototypes for image recognition, language processing, automatic reasoning and basic AI technologies, including programming languages and specialized hardware.

关键词： Artificial intelligence Cybernetics History Pragmatics Europe Economics Social factors Government

来源：评论

学校读者我要写书评

暂无评论

Graph Networks as Inductive Bias for Genetic programming: Symbolic Models for Particle-Laden Flows 1

引用

26th European Conference on Genetic programming (EuroGP) Held as Part of EvoStar

作者： Reuter, Julia Elmestikawy, Hani Evrard, Fabien Mostaghim, Sanaz van Wachem, Berend Otto von Guericke Univ Inst Intelligent Cooperating Syst Magdeburg Germany Otto von Guericke Univ Inst Mech Proc Engn Magdeburg Germany

ISBN: (数字)9783031295737

ISBN: (纸本)9783031295720;9783031295737

High-resolution simulations of particle-laden flows are computationally limited to a scale of thousands of particles due to the complex interactions between particles and fluid. Some approaches to increase the number of particles in such simulations require information about the fluid-induced force on a particle, which is a major challenge in this research area. In this paper, we present an approach to develop symbolic models for the fluid-induced force. We use a graph network as inductive bias to model the underlying pairwise particle interactions. The internal parts of the network are then replaced by symbolic models using a genetic programming algorithm. We include prior problem knowledge in our algorithm. The resulting equations show an accuracy in the same order of magnitude as state-of-the-art approaches for different benchmark datasets. They are interpretable and deliver important building blocks. Our approach is a promising alternative to "black-box" models from the literature.

关键词： Genetic programming Graph Networks Fluid Mechanics

来源：评论

学校读者我要写书评

暂无评论

Optimising the flight turnaround schedules: An improved sliding time windows based on MILP and CP models

引用

computerS & OPERATIONS RESEARCH 2024年 161卷

作者： Zhang, Sicheng Li, Xiang Yuan, Xing Liu, Jiaming Peng, Jinlin Li, Dongmei China Rongtong Artificial Intelligence Res Ctr Chaoyang 100022 Beijing Peoples R China Changan Univ Sch Econ & Management Xian 710064 Shaanxi Peoples R China Beijing Technol & Business Univ Sch Int Econ & Management Chaoyang 100048 Beijing Peoples R China Natl Inst Def Sci & Technol Innovat Beijing 100071 Peoples R China

This paper addresses the scheduling of turnaround operations for flights in civil airports. A series of complex issues, including the heterogeneity of flights and operators, resource constraints on turnaround operations, temporal restrictions and alternative service patterns of turnaround operations, multi-functional operators, multi-trip services and multi-to-one services, are jointedly considered. We propose two formulations for the problem: A mixed-integer linear programming (MILP) model, and a constraint programming (CP) model. For comparison purpose, we also present simplified versions of the models in which the multi-to-one services are prohibited. The uncertainty are incorporated by modifying the models based on robust optimisation principles. The numerical experiments are conducted using instances generated based on real flight data at Beijing Capital International Airport. It is shown that under current computer configurations, small-scale instances can be solved to the optimum by CPLEX within an acceptable period of time using the MILP model, while moderate-scale instances can be tackled using the CP formulation. To cope with large-scale instances, an improved sliding time window method is developed, and evaluated with different parameter combinations, showing that practical turnaround schedule would best be updated two to three times per hour. Besides, after a case study in both static and stochastic scenarios, we illustrate that multi-to-one services should be specifically considered and highlighted, for their existence could significantly improve the operator utilisation rate and reduce flight delay, especially when the uncertainties are taken into account.

关键词： Flight ground service scheduling Flight turnaround scheduling Constraint programming Mixed linear integer programming Airport management

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：