218 resultados para Positive Matrix Factorization
Resumo:
An expression is derived for the probability that the determinant of an n x n matrix over a finite field vanishes; from this it is deduced that for a fixed field this probability tends to 1 as n tends to.
Resumo:
Eklundh's (1972) algorithm to transpose a large matrix stored on an external device such as a disc has been programmed and tested. A simple description of computer implementation is given in this note.
Resumo:
We show that a closed orientable Riemannian n-manifold, n >= 5, with positive isotropic curvature and free fundamental group is homeomorphic to the connected sum of copies of Sn-1 x S-1.
Resumo:
The concurrency matrix aids the detection of bit steerability of microcommand sets in a microprogram. In the present work, the concept of don't-cares is introduced into the concurrency matrix to identify the bit steerable microcommand sets.
Resumo:
A public key cryptosystem is proposed, which is based on the assumption that finding the square root of an element in a large finite ring is computationally infeasible in the absence of a knowledge of the ring structure. The encryption and decryption operations are very fast, and the data expansion is 1:2.
Resumo:
The paper deals with the basic problem of adjusting a matrix gain in a discrete-time linear multivariable system. The object is to obtain a global convergence criterion, i.e. conditions under which a specified error signal asymptotically approaches zero and other signals in the system remain bounded for arbitrary initial conditions and for any bounded input to the system. It is shown that for a class of up-dating algorithms for the adjustable gain matrix, global convergence is crucially dependent on a transfer matrix G(z) which has a simple block diagram interpretation. When w(z)G(z) is strictly discrete positive real for a scalar w(z) such that w-1(z) is strictly proper with poles and zeros within the unit circle, an augmented error scheme is suggested and is proved to result in global convergence. The solution avoids feeding back a quadratic term as recommended in other schemes for single-input single-output systems.
Resumo:
The leader protease (L-pro) and capsid-coding sequences (P1) constitute approximately 3 kb of the foot-and-mouth disease virus (FMDV). We studied the phylogenetic relationship of 46 FMDV serotype A isolates of Indian origin collected during the period 1968-2005 and also eight vaccine strains using the neighbour-joining tree and Bayesian tree methods. The viruses were categorized under three major groups - Asian, Euro-South American and European. The Indian isolates formed a distinct genetic group among the Asian isolates. The Indian isolates were further classified into different genetic subgroups (<5% divergence). Post-1995 isolates were divided into two subgroups while a few isolates which originated in the year 2005 from Andhra Pradesh formed a separate group. These isolates were closely related to the isolates of the 1970s. The FMDV isolates seem to undergo reverse mutation or onvergent evolution wherein sequences identical to the ancestors are present in the isolates in circulation. The eight vaccine strains included in the study were not related to each other and belonged to different genetic groups. Recombination was detected in the L-pro region in one isolate (A IND 20/82) and in the VP1 coding 1D region in another isolate (A RAJ 21/96). Positive selection was identified at aa positions 23 in the L-pro (P<0.05; 0.046*) and at aa 171 in the capsid protein VP1 (P<0.01; 0.003**).
Resumo:
In a letter RauA proposed a new method for designing statefeedback controllers using eigenvalue sensitivity matrices. However, there appears to be a conceptual mistake in the procedure, or else it is unduly restricted in its applicability. In particular the equation — BR~lBTK = A/.I, in which K is a positive-definite symmetric matrix.
Resumo:
NMR spectra of molecules oriented in thermotropic liquid crystalline media provide information on the molecular structure and order. The spins are generally strongly dipolar coupled and the spectral analyse require the tedious and time consuming numerical iterative calculations. The present study demonstrates the application of multiple quantum spin state selective detection of single quantum transitions for mimicking the homonuclear decoupling and the direct estimation of an element of ordering matrix. This information is utilized to estimate the nearly accurate starting dipolar couplings for iterative calculations. The studies on the spectra of strongly dipolar coupled five and six interacting spin systems are reported.
Resumo:
We present a comparative study of the low temperature electrical transport properties of the carbon matrix containing iron nanoparticles and the films. The conductivity of the nanoparticles located just below the metal-insulator transition exhibits metallic behavior with a logarithmic temperature dependence over a large temperature interval. The zero-field conductivity and the negative magnetoresistance, showing a characteristic upturn at liquid helium temperature, are consistently explained by incorporating the Kondo relation and the two dimensional electron-electron interaction. The films, in contrast, exhibit a crossover of the conductivity from power-law dependence at high temperatures to an activated hopping law dependence in the low temperature region. The transition is attributed to changes in the energy dependence of the density of states near the Fermi level. The observed magnetoresistance is discussed in terms of quantum interference effect on a three-dimensional variable range hopping mechanism.
Resumo:
This paper describes a switching theoretic algorithm for the folding of programmable logic arrays (PLA). The algorithm is valid for both column and row folding, although it has been presented considering only the simple column folding. The pairwise compatibility relations among all the pairs of the columns of the PLA are mapped into a square matrix, called the compatibility matrix of the PLA. A foldable compatibility matrix (FCM), a new concept introduced by the author, is then derived from the compatibility matrix. A new theorem called the folding theorem is then proved. The theorem states that the existence of an m by 2m FCM is both necessary and sufficient to fold 2m columns of the n column PLA (2m ≤ n). Once an FCM is obtained, the ordered pairs of foldable columns and the re-ordering of the rows are readily determined.
Resumo:
One of the applications of nanomaterials is as reinforcements in composites, wherein small additions of nanomaterials lead to large enhancements in mechanical properties. There have been extensive studies in the literature on composites where a polymer matrix is reinforced by a single nanomaterial such as carbon nanotubes. In this article, we examine the significant synergistic effects observed when 2 different types of nanocarbons are incorporated in a polymer matrix. Thus, binary combinations of nanodiamond, few-layer graphene, and single-walled nanotubes have been used to reinforce polyvinyl alcohol. The mechanical properties of the resulting composites, evaluated by the nanoindentation technique, show extraordinary synergy, improving the stiffness and hardness by as much as 400% compared to those obtained with single nanocarbon reinforcements. These results suggest a way of designing advanced materials with extraordinary mechanical properties by incorporating small amounts of 2 nanomaterials such as graphene plus nanodiamond or nanodiamond plus carbon nanotube.
Resumo:
Cibacron Blue 3G-A inhibited monkey liver serine hydroxymethyltransferase competitively with respect to tetrahydrofolate and non-competitively with respect to L-serine. NADH, a positive heterotropic effector, failed to protect the enzymes against inhibition by the dye and was unable to desorb the enzyme from Blue Sepharose CL-6B gel matrix. The binding of the dye to the free enzyme was confirmed by changes in the dye absorption spectrum. The results indicate that the dye probably binds at the tetrahydrofolate-binding domain of the enzyme, rather than at the 'dinucleotide fold'.
Resumo:
Compressive sensing (CS) has been proposed for signals with sparsity in a linear transform domain. We explore a signal dependent unknown linear transform, namely the impulse response matrix operating on a sparse excitation, as in the linear model of speech production, for recovering compressive sensed speech. Since the linear transform is signal dependent and unknown, unlike the standard CS formulation, a codebook of transfer functions is proposed in a matching pursuit (MP) framework for CS recovery. It is found that MP is efficient and effective to recover CS encoded speech as well as jointly estimate the linear model. Moderate number of CS measurements and low order sparsity estimate will result in MP converge to the same linear transform as direct VQ of the LP vector derived from the original signal. There is also high positive correlation between signal domain approximation and CS measurement domain approximation for a large variety of speech spectra.
Resumo:
It is shown how the single-site coherent potential approximation and the averaged T-matrix approximation become exact in the calculation of the averaged single-particle Green function of the electron in the Anderson model when the site energy is distributed randomly with lorentzian distribution. Using these approximations, Lloyd's exact result is reproduced.