课程文献中心 更多>>

关键词： 网站   精品课程   在线测试   模块   上传  

摘要： "数据结构"在计算机科学中是一门非常重要的综合性的专业基础课,为了提高课程的教学效果,建立了课程的教学网站。网站主要实现以下功能:用户信息管理、公告通知管理、资源中心管理、课程信息管理、题库试题管理、课程习题自测、实验指导管理、课程设计管理、考研区管理、作业区管理、网站在线答疑等。网络化的教学是课堂教学的有益补充,是数据结构课程建设与教学的良好途径。

关键词： 数据分析   数据结构   数据基础   数据库  

摘要： 越来越多的行业开始与数据打交道，他们或拥有智慧的头脑，或专注于领先的科技，或热衷于市场或客户等的细分……他们正试图用数据改变世界。

关键词： Simplicial complexes   data structure   flag complexes   clique complexes   Vietoris-Rips complexes   shape reconstruction   shape simplification   edge contraction   collapse   homotopy equivalence   high dimensions  

摘要： We study the simplification of simplicial complexes by repeated edge contractions. First, we extend to arbitrary simplicial complexes the statement that edges satisfying the link condition can be contracted while preserving the homotopy type. Our primary interest is to simplify flag complexes such as Rips complexes for which it was proved recently that they can provide topologically correct reconstructions of shapes. Flag complexes (sometimes called clique complexes) enjoy the nice property of being completely determined by the graph of their edges. But, as we simplify a flag complex by repeated edge contractions, the property that it is a flag complex is likely to be lost. Our second contribution is to propose a new representation for simplicial complexes particularly well adapted for complexes close to flag complexes. The idea is to encode a simplicial complex K by the graph G of its edges together with the inclusion-minimal simplices in the set difference Flag (G)\K. We call these minimal simplices blockers. We prove that the link condition translates nicely in terms of blockers and give formulae for updating our data structure after an edge contraction. Finally, we observe in some simple cases that few blockers appear during the simplification of Rips complexes, demonstrating the efficiency of our representation in this context.

关键词： Automatic program verification   Memory safety   Shape analysis   Overlaid data structure  

摘要： We present a static program analysis for overlaid data structures such that a node in the structure includes links for multiple data structures and these links are intended to be used at the same time. These overlaid data structures are frequently used in systems code, in order to impose multiple types of indexing structures over the same set of nodes. Our analysis implements two main ideas. The first is to run multiple sub-analyses that track information about non-overlaid data structures, such as lists. The second idea is to control the communication among the sub-analyses using ghost states and ghost instructions. The purpose of this control is to achieve a high level of efficiency by allowing only necessary information to be transferred among sub-analyses and at as few program points as possible. Our analysis has been successfully applied to prove the memory safety of the Linux deadline IO scheduler and AFS server.

关键词： Java语言   数据结构  

ISBN: (纸本)9787564064280

摘要： 本书介绍了数据结构算法的基本概念以及线性表、栈和队列、串、多维数组和广义表、树和图等基本数据结构的特点、存储方法和基本运算，最后又围绕数据在外存上的组织方法介绍了文件的若干基本结构。

关键词： Self-healing   Networks   Peer-to-peer   Stretch   Trees   Dynamic   Responsive  

摘要： We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick "repairs," which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions, without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been a"" in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most a"" log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degree would have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase;2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions;3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network.

关键词： 建构主义   教学改革   数据结构  

摘要： 该文介绍了国内数据结构实践教学改革的现状,然后引入建构主义学习理论。根据建构主义学习理论的观点,提出了对数据结构进行教学改革的指导原则,并指出了建构主义学习理论在实践教学改革中的局限性。

关键词： 网络教学   数据结构   教学资源   教学改革  

摘要： 网络课程是开展网络教学的基本前提和重要教学资源,本研究基于THEOL网络教学综合平台的"数据结构"课程资源建设与教学实践为基础,从平台的功能入手,讨论了一门网络课程的开发和教学过程,并对网络教学的实施情况作出评价和分析。

关键词： 识别卡   识别卡系统   市民卡   逻辑数据结构   安全服务  

标准号: UNI CEN/TS 15480-2-2012

关键词： 数据结构   教学   形象化  

摘要： 针对数据结构课程教学过程中存在的教与学问题，提出把形象化理念应用于课堂教学的思路，并结合数据结构部分章节的具体内容——绪论、线性表、栈、递归，详细阐述所采用的形象化教学设计及手段。最后分析了形象化教学的效果。文中的研究思路可供类似课程的教学借鉴和推广。