课程文献中心 更多>>

关键词： 核心素养   数据   数据结构   测评  

摘要： 新课标提出了培养学生的核心素养。在数字化时代,数据对科学发现、技术进步、经济发展以及人们的日常生活的影响越来越深刻。作者提出,理解数据的作用及价值,对学生适应信息社会、学会数字化生存有着十分重要的意义。数据结构是信息技术学科的核心内容之一,对培养学生的信息意识与计算思维,让其深入理解及掌握信息技术学科知识与实践方法、形成学科核心素养,具有非常重要的作用。

关键词： 视频结构化   道路交通   视频图像   应用  

摘要： 随着道路交通视频监控点位数量的逐年增加,视频数据量呈指数级增长趋势。然而,存储在数据库中的海量视频图像数据只应用于一些简单场景,其价值并未得到充分开发和利用。从丰富的道路交通视频入手,利用视频结构化技术挖掘数据库中视频图像的潜在价值,阐述道路交通视频数据结构化后,拓展分析生成情报信息及应用于道路交通管理。

关键词： 知识图谱   数据存储结构   银行业   数据结构   互联网   井喷式   面对的挑战   应用及发展  

摘要： 互联网的发展带来的是数据井喷式的增加,如何从海量的数据中获取有效信息成为银行需要面对的挑战。在此背景下,知识图谱开始崭露头角。与传统的数据存储结构不同,知识图谱是一种基于图的数据结构,将不同种类的信息连接在一起形成一个关系网络,进而可以提供从“关系”的角度分析问题、发现问题的方法。本文就知识图谱在银行业的应用及发展进行深入阐述。

关键词： Data structures  

摘要： The ability to encode and manipulate data structures with distributed neural representations could qualitatively enhance the capabilities of traditional neural networks by supporting rule-based symbolic reasoning, a central property of cognition. Here we show how this may be accomplished within the framework of Vector Symbolic Architectures (VSAs) (Plate, 1991;Gayler, 1998;Kanerva, 1996), whereby data structures are encoded by combining high-dimensional vectors with operations that together form an algebra on the space of distributed representations. In particular, we propose an efficient solution to a hard combinatorial search problem that arises when decoding elements of a VSA data structure: the factorization of products of multiple codevectors. Our proposed algorithm, called a resonator network, is a new type of recurrent neural network that interleaves VSA multiplication operations and pattern completion. We show in two examples-parsing of a tree-like data structure and parsing of a visual scene-how the factorization problem arises and how the resonator network can solve it. More broadly, resonator networks open the possibility of applying VSAs to myriad artificial intelligence problems in real-world domains. The companion article in this issue (Kent, Frady, Sommer, & Olshausen, 2020) presents a rigorous analysis and evaluation of the performance of resonator networks, showing it outperforms alternative approaches.

关键词： Dynamic data structures   Convex hulls   Nearest neighbor search   Closest pair   Shallow cuttings  

摘要： We present new results on a number of fundamental problems about dynamic geometric data structures: (1) We describe the first fully dynamic data structures with sublinear amortized update time for maintaining (i) the number of vertices or the volume of the convex hull of a 3D point set, (ii) the largest empty circle for a 2D point set, (iii) the Hausdorff distance between two 2D point sets, (iv) the discrete 1-center of a 2D point set, (v) the number of maximal (i.e., skyline) points in a 3D point set. The update times are near n(11/12) for (i) and (ii), n(5/6) for (iii) and (iv), and n(2/3) for (v). Previously, sublinear bounds were known only for restricted "semi-online" settings (Chan in SIAM J. Comput.32(3), 700-716 (2003)). (2) We slightly improve previous fully dynamic data structures for answering extreme point queries for the convex hull of a 3D point set and nearest neighbor search for a 2D point set. The query time is O(log(2)n), and the amortized update time is O(log(4)n) instead of O(log(5)n)(Chan in J. ACM57(3), # 16 (2010);Kaplan et al. in 28th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2495-2504. SIAM, Philadelphia (2017)). (3) We also improve previous fully dynamic data structures for maintaining the bichromatic closest pair between two 2D point sets and the diameter of a 2D point set. The amortized update time is O(log(4)n) instead of O(log(7)n) (Eppstein in Discrete Comput. Geom.13(1), 111-122 (1995);Chan in J. ACM57(3), # 16 (2010);Kaplan et al. in 28th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2495-2504. SIAM, Philadelphia (2017)).

关键词： 算法分析   数据结构  

ISBN: (纸本)9787563562657

摘要： 本书系统地介绍了一些常用算法及多种常用的数据结构，这些常用的算法包括选择算法、查找算法、排序算法。本书还详细地介绍了字符串匹配和图论中的一些经典算法。数据结构的内容包括线性结构、树形结构、哈希结构等。

关键词： 数据结构   C语言  

ISBN: (纸本)9787302564379

摘要： 本书按照循序渐进的原则介绍线性表、栈、队列、串、树、图等数据结构的逻辑结构、存储结构和数据运算, 对于经典算法使用C++构造可执行的程序, 帮助读者利用最少的时间和空间资源编写出最优秀最合理的程序。

标准号: T/CERACU 202-2020

关键词： Colored range searching   Relational event graph   Social network analysis   Timestamp  

摘要： We present a general approach for analyzing structural parameters of a relational event graph within arbitrary query time intervals using colored range query data structures. Relational event graphs generally represent social network datasets, where each graph edge carries a timestamp. We provide data structures based on colored range searching to efficiently compute several graph parameters (e.g., density, neighborhood overlap, h-index). (C) 2019 Elsevier B.V. All rights reserved.

关键词： 虚拟实验方法   SPOC   数据结构   教学改革   教学实践  

摘要： 基于数据结构课程理论抽象程度高、应用实践性强的特点,结合应用型人才培养要求,给出基于图结构的虚拟仿真教学案例设计,阐述在实际教学中如何构建融合虚拟仿真实验的SPOC混合式教学体系,介绍具体实施过程,最后通过成绩对比说明取得的教学效果。