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

A Novel Swarm Exploring Varying Parameter Recurrent Neural Network for Solving Non-Convex Nonlinear programming

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2024年第9期35卷 12642-12652页

作者： Zhang, Zhijun Ren, Xiaohui Xie, Jilong Luo, Yamei South China Univ Technol Sch Automat Sci & Engn Guangzhou 510640 Peoples R China Guangdong Univ Petrochem Technol Sch Automat Maoming 525000 Peoples R China Guangdong Artificial Intelligence & Digital Econ L Pazhou Lab Guangzhou 510335 Peoples R China Shaanxi Univ Technol Sch Mech Engn Shaanxi Prov Key Lab Ind Automat Hanzhong 723001 Peoples R China Hunan Univ Finance & Econ Sch Informat Technol & Management Changsha 410205 Peoples R China East China Jiaotong Univ Sch Automat Sci & Engn Nanchang 330052 Peoples R China South China Univ Technol Sch Automat Sci & Engn Guangzhou 510640 Peoples R China

Aiming at solving non-convex nonlinear programming efficiently and accurately, a swarm exploring varying parameter recurrent neural network (SE-VPRNN) method is proposed in this article. First, the local optimal solutions are searched accurately by the proposed varying parameter recurrent neural network. After each network converges to the local optimal solutions, information is exchanged through a particle swarm optimization (PSO) framework to update the velocities and positions. The neural network searches for the local optimal solutions again from the updated position until all the neural networks are searched to the same local optimal solution. For improving the global searching ability, wavelet mutation is applied to increase the diversity of particles. Computer simulations show that the proposed method can solve the non-convex nonlinear programming effectively. Compared with three existing algorithms, the proposed method has advantages in accuracy and convergence time.

关键词： Optimization programming Recurrent neural networks Search problems Neurodynamics Heuristic algorithms Convergence Multiple constraints non-convex nonlinear programming particle swarm optimization (PSO) varying parameter recurrent neural network

来源：评论

学校读者我要写书评

暂无评论

"You give a little bit more love to animals than to robots": primary pupils' conceptions of 'programming' and programmable artefacts

引用

INTERNATIONAL JOURNAL OF TECHNOLOGY AND DESIGN EDUCATION 2024年第2期34卷 505-530页

作者： Axell, Cecilia Berg, Astrid Linkoping Univ Dept Behav Sci & Learning IBL Div Learning AesthetNat Sci LEN S-60174 Norrkoping Sweden

Although digital technology is an important part of young people's lives, previous research implies that they have a limited understanding of what programming is and its connection to the digital devices they encounter every day. In order to create conditions for meaningful teaching in and about programming in technology education, more knowledge about younger students' pre-understanding and experiences is needed. In the light of this, the aim of this case study was to explore young pupils' descriptions of the concept 'programming', in connection with being introduced to programming as a teaching content in technology education. The study is based on semi-structured interviews with 16 children in year 1 (7-year-olds) in a primary school in Sweden. In their descriptions of 'programming' as an activity, the pupils mainly used technological descriptions-a theory of artificial mind perspective. However, when they talked about the objects with which they associated programming, psychological descriptions-a theory of mind perspective-were more clearly present. Then, a less pronounced distinction between humans and machines was made. Anthropomorphic references were used, such as when the pupils referenced children's culture such as movies and television programs. However, the term 'programming' was difficult for many of the pupils to grasp. They also had difficulty in finding a function for programming, as well as explanations and arguments for why they learn programming in school. The results of this study indicate that these 7-year-old pupils perceive 'programming' as something complex. This at the same time as they describe how programmed and programmed artefacts (including AI devices) are highly present in their everyday lives, in their leisure environments, and in school. This mirrors how technology has become an 'intelligent' and active agent, rather than a mere tool in their lives-an aspect that teachers may forget to take advantage of.

关键词： Technology education Primary school programming Theory of mind Theory of artificial mind

来源：评论

学校读者我要写书评

暂无评论

Strider: Signal Value Transition-Guided Defect Repair for HDL programming Assignments

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2024年第5期43卷 1594-1607页

作者： Yang, Deheng He, Jiayu Mao, Xiaoguang Li, Tun Lei, Yan Yi, Xin Wu, Jiang Natl Univ Def Technol Coll Comp Key Lab Software Engn Complex Syst Changsha 410073 Peoples R China Natl Univ Def Technol Coll Comp Changsha 410073 Peoples R China Chongqing Univ Sch Big Data & Software Engn Chongqing 401331 Peoples R China

Hardware description languages (HDLs) are pivotal for the development of hardware designs. The programming courses for HDLs are also popular in both universities and online course platforms. Similar to programming assignments of software languages (SLs), these of HDLs also actively call for automated program repair (APR) techniques to provide personalized feedback for students. However, the research of APR techniques targeting HDL programming assignments is still in an early stage. Due to the significantly different programming mechanism of HDLs from SLs, the only APR technique (i.e., CirFix) targeting HDL programming assignments contributes a customized repair pipeline. However, the fundamental challenges in the design of HDL-oriented fault localization and patch generation still remain unresolved. In this work, we propose a signal value transition-guided defect repair technique named Strider by capturing the intrinsic features of HDLs. This technique consists of a time-aware dynamic defect localization approach to precisely localize defects, and a signal value transition-guided patch synthesis approach to effectively generate fixes. We further construct a dataset of 57 real defects from HDL programming assignments for tool evaluation. The evaluation reveals the overfitting issue of the pioneering tool CirFix and the significant improvement of Strider over CirFix in terms of both effectiveness and efficiency. In particular, Strider is more effective by correctly fixing 2.3x as many defects as CirFix in the real defect dataset, and is 23x more efficient by generating a correct fix within 5 min on average in the synthetic defect dataset, while CirFix takes around 2 h on average.

关键词： programming Hardware design languages Maintenance engineering Hardware Software Location awareness Timing Automated program repair (APR) fault localization hardware description languages (HDLs) programming assignments

来源：评论

学校读者我要写书评

暂无评论

Cluster and trajectory analysis of motivation in an emergency remote programming course

引用

PEERJ COMPUTER SCIENCE 2024年 10卷 e1787-e1787页

作者： Jahr, Andres Meza, Javiera Munoz-Gama, Jorge Herskovic, Luis Herskovic, Valeria Pontificia Univ Catolica Chile Dept Comp Sci Santiago Chile Univ Adolfo Ibanez Escuela Gobierno Santiago Chile

Emergency remote teaching is a temporary change in the way education occurs, whereby an educational system unexpectedly becomes entirely remote. This article analyzes the motivation of students undertaking a university course over one semester of emergency remote teaching in the context of the COVID-19 pandemic. University students undertaking a programming course were surveyed three times during one semester, about motivation and COVID concern. This work explores which student motivation profiles existed, how motivation evolved, and whether concern about the pandemic was a factor affecting motivation throughout the course. The most adaptive profile was highly motivated, more prepared and less frustrated by the conditions of the course. However, this cluster experienced the highest levels of COVID-19 concern. The least adaptive cluster behaved as a mirror image of the most adaptive cluster. Clear differences were found between the clusters that showed the most and least concern about COVID-19.

关键词： Computer education Emergency remote course programming Motivation

来源：评论

学校读者我要写书评

暂无评论

Surrogate-Based Constraint-Handling Technique for Multi-Area Combined Economic/Emission Dispatch Problems Within Bi-Level programming Framework

引用

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE 2024年

作者： Liang, Huijun Lin, Chenhao Pang, Aokang Hubei Minzu Univ Coll Intelligent Syst Sci & Engn Enshi 445000 Peoples R China

Due to long optimization time and limited dispatching cycle, multi-area combined economic/emission dispatch (MACEED) problems are converted into computationally expensive MACEED (CEMACEED) problems. Existing centralized and distributed method for CEMACEED problems include time-consuming and inaccurate disadvantages. The drawbacks, i.e., low convergence rate and unaffordable computing time may make scheduling cycles can hardly be met. In this paper, a novel surrogate-based bi-level programming framework is proposed. CEMACEED problem is decoupled to obtain completely independent sub-area dispatching problems. Then, a novel surrogate-based constraint-handling technique is proposed to handle tie line constraint while realizing decoupling. Original tie line constraint is replaced by improved polynomial regression surrogate models to save more than 75% of operating time. Finally, a novel meta-heuristic algorithm named emotional accumulation game evolutionary algorithm (EAGEA) is proposed to execute CEMACEED problems. The proposed method obtains the minimum cost, emission, and operating time over all simulation cases.

关键词： Dispatching Optimization Costs Metaheuristics programming Convergence Task analysis Bi-level programming constraint-handling technique game theory multi-area combined economic/emission dispatch surrogate model

来源：评论

学校读者我要写书评

暂无评论

Identifying Difficult Questions and Student Difficulties in a Spanish Version of a programming Assessment Instrument (SCS1)

引用

ACM TRANSACTIONS ON COMPUTING EDUCATION 2024年第3期24卷 1-17页

作者： Vieira, Camilo Vasquez, Andrea Meza, Federico Quintero-manes, Roxana Godoy, Pedro Univ Norte Barranquilla Colombia Univ Tecn Federico Santa Maria Valparaiso Chile

Currently, there is little evidence about how non-English-speaking students learn computer programming. For example, there are few validated assessment instruments to measure the development of programming skills, especially for the Spanish-speaking population. Having valid assessment instruments is essential to identify the difficulties of the students, make formative decisions, and evaluate the impact of pedagogical interventions. This article presents the outcomes of the early steps toward a validation in Spanish of the SCS1 assessment, derived from the first conceptual inventory to measure programming knowledge decoupled from a particular language. The goal of this initial step is twofold: (1) identifying the questions that are too difficult in this version and might need to be adapted based on empirical evidence of how students answer them and (2) identifying students' common difficulties with the most challenging questions. This study started with a "think-aloud" protocol to validate whether the Spanish version was similar to the original instrument and if the students understood the translation as intended. Then, the instrument was applied to a sample of 71 university students who had previously taken an introductory programming course using Python. We computed the difficulty index for each question and identified students' difficulties in answering them. We also propose potential improvements for these items. The main contributions of this study include (1) progress toward the validation of an instrument for evaluating programming skills in Spanish, (2) noting the advantage that experienced students in Python have to complete the instrument, (3) identifying the tendency of students to translate the pseudo-code from Spanish into English, and (4) the identification of common mistakes, like misunderstanding the scope of local variables or the confusion between returning and printing.

关键词： programming SCS1 assessment validation instrument

来源：评论

学校读者我要写书评

暂无评论

Finding Minimal Solution to Generalized Min-Max programming Problem With Addition-Min Composition

引用

IEEE ACCESS 2024年 12卷 145174-145187页

作者： Zhou, Xuegang Qin, Zejian Guangdong Univ Finance Sch Financial Math & Stat Guangzhou 510521 Guangdong Peoples R China

In order to describe the data transmission mechanism in the BitTorrent-like peer-to-peer file-sharing system, the addition-min fuzzy relation inequality system is introduced. At the same time, in order to distinguish the different importance of different terminals, the generalized min-max programming problem under the addition-min fuzzy relation inequality is proposed and studied. On the premise of ensuring that the quality level of data transmission meets all users, the minimal optimal solution can better avoid network congestion and improve the stability of data transmission. In this paper, we present how to find a minimal optimal solution to generalized min-max programming problems with addition-min composition. Firstly, some properties of the maximum optimal solution for the generalized min-max programming problem with addition-min combination are given. Then, by using the maximum optimal solution, the minimal optimal solution of the original problem is obtained by finding the minimal solution of the simplified constraint inequality. Moreover, convexity of the optimal solution set and the number of minimal optimal solutions are discussed. Finally, we propose an algorithm for finding the minimal optimal solution of the generalized min-max programming problem. Some examples are given to illustrate the feasibility and efficiency of the algorithm.

关键词： programming Optimization methods Peer-to-peer computing Indexes Vectors Minimax techniques Linear programming Fuzzy systems Generalized min-max programming problem fuzzy relation inequalities addition-min composition minimal solution

来源：评论

学校读者我要写书评

暂无评论

Semi-Definite programming Based Scalable and Accurate Optimal Power Flow Models for Radial Distribution Networks

引用

IEEE TRANSACTIONS ON INDUSTRY APPLICATIONS 2024年第1期60卷 1463-1475页

作者： Hasan, Md Shamim Chowdhury, Md Mahmud-Ul-Tarik Biswas, Biswajit Dipan Kamalasadan, Sukumar Univ North Carolina Energy Prod Infrastructure Ctr EP Power Energy & Intelligent Syst Lab Charlotte NC 28223 USA Univ North Carolina Charlotte Dept Elect Engn Charlotte NC 28223 USA

With high integration of distributed energy resources (DERs), modern distribution networks are subject to optimal power flow (OPF) analysis. Conventional non-linear and linear OPF models suffer from either infeasibility or inaccuracy for large networks, and global optimality is not guaranteed. Addressing computational infeasibility and non-convexity for DERs integrated distribution networks, this article presents a novel approach for OPF analysis employing semi-definite programming (SDP). For the proposed SDP-OPF model, network power flow relations utilize a bus injection model (BIM) for single-phase networks and a branch flow model (BFM) for multi-phased unbalanced power distribution networks. The exactness and the global optimality of the proposed SDP-OPF model are illustrated in this article. The proposed models' performance is evaluated in multiple standard power distribution test cases with a wide range of DER integration. The simulation results are compared with a nonlinear programming (NLP) based and a second order cone programming (SOCP) based OPF models. The comparison and the result analysis demonstrate that the proposed approach yields a more robust solution with improved convergence and accuracy.

关键词： Computational modeling Mathematical models Load flow Admittance Distribution networks programming Reactive power Optimal Power flow (OPF) Distribution System Distributed resources (DERs) Convex Optimization Semi-Definite programming (SDP)

来源：评论

学校读者我要写书评

暂无评论

Analyzing Pedagogic Practice and Assessments in a Cross-Campus programming Course

引用

IEEE TRANSACTIONS ON EDUCATION 2024年第6期67卷 964-973页

作者： Sandstrak, Grethe Klefstad, Bjorn Styve, Arne Raja, Kiran Norwegian Univ Sci & Technol Dept Comp Sci N-7491 Trondheim Norway Norwegian Univ Sci & Technol Dept ICT & Nat Sci N-7491 Trondheim Norway

Teaching programming efficiently to students in the first year of computer science education is challenging. It is especially cumbersome to retain the interest of both groups, when the student group consists of novice (i.e., those who have never programmed before) and expert programmers in the same crowd. Thus, individualized teaching cannot be achieved in a traditional lecture hall for a larger student population setting and poses a pedagogical challenge. This article presents various pedagogical approaches and explores different assessment forms to foster student active learning (SAL), drawing from years of experience teaching a programming course. A detailed analysis has been conducted to understand the effect on the students' learning and perception of a course given different pedagogical approaches and varied assessment forms. The analysis is based on a course offered across three different campuses with the same course description. The key difference between the campuses however is the choice of pedagogical approach, where one of the campuses uses a bottom-up pedagogy. In contrast, the other two campuses use the top-down pedagogy to teach programming concepts to the students. Across the three campuses, the assessment form in the course has varied from regular practical school exams together with a theoretical multiple choice format, a practical home exam during the pandemic and most recently a portfolio. The findings show no significant differences in the learning outcomes based on an analysis of the grades across campuses and extensive student surveys.

关键词： Education programming programming profession Problem-solving Encoding Codes Surveys Software development management Portfolios Philosophical considerations Assessment cross-campus higher education problem-based learning programming teaching philosophies

来源：评论

学校读者我要写书评

暂无评论

Semidefinite programming Bounds on the Size of Entanglement-Assisted Codeword Stabilized Quantum Codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2024年第11期70卷 7867-7881页

作者： Lai, Ching-Yi Tseng, Pin-Chieh Yu, Wei-Hsuan Natl Yang Ming Chiao Tung Univ NYCU Inst Commun Engn Hsinchu 30010 Taiwan Natl Yang Ming Chiao Tung Univ NYCU Dept Appl Math Hsinchu 30010 Taiwan Natl Cent Univ Dept Math Taoyuan 32001 Taiwan

In this paper, we explore the application of semidefinite programming to the realm of quantum codes, specifically focusing on codeword stabilized (CWS) codes with entanglement assistance. Notably, we utilize the isotropic subgroup of the CWS group and the set of word operators of a CWS-type quantum code to derive an upper bound on the minimum distance. Furthermore, this characterization can be incorporated into the associated distance enumerators, enabling us to construct semidefinite constraints that lead to SDP bounds on the minimum distance or size of CWS-type quantum codes. We illustrate several instances where SDP bounds outperform LP bounds, and there are even cases where LP fails to yield meaningful results, while SDP consistently provides tighter and relevant bounds. Finally, we also provide interpretations of the Shor-Laflamme weight enumerators and shadow enumerators for codeword stabilized codes, enhancing our understanding of quantum codes.

关键词： Codes Vectors Upper bound Quantum entanglement Algebra programming Error correction codes Quantum codes codeword stabilized (CWS) codes semidefinite program Terwilliger algebra weight enumerator

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：