信息安全保密课程教学浅谈

本文在概述课程地位、特点、学员、特征的基础上,论述了课程教学中需要转变的五种思维,探讨了信息安全保密课程教学中应基础内容教学和综合讨论实践教学的教学形式.     

基于MOOC的文献检索课程思政教学案例库设计

为了提高教师在实际教学中引用案例库中资源的意愿、增加库中资源信息量,设计并研究了基于大型开放式网络课程（Massive Open Online Course,MOOC）平台的文献检索课程思政教学案例库。按照文献检索课程思政教学要求,设计文献检索课程思政元素分布与案例载体形式,利用MOOC开发文献检索课程思政教学案例,并编写教学案例脚本,实现案例面向计算机的转变。通过对比实验证明,本文设计的案例库在实际应用中提高了教师在教学中对案例库中资源的引用意愿,显著提高了信息检索速度、教师教学效率以及文献检索课程思政教学的质量。     

软件工程课程教学模式改革研究与实践

介绍软件工程课程教学在专业教学体系中地位和作用,分析课程理论教学和课程设计中存在的问题,提出课程小组结对学习、考试改革、项目管理组考核制等系统解决方案并加以实践,有效促进了课程培养目标的实现,达到了以考促学的考试目的。     

数据结构课程教学改革探讨

根据传统数据结构课程教学中存在的不足,提出了数据结构课程与其它相关计算机基础课程结合协同教学的教学方案。研究了在互动式教学中提高学生自学能力、创新能力、软件设计能力的教学模式改革方案,并对教师业务学习、提高教学质量和评价机制等问题进行了探讨。     

在《计算机信息技术》教学中注重课程实施过程

在课程的教学实施中运用新颖的教学模式、对每堂课进行精心的教学设计、明确教学目标、注意教学内容的合理安排,运用教学艺术授课并对课程进行适当的教学评价,那定会取得事半功倍的教学效果,本人在《计算机信息技术》课程的教学中注重了课程实施过程,为提高教学质量起了一定作用。     

UML课程教学的改革与实践

UML课程是软件工程专业的一门必修课,该文通过分析了UML课程教学中存在的问题和不足,结合在实际教学中的经验和体会,对UML课程教学的教学目标、教学内容和考核方式等进行了一系列探索,总结了UML课程教学的方法和一些改进意见,提高了课程教学质量和效果。     

UML课程教学的改革与实践

UML课程是软件工程专业的一门必修课,该文通过分析了UML课程教学中存在的问题和不足,结合在实际教学中的经验和体会,对UML课程教学的教学目标、教学内容和考核方式等进行了一系列探索,总结了UML课程教学的方法和一些改进意见,提高了课程教学质量和效果。     

《软件工程》课程教学的几点思考

<软件工程>是计算机专业的核心基础课程.对<软件工程>课程教学中所遇到的一些问题、如何在教学中强调<软件工程>课程的重点内容,以及在教学中如何对<软件工程>课程进行实践教学等进行了思考,提出了一些想法与方法.     

对高职软件工程课程的教学改革的思考与探索

高职软件工程课程是理论和实践紧密联系的课程,本文在明确了课程培养目标的情况下,通过转变教学理念,将项目导向、任务驱动、案例教学多种教学方法集中于软件工程课程中进行教学探索,得到了学生和企业的认可.     

计算机专业硬件类课程教学改革探讨

本文针对目前国内高校计算机专业教学中普遍存在的"重视软件课程、轻视硬件课程"现象,分析了计算机硬件类课程教学中存在的主要问题,结合自己多年的教学经验,提出了硬件类课程教学改革和学生创新能力培养的措施。     

Effective solution of certain problems of theory of schedulings of nets

Cybernetics and Systems Analysis -     

Complexity of families of learning algorithms and estimation of the nonrandomness of extraction of empirical regularities

The paper presents a general approach to the evaluation of the complexity of classes of algorithms, so-called pVCD-method. To develop this method, all the examined families of models of empiric generalization were restricted to classes implementable on computers and, wider, by examining their partially recursive representations. Within the framework of the algorithmic approach, the concept of Kolmogorov’ complexity of algorithms for the recognition of properties or the extraction of regularities is proposed. The method proposed to evaluate the nonrandomness of the extraction of empirical regularities is based on this concept.     

Analysis of microdensitometric data in terms of probability of cleavage of DNA

Computer-aided analysis of autoradiographic films of DNA fragments is presented. The Powell least-squares procedure is used for optimization of parameters for components of complex densitometric curves. Since each densitometric spectrum may be divided for several non-overlapped blocks of bands, there is no upper limit on the number of parameters which must be optimized. Eight shapes for the component bands are utilized: symmetric and asymmetric Gauss and Cauchy functions, direct, symmetric and asymmetric product of Gauss function and inverse of Cauchy function, and log-normal function. The probability of DNA cleavage is calculated with correction for multiple cuts. The methods presented was applied to detailed analysis of densitometric spectra of a 21-bp DNA restriction fragment and allowed for direct correlation between structural microheterogeneity of DNA and the resulting cutting pattern. This method should facilitate the analysis of densitometric data from antibiotic-induced cleavage of DNA and footprinting experiments.     

联合收割机脱粒滚筒恒速智能控制器设计

研究了轴流式联合收割机的控制问题,给出了联合收割机脱粒滚筒的数学模型,介绍了基于模式识别的智能控制原理,建立了联合收割机脱粒滚筒恒速控制模型,设计了基于模式识别的智能恒速控制器.应用Matlab/Simulink进行了控制器仿真,其结果表明,将基于模式识别的智能控制应用于联合收割机脱粒滚筒的恒速控制,其过渡过程平稳、响应速度快、无超调、无振荡并且无稳态误差.     

An estimate of numbers of terms of semicycles of delay difference equations

In this paper, we study the semicycles of oscillatory solutions of the delay difference equation y_n+1 − y_n + p_ny_n-k = 0, where p_n is a sequence of nonnegative real numbers and k is a positive integer. Upper bound of numbers of terms of semicycles are determined in the case when

Our results improve and complement known results in literature.     

Complexity of approximation of 3-edge-coloring of graphs

The problem to find a 4-edge-coloring of a 3-regular graph is solvable in polynomial time but an analogous problem for 3-edge-coloring is NP-hard. To make the gap more precise, we study complexity of approximation algorithms for invariants measuring how far is a 3-regular graph from having a 3-edge-coloring. We show that it is an NP-hard problem to approximate such invariants with an error O(n1−ε), where n denotes the order of the graph and 0<ε<1 is a constant.     

Modifications of the method of variation of parameters

In spite of being a classical method for solving differential equations, the method of variation of parameters continues having a great interest in theoretical and practical applications, as in astrodynamics. In this paper we analyse this method providing some modifications and generalised theoretical results. Finally, we present an application to the determination of the ephemeris of an artificial satellite, showing the benefits of the method of variation of parameters for this kind of problems.     

计算机辅助课表编排技术的研究

讨论了几种实用的计算机辅助课表编排技术及在实际编排中的应用。应用分析表明，采用分批与或图搜索和分批优化的匈牙利算法相结合的方法，在计算机辅助课表编排中是行之有效的。