In recent years, kernel methods have demonstrated their performance in hyperspectral imaging. Among the reasons their ability to handle large input spaces is essential. However for this type of applications a critical problem is the choice of the kernel which must combine spectral and spatial information [1] and of course achieve good generalization performance. The kernel design stage is gener...

Given samples from distributions p and q, a two-sample test determines whether to reject the null hypothesis that p = q, based on the value of a test statistic measuring the distance between the samples. One choice of test statistic is the maximum mean discrepancy (MMD), which is a distance between embeddings of the probability distributions in a reproducing kernel Hilbert space. The kernel use...

Kernel learning based soft sensor model has been focus of the machine learning domain. Kernel partial least squares (KPLS) algorithm can construct nonlinear models using the extract latent variables from the input and output data space simultaneously. However, the generalization of KPLS model relies on the model’s kernel type and kernel parameter for different modeling data. Thus, linear combin...

This report proposes a composite kernel method of semantic relation extraction between named entities within natural language documents. Using two kernel methods, the benefits from both are combined to gain an increase in performance compared to earlier approaches. 1) A linear kernel processing linguistic features, such as word-span, orderof-entities and word-type. 2) A tree kernel computing th...

We investigate the design of a powerful type system for a polymorphic, functional programming language with an imperative kernel. The proposed type system has the power to transparently encapsulate an imperative implementation of a functional construct into a sound, polymorphic, functional abstraction. Thus, it facilitates a layered approach to language design by allowing arbitrary, high-level,...

This paper is a study of fuzzy type theory (FTT) with partial functions. Out of several possibilities we decided tointroduce a special value ”∗” that represents ”undefined”. In the interpretation of FTT, this value lays outside of thecorresponding domain. In the syntax it can be naturally represented by the description operator acting on the empty(fuzzy) set, because choosing an element from it...

Abstract This paper shows that previously reported generation algorithms run into problems when dealing with f-structure representations. A generation algorithm that is suitable for this type of representations is presented: the Semantic Kernel Generation (SKG) algorithm. The SKG method has the same processing strategy as the Semantic Head Driven generation (SHDG) algorithm and relies on the as...

Kernel rootkits, as one of the most elusive types of malware, pose significant challenges for investigation and defense. Among the most notable are persistent kernel rootkits, a special type of kernel rootkits that implant persistent kernel hooks to tamper with the kernel execution to hide their presence. To defend against them, an effective approach is to first identify those kernel hooks and ...

The paper presents advanced task management techniques featuring Boolean vectors and bitwise vector operations on kernel data structures in the context of the HARTEXTM hard real-time kernel. These techniques have been consistently applied to all aspects of task management and interaction. Hence, the execution time of system functions no longer depends on the number of tasks involved, resulting ...