课程文献中心 更多>>

关键词： 算法   数据结构   计算机语言   教学探索  

摘要： 计算机专业课程教学中算法教学是一个重点和难点,文章针对如何提高算法教学的质量和解决算法教学中存在的问题,进行了积极的探索。

关键词： 多重图   路径优化   数据结构   遗传算法   动态规划   联合运输  

摘要： 为了求解联合运输网络的最优运输方式组合问题,采用遗传算法并使用整数编码方式对城市节点进行编码,摒弃了传统的二进制编码方式,有效地缩减了编码长度并简化了编解码工作;城市节点链的运输方式组合与节点间运输方式转换使用动态规划方法来确定;至于联合运输网络数据,在建立多重图数据结构基础上,采用结构体数组与链式存储结构相结合的方式来存储。通过仿真实验表明,该方法可行,能够在较短的时间和可预期的迭代次数内找到最优解。

关键词： Drinking Water   Water pipelines   Predictions   Life cycles   Failure modes   Pipes   Failures   Databases   Asset management   Drinking water pipelines   Prediction modeling   Standard data structure   Life cycle   Failure modes and mechanisms   Pipe failure consequences   Data collection protocol  

摘要： This paper presents a standard data structure for predicting the remaining physical life and consequence of failure of water pipes. Correlating the various pipe material types with the pipe life cycle, failure modes and mechanisms are crucial in defining the various parameters that affect water pipelines. Identifying and estimating the failure consequences of a pipeline are also important for risk management. A complete understanding of the pipe life cycle, failure modes and mechanisms, standard data structure to support predictive modeling, and failure consequences can be effectively combined to aid in advanced asset management of drinking water pipelines.

关键词： 查找树   子树   叶子结点   删除算法   合并结点  

摘要： B-树是一种平衡的多路查找树，在文件系统中有着很好的应用。该文分析了在B-树中删除一个关键词的几种情形，给出了B-树删除算法的具体实现，有助于对《数据结构》课程中B-树操作的更好理解。

关键词： 算法控制   世界   程序语言   所见即所得   数据驱动   软件定义   数据结构   程序员  

摘要： 算法，在“软件定义世界”和“大数据驱动世界”盛行的当下，似乎让人觉得久远和陌生。也难怪，《算法＋数据结构=程序》这样的大部头已是少有人问津了。今天有所见即所得的泛滥、有程序语言和库的丰饶，程序员无须在键盘边上放一本算法书，倒是在面试前需要临时抱佛脚复习一下算法。当然，真正的硬核程序员是与算法为友的，但需要为他们写一本算法的科普书吗？不需要。

关键词： 面向对象数据库   发展趋势   思维方式   数据结构   模拟现实   语义  

摘要： 首先，面向对象数据库数据结构复杂，表达的语义更加广泛。并且面向对象的思维方式符合人的思维方式，迎合人类的需求，能够更加真切地模拟现实需求。

关键词： 可访问性   可访问的   数据压缩   数据交换   数据管理   数据处理   数据表示   数据结构   定义   文件管理   文献加工   文献   EDI   电子数据交换(EDI)   文件格式   文件结构   文件   情报检索   信息系统   管理   PDF   出版物   软件   规范(验收)  

标准号: DIN ISO 14289-1-2014

关键词： 拓扑排序   教学方法   图结构   计算机科学   顶点数   教学效果   数据结构   有向图   时间复杂度   学生情况  

摘要： 图结构是数据结构中重要的章节之一,而拓扑排序又是图的重要应用,尤其在计算机科学、数学、工程以及其它许多学科中,图结构有着广泛的应用。如何提高拓扑排序的教学效果,是一个值得探讨与研究的问题。本文结合教学中的一些经验,从教学实践出发,对拓扑排序的教学方法进行探索改革,以适应计算机技术的发展和学生情况的变化。

关键词： Advance reservation   Resource management   Data structure   Cluster computing   Grid computing  

摘要： Complex eScience and other sophisticated applications in the field of HPC imply new demands that queuing based resource management systems cannot meet. To guarantee Quality of Service and co-allocation in the Grid, planning based resource management systems implementing advance reservation are needed. These systems face new challenges as a planning based management system has to keep track of the jobs and reservations in the future. Additionally, during the negotiation process of incoming reservations, a good overview of the remaining, not-yet reserved capacity is needed-not only for the current allocation, but also for the whole book-ahead time. Therefore, the resource management problem becomes a two dimensional problem for advance reservations in this field. In this paper different data structures are investigated and discussed in order to fit to planning based resource management. As a result the benefits of using lists of resource allocation or free blocks are exposed. This general idea widely used to manage continuous resources is extended to cover not only the resource dimension but also the time dimension. The list of blocks approach is evaluated in a Grid level and a local resource management system for a computing cluster. The extensive simulations showed a better runtime and higher reservation success rate compared with the currently favored approach of a slotted time and the more sophisticated approach based on AVL trees.

关键词： education   data structures  

摘要： This paper presents the evolution of a data structures and algorithms course based on a specific computer graphics problem, namely, photon mapping, as the teaching medium. The paper reports development of the course through several iterations and evaluations, dating back 5 years. The course originated as a problem-based graphics course requiring sophomore students to implement Hoppe etal.'s algorithm for surface reconstruction from unorganized points found in their SIGGRAPH '92 paper of the same title. Although the solution to this problem lends itself well to an exploration of data structures and code modularization, both of which are traditionally taught in early computer science courses, the algorithm's complexity was reflected in students' overwhelmingly negative evaluations. Subsequently, because implementation of the kd-tree was seen as the linchpin data structure, it was again featured in the problem of ray tracing trees consisting of more than 250000000 triangles. Eventually, because the tree rendering was thought too specific a problem, the photon mapper was chosen as the semester-long problem considered to be a suitable replacement. This paper details the resultant course description and outline, from its now three semesters of teaching.