On the open problem related to rank equalities for the sum of finitely many idempotent matrices and its applications.
Ontology highlight
ABSTRACT:
SUBMITTER: Chen MX
PROVIDER: S-EPMC4121197 | biostudies-other | 2014
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Probe-level microarray data are usually stored in matrices, where the row and column correspond to array and probe, respectively. Scientists routinely summarize each array by a single index as the expression level of each probe-set (gene). We examine the adequacy of a uni-dimensional summary for characterizing the data matrix of each probe-set. To do so, we propose a low-rank matrix model for the probe-level intensities, and develop a useful framework for testing the adequacy of uni-dimensionality against targeted alternatives. This is an interesting statistical problem where inference has to be made based on one data matrix whose entries are not i.i.d. We analyze the asymptotic properties of the proposed test statistics, and use Monte Carlo simulations to assess their small sample performance. Applications of the proposed tests to GeneChip data show that evidence against a uni-dimensional model is often indicative of practically relevant features of a probe-set.
| S-EPMC2876352 | biostudies-literature
Project description:Finding the best material for a specific application is the ultimate goal of materials discovery. However, there is also the reverse problem: when experimental groups discover a new material, they would like to know all the possible applications this material would be promising for. Computational modeling can aim to fulfill this expectation, thanks to the sustained growth of computing power and the collective engagement of the scientific community in developing more efficient and accurate workflows for predicting materials' performances. We discuss the impact that reproducibility and automation of the modeling protocols have on the field of gas adsorption in nanoporous crystals. We envision a platform that combines these tools and enables effective matching between promising materials and industrial applications.
| S-EPMC7706098 | biostudies-literature
Project description:This article investigates a form of rank deficiency in phenotypic covariance matrices derived from geometric morphometric data, and its impact on measures of phenotypic integration. We first define a type of rank deficiency based on information theory then demonstrate that this deficiency impairs the performance of phenotypic integration metrics in a model system. Lastly, we propose methods to treat for this information rank deficiency. Our first goal is to establish how the rank of a typical geometric morphometric covariance matrix relates to the information entropy of its eigenvalue spectrum. This requires clear definitions of matrix rank, of which we define three: the full matrix rank (equal to the number of input variables), the mathematical rank (the number of nonzero eigenvalues), and the information rank or "effective rank" (equal to the number of nonredundant eigenvalues). We demonstrate that effective rank deficiency arises from a combination of methodological factors-Generalized Procrustes analysis, use of the correlation matrix, and insufficient sample size-as well as phenotypic covariance. Secondly, we use dire wolf jaws to document how differences in effective rank deficiency bias two metrics used to measure phenotypic integration. The eigenvalue variance characterizes the integration change incorrectly, and the standardized generalized variance lacks the sensitivity needed to detect subtle changes in integration. Both metrics are impacted by the inclusion of many small, but nonzero, eigenvalues arising from a lack of information in the covariance matrix, a problem that usually becomes more pronounced as the number of landmarks increases. We propose a new metric for phenotypic integration that combines the standardized generalized variance with information entropy. This metric is equivalent to the standardized generalized variance but calculated only from those eigenvalues that carry nonredundant information. It is the standardized generalized variance scaled to the effective rank of the eigenvalue spectrum. We demonstrate that this metric successfully detects the shift of integration in our dire wolf sample. Our third goal is to generalize the new metric to compare data sets with different sample sizes and numbers of variables. We develop a standardization for matrix information based on data permutation then demonstrate that Smilodon jaws are more integrated than dire wolf jaws. Finally, we describe how our information entropy-based measure allows phenotypic integration to be compared in dense semilandmark data sets without bias, allowing characterization of the information content of any given shape, a quantity we term "latent dispersion". [Canis dirus; Dire wolf; effective dispersion; effective rank; geometric morphometrics; information entropy; latent dispersion; modularity and integration; phenotypic integration; relative dispersion.].
| S-EPMC9203068 | biostudies-literature
Project description:The subset sum problem (SSP) is a typical nondeterministic-polynomial-time (NP)-complete problem that is hard to solve efficiently in time with conventional computers. Photons have the unique features of high propagation speed, strong robustness, and low detectable energy level and therefore can be promising candidates to meet the challenge. Here, we present a scalable chip built-in photonic computer to efficiently solve the SSP. We map the problem into a three-dimensional waveguide network through a femtosecond laser direct writing technique. We show that the photons sufficiently dissipate into the networks and search for solutions in parallel. In the case of successive primes, our approach exhibits a dominant superiority in time consumption even compared with supercomputers. Our results confirm the ability of light to realize computations intractable for conventional computers, and suggest the SSP as a good benchmarking platform for the race between photonic and conventional computers on the way toward "photonic supremacy."
| S-EPMC6994215 | biostudies-literature
Project description:Neonicotinoids are the most commonly used insecticides due to their effectiveness. However, non-targeted insects, especially bees, are also affected by neonicotinoids. Therefore, neonicotinoid application can contribute to the declining bee populations worldwide. The presented study describes the development of novel competitive, fluorescent microsphere-based suspension immunoassays for neonicotinoid profiling and their application to bees and essential bee-related matrices, using the Multi-Analyte Profiling (xMAP) technology. For the construction of these neonicotinoid microsphere immunoassays (nMIAs), neonicotinoid-ovalbumin conjugates were coupled to unique fluorescent, paramagnetic microspheres, which competed with the free neonicotinoids that were present in test samples for interacting with the corresponding, specific antibodies. In total, five independent nMIA's were developed for the detection of imidacloprid, acetamiprid, clothianidin, thiacloprid, thiamethoxam, dinotefuran, nitenpyram and imidaclothiz with the limits of detection being for 0.01 ng/mL, 0.01 ng/mL, 0.02 ng/mL, 0.02 ng/mL, 0.003 ng/mL, 2.95 ng/mL, 0.09 ng/mL and 0.04 ng/mL, respectively. The developed nMIAs were applied to fortified matrices including surface water, pollen, honey and honeybees. All of the neonicotinoids, except dinotefuran, could be sensitively detected in all of the tested environmental matrices and bees, with there being sensitivities of 1 ng/mL in water and 10 ng/g in solid materials. These nMIAs provide a rapid profiling method for all of the common neonicotinoids, including those that are banned by the European Union for outdoor use. The developed method can contribute to healthy and sustainable beekeeping, globally, via its application in the apiary environment.
| S-EPMC9599487 | biostudies-literature
Project description:Situations often arise in which the matrix of independent variables is not of full column rank. That is, there are one or more linear dependencies among the independent variables. This paper covers in detail the situation in which the rank is one less than full column rank and extends this coverage to include cases of even greater rank deficiency. The emphasis is on the row geometry of the solutions based on the normal equations. The author shows geometrically how constrained-regression/generalized-inverses work in this situation to provide a solution in the face of rank deficiency.
| S-EPMC3378569 | biostudies-literature
Project description:The paper mainly discusses the lower bounds for the rank of matrices and sufficient conditions for nonsingular matrices. We first present a new estimation for [Formula: see text] ([Formula: see text] is an eigenvalue of a matrix) by using the partitioned matrices. By using this estimation and inequality theory, the new and more accurate estimations for the lower bounds for the rank are deduced. Furthermore, based on the estimation for the rank, some sufficient conditions for nonsingular matrices are obtained.
| S-EPMC5519689 | biostudies-other
Project description:"How does T cell receptor signaling begin?" Answering this question requires an understanding of how the parts of the molecular machinery that mediates this process fit and work together. Ultimately this molecular architecture must (i) trigger the relay of information from the TCR-pMHC interface to the signaling substrates of the CD3 molecules and (ii) bring the kinases that modify these substrates in close proximity to interact, initiate, and sustain signaling. In this contribution we will discuss advances of the last decade that have increased our understanding of the complex machinery and interactions that underlie this type of signaling.
| S-EPMC3381686 | biostudies-other
Project description:Recovering low-rank structures via eigenvector perturbation analysis is a common problem in statistical machine learning, such as in factor analysis, community detection, ranking, matrix completion, among others. While a large variety of bounds are available for average errors between empirical and population statistics of eigenvectors, few results are tight for entrywise analyses, which are critical for a number of problems such as community detection. This paper investigates entrywise behaviors of eigenvectors for a large class of random matrices whose expectations are low-rank, which helps settle the conjecture in Abbe et al. (2014b) that the spectral algorithm achieves exact recovery in the stochastic block model without any trimming or cleaning steps. The key is a first-order approximation of eigenvectors under the ℓ ∞ norm: uk≈Auk*λk*, where {u k } and {uk*} are eigenvectors of a random matrix A and its expectation EA , respectively. The fact that the approximation is both tight and linear in A facilitates sharp comparisons between u k and uk* . In particular, it allows for comparing the signs of u k and uk* even if ‖uk-uk*‖∞ is large. The results are further extended to perturbations of eigenspaces, yielding new ℓ ∞-type bounds for synchronization ( ℤ2 -spiked Wigner model) and noisy matrix completion.
| S-EPMC8046180 | biostudies-literature
Project description:BackgroundThe design of long oligonucleotides for spotted DNA microarrays requires detailed attention to ensure their optimal performance in the hybridization process. The main challenge is to select an optimal oligonucleotide element that represents each genetic locus/gene in the genome and is unique, devoid of internal structures and repetitive sequences and its Tm is uniform with all other elements on the microarray. Currently, all of the publicly available programs for DNA long oligonucleotide microarray selection utilize various combinations of cutoffs in which each parameter (uniqueness, Tm, and secondary structure) is evaluated and filtered individually. The use of the cutoffs can, however, lead to information loss and to selection of suboptimal oligonucleotides, especially for genomes with extreme distribution of the GC content, a large proportion of repetitive sequences or the presence of large gene families with highly homologous members.ResultsHere we present the program OligoRankPick which is using a weighted rank-based strategy to select microarray oligonucleotide elements via an integer weighted linear function. This approach optimizes the selection criteria (weight score) for each gene individually, accommodating variable properties of the DNA sequence along the genome. The designed algorithm was tested using three microbial genomes Escherichia coli, Saccharomyces cerevisiae and the human malaria parasite species Plasmodium falciparum. In comparison to other published algorithms OligoRankPick provides significant improvements in oligonucleotide design for all three genomes with the most significant improvements observed in the microarray design for P. falciparum whose genome is characterized by large fluctuations of GC content, and abundant gene duplications.ConclusionOligoRankPick is an efficient tool for the design of long oligonucleotide DNA microarrays which does not rely on direct oligonucleotide exclusion by parameter cutoffs but instead optimizes all parameters in context of each other. The weighted rank-sum strategy utilized by this algorithm provides high flexibility of oligonucleotide selection which accommodates extreme variability of DNA sequence properties along genomes of many organisms.
| S-EPMC2099447 | biostudies-literature