Browse
Submit Data
Databases
API
Help

Dataset Information

6 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Confidence analysis of standard deviational ellipse and its extension into higher dimensional euclidean space.

ABSTRACT: Standard deviational ellipse (SDE) has long served as a versatile GIS tool for delineating the geographic distribution of concerned features. This paper firstly summarizes two existing models of calculating SDE, and then proposes a novel approach to constructing the same SDE based on spectral decomposition of the sample covariance, by which the SDE concept is naturally generalized into higher dimensional Euclidean space, named standard deviational hyper-ellipsoid (SDHE). Then, rigorous recursion formulas are derived for calculating the confidence levels of scaled SDHE with arbitrary magnification ratios in any dimensional space. Besides, an inexact-newton method based iterative algorithm is also proposed for solving the corresponding magnification ratio of a scaled SDHE when the confidence probability and space dimensionality are pre-specified. These results provide an efficient manner to supersede the traditional table lookup of tabulated chi-square distribution. Finally, synthetic data is employed to generate the 1-3 multiple SDEs and SDHEs. And exploratory analysis by means of SDEs and SDHEs are also conducted for measuring the spread concentrations of Hong Kong's H1N1 in 2009.

SUBMITTER: Wang B

PROVIDER: S-EPMC4358977 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

New family of tilings of three-dimensional Euclidean space by tetrahedra and octahedra.

Project description:It is well known that two regular tetrahedra can be combined with a single regular octahedron to tile (complete fill) three-dimensional Euclidean space . This structure was called the "octet truss" by Buckminster Fuller. It was believed that such a tiling, which is the Delaunay tessellation of the face-centered cubic (fcc) lattice, and its closely related stacking variants, are the only tessellations of that involve two different regular polyhedra. Here we identify and analyze a unique family comprised of a noncountably infinite number of periodic tilings of whose smallest repeat tiling unit consists of one regular octahedron and six smaller regular tetrahedra. We first derive an extreme member of this unique tiling family by showing that the "holes" in the optimal lattice packing of octahedra, obtained by Minkowski over a century ago, are congruent tetrahedra. This tiling has 694 distinct concave (i.e., nonconvex) repeat units, 24 of which possess central symmetry, and hence is distinctly different and combinatorically richer than the fcc tetrahedra-octahedra tiling, which only has two distinct tiling units. Then we construct a one-parameter family of octahedron packings that continuously spans from the fcc to the optimal lattice packing of octahedra. We show that the "holes" in these packings, except for the two extreme cases, are tetrahedra of two sizes, leading to a family of periodic tilings with units composed four small tetrahedra and two large tetrahedra that contact an octahedron. These tilings generally possess 2,068 distinct concave tiling units, 62 of which are centrally symmetric.

| S-EPMC3131308 | biostudies-literature

A model for the simultaneous analysis of reflectance spectra and basis factors of Munsell color samples under D65 illumination in three-dimensional Euclidean space.

Project description:In this paper we present the results of an analysis of the physically measured surface reflectance spectra of 360 matte Munsell chromatic color chips plus 10 flat achromatic vectors corresponding to Munsell value levels 10 (white) to 1 (near black) for a total sample size of 370. Each of the 370 spectra was multiplied by the spectral radiant power distribution of D65 light so that the final results represent the spectra of reflected light from Munsell color chips under D65 illumination. We simultaneously model the structure of the color chips and the spectra in a common three-dimensional Euclidean space, oriented to yield the most interpretable structure with respect of the Munsell color structure. In this orientation, axis 1 roughly corresponds to the mean power of the spectral reflectance (approximate Munsell value), axis 2 goes from Munsell red to blue-green, and axis 3 goes from Munsell green-yellow to purple. Basis factors for the spectra are also plotted against wavelength and Munsell hue. These plots have implications for theories of opponent processes. By plotting the chips and spectra in the same space we obtain virtually exact correspondences between the various Munsell hues and spectral values in nanometers for comparison to those obtained by previous researchers. Mathematical derivations are provided to validate the common Euclidean model.

| S-EPMC123292 | biostudies-literature

Representing logic gates over Euclidean space via heaviside step function.

Project description:Theoretical concepts asserted by Alan Turing are the basis of the computation and hence of machine intelligence. Turing Machine, the fundamental computational model, has been proven to be reducible to a logic circuit and, at the same time, portable into a computer program that can be expressed through a combination of fundamental programming language control structures. This work proposes a mathematical framework that analytically models logic gates employing Heaviside Step Function. The existence of a correspondence between a generic finite-time algorithm and the proposed mathematical formulation is proven. The proposed interpretation is given through a well-defined logical circuit analytical expression. Relevant geometrical applications, related to polygon processing, having wide implications in engineering branches are presented together with a new Penalty Method for constrained optimization problems handling. A detailed simulation campaign is conducted to assess the effectiveness of the applications derived from the proposed mathematical framework.

| S-EPMC9107489 | biostudies-literature

A new method for identifying industrial clustering using the standard deviational ellipse.

Project description:Industrial agglomeration has attracted extensive attention from economists and geographers, yet it is still a challenge to identify the multi-agglomeration spatial structure and degree of industrial agglomeration in continuous space-there is still a lack of a more targeted industrial clustering method. The clustering method and the standard deviational ellipse (simply, ellipse) model have advantages in identifying the spatial structure and representing spatial information respectively. On this basis, we propose an ellipse-based approach to identifying industrial clusters. Our ellipse-based approach rests upon group nearest neighbor using the group-based nearest neighbor (GNN) ordering and spatial compactness matrix, where a number of point sequences with varying lengths, generated under the GNN ordering, are characterized by an ellipse and the elliptical parameters of these point sequences formulate the values and structure of the compactness matrix. Clustering is reformulated to identify ellipses with a specified parameter among a number of potential candidate ellipses, with significant changes (especially in the area) used as the cutoff criterion for determining the clusters' border point. Our approach is illustrated in the location pattern of firms in Shanghai City, China in comparison with four well-known clustering methods. With the combination of elliptical parameters and spatial compactness, our approach may bring a new analytical ground for future industrial clustering research.

| S-EPMC9834335 | biostudies-literature

Euclidean sections of protein conformation space and their implications in dimensionality reduction.

Project description:Dimensionality reduction is widely used in searching for the intrinsic reaction coordinates for protein conformational changes. We find the dimensionality-reduction methods using the pairwise root-mean-square deviation (RMSD) as the local distance metric face a challenge. We use Isomap as an example to illustrate the problem. We believe that there is an implied assumption for the dimensionality-reduction approaches that aim to preserve the geometric relations between the objects: both the original space and the reduced space have the same kind of geometry, such as Euclidean geometry vs. Euclidean geometry or spherical geometry vs. spherical geometry. When the protein free energy landscape is mapped onto a 2D plane or 3D space, the reduced space is Euclidean, thus the original space should also be Euclidean. For a protein with N atoms, its conformation space is a subset of the 3N-dimensional Euclidean space R(3N). We formally define the protein conformation space as the quotient space of R(3N) by the equivalence relation of rigid motions. Whether the quotient space is Euclidean or not depends on how it is parameterized. When the pairwise RMSD is employed as the local distance metric, implicit representations are used for the protein conformation space, leading to no direct correspondence to a Euclidean set. We have demonstrated that an explicit Euclidean-based representation of protein conformation space and the local distance metric associated to it improve the quality of dimensionality reduction in the tetra-peptide and ?-hairpin systems.

| S-EPMC4177328 | biostudies-literature

Region of Attainable Redaction, an extension of Ellipse of Insignificance analysis for gauging impacts of data redaction in dichotomous outcome trials.

Project description:In biomedical science, it is a reality that many published results do not withstand deeper investigation, and there is growing concern over a replicability crisis in science. Recently, Ellipse of Insignificance (EOI) analysis was introduced as a tool to allow researchers to gauge the robustness of reported results in dichotomous outcome design trials, giving precise deterministic values for the degree of miscoding between events and non-events tolerable simultaneously in both control and experimental arms (Grimes, 2022). While this is useful for situations where potential miscoding might transpire, it does not account for situations where apparently significant findings might result from accidental or deliberate data redaction in either the control or experimental arms of an experiment, or from missing data or systematic redaction. To address these scenarios, we introduce Region of Attainable Redaction (ROAR), a tool that extends EOI analysis to account for situations of potential data redaction. This produces a bounded cubic curve rather than an ellipse, and we outline how this can be used to identify potential redaction through an approach analogous to EOI. Applications are illustrated, and source code, including a web-based implementation that performs EOI and ROAR analysis in tandem for dichotomous outcome trials is provided.

| S-EPMC10871715 | biostudies-literature

Optimal settings of mass spectrometry open search strategy for higher confidence

Project description:More than half of the mass spectra could not be identified in most proteome mass spectrometry experiments. Various modifications have been considered as a major reason. Open search strategy was then introduced to solve this problem, however, lacking thorough quality assessment using independent information. Here, we used the “Suspicious Discovery Rate (SDR)” based on the translatome sequencing (RNC-seq) as an independent source to assess the proteome open search strategy. We found that the open search strategy increased the spectra utilization with the cost of increasing suspicious identifications that lacks translation evidence. We further suggested that restricting the peptide FDR below 0.1% would efficiently control the suspicious identifications of open search methods and enhanced the confidence of the peptide identification with modifications than the narrow window search. These results facilitated the proper use of open search methods for higher quality of proteome identifications with the information of post-translational modifications and single amino acid polymorphisms

2018-10-04 | GSE112623 | GEO

The Confidence Information Ontology: a step towards a standard for asserting confidence in annotations.

Project description:Biocuration has become a cornerstone for analyses in biology, and to meet needs, the amount of annotations has considerably grown in recent years. However, the reliability of these annotations varies; it has thus become necessary to be able to assess the confidence in annotations. Although several resources already provide confidence information about the annotations that they produce, a standard way of providing such information has yet to be defined. This lack of standardization undermines the propagation of knowledge across resources, as well as the credibility of results from high-throughput analyses. Seeded at a workshop during the Biocuration 2012 conference, a working group has been created to address this problem. We present here the elements that were identified as essential for assessing confidence in annotations, as well as a draft ontology--the Confidence Information Ontology--to illustrate how the problems identified could be addressed. We hope that this effort will provide a home for discussing this major issue among the biocuration community. Tracker URL: https://github.com/BgeeDB/confidence-information-ontology Ontology URL: https://raw.githubusercontent.com/BgeeDB/confidence-information-ontology/master/src/ontology/cio-simple.obo

| S-EPMC4425939 | biostudies-literature

Explaining the emergence of complex networks through log-normal fitness in a Euclidean node similarity space.

Project description:Networks of disparate phenomena-be it the global ecology, human social institutions, within the human brain, or in micro-scale protein interactions-exhibit broadly consistent architectural features. To explain this, we propose a new theory where link probability is modelled by a log-normal node fitness (surface) factor and a latent Euclidean space-embedded node similarity (depth) factor. Building on recurring trends in the literature, the theory asserts that links arise due to individualistic as well as dyadic information and that important dyadic information making up the so-called depth factor is obscured by this essentially non-dyadic information making up the surface factor. Modelling based on this theory considerably outperforms popular power-law fitness and hyperbolic geometry explanations across 110 networks. Importantly, the degree distributions of the model resemble power-laws at small densities and log-normal distributions at larger densities, posing a reconciliatory solution to the long-standing debate on the nature and existence of scale-free networks. Validating this theory, a surface factor inversion approach on an economic world city network and an fMRI connectome results in considerably more geometrically aligned nearest neighbour networks, as is hypothesised to be the case for the depth factor. This establishes new foundations from which to understand, analyse, deconstruct and interpret network phenomena.

| S-EPMC7820353 | biostudies-literature

Euclidean Distance Analysis Enables Nucleotide Skew Analysis in Viral Genomes.

Project description:Nucleotide skew analysis is a versatile method to study the nucleotide composition of RNA/DNA molecules, in particular to reveal characteristic sequence signatures. For instance, skew analysis of the nucleotide bias of several viral RNA genomes indicated that it is enriched in the unpaired, single-stranded genome regions, thus creating an even more striking virus-specific signature. The comparison of skew graphs for many virus isolates or families is difficult, time-consuming, and nonquantitative. Here, we present a procedure for a more simple identification of similarities and dissimilarities between nucleotide skew data of coronavirus, flavivirus, picornavirus, and HIV-1 RNA genomes. Window and step sizes were normalized to correct for differences in length of the viral genome. Cumulative skew data are converted into pairwise Euclidean distance matrices, which can be presented as neighbor-joining trees. We present skew value trees for the four virus families and show that closely related viruses are placed in small clusters. Importantly, the skew value trees are similar to the trees constructed by a "classical" model of evolutionary nucleotide substitution. Thus, we conclude that the simple calculation of Euclidean distances between nucleotide skew data allows an easy and quantitative comparison of characteristic sequence signatures of virus genomes. These results indicate that the Euclidean distance analysis of nucleotide skew data forms a nice addition to the virology toolbox.

| S-EPMC6232797 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data