Search - kernel

Search - kernel - List

[Data structs] list-lianbiaodejiandanshilicaozuo DL : 0: 内核中链表结构的实现,并通过实例对每个链表操作接口进行了详尽的讲解。一、链表数据结构简介链表是一种常用的...这些链表大多采用在[include/linux/list.h]实现的一个相当精彩的链表数据结构-Kernel list realize the structure, and list examples of each interface in detail explanation. First, list data structure is a commonly used brief list of the list ... these are mostly used in [include/linux/list.h] achieved a very exciting list data structure
Date : 2026-01-10 Size : 9kb User : 白霞
[Data structs] kernel2.4.18_r1.1 DL : 0: 自己根据lkd和情境分析，对kernel源码的核心模块的关键数据结构做的注释-Themselves in accordance with lkd and situational analysis, kernel-source core modules to do the key data structure of the Notes
Date : 2026-01-10 Size : 49.16mb User : bradgei
[Data structs] Unix_kernel_internal_data_structures_and_algorithm DL : 0: Unix系统内核内部数据结构和算法Unix kernel internal data structures and algorithms-Unix kernel internal data structures and algorithms Unix kernel internal data structures and algorithms
Date : 2026-01-10 Size : 8.29mb User : dfi
[Data structs] sparselib_1_6 DL : 0: 　SparseLib + +是一个c++类库,为在不同的计算机平台进行有效稀疏矩阵的计算。这个软件组成对象包含了目前正在使用的几种稀疏矩阵存储格式(在这个版本:压缩行、压缩列和协调格式),提供基本的功能,节约稀疏矩阵存储空间和计算时间。-SparseLib++ is a C++ class library for efficient sparse matrix computations across various computational platforms. The software package consists of matrix objects representing several sparse storage formats currently in use (in this release: compressed row, compressed column and coordinate formats), providing basic functionality for managing sparse matrices, together with efficient kernel mathematical operations (e.g. sparse matrix-vector multiply). Routines based on the Sparse BLAS are used to enhance portability and performance. Included in the package are various preconditioners commonly used in iterative solvers for linear systems of equations. The focus is on computational support for iterative methods, but the sparse matrix objects presented here can be used on their own.
Date : 2026-01-10 Size : 159kb User : 刘振华
[Data structs] kuaipai DL : 0: 1. 按下述原则编写快排的非递归算法： (1)一趟排序之后，若子序列已有序(无交换)，则不参加排序，否则先对长度较短的子序列进行排序，且将另一子序列的上、下界入栈保存； (2)若待排记录数?3，则不再进行分割，而是直接进行比较排序。测试实例：{49 38 65 97 76 13 27 49 88 21 105} -1. Prepared by the following principles of non-recursive algorithm for fast row: (1) After a trip to sort, if the sequence has been ordered (no exchange), not to participate in order, otherwise the first sub-sequence of shorter length sort, and will Another sequence of upper and lower stack saved (2) if the number of records to be ranked ? 3, then no longer be divided, but a direct comparison sort. Test Case: {49 3,865,977,613,274,988 21 105}
Date : 2026-01-10 Size : 1kb User : zhongkeli
[Data structs] kernel_list DL : 0: 使用Linux kernel 的链表头文件来操作双向链表，只需要一个*.h即实现链表，非常简洁有用,与一般数据结构实现风格不太一样-Using the Linux kernel header files to manipulate the linked list doubly linked list, just a list*. h of achieving very simple and useful, and the general data structure is not the same style
Date : 2026-01-10 Size : 7kb User : Andrew Huang
[Data structs] Kernel-for-Relation-Extraction DL : 0: 最短的路径依赖关系提取我们提出了一个新颖的方法来提取关系，根据观察断言之间的关系之间的两个命名实体在同一个句子1所需的信息通常是由两个实体之间的依赖关系图中的最短路径捕获。实验上提取的ACE（自动内容抽取）报纸语料表明，新的最短路径依赖内核外执行最近的做法，根据去依赖树内核顶层的关系-We present a novel approach to relation extraction, based on the observation that the information required to assert a rela-tionship between two named entities in the same sentence is typically captured by the shortest path between the two entities in the dependency graph. Experiments on extracting top-level relations from the ACE (Automated Content Extraction) newspaper corpus show that the new shortest path dependency kernel out-performs a recent approach based on de-pendency tree kernels
Date : 2026-01-10 Size : 130kb User : xz
[Data structs] hrms_1.0.0.0 DL : 0: 使用C语言实现的简单的人事管理系统，使用了linux内核的通用链表-Simple personnel management system, using the C language using the Linux kernel generic linked list
Date : 2026-01-10 Size : 9.15mb User : hannax
[Data structs] list DL : 0: 主要是linux内核中list的实现与一些小的测试例子，-Mainly is the Linux kernel in the realization of the list with a small test cases,
Date : 2026-01-10 Size : 3kb User : junshen
[Data structs] memcpy-and-memmove DL : 0: memcpy函数测试，在linux和VC编译器下面运行，效果不一样（不能重叠copy）。linux内核memmove函数实现。-memcpy function tests, and VC compiler in linux running below, the effect is the same. linux kernel memmove function implementation.
Date : 2026-01-10 Size : 1kb User : 熙乐
[Data structs] link DL : 0: linux内核链表的使用说明及使用示例-The use of kernel list descriptions and examples of the use
Date : 2026-01-10 Size : 28kb User : 封帛
[Data structs] List DL : 0: c++语言中，list库函数的讲解程序，了解内核构造。-Library functions in c++ language, a list of the interpretation process, understand the kernel structure.
Date : 2026-01-10 Size : 1.31mb User : liqian
[Data structs] KPCA1 DL : 0: 通过非线性映射将原始空间的向量映射到高维空间，进而提取特征的方法核主成分分析法-Kernel Principal Component Analysis
Date : 2026-01-10 Size : 3.32mb User : 王伟
[Data structs] lhisft DL : 0: Learning Kernel Classifiers Theory and Algorithms, Introducti()
Date : 2026-01-10 Size : 2.42mb User : DCBhtili%2526758606