问题驱动的“C++程序设计”教学方法研究

问题驱动教学方法是实践建构主义认知理论的重要方法之一,对激发学生学习兴趣、培养主动学习能力具有重要意义。本文提出将问题驱动教学方法应用到C++程序设计课程的教学中,改进传统的教学方法与手段,加强实验、实践环节,增加上机考核。初步实践表明新的教学方法能够有效提高C++程序设计课程的教学效果,提升学生的实际动手编程能力。     

C++面向对象程序设计课程的实践教学研究

本文主要从三点一线式教学方法上来指导C++面向对象程序设计课程的实践教学,并且补充案例辅助教学以及建立学生学习团队来提高实践教学质量。从实践效果来看,这些方法对提高学生的实际编程能力有显著效果,能大大提高C++课程的实践教学质量,对于培养面向应用的高级专门人才具有积极作用。     

C++多元化教学方法的实践与思考

从加强C++程序设计的教学效果,提高学生编程能力的目标出发,对教学过程中所采取的教学模式、教学方法以及实验环节进行了探讨,展示了实例教学法、问题教学法、任务驱动教学法和多媒体辅助教学法在C++程序设计教学过程中的简单运用,强调了实验环节对于C++课程教学的重要性.     

C++程序设计教学方法研究与实践

为了提高C++程序设计课程的教学效果,培养学生的程序设计思维和能力,采用有效的教学方法是非常必要的.本文基于C++程序设计课程教学现状的分析,对课程教学方法进行了研究,设计了理论教学和实验教学的教学方案,阐述了教学方案的实施细节.实践结果表明,采用该方案组织的课程教学能够有效提高学生的学习效果.     

“C++程序设计”课程改革和探索

本文结合笔者多年的教学经验,从教学内容、教学方法、动手实践环节和考核方式多个方面探讨了C++程序设计的课程教学改革。经推广实践,证明这些措施能有效地提高学生的编程能力、自学能力、沟通能力和团队合作能力。     

应用型本科院校C++课程教学改革探索

为了提高学生的C++程序设计能力,文章基于课程的内在特点和重要性,从应用型本科院校一年级学生的实际情况出发,针对目前教学中存在的问题,从教学体系、教学内容、教学方法、教学辅助手段、课程考核方法等方面,系统地阐述C++课程教学的改革方法与实施过程。     

面向网络空间安全专业的C/C++程序设计教学研究

针对目前高校网络空间安全专业的人才培养需求,分析现有C/C++程序设计课程教学现状,提出面向网络空间安全专业的C/C++教学建议,包括将安全编码内容融入C/C++教学、跨课程的安全编码教学、安全编码规范教学、代码审计教学以及结合攻击案例的实例化教学,以期在培养学生编程能力的同时提升学生的安全编码能力。     

实例教学法在《C++程序设计》课堂教学中的应用初探

从C++程序设计课程的自身特点和实际需要出发,提出了在课堂教学中应用实例化教学的方法。实践证明,在该课程的讲授过程中,从各个方面合理地应用实例化教学,能够激发学生的学习兴趣,提高学生的编程能力,收到很好的教学效果。     

C++程序设计课程研究与教材建设

文章简要介绍了C++语言及课程的特点,分析国内高校C++课程的教材建设现状,针对C++课程的特点,结合南通大学C++课程的建设、教学研究、教学实践和教学理念,以学生的认识规律和编程能力的形成规律为依据,以培养学生实际编程能力和创新能力为目标,阐述C++系列教材建设历程和建设成果。     

以兴趣为导向“面向对象程序设计C++”教学实践

面向对象程序设计是计算机专业学生的专业基础课,但学生普遍反映C++程序设计语言学习难度大,兴趣不高,教学效果差,难以完成即使小项目的编程实现。通过分析教学过程中存在的问题,例如学生对控制台应用程序不感兴趣、例子老套、与其他课程联系少,以提高学生兴趣为导向,培养学生面向对象思维能力以及编程实践能力为目标,对面向对象程序设计C++教学方法、教学内容、教学形式、考核评价手段等进行了一些改革,并通过调查法、定量分析法对教学实践改革的成果进行了总结,结果也表明,学生越感兴趣,那么对课程的掌握也就越好。     

极限编程在项目实践教学中的应用探索

极限编程是一种轻量级的软件开发方法。该文在介绍极限编程主要特点的基础上,探讨了在计算机项目实践教学中引入极限编程方法的必要性,以及如何在计算机项目实践教学中有效地应用极限编程方法。     

In Pursuit of the Holy Grail

Constraint programming brings us closer to true declarative programming. Considerable progress has been made in this field; exciting challenges remain.     

利用结对编程技术改进程序设计实践教学

介绍了结对编程的概念,阐述了其作为学习编程技能的一种过程改进策略在国外计算机专业教学中的实验效果,并论述了相关影响因素。     

Towards the uniform implementation of declarative languages

Current implementation techniques for functional languages differ considerably from those for logic languages. This complicates the development of flexible and efficient abstract machines that can be used for the compilation of declarative languages combining concepts of functional and logic programming. We propose an abstract machine, called the JUMP-machine, which systematically integrates the operational concepts needed to implement the functional and logic programming paradigm. The use of a tagless representation for heap objects, which originates from the Spineless Tagless G-machine, supports the integration of different concepts. In this paper, we provide a functional logic kernel language and show how to translate it into the abstract machine language of the JUMP-machine. Furthermore, we define the operational semantics of the machine language formally and discuss the mapping of the abstract machine to concrete machine architectures. We tested the approach by writing a compiler for the functional logic language GTML. The obtained performance results indicate that the proposed method allows to implement functional logic languages efficiently.     

An experimental comparison of the new goal programming and the linear programming approaches in the two-group discriminant problems

The aim of this article is to consider a new linear programming and two goal programming models for two-group classification problems. When these approaches are applied to the data of real life or of simulation, our proposed new models perform well both in separating the groups and the group–membership predictions of new objects. In discriminant analysis some linear programming models determine the attribute weights and the cut-off value in two steps, but our models determine simultaneously all of these values in one step. Moreover, the results of simulation experiments show that our proposed models outperform significantly than existing linear programming and statistical approaches in attaining higher average hit-ratios.     

An implementation of the object-oriented concurrent programming language SINA

SINA is an object-oriented language for distributed and concurrent programming. The primary focus of this paper is on the object-oriented concurrent programming mechanisms of SINA and their implementation. This paper presents the SINA constructs for concurrent programming and inter-object communication, some illustrative examples and a message-based implementation model for SINA that we have used in our current implementation.     

计算机在车载式天线座中的应用

在车载式移动卫星天线座设计中,该文提出了在硬件上采用安全装置来取代传统的汇流环,保证了旋转设备与固定设备之间各种信号的顺利传递;利用计算机来处理限位中断,实现了天线座在方位面上连续旋转;并给出了硬件结构图及主要源程序。     

Systematic construction of examples for cycling in the simplex method

We present systematic procedures to construct examples of linear programs that cycle when the simplex method is applied. Cycling examples are constructed for diverse variants of pivot selection strategies: most negative reduced-cost and steepest-edge rule for the entering variable, and smallest ratio rule for the leaving variable (where ties are broken according to the least-index or the largest coefficient criterion, respectively). The results are of theoretical interest since only a limited number of cycling examples have been presented in the literature up to date. Constructed cycling examples may also serve as test problems to evaluate the practical performance of anticycling procedures or new variants of simplex type methods.     

Intelligent solution and analysis of goal programmes: the GPSYS system

An overview of GPSYS, an intelligent linear and integer goal programming system is presented in this paper. The intelligent goal programming system is one which is designed to allow a non-specialist access to, and clear understanding of, goal programming solution and analysis techniques. GPSYS is equipped with GP speed up techniques and analysis tools such as Pareto detection and restoration, normalisation, automated lexicographic redundancy checking and an interactive facility.     

Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming

In this paper, a constraint set swelling homotopy (CSSH) algorithm for solving the single-level non-convex programming problem with designing piecewise linear contractual function which is equivalent to the principal-agent model with integral operator is proposed, and the existence and global convergence is proven under some mild conditions. As a comparison, a piecewise constant contract is also designed for solving the single-level non-convex programming problem with the corresponding discrete distributions. And some numerical tests are done by the proposed homotopy algorithm as well as by using fmincon in Matlab, LOQO and MINOS. The numerical results show that the CSSH algorithm is robust, feasible and effective.