为方便事件表和队列的操作，采用的数据结构是链表。
For the convenience of operating of the event table and queues, link as data structure is adopted.
本文的计算软件采用动态链表数据结构存贮总体刚度矩阵，具有很高的存贮和计算效率。
The solver of this software uses the linked list data structure to store the global stiffness matrix, which is efficient in storage and calculation.
提出以二叉树结构取代原有入侵检测系统采用的链表结构，旨在改进入侵规则的存储和模式匹配，提高检测速度。
In this paper, binary tree structure substitutes for linked list structure used in traditional IDS, aiming to better storage of rules and improve pattern matching so as to speed intrusion detection.
并根据C语言结构功能强的特点，采用结构指针及链表、队列等动态数据结构，使整个算法具有节省内存、快速省时的特点。
Applying structure pointer and dynamic data structure, such as the linked list and queue in c, we have made the working software executed with less memory requirement and time overhead.
通过事务剪枝、采用数组链表相结合的数据结构存储候选数据集来改进频繁集支持数的计算；
The applications of transactions pruning and a new data structure for storage of the candidate sets help to compute the support counts of candidate sets fast and reduce the cost of scanning database.
本设计采用层次化设计，运用链表与树形数据结构实现FAT文件系统，具有较高的可维护性与可移植性。
The design USES hierarchical design method, with the use of chain and tree data structure to achieve the FAT file system. It has well maintainability and portability.
讨论了大型容量矩阵的压缩存储方式，采用数组和结构体相结合的方法实现容量矩阵的一维链表式压缩存储。
The paper analyzes compress storage of large coefficient matrix which realizes 1D chain compress storage of coefficient matrix by combination of array and structure.
讨论了大型容量矩阵的压缩存储方式，采用数组和结构体相结合的方法实现容量矩阵的一维链表式压缩存储。
Based on the MOLAP technology of multi-dimension array, the article proposes a new method of compressed store, which was stored in dimensions by binary code.
讨论了大型容量矩阵的压缩存储方式，采用数组和结构体相结合的方法实现容量矩阵的一维链表式压缩存储。
Based on the MOLAP technology of multi-dimension array, the article proposes a new method of compressed store, which was stored in dimensions by binary code.
应用推荐