课程文献中心 更多>>

关键词： 数据结构   软件工程思想   MOOC   专业课程实践  

摘要： 新的经济形态对软件工程人才培养提出了新的要求,结合数据结构在人才培养体系中的重要性以及当前的教学现状,将软件工程的工程思想融入教学中,加强工程实践,结合超星MOOC平台实现线上线下的混合式教学,解决课时压缩的问题,并通过专业课程实践将程序设计语言与数据结构完美衔接,保证教学工作顺利进行,通过教学实践,整个成绩分布合理,成绩可信度高,教学效果良好。

关键词： 地震数据   SEG-D格式   SEG-Y格式  

摘要： 在地质勘探与开发研究工作中,地震数据是最重要的研究对象.随着地震勘探技术及设备的不断发展与进步,从陆地到海洋、从浅层到深层,采集的地震数据结构越来越复杂,数据的量级也不断增加,因此,地震数据的结构分析将直接影响到勘探与开发的研究进展.本文对多格式地震数据进行剖析,在熟知地震数据基本概念与采集原理的基础上,探索不同格式地震数据的结构转换与数据存取的实现意义.

关键词： 抽象数据结构   JAVA语言  

ISBN: (纸本)9787111636373

摘要： 本书是介绍数据结构的经典教材，第5版增加了新的覆盖递归内容的一章，介绍语法、语言及回溯；还增加了设计决策、注、安全说明及编程技巧内容；在大部分章节中，本版侧重游戏、电子商务及财务的新练习和程序设计项目；同时调整了某些主题的次序，相关的主题集中介绍，内容连贯。

关键词： data structures   incrementalization   synthesis   Computer science   Computer science and engineering  

摘要： Data structures are integral to software. Many programs require custom application-specific data structures more complicated than those found in standard libraries. Implementing and maintaining application-specific data structures is tedious and error-prone. This work presents Cozy, a novel tool that synthesizes efficient implementations of application-specific data structures from high-level specifications. Cozy handles a wider range of data structures than previous work, including structures that track multiple related collections and have complex retrieval methods involving sums, counts, minimums, and maximums. Cozy iteratively discovers good data structures using alternating steps of query synthesis and state maintenance. The query synthesis step implements pure operations over the data structure state by leveraging existing enumerative synthesis techniques, specialized to the data structures domain. The state maintenance step implements imperative state modifications by re-framing them as fresh queries that determine what to change, coupled with a small amount of code to apply the change. As an added benefit of this approach over previous work, the synthesized data structure is optimized for not only the queries in the specification but also the required update operations. Cozy has three goals: to reduce programmer effort, to produce bug-free code, and to match the performance of handwritten code. We have evaluated Cozy in four large case studies, demonstrating that it meets the goals. Using Cozy requires an order of magnitude fewer lines of code than manual implementation, results in fewer bugs, and matches the performance of handwritten code. Finally, we have used Cozy as an automatic incrementalizer. An incremental algorithm can update its output efficiently in response to small changes to its input. Replacing batch-style algorithms with incremental versions yields incredible speedups when the input data changes frequently. Cozy is well-suited to the problem

关键词： Computer science  

摘要： Formal verification has had great success in improving the reliability of real-world software, with projects such as ASTREE, CompCert, and Infer showing that rigorous mathematical analysis can handle the scale of today's cyber-infrastructure. However, despite these successes, many core software components are yet to be verified formally. Concurrent data structures are a class of algorithms that are becoming ubiquitous, as software systems seek to make use of the increasingly parallel design of computers and servers. These data structures use sophisticated algorithms to perform fine-grained synchronization between threads, making them notoriously difficult to design correctly, with bugs being found both in actual implementations and in the designs proposed by experts in peer-reviewed publications. The rapid development and deployment of these concurrent algorithms has resulted in a rift between the algorithms that can be verified by the state-of-the-art techniques and those being developed and used today. The goal of this dissertation is to bridge this gap and bring the certified safety of formal verification to the concurrent data structures used in practice. Permission-based program logics such as separation logic have been established as the standard technique for verifying programs that manipulate complex heap-based data structures. These logics build on so-called separation algebras, which allow expressing properties of heap regions such that modifications to a region do not invalidate properties stated about the remainder of the heap. This concept is key to enabling modular reasoning and also extends to concurrency. However, certain data structure idioms prevalent in real-world programs, especially concurrent programs, are notoriously difficult to reason about, even in these advanced logics (e.g., random access into inductively defined structures, data structure overlays). The underlying issue is that while heaps are naturally related to mathematical graphs, ma

关键词： Computer science  

摘要： Concurrent algorithms have gained importance as multi-core machines have become more ubiquitous. Several techniques are employed to enable the construction of such algorithms. We present algorithms for the Group Mutual Exclusion (GME) problem which can be used as an advanced concurrency technique to increase the performance of software built on concurrent data structures. The group mutual exclusion (GME) problem is a generalization of the classical mutual exclusion problem in which every critical section is associated with a type or session. Critical sections belonging to the same session can execute concurrently, whereas critical sections belonging to different sessions must be executed serially. The well-known read-write mutual exclusion problem is a special case of the group mutual exclusion problem. We present a new GME algorithm for an asynchronous shared-memory system under the Cache-Coherent model that, in addition to satisfying lockout freedom, bounded exit and concurrent entering properties, has O(1) step-complexity when the system contains no conflicting requests as well as O(1) space-complexity per GME object when the system contains sufficient number of GME objects. We also present a GME algorithm for the Distributed Shared Memory model that satisfies above properties and has optimal Remote Memory-Reference complexity. To the best of our knowledge, no existing GME algorithm has O(1) step-complexity for concurrent entering for either model. The Remote-Memory-Reference complexity of a request for cache-coherent model is only O(ċ) in the amortized case, where ċ denotes the point contention of the request. Experiments indicate that our GME algorithm vastly outperforms well-known GME algorithms in most, if not all, cases. We also present a lock-based concurrent algorithm for a strictly-balanced red black tree data structure. Our algorithm can be implemented on hardware directly without requiring any additional system support such as transactional memory. We a

关键词： 数据结构   软件工具  

ISBN: (纸本)9787302521860

摘要： 本书共分为8章，分别为绪论、线性表、栈和队列、串和数组、树形结构、图、内排序和查找。

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

ISBN: (纸本)9787520807166

摘要： 本书内容按照问题空间数据对象的逻辑结构划分为五章。第1章介绍数据结构知识框架；第2-5章，分别介绍线性结构、扩展线性结构、树结构和图结构。每章内容运用计算思维分析方法从抽象分析到具体分解，并基于特定的抽象数据类型，介绍各逻辑结构相关联的基本算法的分析与设计。

关键词： CDIO模式   数据结构   教学改革  

摘要： 数据结构是以操作为主的实践课程,在计算机及通信管理专业中有着非常重要的地位。在现有的教学模式下,学生在学习数据结构实验的过程中出现了各种各样的问题。本文主要从教学现状,出现问题的原因及解决策略等方面对CDIO模式下数据结构课程实验教学内容和教学方法进行了探究,提出了相关教学改革的思路。

关键词： 数据结构   微信   碎片化学习   课程教学  

摘要： 随着微信等新媒体的普及和广泛使用,很多人充分利用零碎时间进行阅读和学习,碎片化学习成为人们获取信息的一种重要方式,也可以是计算机专业大学生学习数据结构的重要途径。数据结构课程通过微信把教学资源(如课程PPT、视频或动画等)中的数据结构知识点进行讲解和展示,学生在碎片化时间学习小知识单元,让学生可以不受时间、地点的限制,进行相关知识点的学习。在学习过程中如果学生有不理解的问题,可在微信中留言或提问,以便在教学课堂上教师对这些问题进行重点详细地讲解,因此可以提高教学的针对性,有利于提高教学效率。