课程文献中心 更多>>

关键词： 矿山测绘   数字矿山   数学模型   三维建模   空间对象   数据结构  

摘要： 随着计算机科学技术的不断进步,信息数字化逐渐成为全球各行各业的发展趋势。矿山生产也不例外,"数字矿山"(Digital Mine,DM)应运而生。因此,如何将矿山在生产活动中积累的各种信息进行管理,建立起相应的数学模型,实现科学可视化并进行分析研究,是"数字矿山"必须解决的核心技术问题。

关键词： 数据结构   C语言  

ISBN: (纸本)9787561844670

摘要： 全书内容分为三部分: 第1部分为实验指导, 包括Visual C++ 6.0的使用和20个精心设计的实验 ; 第2部分为C++习题与答案 ; 第3部分为数据结构习题与答案。

关键词： 汇编   编码   通信   容器   控制   数据处理系统   数据结构   定义(术语)   名称与符号   文献工作   编译   货运集装箱   货物运输   货物   货运   识别   识别方法   标志   标记   摩托车   编号   参数   铁路应用设施   铁路   登记号码   表示法   交换部件   符号   远程信息管理   类型表示法  

标准号: BS EN ISO 17263-2012

关键词： Data structure   Data management   ROOT   CouchDB   Dark Matter   Multi-tier  

摘要： A multi-tiered data structure, analysis toolkit and data processing management system has been constructed using ROOT and CouchDB. This system is well suited for experiments that acquire many computer files of raw data over the course of months or years, that are distributed to different computing centers and further reduced in size by several steps of data processing. Data handling for experiments searching for rare events extracted from digitized pulse traces typically fit this description. An implementation of this system has been constructed for the EDELWEISS-III experiment and is described here in some detail. This solution may also serve as a prototype system for the proposed EURECA experiment. (C) 2012 Elsevier B.V. All rights reserved.

摘要： Recent advancements in the field of compressed data structures create inter- esting opportunities for interdisciplinary research and applications. Com- pressed data structures provide essentially a time space tradeofffor solving a problem; while traditional data structures use extra space in addition to the input, compressed data structures replace the input and require space proportional to the compressed size of the input. The amount of available memory is often fixed, thus, the user might be willing to spend more time if it allows the use of larger inputs. However, despite the potential behind compressed data structures, they have not quite reached the audience of other disciplines. We study how to take advantage of compressed data structures in the fields of bioinformatics, data analysis and information retrieval. We present several novel applications for compressed data structures and include an experimental evaluation of the time space tradeoffs achieved. More precisely, we propose (i) a space-efficient string mining algorithm to recognise substrings that admit the given frequency constraints, (ii) both theoretical and practical methods for computing approximate overlaps be- tween all string pairs, (iii) a practical path-based graph kernel for predicting the function of unknown enzymatic reactions, and (iv) a compressed XML index that supports efficient XPath queries on both the tree-structure and textual content of XML documents. Problem (i) is motivated by knowledge discovery in databases, where the goal is to extract emerging substrings that discriminate two (or more) databases. Problem (ii) is one of the first phases in a sequence assembly pipeline and requires efficient algorithms due to the new high-throughput sequencing systems. Problem (iii) is motivated by machine learning, where kernels are used to measure the similarity of complex objects. Problem (iv) has its background in information retrieval. The proposed methods achieve theoretical and practica

关键词： rise level   control mechanism   Data structures   Swarming   simulating   simulator   dike swarms  

摘要： Data structures and control mechanisms for multi-target swarming software simulators are presented. The advantage of the proposed approach is that a swarm, besides local self-organisation, is able to accept higher level directives on target priorities. Also, the presented mechanisms enable a swarm to dynamically change its participants' assignment on every target appearance or removal in simulation.

关键词： Dijkstra算法   数据结构  

摘要： 在地理信息系统中,最短路径问题更是其中的核心环节。现阶段比较主流的最短路径算法主要有Dijkstra算法,SPFA算法,A*算法,Bellman-Ford算法等等。目前,国内外对于最短路径算法的研究已经颇为成熟,最短路径问题已然不是新问题,但是大部分案例都是基于邻接矩阵的数据结构对整个网进行构造与计算的,而在各学术期刊与网上电子资源中,对于基于邻接表数据结构的算法则没有太多的讨论,旨在此方向上给出一个方法思路与C#语言的较为详细的编程步骤。

关键词： 最短路径问题   选址问题   应用   求解算法   数据结构   数学模型   学校   居民区  

摘要： 文章主要介绍数据结构中最短路径问题及其求解算法,并用该算法解决学校的选址问题。文中给出了学校选址的数学模型,并举例说明如何在城区中选择建学校的地址,使得各居民区的学生到学校的路径最短。

关键词： 数据结构   树   线性化   线性表  

摘要： 给出了一种树的线性化算法以及从线性化结果重构树的算法.这种线性表表示法比树的其它表示法更简洁、更易管理、更节约空间.在线性表表示方式下,实现了树的求结点双亲、求结点孩子、求树的高度3个运算.从具体实现过程可以看出,线性表表示法对树的常见运算的实现都比较方便.

关键词： 数据结构   教学方法  

摘要： 《数据结构》是一门思维抽象的理论课,历来是教师授课难度大、学生学习效率低的课程之一。本文针对职业院校学生开设该门课程的有关情况,在分析了学生学习困难的基础上重点论述了温故知新、手脑并用和题型分析三种教学方法的应用。实践证明,灵活运用这三种教学方法可以达到较好的教学效果,使学生减少畏难情绪,提高学习兴趣,改善学习现状。