نتایج جستجو برای: decomposing intensity matrix

تعداد نتایج: 547156  

2012
Hussam Hussein Abuazab Adel Omar Dahmane Habib Hamam

Several parallel matrix multiplications developed since four decades based on decomposing the multiplied matrices into smaller size blocks, the blocks will be distributed among the processors to run matrix multiplication in shorter time than when only one processor will run the whole matrix multiplications. All parallel matrix multiplications algorithms suffer from three points: C The optimal s...

2006
Morten Mørup Lars Kai Hansen Sidse M. Arnfred

We demonstrate how non-negative matrix factorization (NMF) can be used to decompose the inter trial phase coherence (ITPC) of multi-channel EEG to yield a unique decomposition of time-frequency signatures present in various degrees in the recording channels. The NMF optimization is easily generalized to a parallel factor (PARAFAC) model to form a non-negative multi-way factorization (NMWF). Whi...

Journal: :مجله انسان، محیط زیست و ارتقاء سلامت 0
somayeh mousavi department of microbiology, faculty of sciences, zanjan branch, islamic azad university, zanjan, iran. mojtaba salouti biology research center, zanjan branch, islamic azad university, zanjan, iran. reza shapoury biology research center, zanjan branch, islamic azad university, zanjan, iran.

background; feather waste is generated in large amounts as a by-product of commercial poultry processing. the main component of feather is keratin. the main purpose of this study was to identify bacillus spp. (the keratinolytic bacteria) that are able to degrade the feather for producing keratin. methods; bacillus spp. were isolated from the waste of poultries located in miyaneh city. the bacte...

2016
Siamak Ravanbakhsh Barnabás Póczos Russell Greiner

Boolean factor analysis is the task of decomposing a binary matrix to the Boolean product of two binary factors. This unsupervised data-analysis approach is desirable due to its interpretability, but hard to perform due its NP-hardness. A closely related problem is low-rank Boolean matrix completion from noisy observations. We treat these problems as maximum a posteriori inference problems, and...

2013
Saeid Taghavi Afshord Yuri Pottosin

The problem of two-block disjoint decomposition of completely specified Boolean functions is considered. Recently a good method in functional decomposition category was proposed. This method is based on using the ternary matrix cover approach. Due to investigation and analysis of this method and to search for an appropriate partition, a computer program was developed. After running the program ...

2016
Dmitry Chistikov Stefan Kiefer Ines Marusic Mahsa Shirmohammadi James Worrell

Nonnegative matrix factorization (NMF) is the problem of decomposing a given nonnegative n × m matrix M into a product of a nonnegative n × d matrix W and a nonnegative d × m matrix H. Restricted NMF requires in addition that the column spaces of M and W coincide. Finding the minimal inner dimension d is known to be NP-hard, both for NMF and restricted NMF. We show that restricted NMF is closel...

Journal: :CoRR 2006
Inmar E. Givoni Vincent Cheung Brendan J. Frey

Many tasks require finding groups of elements in a matrix of numbers, symbols or class likelihoods. One approach is to use efficient bior tri-linear factorization techniques including PCA, ICA, sparse matrix factorization and plaid analysis. These techniques are not appropriate when addition and multiplication of matrix elements are not sensibly defined. More directly, methods like biclustering...

2017
Patrick B. Finnerty Catherine M. Shilton Richard Shine Gregory P. Brown

The immunological and pathological consequences of parasite infection can be more rigorously assessed from experimental manipulation than from correlational studies of natural infections. We used anthelmintic treatment to experimentally decrease intensities of lungworm infection in captive and free-ranging wild cane toads to assess parasite impacts on host immune responses. First, we administer...

2008
Liang Gao Yifang Ban

This paper represents a study on land-cover classification using different polarimetric SAR features. The experiment is carried out using Cand L-band fully polarimetric EMISAR data acquired on July 5 and 6, 1995 over an agricultural area in Fjärdhundra, near Uppsala, Sweden. The polarimetric features investigated are coherency matrix, intensity of both Cand L-band SAR, and Cloud decomposition p...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید