Algebraic Hyperstructures of Vague Soft Sets Associated with Hyperrings and Hyperideals.
Ontology highlight
ABSTRACT:
SUBMITTER: Selvachandran G
PROVIDER: S-EPMC4515304 | biostudies-other | 2015
REPOSITORIES: biostudies-other
Similar Datasets
Project description:The present study investigates some novel categorical properties of soft sets. By combining categorical theory with soft set theory, a categorical framework of soft set theory is established. It is proved that the category SFun of soft sets and soft functions has equalizers, finite products, pullbacks, and exponential properties. It is worth mentioning that we find that SFun is both a topological construct and Cartesian closed. The category SRel of soft sets and Z-soft set relations is also characterized, which shows the existence of the zero objects, biproducts, additive identities, injective objects, projective objects, injective hulls, and projective covers. Finally, by constructing proper adjoint situations, some intrinsic connections between SFun and SRel are established.
| S-EPMC4157215 | biostudies-other
Project description:We introduce the concepts soft β-interior and soft β-closure of a soft set in soft topological spaces. We also study soft β-continuous functions and discuss their relations with soft continuous and other weaker forms of soft continuous functions.
| S-EPMC4087269 | biostudies-other
Project description:We focus our discussion on the uncertainty measures of vague soft sets. We propose axiomatic definitions of similarity measure and entropy for vague soft sets. Furthermore, we present a new category of similarity measures and entropies for vague soft sets. The basic properties of these measures are discussed and the relationships among these measures are analyzed.
| S-EPMC4134822 | biostudies-other
Project description:A common problem when analyzing models, such as mathematical modeling of a biological process, is to determine if the unknown parameters of the model can be determined from given input-output data. Identifiable models are models such that the unknown parameters can be determined to have a finite number of values given input-output data. The total number of such values over the complex numbers is called the identifiability degree of the model. Unidentifiable models are models such that the unknown parameters can have an infinite number of values given input-output data. For unidentifiable models, a set of identifiable functions of the parameters are sought so that the model can be reparametrized in terms of these functions yielding an identifiable model. In this work, we use numerical algebraic geometry to determine if a model given by polynomial or rational ordinary differential equations is identifiable or unidentifiable. For identifiable models, we present a novel approach to compute the identifiability degree. For unidentifiable models, we present a novel numerical differential algebra technique aimed at computing a set of algebraically independent identifiable functions. Several examples are used to demonstrate the new techniques.
| S-EPMC6910699 | biostudies-literature
Project description:According to conventional wisdom, electric double-layer forces normally decay exponentially with separation distance. Here, we present experimental evidence of algebraically decaying double-layer interactions. We show that algebraic interactions arise in both strongly overlapping as well as counterion-only regimes, albeit the evidence is less clear for the former regime. In both of these cases, the disjoining pressure profile assumes an inverse square distance dependence. At small separation distances, another algebraic regime is recovered. In this regime, the pressure decays as the inverse of separation distance.
| S-EPMC6968886 | biostudies-literature
Project description:Understanding protein structure and dynamics is essential for understanding their function. This is a challenging task due to the high complexity of the conformational landscapes of proteins and their rugged energy levels. In particular, it is important to detect highly populated regions which could correspond to intermediate structures or local minima.We present a hierarchical clustering and algebraic topology based method that detects regions of interest in protein conformational space. The method is based on several techniques. We use coarse grained protein conformational search, efficient robust dimensionality reduction and topological analysis via persistent homology as the main tools. We use two dimensionality reduction methods as well, robust Principal Component Analysis (PCA) and Isomap, to generate a reduced representation of the data while preserving most of the variance in the data.Our hierarchical clustering method was able to produce compact, well separated clusters for all the tested examples.
| S-EPMC5731496 | biostudies-literature
Project description:The outcome of a functional genomics pipeline is usually a partial list of genomic features, ranked by their relevance in modelling biological phenotype in terms of a classification or regression model. Due to resampling protocols or to a meta-analysis comparison, it is often the case that sets of alternative feature lists (possibly of different lengths) are obtained, instead of just one list. Here we introduce a method, based on permutations, for studying the variability between lists ("list stability") in the case of lists of unequal length. We provide algorithms evaluating stability for lists embedded in the full feature set or just limited to the features occurring in the partial lists. The method is demonstrated by finding and comparing gene profiles on a large prostate cancer dataset, consisting of two cohorts of patients from different countries, for a total of 455 samples.
| S-EPMC3355159 | biostudies-literature
Project description:BackgroundComputed tomography (CT) is an advanced medical imaging technology. The images obtained by CT are helpful for improving diagnostic accuracy. Currently, CT is widely used in clinical settings for diagnosis and health examinations. However, full angle CT scanning has the disadvantage of causing radiation damage to the human body. Sparse angle projection CT scanning is the most effective way to minimize this damage, but the quality of the reconstructed image is reduced. Therefore, it is important to improve the reconstructed image quality produced by sparse angle projection.MethodsIn this paper, we focused on the algebraic reconstruction algorithm. To reduce the accumulation of random noise, we formulated a modified algebraic reconstruction algorithm. Firstly, the algebraic reconstruction algorithm was used to compute two consecutive results, and then the weighted sum of these two results was used to correct the reconstructed image, and an iterative result was obtained. Using this method, we aimed to reduce the noise accumulation caused by iteration.ResultsIn this study, 20 angle projections were used for the reconstruction. The experimental object was the Shepp-Logan phantom test image. The experiments were implemented under two conditions: without noise and with noise. The peak signal to noise ratio (PSNR) and the mean squared error (MSE) of the reconstructed image from projections without noise were 76.0896 and 0.0016, respectively. The PSNR and MSE of the reconstructed image from projections with noise were 75.8263 and 0.0017, respectively. The reconstructed performance was superior to the previous algebraic reconstruction algorithm.ConclusionsThe performance of the proposed method was superior to other algorithms, which confirms that noise accumulation caused by iteration can be effectively reduced by the weighted summation of two consecutive reconstruction results. Moreover, the reconstruction performance under noisy projection is superior to other algorithms, which demonstrates that the proposed method improves anti-noise performance.
| S-EPMC8506772 | biostudies-literature
Project description:A convex code is a binary code generated by the pattern of intersections of a collection of open convex sets in some Euclidean space. Convex codes are relevant to neuroscience as they arise from the activity of neurons that have convex receptive fields. In this paper, we use algebraic methods to determine if a code is convex. Specifically, we use the neural ideal of a code, which is a generalization of the Stanley-Reisner ideal. Using the neural ideal together with its standard generating set, the canonical form, we provide algebraic signatures of certain families of codes that are non-convex. We connect these signatures to the precise conditions on the arrangement of sets that prevent the codes from being convex. Finally, we also provide algebraic signatures for some families of codes that are convex, including the class of intersection-complete codes. These results allow us to detect convexity and non-convexity in a variety of situations, and point to some interesting open questions.
| S-EPMC6750060 | biostudies-literature
Project description:Resonator networks are ubiquitous in natural and engineered systems, such as solid-state materials, electrical circuits, quantum processors, and even neural tissue. To understand and manipulate these networks it is essential to characterize their building blocks, which include the mechanical analogs of mass, elasticity, damping, and coupling of each resonator element. While these mechanical parameters are typically obtained from response spectra using least-squares fitting, this approach requires a priori knowledge of all parameters and is susceptible to large error due to convergence to local minima. Here we validate an alternative algebraic means to characterize resonator networks with no or minimal a priori knowledge. Our approach recasts the equations of motion of the network into a linear homogeneous algebraic equation and solves the equation with a set of discrete measured network response vectors. For validation, we employ our approach on noisy simulated data from a single resonator and a coupled resonator pair, and we characterize the accuracy of the recovered parameters using high-dimension factorial simulations. Generally, we find that the error is inversely proportional to the signal-to-noise ratio, that measurements at two frequencies are sufficient to recover all parameters, and that sampling near the resonant peaks is optimal. Our simple, powerful tool will enable future efforts to ascertain network properties and control resonator networks in diverse physical domains.
| S-EPMC10789822 | biostudies-literature