CPS拓扑结构节点重要性排序方法

信息物理融合系统(Cyber-physical Systems,CPS)拓扑结构中节点重要性排序是CPS拓扑分析的重要方面。针对CPS内在结构特征,构建一种CPS拓扑结构模型——交互网络模型。然后结合CPS信息交互特点定义节点交互介数作为衡量具体节点重要性度量,阐明该测度能够反映节点的相对重要度,并给出了时间复杂度为多项式阶的节点重要性排序有效算法。最后构建CPS拓扑实例进行分析,并与节点介数进行对比,说明节点重要性排序能够为CPS的运行和防护提供重要参考。     

拓扑排序的研究和应用

介绍了排序的基本概念和常见排序类型,讲解了图排序中的一种非常重要的排序算法拓扑排序的概念,研究了拓扑排序的原理以及2种常见的遍历算法,分析了拓扑排序的空间和时间复杂度,采用这2种遍历算法对有向无环图进行拓扑排序的实现,并对拓扑排序的常见应用场景进行了介绍。     

拓扑排序算法的拓展研究

拓扑排序是有向图的一种重要运算,可以根据拓扑序列串行地安排活动。为增加活动安排的并行性,文章提出并实现了分阶段拓扑排序算法。为求出最佳拓扑序列,还提出了一种全拓扑排序的实现算法。     

贪婪算法之拓扑排序的实现

拓扑排序是图的应用领域中一种重要运算,可以根据拓扑序列串行地安排活动。本文给出了拓扑排序的贪婪算法．讨论了算法中用到的数据结构．本文采用邻接袁和栈以C＋＋语言进行仿真．给出了仿真结果。     

基于属性度的属性排序算法

形式概念分析是一种从形式背景进行数据分析和规则提取的强有力工具。属性拓扑作为一种新型的形式背景表示方法,直观地描述了属性之间的关联。利用属性拓扑可以更方便直观地计算形式概念和概念格。经过对现有属性拓扑的算法与流程的研究,分析了现有属性排序算法的特异性和层次局限性,通过结合度的概念,提出了一种属性衡量的新方式--属性度,并提出了基于属性度的属性排序算法。这种排序算法得到的结果更加灵活,消除了属性排序的层次局限性,对父属性的查找有明显的优势,为基于属性拓扑中的属性排序方法提供了指引方向。     

同步数据流程序的可信排序

Lustre是一种广泛应用于核电、航空等高可信领域的同步数据流语言。用形式化验证的方法来实现Lustre到C的翻译并证明其过程能有效提高编译器的安全性。因为Lustre程序是并发执行的,需要对其进行因果分析和串行化。利用Coq工具,形式化定义拓扑排序的性质和相应层次的Lustre的语义;对Lustre程序进行因果分析和排序;证明排序后的程序满足拓扑排序的性质;证明任意两个满足拓扑排序性质的程序语义执行等价。从而实现了一种针对Lustre程序的可信排序过程。     

分组拓扑排序的面向对象实现

本文用面向对象的思想设计了分组拓扑排序算法,用该算法得到的分组拓扑序列解决了工作任务的并行安排问题.不论是用于教务管理、工程安排还是用于数据结构课程教学都是很好的.     

个性化超媒体课件研究

探讨应用能反映领域知识本质结构的语义网,应用课程排序方法、有向无环图的拓扑排序方法动态生成课件等关键技术,为开发者提供一个动态生成个性化超媒体课件的框架和过程.     

一种有向图并行性全拓扑排序算法设计与实现

讨论了AOV网的一种并行性全拓扑排序的算法及实现,解决了传统拓扑排序算法的单一性问题,说明了并行全拓扑排序有重要的实用价值。     

利用RANK函数排名次

众所周知,在Excel中可以很方便地按工作表中一列数据的大小进行排序,其结果是所有的行(记录)的次序可能被打乱。在某些排序问题中,如在学生成绩汇总表中按各门课程成绩或总成绩排列名次时,必须仍按学号从小到大的次序排列,不允许将行的次序打乱,而仅仅是在名次一栏中填入适当的数。这时一般可采用如下的做法: 第一步:按某一门课程成绩的降序排序。     

An integrated web computing application for tasks related to course selection and registration

We have developed an integrated Internet application system including an OODB, which provides instant lottery selection of applicants for courses with capacity limitations, and which allows students to create their own weekly timetables and at the same time to complete their course registration to be verified/analyzed and confirmed instantly, reducing the time needed for course registration-related work before the beginning of each semester from several days to less than one hour. Information on courses held at each time period and taught by each instructor as well as the syllabus of each course can be viewed using multiple hypertext links, and no keyboard operations are needed for these.     

Prediction of student course selection in online higher education institutes using neural network

Students are required to choose courses they are interested in for the coming semester. Due to restrictions, including lack of sufficient resources and overheads of running several courses, some universities might not offer all of a student's desirable courses. Universities must know every student's demands for every course prior to each semester for optimal course scheduling. This research examines the problems associated with course selection in the context of e-learning. This study is focused on identifying the potential factors that affect student satisfaction concerning the online courses they select, modeling student course selection behavior and fitting a function to the training data using neural network approach, and applying the obtained function to predict the final number registrations in every course after the drop and add period. The experimental sample came from 714 online graduate courses in 16 academic terms from 2005 to 2012. Findings disclosed high prediction accuracy based on the experimental data and exhibited that the proposed model outperforms three well-known machine learning techniques and two previous, naive approaches significantly. This contribution finally ends with an analysis and interpretation of results, and presentation of some suggestions and recommendations for enthusiastic educational institutes regarding how to choose the best strategy and configuration to expand and also adapt the introduced system to their specific needs.     

A survey of approaches for university course timetabling problem

Scheduling is one of the problems which so many researches have been conducted on it over the years. The university course timetabling problem which is an NP-hard problem is a type of scheduling problem. Timetabling process must be done for each semester frequently, which is an exhausting and time consuming task. The allocation of whole of events in timeslots and rooms performs by the university course timetabling process considering the list of hard and soft constraints presented in one semester, so that no conflict is created in such allocations. In the university course timetabling problem (UCTTP), the hard constraints should not be violated under any conditions; soft constraints also should not be violated as much as possible. The aim of the present paper is to analyze available approaches in the study of university course timetabling problems, including operational researches, metaheuristic methods and intelligent novel methods; also the distributed multi agent systems based approach (Cooperative Search method) is investigated due to its scalability which enables the timetabling of common events between departments. In addition, in this work a complete introduction of reliable datasets has been given to test and evaluation of the structure of considered algorithms.     

The timing of online lecture slide availability and its effect on attendance, participation, and exam performance

The use of PowerPoint slides has become an almost ubiquitous practice in university classrooms, however little research has examined whether the timing of lecture slide availability to students (either before or after lecture) affects classroom behaviour or exam performance. Using a 2 (slide availability condition) × 2 (course type) between-subjects design, the present study examined lecture slide availability differences in attendance, participation, and exam performance in two courses – Research Methods and Cognitive Development – taught in both the Fall and Winter semesters. For each type of course, lecture slides were made available on the course website before lecture in one semester and after lecture in the other semester. Course material was held constant across semesters. Results showed that mean attendance was higher when slides were available before lecture, but only for the type of course that did not include attendance points as part of students’ final grades. For students who participated in class, participation was more frequent when slides were available before lecture. No significant difference in exam performance was found between lecture slide availability conditions, however. These findings suggest that making lecture slides available to students before lecture may lead to better overall attendance and participation, but exam performance is determined by more than just whether or not students have lecture slides available for their note-taking.     

《计算机应用基础》课程1＋2模式的教学探讨——以毕节学院为例

《计算机应用基础》课程是我校学生入校后的第一门计算机课程,是各专业学生的必修公共基础课,理工科专业在第一学期开课,文科专业在第二学期开课.这门课程是进一步学习其他计算机课程的基础,同时对学生学习专业课程具有重要的支撑作用.在我校1＋2的开课模式和2＋4能力测试标准下,作者根据我校教学大纲的改革,对教学方法进行了分析和探讨,力求在教学过程中学生能更好的掌握基础知识和操作技能.     

一种面向就业的计算机专业培养计划改革方案

本文提出了一种计算机专业本科培养计划的改革创新思路,即根据市场需求确定课程计划,每个学期重点学习掌握一个方向的软件开发技术,保持学生对专业技术的兴趣,再根据课程设计来安排先行课程的开设学期;并给出了软件类课程设计及先行课程的安排表。     

一种基于本体的高校知识管理系统及实现

针对高校师生知识的分布式、动态性和异构性等特点以及高校知识的学科专业的分类特征,提出了一种基于本体的高校知识管理系统模型OUKM,重点研究了OUKM的知识组织、知识查询和知识排序等实现方法,提出了基于知识结构本体的知识组织方法,以及精确知识查询、排序算法和模糊知识查询、排序算法。针对计算机专业知识,实现了一个基于本体的高校知识管理系统。     

数电模电实验平台的应用分析与探讨

数电模电实验室是电子专业基础课程的重要实验平台,数电模电实验课程完成的好,后续的专业课程才能跟得上。数电模电实验平台由数字电路部分和模拟电路部分两大块组成。该数电模电实验平台于2020年8月初制作调试完成,本学期安排了2019级电子信息工程学院本科班学生利用该平台进行数模电实验课程的操作使用,基本达到了预期的效果。根据本学期学生实验成绩与上一学年同专业班级进行比较,成绩有了较多提高,特别是模拟电路数据的测试准确率有明显提升。     

高职高专软件技术专业综合实践能力体系构建

提出一个适合高职软件专业的综合实践能力培养体系,以暑假实践学期的团队合作项目开发和专业内跨课程的综合课程设计为主体,达到提升软件专业学生实践能力的目的。     

C语言编程技巧在C语言学习中的应用

C语言是功能强大、应用广泛的编程语言,也是目前高校理工类的公共必修课程之一,可见其重要性,C语言集高级编程语言和汇编语言的特点于一身,目前市面上的许多软件也是在C语言的平台上产生的,所以高校在C语言的教学中也可谓是＂不遗余力＂的。但是从近年来的教学效果来看,学生的普遍反映却让人大跌眼镜,大部分人认为C语言晦涩难学,学起来是非常吃力,经常是非常努力学习却达不到想要的效果,课程过后没有任何收获,甚至连一个小程序都写不出来,针对上述情况做了初步分析,并从C语言的编程技巧上提出了相关改善对策。