课程文献中心 更多>>

关键词： 有序数据结构   平衡树   并行运算   三叉树  

摘要： 平衡二叉树是一种用于存储有序数据的经典结构,伴随大数据时代的到来,平衡二叉树调整率高的问题愈发影响其运用于并行计算。有鉴于此,提出一种平衡三叉树,这种三叉树的一个节点存储两个值,维护三棵子树。通过复杂度对比与模拟实验结果表明:(1)相较其他有序数据机构,平衡三叉树具有较低的最坏高度;(2)平衡三叉树可以轻易实施区间操作;(3)平衡三叉树不需要对结构进行经常性的调整,平均内部路径长度远远小于传统平衡二叉树算法,运行速度快,更适合于并发应用。

关键词： 算法基础   图灵   数据结构   Python   精品图书   编程技能   三章   软件开发   单元测试   贪婪算法  

摘要： 书名：算法图解ISBN：978-7-115-44763-0定价：49.00元作者：Aditya Bhargava译者：袁国忠你能轻松看懂的算法基础书代码示例基于Python400多个示意图,生动介绍算法执行过程展示不同算法在性能方面的优缺点教会你用常见算法解决每天面临的实际编程问题本书前三章介绍算法基础,包括二分查找、大O表示法、两种基本的数据结构以及递归等。

关键词： 数据结构   项目驱动   教学   改革  

摘要： 针对数据结构在教学过程中遇到的问题,现提出项目驱动教学法的理念,并在项目教学内容、项目教学实践、项目教学评价和项目纲要体系等四方面提出改革。文章研究的目的是找到适合本科生学习数据结构的方法,培养学生的创新意识,激发学生的学习兴趣,提高学生的实践能力,使学生在理论和实践方面达到高等教育对本科生的要求。

关键词： character animation   human motion synthesis   motion retrieval   clustering  

摘要： Statistical model-based motion synthesis enables the constrained generation of natural human motions. In this paper, we present a combination of statistical model-based motion synthesis with a motion retrieval method. We fit a statistical motion model to the low-dimensional latent space obtained by applying principal component analysis to a functional representation of example motion data. In order to accelerate the synthesis, we construct a space partitioning tree on a dense set of samples from the model projected into a feature space. At run-time, the tree is traversed based on an objective function to find the best sample fitting user-defined constraints. After finding a good initial guess, we apply numerical optimization to reach constraints exactly. We evaluated the accuracy and efficiency of the search in the tree using different space partitioning methods on synthetic and motion capture data. In our experiments, the most stable and accurate search results were achieved using the k-Means++ algorithm for the tree construction.

关键词： 数据结构   青少年读物  

ISBN: (纸本)7564147369

摘要： 本书在基本数据结构的基础上，围绕一些常用的不错数据结构，结合大量实战例题，深入分析“数据结构是如何服务于算法的”，这也是本书编写的一个核心理念：学习数据结构是为了“用好”数据结构。本次修订除了改错，主要是更换全书的程序代码为（C++）。本书的适用对象包括：中学信息学竞赛选手及辅导老师、大学ACM比赛选手及教练、高等院校计算机专业的师生、程序设计爱好者等。

关键词： Succinct data structures   encoding data structures   range search data structures   range minimum queries  

摘要： Given an array A[1, n] of elements with a total order, we consider the problem of building a data structure that solves two queries: (a) selection queries receive a range [i, j] and an integer k and return the position of the kth largest element in A[i, j];(b) top-k queries receive [i, j] and k and return the positions of the k largest elements in A[i, j]. These problems can be solved in optimal time, O(1 + lgk/lg lg n) and O(k), respectively, using linear-space data structures. We provide the first study of the encoding data structures for the above problems, where A cannot be accessed at query time. Several applications are interested in the relative order of the entries of A, and their positions, rather their actual values, and thus we do not need to keep A at query time. In those cases, encodings save storage space: we first show that any encoding answering such queries requires nlg k - O(n + klg k) bits of space;then, we design encodings using O(nlg k) bits, that is, asymptotically optimal up to constant factors, while preserving optimal query time.

关键词： Process mining   Financial audits   Journal entries   Business process intelligence   Business process modeling   Control flow inference   Design science research   Enterprise resource planning systems  

摘要： The increasing integration of computer technology for the processing of business transactions and the growing amount of financially relevant data in organizations create new challenges for external auditors. The availability of digital data opens up new opportunities for innovative audit procedures. Process mining can be used as a novel data analysis technique to support auditors in this context. Process mining algorithms produce process models by analyzing recorded event logs. Contemporary general purpose mining algorithms commonly use the temporal order of recorded events for determining the control flow in mined process models. The presented research shows how data dependencies related to the accounting structure of recorded events can be used as an alternative to the temporal order of events for discovering the control flow. The generated models provide accurate information on the control flow from an accounting perspective and show a lower complexity compared to those generated using timestamp dependencies. The presented research follows a design science research approach and uses three different real world data sets for evaluation purposes.