课程文献中心 更多>>

关键词： 翻转课堂   数据结构   教学设计  

摘要： 本文通过对数据结构课程的特点和翻转课堂教学模式的研究,针对数据结构课程中有代表性的知识点进行了翻转教学模式的原型构建,设计了翻转教学的实施方案,并应用于计算机专业本科二年级的数据结构教学中,研究结果表明翻转课堂教学模式能激发学生的学习兴趣,有助于培养学生自主学习的能力,使其更好地掌握数据结构课程内容。

摘要： Data structures are key pillars for optimizing computational efficiency, as they contribute in no small measure to enhancing the "speed" in the accessing and sub- sequent processing of data. The need for enhancing speed is critical for almost all applications and domains, and this is most relevant when real-time or near real-time efficiency is desired. This thesis proposes the use of "Adaptive" Data-Structures (ADSs) that invoke reinforcement learning schemes from the theory of Learning Automata (LA). These operate in conjunction with select re-organization rules to update themselves as they receive queries from the Environment of interaction. The result of such a process is the subsequent minimization of the cost associated with query accesses. The Environ- ments under consideration are those that exhibit a so-called "locality of reference", and are referred to as Non-stationary Environments (NSEs). A hierarchy of data "sub"-structures is used to design Singly-Linked Lists (SLLs) on Singly-Linked Lists, which thus contain outer and sub-list contexts. The elements that are more likely to be accessed together are grouped within the same sub-context, while the sub-lists themselves are moved "en masse" towards the head of the list- context by following a re-organization strategy. The Object Migration Automaton (OMA) family of reinforcement schemes are em- ployed to capture the probabilistic dependence of the elements in the data structure as it receives query accesses from the Environment. The Enhanced Object Migration Au- tomaton (EOMA), the Pursuit Enhanced Object Migration Automaton (PEOMA), and the Transitivity Pursuit Enhanced Object Migration Automaton (TPEOMA) have each been individually incorporated into the hierarchical SLLs. The conse- quent results are currently the state-of-the-art methods for adaptive SLLs operating in NSEs.

关键词： 数据结构   翻转课堂体系   构建   策略  

摘要： 数据结构课程知识点较多,并具有抽象性的特点,在实际教育过程中,应运用翻转课堂教育模式,能提升教学效率.但现阶段,在数据结构课程教学中,存在较多问题.由于课程内容难度较大,教师依旧采用传统的教育方式,使学生难以全面理解数据结构知识内容.并且,教师忽略实践教育的重要性,导致学生实际操作机会较少,不利于学生未来发展.针对此种教育现状,教师应构建翻转课堂教学体系,重视实践教育,提升教学水平,培养全面发展型人才.本文基于数据结构教学中存在的问题进行分析,提出翻转课堂体系构建策略,提升教学成效.

关键词： 大数据   基础数据结构   软件工程   数据标准  

摘要： 在大数据时代中,大数据的应用效能、应用方便度、应用当地覆盖面是未来大数据应用所关注的重点,而目前在大数据应用方面存在许多的问题,这些问题的存在影响了未来大数据的应用,如何解决这些问题,重现在开始从最基础方面开始,解决这些问题是大数据未来应用的重要工作.本文首先列举了目前大数据应用中存在的问题,分析了产生这些问题的原因,针对这种情况提出了基于基础数据结构体系建立的解决方案设想,为未来大数据应用发挥更大效益的解决方法.

关键词： DXF文件   三维重建   工程图   数据结构   数据整理   二次开发  

摘要： 工程图成为表述机械设计理念的标准语言,在当今的工业时代依然扮演重要角色。许多计算机辅助产品分析技术如有限元分析、机构装配干涉检查、过程设计、数控加工、仿真显示等不能直接利用二维工程图中的几何和拓扑信息,于是二维工程图向三维实体的转换技术对于产品设计的维护和可持续发展尤为重要。AutoCAD在建筑、土木、机械、装潢等平面设计和三维立体设计领域占据重要地位,特别地,在工程制图领域被视为标准绘图软件。本重建系统正是将DXF文件作为数据源文件完成二维工程图到三维实体的自动转化。本重建系统分为三个环节:二维信息提取环节、三维重建预处理环节和三维实体重建环节。二维信息提取环节的主要任务是编写提取二维工程图图元的几何信息、拓扑信息、尺寸标注信息的接口C程序,提出了全剖视图、半剖视图、局部剖视图、几个相交平面剖切得到的全剖视图、几个平行平面剖切得到的全剖视图的剖面区域信息提取算法,将提取到的信息存入数据链表中,作为三维重建预处理系统的输入,并且探讨了半剖、全剖、局部剖、相交剖和平行剖的预处理算法。在三维重建预处理环节中的视图分割板块,在轮廓搜索的效率方面改进了传统的角度判别法,并将该方法与坐标投影法结合使用来完成具有多个视图的工程图的视图分割。在面向三维重建的数据结构的建立板块,建立双向链表结构并按点、线、面的层次归纳整理数据链表中的图元信息,通过指针将视图链表与图元链表关联、线框链表与线链表关联、线链表与点链表关联、线链表与尺寸链表关联、基本视图与辅助视图关联、剖切区域链表与视图链表关联。三维实体重建系统的建立是基于AutoCAD平台的二次开发技术,采用面向对象的编程方法,使用ObjectARX提供的类和函数,在VC++6.0环境中编译ObjectARX程序,在AutoCAD中以命令行的方式调用ARX程序生成基本形体,根据视图中轮廓环的相对位置关系推断基元体的空间相对位置关系,利用布尔运算组合基元体,最后生成符合工程图视图投影关系的组合体。利用本文提出的重建方法结合二维工程图进行了三维重建实验,结果表明,对于包含全剖视图、半剖视图、局部剖视图的工程图有良好的重建效果。

摘要： In this thesis we study space-efficient data structures for various combinatorial objects. We focus on succinct and compact data structures. Succinct data structures are data structures whose size is within the information theoretic lower bound plus a lower order term, whereas compact data structures are data structures whose size is a constant factor from the information theoretic lower bound. We start by discussing the compact representation of unlabeled permutations, where the goal is to store a permutation π if we are permitted to reassign the labels of the elements, while supporting the following query: given k and i compute π k (i) quickly. We study this problem in several scenarios. In the first scenario the queries are answered by just examining the labels of the queried elements. In the second scenario we assign labels to the n elements from the label set {1,..., cn} where c ≥ 1 is a constant. In the third scenario we assign labels to the n elements from the label set {1,..., cn 1+ε } where c is a constant and 0 < ε < 1. We give tight upper and lower bounds in all the three scenarios and we are able to answer queries in constant time independent of k. Finally, as an application we show how to improve the representation of general (labeled) permutations using our results. We then deviate from the general scheme of designing space-efficient data structures to designing space-efficient algorithms. We cover the problem of powering permutations in place. Given a permutation of n elements, stored as an array, we address the problem of replacing the permutation by its k th power while using o(n) bits of extra storage. To this end, we first present an algorithm for inverting permutations that uses O(lg 2 n) additional bits and runs in O(n lg n) worst case time. This result is then generalized to the situation in which the permutation is to be replaced by its k th power. We present an algorithm whose worst case running time is O(n lg n) and uses O(lg 2 n + min{k lg

关键词： C#   .NET   Data Structures   Algorithms   Arrays   Strings   Data Types   Concurrency   Reactive programming   Functional Programming   Graph algorithms   Sort C#   linked list C#   C# data structure   C# bubble sort   C# search   C# binary   C# tree   C# hash   C# arrays  

ISBN: (数字)9781788834681 ISBN: (纸本)9781788833738

摘要： A complete guide on using data structures and algorithms to write sophisticated C# codeKey FeaturesLearn how to build reusable and maintainable code in C#.Delve into effective design and implementation techniques to meet your software requirementsExplore illustrations to present data structures and algorithms, as well as their analysis in a clear, visual *** DescriptionData structures allow organizing data efficiently. They are critical to various problems and their suitable implementation can provide a complete solution that acts like reusable code. In this book, you will learn how to use various data structures while developing in the C# language as well as how to implement some of the most common algorithms used with such data *** the beginning, you will get to know arrays, lists, dictionaries, and sets together with real-world examples of your application. Then, you will learn how to create and use stacks and queues. In the following part of the book, the more complex data structures will be introduced, namely trees and graphs, together with some algorithms for searching the shortest path in a graph. We will also discuss how to organize the code in a manageable, consistent, and extendable way. By the end of the book,you will learn how to build components that are easy to understand, debug, and use in different *** you will learnHow to use arrays and lists to get better results in complex scenariosImplement algorithms like the Tower of Hanoi on stacks of C# objectsBuild enhanced applications by using hashtables, dictionaries and setsMake a positive impact on efficiency of applications with tree traversalEffectively find the shortest path in the graphWho This Book Is ForThis book is for developers who would like to learn the Data Structures and Algorithms in C#. Basic C# programming knowledge would be an added advantage.

关键词： 数据结构   实践教学   综合编程   翻转课堂  

摘要： 《数据结构》是计算机相关专业的基础课程,具有很强的实践性.在教学中,采用多种教学方法与教学工具相结合、合理设计联系题目等改革措施,提高学生的综合编程能力和教学效果.

关键词： 数据结构   教学内容   能力培养   相关性  

摘要： 分析数据结构课程在高职院校相关专业中的课程地位,以及该课程的教学现状,探讨数据结构教学内容与学生专业素养培养以及就业岗位能力需求的相关性,对课程教学内容进行改革并设计实践任务,使数据结构教学对学生专业能力培养更有针对性。

关键词： 5G原型验证系统   驱动抽象层   数据结构   函数接口   功能模块  

摘要： 5G网络即第五代移动通信网络技术，其理论传输速率最高可达10Gbps，是现有4G网络的十到百倍，5G网络技术也将大大降低网络传输时延，提高传输的可靠性。目前世界各大通信公司均已在加大在5G研发上的投入，为后续5G商用做着积极准备。　　5G原型验证系统是在5G商用前为了验证5G网络的一些关键技术特性而研发的一套软硬件平台，该系统包括基站和终端两个平台，以及它们对应配套软件组成。相比商用产品，具有更大的系统容量和更加灵活的系统架构，同时为了提高软件的使用周期，软件设计上将具有更易于升级、更方便移植等特点。　　为了达到上述要求，提高协议软件的升级和可移植能力灵活性，降低与硬件、操作系统的耦合度，本系统在研发中引入了操作系统驱动抽象层的设计。通过该抽象层设计:　　可实现上层软件与驱动的隔离，提高软件的通用性;可统一上层软件对外接口，降低软件对处理器和嵌入式操作系统的依赖;可实现如任务处理、内存管理等的统一操作，提高系统稳定性。　　论文所完成的主要工作如下:　　1)分析了驱动抽象层软件的功能需求及性能要求，在此基础上完成了驱动抽象层软件的总体设计，包括软件模块及软件接口，明确了对外提供的函数接口及数据结构定义，给出了内部的模块划分、关键数据结构，并设计了各模块功能的流程图。　　2)完成了驱动抽象层软件概要设计及模块函数的设计与实现;设计了各个模块接口、关键数据结构、函数流程图，并完成了函数编程;3)设计了较全面的测试方案，从功能和性能两方面对驱动抽象层软件进行了调试及测试，验证了其有效性。　　实验证明，本文实现的5G原型验证系统中操作系统驱动抽象层处理速度快、性能稳定，满足5G标准和协议对大容量、高可靠、低时延等要求;可为将来基于5G标准的商用产品提供重要的设计参考和实现依据。