文科大学生计算机课程设计性实验的研究与实践

将现代项目管理理念引入教学,并将这一理念应用于Visual Foxpro程序设计课程的教学实践。通过在文科类大学生计算机课程教学中设计性实验的实施,阐述了实施设计性实验的意义,总结了教学实践中遇到的问题,探究了问题存在的原因,并提出了解决问题的一些设想。     

改进的D_时刻表算法在大学课程表问题中的应用

课程表的自动生成是大学课程表编排中最复杂的一个环节,是一个典型的时间规划问题。针对这一问题。本文设计了一种全新的使用改进的D_时刻表的设计方法,提出一套大学课程表白动生成方法。该方法是以文献[5]中介绍的有效解决时间规划问题的D_时刻表算法为基础,并通过试验说明了该方法具有一定的可行性和有效性。     

面向应用型本科的“计算机控制系统”课程教学改革与探索

应用型本科院校以培养高素质应用型人才作为培养目标。为达到预期的培养目标,需要在专业培养方案设置、课程知识体系、课程教学模式与方法等各个环节进行有针对性的优化设计。《计算机控制系统》课程兼有深入的理论基础和面向实际应用的特点,因此在教学改革时需要把握好理论与实践的关系。针对理论教学,在优化调整讲授内容的基础上,通过引入工程案例法将核心知识点串联起来,并制作“慕课”形式的教学视频作为线下教学的补充;针对实验教学,设置更多的设计性和综合性实验并引入三级训练项目作为补充。改革后的教学内容与工程实践的结合更加紧密,教学素材与方法也更加丰富,极大地提升了学生的学习自主性,更有利于学生分析和解决实际问题能力的培养。     

Exploring entrepreneurship in the academic environment

The entrepreneurial university has taken a prodigious influence globally, and studies show the expedient value of entrepreneurship in universities performing innumerable activities alongside their main objectives of teaching and research. Universities worldwide are adopting entrepreneurship teaching through creating models and methods. Collaboration of research, industry, and government entities is crucial to fulfill innovative systems in the academic environment. This study evaluates academic faculty and their impact on entrepreneurial education by focusing on their work experience, position, involvement in technical projects, international work experience, and private sector experience. Analysis of Variances (ANOVA), Least Significant Difference (LSD) assessments are conducted to support the results of our hypotheses and the variables of the entrepreneurial education impact by understanding the interpersonal aspects of faculty within academic organizations.     

地方综合性大学计算机中心管理的研究与实践

为了解决地方综合性大学不同专业对计算机中心的不同需求,提出了以需求为导向、以公共管理和服务平台为依托的计算机中心管理模式。通过整合实验室资源、建立高效维护平台、充实网络资源,能够提高机房利用效率,满足专业需求,促进学生计算机综合能力的培养。     

道家思想影响下的高校公共艺术美学刍探

从道家思想中挖掘其美学内涵,融汇于高校校园公共艺术的营造之中,并能呈现大学校园的文化及人文内涵。道家思想影响下的高校公共艺术具有非常丰富的美学内涵,即综合蕴含了天人合一、和谐共生、以和为美等诸方面要素。     

The other side of ranking schemes: generating weights for specified outcomes

This paper treats the problem of how to determine weights in a ranking, which will cause a selected entity to attain the highest possible position. We establish that there are two types of entities in a ranking scheme: those which can be ranked as number one and those which cannot. These two types of entities can be identified using the “ranking hull” of the data; a polyhedral set that envelops the data. Only entities with data points on the boundary of this hull can attain the number one position. There are no weights that will make an entity whose data point is in the interior of the hull to ever attain the number one position. We deal with these two types of entities separately. In the first case, we propose an approach for finding a set of weights that, under special conditions, will result in a selected entity achieving the top of the ranking without ties and without ignoring any of the attributes. For the second category of entities, we devise a procedure to guarantee that these entities will attain their highest possible position in the ranking. The first case will require using interior point methods to solve a linear program (LP). The second case involves a binary mixed integer formulation. These two mathematical programs were tested on data from a well‐known university ranking.     

An integer program and a hybrid genetic algorithm for the university timetabling problem

The university timetabling problem (UTP) has been studied by numerous research groups for decades. In addition to addressing hard and soft constraints, we extend the UTP by considering consecutiveness and periodicity constraints of multi-session lectures, which are common in many eastern Asian universities. Because schedulers can decide the consecutiveness and periodicity constraints for the multi-session lectures within a limited ratio, we consider these novel decision variables in our model. We develop a mixed integer linear program for the UTP. For the analysis, we convert the UTP into the three-dimensional container packing problem (3DCPP) and create a hybrid genetic algorithm (HGA), which has been shown to be efficient in solving the 3DCPP. We also develop a tabu search algorithm based on the existing UTP literature and compare the findings with that of our HGA. The results show that our HGA obtains a better solution than the tabu search algorithm in a reasonable amount of time.     

地方高校本科计算机专业数据库系统课程体系建设

针对地方高校本科计算机专业数据库课程教学进行研究,首先详细分析了地方高校应用型本科该专业课程的培养目标;其次通过设置数据库课程群和课程链,制定了数据库相关系列课程的体系结构;最后对地方高校应用型本科计算机专业数据库系列课程的教学方法和考核方式进行了探讨.     

浅谈高校中的计算机安全管理

随着因特网的普及和发展,高校的计算机安全面临着许多恶意的代码和黑客的攻击,致使高校的计算机网络室安全管理软件和还原软件全部失效,但高校计算机安全性太高又不利于学生对计算机的使用。本文主要介绍了利用注册表实现高校电子阅览室计算机安全管理的实例,以便更深入的对计算机安全管理的了解。