计算机辅助设计类课程"课程思政"教学改革探析

探讨计算机辅助设计类课程课程思政融入的路径,解决在教学中课程思政融入的痛点问题.采用"微课+翻转课堂"的混合式教学,从教学设计、内容、活动及评价四个方面,探讨课程思政融入的具体方法.通过混合式教学改革实践,绘制"课程思政元素导图",提出"一环二元三步多融合"的教学模式.此种教学模式能够实现"思政元素"和专业知识教学协调同步、互相促进.     

融入思政元素的"信息系统开发技术"教学设计与实践

如何结合专业课程的课程属性、特色优势、蕴含的思政资源,实现专业教育与思政教育的共振效应,是当前专业课程开展课程思政建设的关注重点.专业基础课"信息系统开发技术"具有多学科交叉、综合性强的特点,是开展课程思政教学的良好平台.文章介绍了该课程的背景及融合思政教育的教学目标和教学特点,详细阐述了该课程开展思政教学的案例设计及实践情况,并分析了教学效果.     

基于"主动思政"和"体悟践行"的软件工程实践课程教学模式研究

为将课程思政建设落到实处,分析软件工程实践课程特点,提出基于"主动思政"和"体悟践行"的新教学模式,阐述其涵义,从课程前期准备、项目实施、答辩、课堂外几方面介绍具体教学设计及实施过程,通过与传统教学模式的对比说明新教学模式的优势.     

大数据技术课程群的"导师制"课程思政教学模式探究

针对高校大数据课程理论较多、难度大、学习曲线陡峭的教学实际,分析价值引导在提升学生知识习得能力上的重要性,结合"导师制"工作室教学模式,提出"导师制"背景下大数据技术课程群的课程思政教学模式,并详细探讨该教学模式的研究背景、研究意义、大数据技术课程中思政元素的发掘与融入路径、课程思政教育模型.     

"C语言程序设计"课程中思政元素的设计

阐述了"C语言程序设计"课程开展"课程思政"的必要性,对课程教学中的思政元素进行了深入的剖析与提炼,在教学实施过程中将思政教育融入到基础理论知识和实践操作等各学习环节中,以达到激发学生学习的积极性、增强其程序阅读分析与编程的实际能力、提高课堂教学质量和教书育人的目标.     

思政教育融入"移动通信原理"课程的研究与实践

课程思政建设是全面提高人才培养质量的重要任务."移动通信原理"课程是通信工程专业的核心必修课,深度挖掘该课程内容和教学方式中蕴含的思政教育资源,将对通信工程专业的全面育人起到良好的促进作用.文章从思政教育与"移动通信原理"课程内容相融合角度出发,将思政教育目标融入课程目标,设计思政元素融合案例,运用多种教学手段和方法实施思政教育,以期对高校工科专业课程思政教学提供改革思路和实践经验.     

基于"OBE+思政"的软件工程专业课程群建设与改革

针对大思政背景下对软件工程专业人才培养的要求,从工程教育认证出发,提出基于"OBE+思政"的软件专业人才培养框架,阐述如何构建基于"OBE+思政"的软件工程专业课程群,以湖北工程学院软件工程专业为例,以学习产出为目标,介绍课程群"OBE+思政"教学实施过程,最后说明课程群建设效果。     

"虚拟仿真综合实训"课程融入思政内容设计

采用纵向和横向两条线进行"虚拟仿真综合实训"课程思政内容设计.纵向即按照实训的不同阶段来安排思政内容,横向即按照实训的不同主体单位来安排思政内容.对"虚拟仿真综合实训"课程思政教育教学体系的探索,必将使学生在学习专业技能的同时不断提高自身思想政治水平,真正成为德才兼备的新时代人才.     

军校计算机课程培塑"科学精神"的思政教学探索

分析目前军校大学计算机基础课程思政现状,指出科学精神在本门课程中的重要地位与作用,提出"一依据三结合四融入"思政教学路径,介绍以此设计的教学案例及教学实践应用,最后对照思政教学效果检验标准分析、总结教学案例,证明该教学路径对发挥育人效应起到一定的推动作用.     

"课程思政+实践创新"的计算机专业课程教学改革研究

根据计算机专业特点,以Python程序设计课程教学改革为例,根据社会需求与学生未来发展需求,从课程教学目标、教学内容、教学模式、课程评价等环节探讨"课程思政+实践创新"的教学改革方案,通过教学实践验证,说明新教改方案有效激发了学生的学习热情,实现了专业教育和思政教育"1+1＞2"的协同效应,提升了专业人才培养质量.     

Assessing Ideational and Evaluative Skills and Creative Styles and Attitudes

This article describes the rationale for the multiphase creative problem solving process, and reports the findings from an empirical investigation conducted to facilitate the problem solving of managers. The ideational skills of the managers were assessed before and after training in a complete process of creative problem solving, along with their ideational attitudes, creative problem solving style (i.e., generator, conceptualizer, optimizer, or implementor), and evaluative skill (i.e., ability to recognize original ideas). The most important findings indicated that the training had a significant impact on the evaluative accuracy of the managers. They were significantly more accurate in their judgments about original ideas after training, both in their identification of original ideas and their recognition of unoriginal ideas. After training, the managers also gave more solutions and more original solutions to problems. Finally, several variables (e.g., the “preference for active divergence” attitude, and the conceptualizer process style) seemed to moderate the impact of training. Training was therefore effective, with specific effects that can be predicted from pre-training individual differences in attitudes and process style.     

Semantics and verification of monitors and systems of monitors and processes

In this paper we present a sound and complete semantics for the monitor concept of C.A.R. Hoare. First a method for specification of monitors, introduced by O.-J. Dahl, is reviewed. This method is based on the relation between the historic sequence of monitor procedure calls and the historic sequence of monitor procedure exits. Based on such specifications and our new monitor semantics we present a method by which it is possible to prove that a concrete monitor is an implementation of an abstract one. In the last part of the paper an axiomatic semantics for systems of concurrent processes and monitors is introduced. The method supports verification by separation of concerns: Properties of the communication to and from each process are proven in isolation by a usual Hoare style axiomatic semantics, while abstract monitors are also specified in isolation by the method reviewed in the first part of the paper. These properties of the components of the system are then used in a new proof rule to conclude properties of the complete system. Stein Gjessing received a Ph.D. (actually a Dr. philos.) from the University of Oslo (Norway) in 1985. Presently he is an Associate Professor at the Institute of informatics, University of Oslo, Norway. Dr. Gjessings research interests are in the area of concurrent and distributed programming, operating systems, formal specification and verification and programming languages.     

Integrating and automating analysis and optimization

The development of an interface coupling program on personal computers for an analysis software system such as ANSYS, SAP, etc. and an optimization software system, MOST, is presented. By controlling and directing the communications the interface coupler integrates the two programs while retaining their versatility and interactive features. The integrated system is used to solve a numerical example of active noise control for a three-dimensional enclosure, in which an energy density level of control points is minimized by adding the sound source to cancel the unwanted noise. The interface coupling program automates with relatively low cost the iterative process for designing an engineering system, remaining flexible in acoustical modelling and efficient in equation solving. Also, the coupling interface is developed in a general-purpose way so that it can be expanded easily to integrate more analysis software packages of different kinds.     

Rank and select revisited and extended

The deep connection between the Burrows–Wheeler transform (BWT) and the so-called rank and select data structures for symbol sequences is the basis of most successful approaches to compressed text indexing. Rank of a symbol at a given position equals the number of times the symbol appears in the corresponding prefix of the sequence. Select is the inverse, retrieving the positions of the symbol occurrences. It has been shown that improvements to rank/select algorithms, in combination with the BWT, turn into improved compressed text indexes.