Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 34 for “"Kernel-Space"”.

  1. The homology of the kernel space of the Thom spectrum in low degrees

    I present an investigation of the multiplicative structure of H_*(SL_1 MU; F_2) as an algebra over F_2. This includes a list of generators in low degrees and the multiplication table for these generators. This ring has applications in topology related to orientability of vector bundles, as it is …

    umn Repository record for The homology of the kernel space of the Thom spectrum in low degrees (opens in a new tab)

  2. Investigation of Extending Feature Selection Algorithms to Explicit Feature Selection in Kernel Space

    … data by being projected into a high dimensional space, the computation cost of calculating in high dimensional space is quite high. Kernel Trick is a method in model training. It reduces greatly the computational cost of calculating the inner product of high dimension data, and thus is usually …

    washington Repository record for Investigation of Extending Feature Selection Algorithms to Explicit Feature Selection in Kernel Space (opens in a new tab)

  3. AUTOMATED KERNEL SELECTION FOR GAUSSIAN PROCESSES ON LARGE DATASETS

    In Gaussian processes (GPs), the kernel functions play a crutial role in capturing the underlying patterns of datasets. However, the complex data patterns and the vast space of candidate kernels render manually selecting an appropriate kernel infeasible. This thesis focuses on designing and …

    nus Repository record for AUTOMATED KERNEL SELECTION FOR GAUSSIAN PROCESSES ON LARGE DATASETS (opens in a new tab) Download file for AUTOMATED KERNEL SELECTION FOR GAUSSIAN PROCESSES ON LARGE DATASETS (opens in a new tab)

  4. Higher spin dirac operators in two vector variables in Clifford analysis

    … differentiable functions with values in a vector space V which is an irreducible representation of Spin(m) with a specific highest weight and which can be realised in Clifford analysis as a vector space of polynomials in several vector variables, called the simplicial monogenic polynomials. Higher …

    ghent Repository record for Higher spin dirac operators in two vector variables in Clifford analysis (opens in a new tab)

  5. TOWARDS OBSERVABLE AND TRUSTWORTHY SYSTEM FOUNDATIONS FOR INTELLIGENT CLOUD INFRASTRUCTURES

    … investigation. Appare extends observability into kernel space by identifying anomalous in-kernel control flows that reveal OS-level exploits. HitchHiker protects observability itself using a hardware-assisted, micro-TCB TEE design that maintains log integrity under OS or hypervisor compromise. …

    nus Repository record for TOWARDS OBSERVABLE AND TRUSTWORTHY SYSTEM FOUNDATIONS FOR INTELLIGENT CLOUD INFRASTRUCTURES (opens in a new tab) Download file for TOWARDS OBSERVABLE AND TRUSTWORTHY SYSTEM FOUNDATIONS FOR INTELLIGENT CLOUD INFRASTRUCTURES (opens in a new tab)

  6. The research of high-level tracing for linux extended berkeley packet filter /

    … or sanitizing them. Recent advances in the Linux kernel's eBPF subsystem enable the development of programs that can efficiently process large volumes of network traffic directly within the Linux kernel, without building complex kernel modules and without requiring a kernel reboot. This thesis …

    vilnius Repository record for The research of high-level tracing for linux extended berkeley packet filter / (opens in a new tab)

  7. Change Point Detection for Streaming Data Using Support Vector Methods

    … concerns the use of methods based on kernel functions and support vectors to detect changes. A variety of support vector-based methods are considered, but the primary focus concerns Least Squares Support Vector Data Description (LS-SVDD). LS-SVDD constructs a hypersphere in a kernel …

    ucf Repository record for Change Point Detection for Streaming Data Using Support Vector Methods (opens in a new tab)

  8. Linux Kernel Module Continuous Address Space Re-Randomization

    Address space layout randomization (ASLR) is a technique employed to prevent exploitation of memory corruption vulnerabilities in user-space programs. While this technique is widely studied, its kernel space counterpart known as kernel address space layout randomization (KASLR) has received less …

    vt Repository record for Linux Kernel Module Continuous Address Space Re-Randomization (opens in a new tab)

  9. Optimizing Emerging Memory Systems for Performance

    … and approaches. First, we construct a user space library to virtualize and share NVM between multiple processes and applications. The reason to construct a user space library is because of performance, which can be significantly improved by avoiding context switch overheads from system …

    tamu Repository record for Optimizing Emerging Memory Systems for Performance (opens in a new tab)

  10. Development and Properties of Kernel-based Methods for the Interpretation and Presentation of Forensic Evidence

    … a hierarchical sample and models them in the kernel space using a linear model. Our model is flexible to accommodate any kernel satisfying basic conditions and as a result is applicable to any type of complex high-dimensional data. An important result of this work is the asymptotic …

    sdstate Repository record for Development and Properties of Kernel-based Methods for the Interpretation and Presentation of Forensic Evidence (opens in a new tab)

  11. Clustering using similarity and kernel matrices

    … coming from different sources and/or feature spaces and iii) multiple kernel learning, where a kernel that suits the data is learned together with the cluster assignments. Usually, the kernel is parametrized as a combination of some predefined kernels, called basis kernels, and we wish to …

    greece Repository record for Clustering using similarity and kernel matrices (opens in a new tab)

  12. New algorithms for solving inverse source problems in imaging techniques with applications in fluorescence tomography

    … Then we add to it a correction function in the kernel space so that the final solution fulfills the regularization and other physical requirements. The key idea is that the correction function in the kernel has no impact to the data fitting, and the regularization is imposed in a smaller space. …

    gatech Repository record for New algorithms for solving inverse source problems in imaging techniques with applications in fluorescence tomography (opens in a new tab)

  13. From page importance to memory characterization: profile-driven heterogeneous memory management in high-performance embedded systems

    … diversity of memory resources expands the design space for page placement and resource isolation. This dissertation argues that predictable and efficient memory management on such platforms requires moving beyond blind, capacity- and locality-centric allocation policies toward profile-driven …

    bu Repository record for From page importance to memory characterization: profile-driven heterogeneous memory management in high-performance embedded systems (opens in a new tab)

  14. Accelerating virtualization of accelerators

    … in domains such as cloud infrastructure and kernel space. Complex hardware and proprietary software stacks inhibit efficient accelerator virtualization. We observe that practical virtualization has to choose between interposition at the topmost (user API) and bottom-most (hardware) …

    texas Repository record for Accelerating virtualization of accelerators (opens in a new tab)

  15. Developing a smart and low cost device for machining vibration analysis

    … used to enable hardware interrupts on the Linux Kernel space. The vibrations generated by the cutting of different materials are recorded and used to train a machine learning algorithm on an external computer. Training will use a Kernel Support Vector Machine algorithm. Once the algorithms are …

    gatech Repository record for Developing a smart and low cost device for machining vibration analysis (opens in a new tab)

  16. Changing representation of curves and surfaces: exact and approximate methods

    … build a numeric matrix, ideally of corank 1. Its kernel contains their coefficients in the implicit equation.We compute kernel of the matrix either symbolically, or numerically, applying singular value decomposition (SVD).We propose techniques for handling the case of the multidimensional kernel …

    greece Repository record for Changing representation of curves and surfaces: exact and approximate methods (opens in a new tab)

  17. Towards Accurate and Fair Deepfake Detection

    … embedding distributions in a high-dimensional kernel space. Our approach reduces information related to sensitive attributes in the embedding space that could potentially bias the detection process, thus promoting fairness. FairAlign is a versatile plug-and-play loss term compatible with …

    queens Repository record for Towards Accurate and Fair Deepfake Detection (opens in a new tab)

  18. LOW RANK AND SPARSE MODELING FOR DATA ANALYSIS

    … among data points, we formulate this method in kernel space. Furthermore, the obtained continuous spectral solutions could severely deviate from the true discrete cluster labels, a discrete transformation is further incorporated in our model. Finally, our framework can simultaneously learn …

    siu-theses Repository record for LOW RANK AND SPARSE MODELING FOR DATA ANALYSIS (opens in a new tab)

  19. Big Data-Driven Process Control using Behavioral Systems Theory and Machine Learning

    … (DLVAE). The DLVAE transforms nonlinear physical space into a linear latent variable space, enabling direct control of physical nonlinear process variables through their corresponding linear latent variables. Based on the behavioral systems theory, the proposed data-driven control framework does …

    unsw Repository record for Big Data-Driven Process Control using Behavioral Systems Theory and Machine Learning (opens in a new tab)

  20. Information Fusion for Multi-Source Data Classification

    … machine interface (BMI). We develop a mixture-of-kernels approach for data fusion, and demonstrate its efficacy at fusion of multi-source data in the kernel space. In the proposed approach, each source of data is represented by a dedicated kernel -- one can then learn a classifier (or an …

    houston Repository record for Information Fusion for Multi-Source Data Classification (opens in a new tab)

Page 1 of 2