课程文献中心 更多>>

关键词： 思维导图   数据结构   教学改革  

摘要： 当前PPT在课程教学中得到了广泛使用,但是传统的PPT仅仅是对课程内容的概括与文字总结,不能很好地展示课程内容之间的联系以及课程内容的动态可视化过程。针对数据结构课程知识点多、逻辑性强、概念抽象等特点,研究采用思维导图工具XMind改进该课程教学,促进学生自主学习和复习。

关键词： 部队卫生信息管理系统   部队医疗单位   电子病历系统   数据结构   软件  

摘要： 部队卫生信息管理系统定版于2000年8月,包含了门诊挂号、门诊信息、门诊收费、住院信息、住院收费、医嘱处理、药材管理、防疫信息、人员管理、综合查询、指标管理、系统维护、价表管理、公用字典、医疗卡管理、转诊管理与外诊报销、经费管理与数据上报等十七个功能模块.

关键词： 数据安全   数据结构   程序发布管理   运维管理  

摘要： 目前在信息系统维护期间,程序变更管理工作仍停留在人工流程阶段,对数据库数据结构进行增、删、改等变更操作管控不到位,程序发布变更过程中时常出现误操作、超范围操作、变更影响范围评估不全面、发布后相关信息难以同步更新、版本回退困难等问题。广西电网公司针对上述问题开发了一套信息系统数据结构管控平台,可以实现对企业级管理系统数据结构变更前进行校验预判,变更中进行严格管控,变更后进行追溯,有效提升系统核心数据的安全性,提升系统运维管理水平。

关键词： 数据结构   计算机   图形学  

摘要： 计算机的存储方式之一是数据结构,而计算机图形学是将计算机的字符处理系统升级成为计算机图像处理系统,同时把相关的数据转化成为图形信息,最后在计算机显示屏呈现的一种科学技术,此项技术本身具有一定的优势。基于此,以计算机图形学为研究视角,针对数据结构在计算机图形学中的应用展开分析,希望能够为相关研究提供借鉴。

关键词： 微课   数据结构   课程融合  

摘要： 作为计算机相关专业的核心专业课,数据结构在课程体系中起着重要的地位和作用。数据结构课程的学习对学生和教师都有着较高的要求,其中,理论学习需要学生具备较强的逻辑思维能力,上机实践则需要学生在透彻理解理论知识的基础上完成代码编写。作为信息技术与课程教学融合产物的微课,具有形式多样、主题突出、短小精干等特点。本文结合微课的特点和数据结构课程的现状,探讨了微课在数据结构课程中的应用。

关键词： 数据结构   实践能力   教学过程管理  

摘要： 分析教学质量管理现状,讨论《数据结构》的课程教学问题和研究现状,从教师角度提出了以实践能力为核心的《数据结构》教学过程管理改革方案。介绍在教学方法、作业批改、课外辅导和上机考核方面的教学改革探索。通过教学实践的数据分析证明,该方案是一种有效教学管理方案,极大地提高了学生的实践能力和理论学习效果。

摘要： Concurrent data structures are widely used in modern multi-core architectures, providing atomic- ity (linearizability) for each concurrent operation. However, it is often desirable to execute several operations on multiple data structures atomically. This requirement cannot be easily supported by concurrent data structures, and requires the use of a locking mechanism or some sort of transac- tional framework. We present a design of such a transactional framework supporting linearizable transactions of multiple operations on multiple data structures in a lock-free manner. Our design is comprised of concurrent lock-free data structures supporting a transactional API, and a transac- tion engine responsible for executing operations as an atomic transaction. We employ a helping mechanism to obtain lock-freedom, and an advanced lock-free contention management mechanism to mitigate the effects of aborting transactions. When cyclic helping conflicts are detected, the contention manager reorders the conflicting transactions execution allowing all transactions to com- plete with minimal delay. Our design supports operation dependencies, i. e., results of operations can affect the inputs of subsequent operations or their control flow. To exemplify this framework we implement a transactional set using a skip-list, a transactional queue, and a transactional register. We present an evaluation of the system showing that we outperform general software transactional memory, and are competitive with lock-based transactional data structures, while providing an ad- ditional (lock-free) progress guarantee.

关键词： Finite-element method (FEM)   graph-theoretic foundation   optimization   topological data structure  

摘要： This paper applied the finite-element method (FEM) with topological data structures to the optimization of electrical devices. A generic modifiable graph data structure is built according to the graph-theoretic foundation for these data structures. The employed topological FEM avoids rebuilding of the mesh in traditional FEM method while geometrical variations happen. It is an effective algorithm which can save computer storage and working time when applied to successive optimization. The effectiveness is verified by numerical example and comparison of the topological FEM with traditional FEM on storage load and working time is shown in this paper.

关键词： Voronoi diagrams   Data structures   Trees   Flarbs  

摘要： We consider preprocessing a set S of n points in convex position in the plane into a data structure supporting queries of the following form: given a point q and a directed line in the plane, report the point of S that is farthest from (or, alternatively, nearest to) the point q among all points to the left of line . We present two data structures for this problem. The first data structure uses space and preprocessing time, and answers queries in time, for any . The second data structure uses space and polynomial preprocessing time, and answers queries in time. These are the first solutions to the problem with query time and space. The second data structure uses a new representation of nearest- and farthest-point Voronoi diagrams of points in convex position. This representation supports the insertion of new points in clockwise order using only amortized pointer changes, in addition to -time point-location queries, even though every such update may make combinatorial changes to the Voronoi diagram. This data structure is the first demonstration that deterministically and incrementally constructed Voronoi diagrams can be maintained in o(n) amortized pointer changes per operation while keeping -time point-location queries.

关键词： Spatiotemporal datasets   Streaming   Real-time exploration   Range queries  

摘要： The visual analysis of large multidimensional spatiotemporal datasets poses challenging questions regarding storage requirements and query performance. Several data structures have recently been proposed to address these problems that rely on indexes that pre-compute different aggregations from a known-a-priori dataset. Consider now the problem of handling streaming datasets, in which data arrive as one or more continuous data streams. Such datasets introduce challenges to the data structure, which now has to support dynamic updates (insertions/deletions) and rebalancing operations to perform self reorganizations. In this work, we present the Packed-Memory Quadtree (PMQ), a novel data structure designed to support visual exploration of streaming spatiotemporal datasets. PMQ is cache-oblivious to perform well under different cache configurations. We store streaming data in an internal index that keeps a spatiotemporal ordering over the data following a quadtree representation, with support for real-time insertions and deletions. We validate our data structure under different dynamic scenarios and compare to competing strategies. We demonstrate how PMQ could be used to answer different types of visual spatiotemporal range queries of streaming datasets. (C) 2018 Elsevier Ltd. All rights reserved.