课程文献中心 更多>>

关键词： 数据结构   计算机教学   教学改革  

摘要： 对"数据结构"课程教学进行了改革,在教学过程中除了正常的课堂教学内容外,还结合了理论和实验部分的内容,并对实验环节和考核方式等方面进行了改革和实践,提高了学生的分析和解决问题的能力、创造能力,教学效果良好。

关键词： 空中接口   货物   货物搬运   代码   译码   通信   容器   数据块   数据通信   数据格式   数据处理   数据安全   数据结构   数据传输   名称与符号   编码   货运集装箱   货物运输   识别   识别方法   识别系统  

标准号: ISO 17367-2013

关键词： 课程   原型教学法   理论  

摘要： 高职院校中《数据结构》这门课程理论性较强，这样的课程对于教师来说很难教，对于学生来说也很难学，知识枯燥乏味，上课学生不愿意听，课堂气氛沉闷，面对这种情况老师讲课也没有激情。我们如何让这种理论性强的课程，在授课过程中调动学生学习的乐趣，让学生学起来能够更加容易接受呢？原型教学法可以说不失为解决这一问题的好方法。

关键词： 数据结构  

ISBN: (纸本)9787115308078

摘要： 本书共9章，分为3大部分：第一部分 (第1章) 是对数据结构的概述，是学习本书的基础；第二部分 (第2章到第7章) 逐一介绍各种数据结构、存储实现及其常见算法；第三部分 (第8章和第9章) 介绍查找技术和排序技术。

关键词： SaaS应用模式   Multi-Tenant   数据库   数据结构  

摘要： 基于云计算多租户技术的网上考试系统是今后考试系统的一个发展趋势,本文结合云计算SaaS应用模式中的多租户和元数据管理等相关技术提出一多租户《程序设计》课程考试系统实现方法。重点研究阐述如何使用数据库以及如何利用数据结构的扩展和关联来满足用户数据的个性化配置。

关键词： 地址(数据处理)   寻址   通信协议   数据接口   数据结构   定义   编码   执行   信息技术   接口(数据处理)   因特网   管理   服务   规范(验收)   万维网  

标准号: ISO/IEC 17963-2013

摘要： ISO/IEC 17963:2013 describes a Web services protocol based on SOAP for use in management?specific domains. These domains include the management of entities such as PCs, servers, devices, Web services and other applications manageable entities. Services can expose only a WS-Management interface or compose the WS-Management service interface with some of the many other Web service specifications. A crucial application for these services is in the area of systems management. To promote interoperability between management applications and managed resources, ISO/IEC PAS 17963:2012 identifies a core set of Web service specifications and usage requirements that expose a common set of operations central to all systems management. This includes the ability to do the following: a) get, put (update), create, and delete individual resource instances, such as settings and dynamic values;b) enumerate the contents of containers and collections, such as large tables and logs;c) subscribe to events emitted by managed resources;d) execute specific management methods with strongly typed input and output parameters. In each of these areas of scope, ISO/IEC 17963:2013 defines minimal implementation requirements for conformant Web service implementations. An implementation is free to extend beyond this set of operations, and to choose not to support one or more of the preceding areas of functionality if that functionality is not appropriate to the target device or system. ISO/IEC 17963:2013 intends to meet the following requirements: a) constrain Web services protocols and formats so that Web services can be implemented with a small footprint in both hardware and software management services;b) define minimum requirements for compliance without constraining richer implementations;c) ensure backward compatibility and interoperability with WS-Management version 1.0;d) ensure composability with other Web services specifications.

关键词： 数据结构   教学改革   教学方案   教学效果  

摘要： 数据结构是计算机专业的一门重要基础课程,对学生的后续专业学习有着十分重要的意义。本文从该课程的教学实践出发,针对当前的教学现状,提出了相应的改革方案。

关键词： 数据结构  

ISBN: (纸本)9787115335913

摘要： 全书围绕核心概念，提炼基础性内容，侧重工程实践，注重算法设计与程序实现。本书对知识单元的结构安排合理，主线清晰，全面、系统地介绍了线性表、队列、堆栈、树、图等基本数据结构，以及这些数据结构在计算机中的存储及算法实现。

摘要： A compressed text index is a data structure that stores a text in the compressed form while efficiently supports pattern searching queries. This thesis investigates three compressed text indexes and their applications in bioinformatics. Suffix tree, suffix array, and directed acyclic word graph (DAWG) are the pioneers text indexing structures developed during the 70's and 80's. Recently, the development of compressed data-structure research has created many structures that use surprisingly small space while being able to simulate all operations of the original structures. Many of them are compressed versions of suffix arrays and suffix trees, however, there is still no compressed structure for DAWG with full functionality. Our first work introduces an nH k ( S ) + 2 nH 0 ( T S ) + o ( n )-bit compressed data-structure for simulating DAWG where H k ( S ) and H 0 ( T S ) are the empirical entropy of the reversed input sequence and the suffix tree topology of the reversed sequence, respectively. Besides, we also proposed an application of DAWG that improves the time complexity of local alignment problem. In this application, using DAWG, the problem can be solved in O ( n 0.628 m ) average case time and O ( nm ) worst case time where n and m are the lengths of the database and the query, respectively. In the second work, we focus on text indexes for a set of similar sequences. In the context of genomic, these sequences are DNA of related species which are highly similar, but hard to compress individually. One of the effective compression schemes for this data (called delta compression) is to store the first sequence and the changes in term of insertions and deletions between each pair of sequences. However, using this scheme, many types of queries on the sequences cannot be supported effectively. In the first part of this work, we design a data structure to support the rank and select queries in the delta compressed sequences. The data structure is called multi-version

摘要： Over the course of the years many different structures have been developed for computing and storing geometric information on a set of objects (often points). In recent years there has been a growing interest in maintaining such structures as the input moves over time. The straightforward approach is to recompute the desired structure from scratch whenever the input changes, but this can be wasteful if the changes are small. To avoid unnecessary computations the Kinetic Data Structures (KDS) framework was introduced by Basch, Guibas and Hershberger in 1997. In this framework we assume that the trajectories of the objects are known and we can compute when to change the data structure. This leads to an event-driven approach for which several efficiency guarantees can be proven. Unfortunately, there are many situations when the trajectories are unknown. For example when the input comes from tracking devices, human-controlled avatars in a virtual world or a numerical integrator in a physical simulation. In these cases new locations become available as time progresses and no precise trajectories can be given beforehand. This means we cannot apply the KDS-framework, but we would still like to maintain data structures in a provably efficient manner. For these applications we introduce the black- box model to model the motions of the input and design efficient algorithms to maintain several basic data structures within this model. In the black-box model we assume that locations of input objects are given at discrete time steps and that between any two time steps each input object moves at most some distance d max. Without any further knowledge about the distribution of the objects, this maximum displacement d max does not provide much information. When all objects are very close together we cannot use the information we had about object locations in the previous time step. To cope with these cases we introduce two additional parameters that can be used to analyse our algori