课程文献中心 更多>>

关键词： 数据结构   虚拟实验平台   教学方法  

摘要： 针对学生对数据结构课程认知"乏"、水平"弱"、掌握"难"的现象,以绪论部分教学为例,提出利用虚拟实验平台演示、借题发挥、化繁为简等多样化教学方法,提高学生学习的兴趣和探索的欲望。

关键词： 数据结构   算法设计   ACM/ICPC   问题驱动  

摘要： 《数据结构》课程是计算机专业的核心"饭碗"课程之一,然而在传统的教学中教师往往只教理论,没有实际的代码实现过程演示,讲解的例子缺乏应用性,学生学得枯燥无味。课题组经过教学改革,将ACM/ICPC问题驱动引入课堂教学,采用问题驱动的教学方法,并贯穿于整个理论教学、实验实训的过程,组织学生参加程序,以竞促学,以竞促教,提高学生的算法设计能力,取得了良好的教学效果。

关键词： 数据结构   混合式教学   信息化平台   蓝墨云班课   PTA平台  

摘要： 结合数据结构课程的特点,以蓝墨云班课和PTA平台这类信息化教学辅助工具作为课程支持,构建该课程的混合式教学模式,从混合式教学过程设计以及具体的线上、线下实施过程进行介绍。

关键词： 算法   数据结构   程序设计   计算机教学  

摘要： 作为计算机及相关专业的核心课程,"算法与数据结构"的教学一直得到了广大教师的高度关注和重视。该课程教学内容抽象,理论性强,涉及的算法复杂,如何取得理想的教学和学习效果一直是教学改革的重点。本文分析了"算法与数据结构"课程的特点和实践教学环节存在的主要问题,指出实践教学对课程的教学效果具有重要影响,并从教学内容出发梳理了实践教学环节,优化了实践教学内容,构建了层次化的实践教学体系,力图通过实践教学强化理论教学,以期取得理想的教学效果。

关键词： 气象档案   档案资料   利用价值   服务类型   社会   数据结构   研究人员   统计分析  

摘要： 我国由于南北方气候的差异，对气候结构进行完善的数据结构统计，能够促进研究人员对于气象安全的进一步探索。气象档案是一种具有很强专业性的科技资料档案，各种各样的资料和数据具有很强的利用价值，研究人员通过对各种天气服务类型进行检测和加工，对气象档案资料进行整理再加工，通过统计分析能够得到实际的操作数据，使气象预测更加准确，具有较强的利用价值。文章主要研究我国气象档案资料的基本内涵，并分析其实际的操作方法。

关键词： 数字档案   扫描   转换技术   数据结构  

摘要： 数字档案取代传统纸质档案是未来档案工作的发展方向,数字档案已被越来越多的行业纳入档案工作范畴。事业单位对档案管理的数字化特别重视。档案管理系统采用数字化来管理检索,是未来档案管理的发展趋势。在实现档案管理的飞跃发展中,数字化档案管理的核心是基础信息数字化建设。

关键词： 计算机应用技术   数据结构   教学改革   混合式教学模式   无纸化考试  

摘要： 为了更好地提高《数据结构》课程的教学效果,增强学生解决实际问题的程序设计能力,本文在分析《数据结构》课程教学现状的基础上,总结了教学过程中存在的普遍问题,探讨了相关的教学改革方案和措施。从实施效果可以看出,采用混合式教学模式和无纸化考试方式等改革方案可以显著提高数据结构课程的教学效果和质量,对其他课程的教学改革,具有重要的借鉴意义。

关键词： Layered indexing   Distributed hash table (DHT)   Range search   Search cost   Fault tolerance   Multidimensional data   Distributed systems  

摘要： In recent years, many layered indexing techniques over distributed hash table (DHT)-based peer-to-peer (P2P) systems have been proposed to realize distributed range search. In this paper, we present a fault tolerant constant degree dynamic Distributed Spatial Data Structure called DSDS that supports orthogonal range search on a set of N d-dimensional points published on n nodes. We describe a total order binary relation algorithm to publish points among supernodes and determine supernode keys. A non-redundant rainbow skip graph is used to coordinate message passing among nodes. The worst case orthogonal range search cost in a d-dimensional DSDS with n nodes is O (log n + m + K/B) messages, where m is the number of nodes intersecting the query, K is the number of points reported in range, and B is the number of points that can fit in one message. A complete backup copy of data points stored in other nodes provides redundancy for our DSDS. This redundancy permits answering a range search query in the case of failure of a single node. For single node failure, the DSDS routing system can be recovered to a fully functional state at a cost of O(log n) messages. Backup sets in DSDS nodes are used to first process a query in the most efficient dimension, and then used to process a query containing the data in a failed node in d-dimensional space. The DSDS search algorithm can process queries in d-dimensional space and still tolerate failure of one node. Search cost in the worst case with a failed node increases to O (d log n + dm + K/B) messages for d dimensions.

关键词： Type systems   rely-guarantee   refinement types   concurrency   verification  

摘要： Verifying invariants of fine-grained concurrent, data structures is challenging, because interference from other threads may occur at any time. We propose a new way of proving invariants of fine-grained concurrent data structures: applying rely-guarantee reasoning to references in the concurrent setting. Rely-guarantee applied to references can verify bounds on thread interference without requiring a whole program to be verified. This article provides three new results. First, it provides a new approach to preserving invariants and restricting usage of concurrent data structures. Our approach targets a space between simple type systems and modern concurrent program logics, offering an intermediate point between unverified code and full verification. Furthermore, it avoids sealing concurrent data structure implementations and can interact safely with unverified imperative code. Second, we demonstrate the approach's broad applicability through a series of case studies, using two implementations: an axiomatic COQ domain-specific language and a library for Liquid Haskell. Third, these two implementations allow us to compare and contrast verifications by interactive proof (Coq) and a weaker form that can be expressed using automatically-discharged dependent refinement types (Liquid Haskell).

关键词： Sheaf   Sensor integration   Mosaic   Semantic fusion   Heterogeneous data source   Cohomology  

摘要： A sensor integration framework should be sufficiently general to accurately represent many sensor modalities, and also be able to summarize information in a faithful way that emphasizes important, actionable information. Few approaches adequately address these two discordant requirements. The purpose of this expository paper is to explain why sheaves are the canonical data structure for sensor integration and how the mathematics of sheaves satisfies our two requirements. We outline some of the powerful inferential tools that are not available to other representational frameworks. (C) 2016 Elsevier B.V. All rights reserved.