期刊文献+
共找到105,078篇文章
< 1 2 250 >
每页显示 20 50 100
Adaptive path planning for unmanned aerial vehicles based on bi-level programming and variable planning time interval 被引量:7
1
作者 Liu Wei Zheng Zheng Cai Kaiyuan 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2013年第3期646-660,共15页
This paper presents an adaptive path planner for unmanned aerial vehicles (UAVs) to adapt a real-time path search procedure to variations and fluctuations of UAVs’ relevant performances, with respect to sensory cap... This paper presents an adaptive path planner for unmanned aerial vehicles (UAVs) to adapt a real-time path search procedure to variations and fluctuations of UAVs’ relevant performances, with respect to sensory capability, maneuverability, and flight velocity limit. On the basis of a novel adaptability-involved problem statement, bi-level programming (BLP) and variable planning step techniques are introduced to model the necessary path planning components and then an adaptive path planner is developed for the purpose of adaptation and optimization. Additionally, both probabilistic-risk-based obstacle avoidance and performance limits are described as path search constraints to guarantee path safety and navigability. A discrete-search-based path planning solution, embedded with four optimization strategies, is especially designed for the planner to efficiently generate optimal flight paths in complex operational spaces, within which different surface-to-air missiles (SAMs) are deployed. Simulation results in challenging and stochastic scenarios firstly demonstrate the effectiveness and efficiency of the proposed planner, and then verify its great adaptability and relative stability when planning optimal paths for a UAV with changing or fluctuating performances. 展开更多
关键词 ADAPTIVE bi-level programming Motion planning Unmanned aerial vehicles Variable time interval
原文传递
Bi-level programming model for reconstruction of urban branch road network 被引量:6
2
作者 史峰 黄恩厚 +1 位作者 陈群 王英姿 《Journal of Central South University》 SCIE EI CAS 2009年第1期172-176,共5页
Considering the decision-making variables of the capacities of branch roads and the optimization targets of lowering the saturation of arterial roads and the reconstruction expense of branch roads, the bi-level progra... Considering the decision-making variables of the capacities of branch roads and the optimization targets of lowering the saturation of arterial roads and the reconstruction expense of branch roads, the bi-level programming model for reconstructing the branch roads was set up. The upper level model was for determining the enlarged capacities of the branch roads, and the lower level model was for calculating the flows of road sections via the user equilibrium traffic assignment method. The genetic algorithm for solving the bi-level model was designed to obtain the reconstruction capacities of the branch roads. The results show that by the bi-level model and its algorithm, the optimum scheme of urban branch roads reconstruction can be gained, which reduces the saturation of arterial roads apparently, and alleviates traffic congestion. In the data analysis the arterial saturation decreases from 1.100 to 0.996, which verifies the micro-circulation transportation's function of urban branch road network. 展开更多
关键词 branch road RECONSTRUCTION bi-level programming model micro-circulation traffic
在线阅读 下载PDF
Bi-Level Programming for the Optimal Nonlinear Distance-Based Transit Fare Structure Incorporating Principal-Agent Game
3
作者 Xin Sun Shuyan Chen Yongfeng Ma 《Journal of Harbin Institute of Technology(New Series)》 CAS 2022年第5期69-77,共9页
The urban transit fare structure and level can largely affect passengers’travel behavior and route choices.The commonly used transit fare policies in the present transit network would lead to the unbalanced transit a... The urban transit fare structure and level can largely affect passengers’travel behavior and route choices.The commonly used transit fare policies in the present transit network would lead to the unbalanced transit assignment and improper transit resources distribution.In order to distribute transit passenger flow evenly and efficiently,this paper introduces a new distance-based fare pattern with Euclidean distance.A bi-level programming model is developed for determining the optimal distance-based fare pattern,with the path-based stochastic transit assignment(STA)problem with elastic demand being proposed at the lower level.The upper-level intends to address a principal-agent game between transport authorities and transit enterprises pursing maximization of social welfare and financial interest,respectively.A genetic algorithm(GA)is implemented to solve the bi-level model,which is verified by a numerical example to illustrate that the proposed nonlinear distance-based fare pattern presents a better financial performance and distribution effect than other fare structures. 展开更多
关键词 bi-level programming model principal-agent game nonlinear distance-based fare path-based stochastic transit assignment
在线阅读 下载PDF
Bi-level programming model and algorithm for optimizing headway of public transit line
4
作者 张健 李文权 《Journal of Southeast University(English Edition)》 EI CAS 2010年第3期471-474,共4页
Due to the fact that headway is a key factor to be considered in bus scheduling, this paper proposes a bi-level programming model for optimizing bus headway in public transit lines. In this model, with the interests o... Due to the fact that headway is a key factor to be considered in bus scheduling, this paper proposes a bi-level programming model for optimizing bus headway in public transit lines. In this model, with the interests of bus companies and passengers in mind, the upper-level model's objective is to minimize the total cost, which is affected by frequency settings, both in time and economy in the transit system. The lower-level model is a transit assignment model used to describe the assignment of passengers' trips to the network based on the optimal bus headway. In order to solve the proposed model, a hybrid genetic algorithm, namely the genetic algorithm and the simulated annealing algorithm (GA-SA), is designed. Finally, the model and the algorithm are tested against the transit data, by taking some of the bus lines of Changzhou city as an example. Results indicate that the proposed model allows supply and demand to be linked, which is reasonable, and the solving algorithm is effective. 展开更多
关键词 HEADWAY bi-level model transit assignment hybrid genetic algorithm
在线阅读 下载PDF
An Alternative Approach for Solving Bi-Level Programming Problems
5
作者 Rashmi Birla Vijay K. Agarwal +1 位作者 Idrees A. Khan Vishnu Narayan Mishra 《American Journal of Operations Research》 2017年第3期239-247,共9页
An algorithm is proposed in this paper for solving two-dimensional bi-level linear programming problems without making a graph. Based on the classification of constraints, algorithm removes all redundant constraints, ... An algorithm is proposed in this paper for solving two-dimensional bi-level linear programming problems without making a graph. Based on the classification of constraints, algorithm removes all redundant constraints, which eliminate the possibility of cycling and the solution of the problem is reached in a finite number of steps. Example to illustrate the method is also included in the paper. 展开更多
关键词 LINEAR programming PROBLEM bi-level programming PROBLEM GRAPH Algorithm
在线阅读 下载PDF
Optimization of the bioconversion of glycerol to ethanol using Escherichia coli by implementing a bi-level programming framework for proposing gene transcription control strategies based on genetic algorithms
6
作者 Carol Milena Barreto-Rodriguez Jessica Paola Ramirez-Angulo +2 位作者 Jorge Mario Gomez-Ramirez Luke Achenie Andres Fernando Gonzalez-Barrios 《Advances in Bioscience and Biotechnology》 2012年第4期336-343,共8页
In silico approaches for metabolites optimization have been derived from the flood of sequenced and annotated genomes. However, there exist still numerous degrees of freedom in terms of optimization algorithm approach... In silico approaches for metabolites optimization have been derived from the flood of sequenced and annotated genomes. However, there exist still numerous degrees of freedom in terms of optimization algorithm approaches that can be exploited in order to enhance yield of processes which are based on biological reactions. Here, we propose an evolutionary approach aiming to suggest different mutant for augmenting ethanol yield using glycerol as substrate in Escherichia coli. We found that this algorithm, even though is far from providing the global optimum, is able to uncover genes that a global optimizer would be incapable of. By over-expressing accB, eno, dapE, and accA mutants in ethanol production was augmented up to 2 fold compared to its counterpart E. coli BW25113. 展开更多
关键词 bi-level Optimization Escherichia coli Metabolic Flux Analysis Genetic Algorithm
暂未订购
Glia-to-neuron reprogramming to the rescue?
7
作者 Jack W.Hickmott Cindi M.Morshead 《Neural Regeneration Research》 SCIE CAS 2025年第5期1395-1396,共2页
Over the last two decades,the dogma that cell fate is immutable has been increasingly challenged,with important implications for regenerative medicine.The brea kth rough discovery that induced pluripotent stem cells c... Over the last two decades,the dogma that cell fate is immutable has been increasingly challenged,with important implications for regenerative medicine.The brea kth rough discovery that induced pluripotent stem cells could be generated from adult mouse fibroblasts is powerful proof that cell fate can be changed.An exciting extension of the discovery of cell fate impermanence is the direct cellular reprogram ming hypothesis-that terminally differentiated cells can be reprogrammed into other adult cell fates without first passing through a stem cell state. 展开更多
关键词 programming PASSING proof
暂未订购
Neurocircuit regeneration by extracellular matrix reprogramming
8
作者 Shengzhang Su Ian N.Levasseur Kimberly M.Alonge 《Neural Regeneration Research》 SCIE CAS 2025年第8期2300-2301,共2页
The brain's extracellular matrix(ECM),which is comprised of protein and glycosaminoglycan(GAG)scaffolds,constitutes 20%-40% of the human brain and is considered one of the largest influencers on brain cell functio... The brain's extracellular matrix(ECM),which is comprised of protein and glycosaminoglycan(GAG)scaffolds,constitutes 20%-40% of the human brain and is considered one of the largest influencers on brain cell functioning(Soles et al.,2023).Synthesized by neural and glial cells,the brain's ECM regulates a myriad of homeostatic cellular processes,including neuronal plasticity and firing(Miyata et al.,2012),cation buffering(Moraws ki et al.,2015),and glia-neuron interactions(Anderson et al.,2016).Considering the diversity of functions,dynamic remodeling of the brain's ECM indicates that this understudied medium is an active participant in both normal physiology and neurological diseases. 展开更多
关键词 MATRIX programming
在线阅读 下载PDF
Safe flight corridor constrained sequential convex programming for efficient trajectory generation of fixed-wing UAVs 被引量:2
9
作者 Jing SUN Guangtong XU +2 位作者 Zhu WANG Teng LONG Jingliang SUN 《Chinese Journal of Aeronautics》 2025年第1期537-550,共14页
Generating dynamically feasible trajectory for fixed-wing Unmanned Aerial Vehicles(UAVs)in dense obstacle environments remains computationally intractable.This paper proposes a Safe Flight Corridor constrained Sequent... Generating dynamically feasible trajectory for fixed-wing Unmanned Aerial Vehicles(UAVs)in dense obstacle environments remains computationally intractable.This paper proposes a Safe Flight Corridor constrained Sequential Convex Programming(SFC-SCP)to improve the computation efficiency and reliability of trajectory generation.SFC-SCP combines the front-end convex polyhedron SFC construction and back-end SCP-based trajectory optimization.A Sparse A^(*)Search(SAS)driven SFC construction method is designed to efficiently generate polyhedron SFC according to the geometric relation among obstacles and collision-free waypoints.Via transforming the nonconvex obstacle-avoidance constraints to linear inequality constraints,SFC can mitigate infeasibility of trajectory planning and reduce computation complexity.Then,SCP casts the nonlinear trajectory optimization subject to SFC into convex programming subproblems to decrease the problem complexity.In addition,a convex optimizer based on interior point method is customized,where the search direction is calculated via successive elimination to further improve efficiency.Simulation experiments on dense obstacle scenarios show that SFC-SCP can generate dynamically feasible safe trajectory rapidly.Comparative studies with state-of-the-art SCP-based methods demonstrate the efficiency and reliability merits of SFC-SCP.Besides,the customized convex optimizer outperforms off-the-shelf optimizers in terms of computation time. 展开更多
关键词 Fixed-wing unmanned aerial vehicle Efficient trajectory planning Safe flight corridor Sequential convex programming Customized convex optimizer
原文传递
Evaluation of Integer Programming Solvers to Improve the Efficiency of Individual Work Planning
10
作者 Keiichi Takahashi 《Open Journal of Modelling and Simulation》 2025年第1期51-64,共14页
This study proposes a novel approach to optimizing individual work schedules for book digitization using mixed-integer programming (MIP). By leveraging the power of MIP solvers, we aimed to minimize the overall digiti... This study proposes a novel approach to optimizing individual work schedules for book digitization using mixed-integer programming (MIP). By leveraging the power of MIP solvers, we aimed to minimize the overall digitization time while considering various constraints and process dependencies. The book digitization process involves three key steps: cutting, scanning, and binding. Each step has specific requirements and limitations such as the number of pages that can be processed simultaneously and potential bottlenecks. To address these complexities, we formulate the problem as a one-machine job shop scheduling problem with additional constraints to capture the unique characteristics of book digitization. We conducted a series of experiments to evaluate the performance of our proposed approach. By comparing the optimized schedules with the baseline approach, we demonstrated significant reductions in the overall processing time. In addition, we analyzed the impact of different weighting schemes on the optimization results, highlighting the importance of identifying and prioritizing critical processes. Our findings suggest that MIP-based optimization can be a valuable tool for improving the efficiency of individual work schedules, even in seemingly simple tasks, such as book digitization. By carefully considering specific constraints and objectives, we can save time and leverage resources by carefully considering specific constraints and objectives. 展开更多
关键词 Mixed Integer programming Scheduling Optimization Work Planning Book Scanning Gantt Chart
在线阅读 下载PDF
Research on Human-Computer Collaboration Paradigm in AIGC-Empowered High-Level Language Programming Courses
11
作者 Hongyuan Wang Baokai Zu +2 位作者 Yafang Li Wanting Zhu Hongli Chen 《Journal of Contemporary Educational Research》 2025年第5期285-289,共5页
With the rapid development of artificial intelligence technology,AIGC(Artificial Intelligence-Generated Content)has triggered profound changes in the field of high-level language programming courses.This paper deeply ... With the rapid development of artificial intelligence technology,AIGC(Artificial Intelligence-Generated Content)has triggered profound changes in the field of high-level language programming courses.This paper deeply explored the application principles,advantages,and limitations of AIGC in intelligent code generation,analyzed the new mode of human-computer collaboration in high-level language programming courses driven by AIGC,discussed the impact of human-computer collaboration on programming efficiency and code quality through practical case studies,and looks forward to future development trends.This research aims to provide theoretical and practical guidance for high-level language programming courses and promote innovative development of high-level language programming courses under the human-computer collaboration paradigm. 展开更多
关键词 Human-computer collaboration AIGC High-level language programming Intelligence programming Efficiency improvement
在线阅读 下载PDF
A 28 nm 576K RRAM-based computing-in-memory macro featuring hybrid programming with area efficiency of 2.82 TOPS/mm^(2)
12
作者 Siqi Liu Songtao Wei +7 位作者 Peng Yao Dong Wu Lu Jie Sining Pan Jianshi Tang Bin Gao He Qian Huaqiang Wu 《Journal of Semiconductors》 2025年第6期112-119,共8页
Computing-in-memory(CIM)has been a promising candidate for artificial-intelligent applications thanks to the absence of data transfer between computation and storage blocks.Resistive random access memory(RRAM)based CI... Computing-in-memory(CIM)has been a promising candidate for artificial-intelligent applications thanks to the absence of data transfer between computation and storage blocks.Resistive random access memory(RRAM)based CIM has the advantage of high computing density,non-volatility as well as high energy efficiency.However,previous CIM research has predominantly focused on realizing high energy efficiency and high area efficiency for inference,while little attention has been devoted to addressing the challenges of on-chip programming speed,power consumption,and accuracy.In this paper,a fabri-cated 28 nm 576K RRAM-based CIM macro featuring optimized on-chip programming schemes is proposed to address the issues mentioned above.Different strategies of mapping weights to RRAM arrays are compared,and a novel direct-current ADC design is designed for both programming and inference stages.Utilizing the optimized hybrid programming scheme,4.67×programming speed,0.15×power saving and 4.31×compact weight distribution are realized.Besides,this macro achieves a normalized area efficiency of 2.82 TOPS/mm2 and a normalized energy efficiency of 35.6 TOPS/W. 展开更多
关键词 computing-in-memory on-chip programming scheme hybrid programming resistive random access memory matrix-vector-multiplication acceleration
在线阅读 下载PDF
Adapting High-Level Language Programming(C Language)Education in the Era of Large Language Models
13
作者 Baokai Zu Hongyuan Wang +1 位作者 Hongli Chen Yafang Li 《Journal of Contemporary Educational Research》 2025年第5期264-269,共6页
With the widespread application of large language models(LLMs)in natural language processing and code generation,traditional High-Level Language Programming courses are facing unprecedented challenges and opportunitie... With the widespread application of large language models(LLMs)in natural language processing and code generation,traditional High-Level Language Programming courses are facing unprecedented challenges and opportunities.As a core programming language for computer science majors,C language remains irreplaceable due to its foundational nature and engineering adaptability.This paper,based on the rapid development of large model technologies,proposes a systematic reform design for C language teaching,focusing on teaching objectives,content structure,teaching methods,and evaluation systems.The article suggests a teaching framework centered on“human-computer collaborative programming,”integrating prompt training,AI-assisted debugging,and code generation analysis,aiming to enhance students’problem modeling ability,programming expression skills,and AI collaboration literacy. 展开更多
关键词 Large language models(LLMs) High-level language programming C language Human-computer collaborative programming
在线阅读 下载PDF
Reprogramming induced neurons from olfactory ensheathing glial cells: A feasible approach for spinal cord injury repair
14
作者 Javier Sierra María Portela-Lomba +1 位作者 Diana Simón M.Teresa Moreno-Flores 《Neural Regeneration Research》 2026年第1期296-297,共2页
Every year, around the world, between 250,000 and 500,000 people suffer a spinal cord injury(SCI). SCI is a devastating medical condition that arises from trauma or disease-induced damage to the spinal cord, disruptin... Every year, around the world, between 250,000 and 500,000 people suffer a spinal cord injury(SCI). SCI is a devastating medical condition that arises from trauma or disease-induced damage to the spinal cord, disrupting the neural connections that allow communication between the brain and the rest of the body, which results in varying degrees of motor and sensory impairment. Disconnection in the spinal tracts is an irreversible condition owing to the poor capacity for spontaneous axonal regeneration in the affected neurons. 展开更多
关键词 INJURY feasible programming
暂未订购
From flying dreams to programming pioneer
15
作者 孙启禄 《疯狂英语(新读写)》 2025年第7期24-27,76,共5页
More than seventy years before airplanes were invented,a twelve⁃year⁃old girl named Ada Lovelace dreamed of flying.She studied birds and experimented with materials to make wings,even writing a guide called Flyology.B... More than seventy years before airplanes were invented,a twelve⁃year⁃old girl named Ada Lovelace dreamed of flying.She studied birds and experimented with materials to make wings,even writing a guide called Flyology.But her curiosity didnt stop there. 展开更多
关键词 GUIDE flyology ada lovelace programming pioneer FLYING
在线阅读 下载PDF
AI-Enabled Computer Programming Course Teaching Reform
16
作者 Yao Dai 《Journal of Electronic Research and Application》 2025年第3期90-96,共7页
With the rapid development of modern science and technology,the era of artificial intelligence has quietly come.Against the background of the new era,students’learning needs,learning resource acquisition methods,teac... With the rapid development of modern science and technology,the era of artificial intelligence has quietly come.Against the background of the new era,students’learning needs,learning resource acquisition methods,teachers’teaching concepts,teaching tools,and so on have changed significantly.How to carry out teaching reform based on this change has become one of the important issues facing educators,and the same is true for the teaching of computer programming courses.This paper focuses on the teaching reform of AI-enabled computer programming courses,analyzes its basic problems,and puts forward corresponding reform countermeasures to provide a useful reference for front-line teachers. 展开更多
关键词 AI Computer programming
在线阅读 下载PDF
Enhancing the data processing speed of a deep-learning-based three-dimensional single molecule localization algorithm (FD-DeepLoc) with a combination of feature compression and pipeline programming
17
作者 Shuhao Guo Jiaxun Lin +1 位作者 Yingjun Zhang Zhen-Li Huang 《Journal of Innovative Optical Health Sciences》 2025年第2期150-160,共11页
Three-dimensional(3D)single molecule localization microscopy(SMLM)plays an important role in biomedical applications,but its data processing is very complicated.Deep learning is a potential tool to solve this problem.... Three-dimensional(3D)single molecule localization microscopy(SMLM)plays an important role in biomedical applications,but its data processing is very complicated.Deep learning is a potential tool to solve this problem.As the state of art 3D super-resolution localization algorithm based on deep learning,FD-DeepLoc algorithm reported recently still has a gap with the expected goal of online image processing,even though it has greatly improved the data processing throughput.In this paper,a new algorithm Lite-FD-DeepLoc is developed on the basis of FD-DeepLoc algorithm to meet the online image processing requirements of 3D SMLM.This new algorithm uses the feature compression method to reduce the parameters of the model,and combines it with pipeline programming to accelerate the inference process of the deep learning model.The simulated data processing results show that the image processing speed of Lite-FD-DeepLoc is about twice as fast as that of FD-DeepLoc with a slight decrease in localization accuracy,which can realize real-time processing of 256×256 pixels size images.The results of biological experimental data processing imply that Lite-FD-DeepLoc can successfully analyze the data based on astigmatism and saddle point engineering,and the global resolution of the reconstructed image is equivalent to or even better than FD-DeepLoc algorithm. 展开更多
关键词 Real-time data processing feature compression pipeline programming
原文传递
Magneto-soft robots based on multi-materials optimizing and heat-assisted in-situ magnetic domains programming
18
作者 Fuzhou Niu Quhao Xue +9 位作者 Qing Cao Xinyang He Taolei Wang HaoChen Wang Chonglei Hao Xiaojian Li Ying Li Hao Yang Huayong Yang Dong Han 《International Journal of Extreme Manufacturing》 2025年第5期447-462,共16页
Soft robots, inspired by the flexibility and versatility of biological organisms, have potential in a variety of applications. Recent advancements in magneto-soft robots have demonstrated their abilities to achieve pr... Soft robots, inspired by the flexibility and versatility of biological organisms, have potential in a variety of applications. Recent advancements in magneto-soft robots have demonstrated their abilities to achieve precise remote control through magnetic fields, enabling multi-modal locomotion and complex manipulation tasks. Nonetheless, two main hurdles must be overcome to advance the field: developing a multi-component substrate with embedded magnetic particles to ensure the requisite flexibility and responsiveness, and devising a cost-effective,straightforward method to program three-dimensional distributed magnetic domains without complex processing and expensive machinery. Here, we introduce a cost-effective and simple heat-assisted in-situ integrated molding fabrication method for creating magnetically driven soft robots with three-dimensional programmable magnetic domains. By synthesizing a composite material with neodymium-iron-boron(NdFeB) particles embedded in a polydimethylsiloxane(PDMS) and Ecoflex matrix(PDMS:Ecoflex = 1:2 mass ratio, 50% magnetic particle concentration), we achieved an optimized balance of flexibility, strength, and magnetic responsiveness. The proposed heat-assisted in-situ magnetic domains programming technique,performed at an experimentally optimized temperature of 120℃, resulted in a 2 times magnetization strength(9.5 mT) compared to that at 20℃(4.8 m T), reaching a saturation level comparable to a commercial magnetizer. We demonstrated the versatility of our approach through the fabrication of six kinds of robots, including two kinds of two-dimensional patterned soft robots(2D-PSR), a circular six-pole domain distribution magnetic robot(2D-CSPDMR), a quadrupedal walking magnetic soft robot(QWMSR), an object manipulation robot(OMR), and a hollow thin-walled spherical magneto-soft robot(HTWSMSR). The proposed method provides a practical solution to create highly responsive and adaptable magneto-soft robots. 展开更多
关键词 magneto-soft robots multi-materials optimizing three-dimensional magnetic domains programming
在线阅读 下载PDF
Research on Teaching Reform Strategies of Python Programming Course Based on Artificial Intelligence Technology
19
作者 Hong Chen 《Journal of Electronic Research and Application》 2025年第5期25-29,共5页
As one of the core courses for computer-related majors,the Python programming course has become increasingly important in the era of artificial intelligence.It aims to help students develop good computer thinking and ... As one of the core courses for computer-related majors,the Python programming course has become increasingly important in the era of artificial intelligence.It aims to help students develop good computer thinking and improve their abilities in programming and data analysis.The application of artificial intelligence technology in the teaching of Python programming courses is of great significance for optimizing the allocation of teaching resources,enriching students’learning experience,and significantly improving teaching quality.Based on this,this paper first briefly expounds on the importance of applying artificial intelligence technology in the teaching of Python programming courses.On this basis,it focuses on exploring effective strategies for the teaching reform of Python programming courses based on artificial intelligence technology,hoping to provide new ideas for the teaching of Python programming courses and contribute to cultivating more Python programming talents with artificial intelligence literacy. 展开更多
关键词 Artificial intelligence technology Python programming course Teaching reform Effective strategies
在线阅读 下载PDF
Teaching Reform of the C Programming Language Course Integrating OBE Concept and AI Assistance under the New Engineering Background
20
作者 Arzigul Ahat Gulnaz Alimjan 《Journal of Contemporary Educational Research》 2025年第7期197-202,共6页
With the continuous advancement of the New Engineering Education initiative,universities are raising the standards for cultivating engineering talents.C Programming Language,as a core course for computer science and r... With the continuous advancement of the New Engineering Education initiative,universities are raising the standards for cultivating engineering talents.C Programming Language,as a core course for computer science and related majors,plays a fundamental role in developing logical thinking,programming skills,and engineering practice.However,problems such as outdated content,weak practical connections,and single assessment methods still exist in current teaching,which affects both learning outcomes and students’skill development.Based on the outcome-based education(OBE)approach and supported by AI-assisted teaching tools,this paper proposes a reform plan focusing on teaching content,instructional methods,and evaluation systems.The goal is to enhance students’overall abilities and practical innovation skills,and to align the course more closely with modern industry needs. 展开更多
关键词 New Engineering C programming Language Teaching reform OBE concept AI-assisted instruction
在线阅读 下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部