Underdetermined blind source separation is a signal processing technique that more suitable for practical applications and aims to separate the signals from mixed signals. The mixing matrix estimation major step in underdetermined separation. Since current methods estimating have disadvantages of insufficient accuracy or weak noise immunity, two-stage single-source point screening combines cosi...

High-priced coating devices limit producing electronic and circuit applications widely in laboratories. Simply In this study spin technique was used to create surface thin films. Also with method, an OLED(Organic Light Emitting Diode) device practically produced. OLED includes mainly HTL(hole transfer layer), fluorescent layer(light-emitting ETL(electron layer). Light-emitting layers experiment...

Blind source extraction (BSE) is of advantages over blind source separation (BSS) when obtaining some underlying source signals from high dimensional observed signals. Among a variety of BSE algorithms, a large number of algorithms are based on linear prediction (LP-BSE). In this paper we analyze them from practical point of view. We reveal that they are, in nature, minor component analysis (MC...

In kernel based learning the data is mapped to a kernel feature space of a dimension that corresponds to the number of training data points. In practice, however, the data forms a smaller submanifold in feature space, a fact that has been used e.g. by reduced set techniques for SVMs. We propose a new mathematical construction that permits to adapt to the intrinsic dimension and to find an ortho...

We introduce a novel fast algorithm for Independent Component Analysis, which can be used for blind source separation and feature extraction. It is shown how a neural network learning rule can be transformed into a xed-point iteration, which provides an algorithm that is very simple, does not depend on any user-deened parameters, and is fast to converge to the most accurate solution allowed by ...

Concurrent separation logics have helped to significantly simplify correctness proofs for concurrent data structures. However, a recurring problem in such proofs is that data structure abstractions that work well in the sequential setting are much harder to reason about in a concurrent setting due to complex sharing and overlays. To solve this problem, we propose a novel approach to abstracting...