scholarly journals Symmetric distance formula in kantor spaces and the radius of the circumscribed sphere of affinely independent set of points

2013 ◽  
Vol 57 (4) ◽  
pp. 115
Author(s):  
Péter GN Szabó
Keyword(s):  
Independent Set ◽  
Set Of Points ◽  
Symmetric Distance ◽  
Distance Formula

On the Pauli graphs on N-qudits

2008 ◽  
Vol 8 (1&2) ◽  
pp. 127-146
Author(s):  
M. Planat ◽  
M. Saniga
Keyword(s):  
Independent Set ◽  
Generalized Quadrangle ◽  
Maximum Independent Set ◽  
Partial Geometry ◽  
Commuting Operators ◽  
Strongly Regular ◽  
Isotropic Subspaces ◽  
Commuting Pairs ◽  
Set Of Points ◽  
Totally Isotropic Subspaces

A comprehensive graph theoretical and finite geometrical study of the commutation relations between the generalized Pauli operators of $N$-qudits is performed in which vertices/points correspond to the operators and edges/lines join commuting pairs of them. As per two-qubits, all basic properties and partitionings of the corresponding {\it Pauli graph} are embodied in the geometry of the generalized quadrangle of order two. Here, one identifies the operators with the points of the quadrangle and groups of maximally commuting subsets of the operators with the lines of the quadrangle. The three basic partitionings are (a) a pencil of lines and a cube, (b) a Mermin's array and a bipartite-part and (c) a maximum independent set and the Petersen graph. These factorizations stem naturally from the existence of three distinct geometric hyperplanes of the quadrangle, namely a set of points collinear with a given point, a grid and an ovoid, which answer to three distinguished subsets of the Pauli graph, namely a set of six operators commuting with a given one, a Mermin's square, and set of five mutually non-commuting operators, respectively. The generalized Pauli graph for multiple qubits is found to follow from symplectic polar spaces of order two, where maximal totally isotropic subspaces stand for maximal subsets of mutually commuting operators. The substructure of the (strongly regular) $N$-qubit Pauli graph is shown to be pseudo-geometric, i.\,e., isomorphic to a graph of a partial geometry. Finally, the (not strongly regular) Pauli graph of a two-qutrit system is introduced; here it turns out more convenient to deal with its dual in order to see all the parallels with the two-qubit case and its surmised relation with the generalized quadrangle $Q(4,3)$, the dual of $W(3)$.

Video Graphics and High-Voltage Electron Microscopy For Analysis of Microtubule Distributions In Fixed Cells

1990 ◽  
Vol 48 (1) ◽  
pp. 524-525
Author(s):  
Richard Mcintosh ◽  
David Mastronarde ◽  
Kent McDonald ◽  
Rubai Ding
Keyword(s):  
Electron Microscopy ◽  
Cross Sections ◽  
Cell Shape ◽  
Video Camera ◽  
Computer Memory ◽  
High Voltage Electron Microscopy ◽  
Thin Sections ◽  
Voltage Electron ◽  
Morphogenetic Event ◽  
Set Of Points

Microtubules (MTs) are cytoplasmic polymers whose dynamics have an influence on cell shape and motility. MTs influence cell behavior both through their growth and disassembly and through the binding of enzymes to their surfaces. In either case, the positions of the MTs change over time as cells grow and develop. We are working on methods to determine where MTs are at different times during either the cell cycle or a morphogenetic event, using thin and thick sections for electron microscopy and computer graphics to model MT distributions.One approach is to track MTs through serial thin sections cut transverse to the MT axis. This work uses a video camera to digitize electron micrographs of cross sections through a MT system and create image files in computer memory. These are aligned and corrected for relative distortions by using the positions of 8 - 10 MTs on adjacent sections to define a general linear transformation that will align and warp adjacent images to an optimum fit. Two hundred MT images are then used to calculate an “average MT”, and this is cross-correlated with each micrograph in the serial set to locate points likely to correspond to MT centers. This set of points is refined through a discriminate analysis that explores each cross correlogram in the neighborhood of every point with a high correlation score.

Prediction of K562 Cells Functional Inhibitors Based on Machine Learning Approaches

2020 ◽  
Vol 25 (40) ◽  
pp. 4296-4302 ◽  
Author(s):  
Yuan Zhang ◽  
Zhenyan Han ◽  
Qian Gao ◽  
Xiaoyi Bai ◽  
Chi Zhang ◽  
...  
Keyword(s):  
Machine Learning ◽  
Inclusion Bodies ◽  
Cross Validation ◽  
Independent Set ◽  
K562 Cells ◽  
Machine Learning Algorithms ◽  
Learning Approaches ◽  
Validation Test ◽  
Excess Number ◽  
Fold Cross Validation

Background: β thalassemia is a common monogenic genetic disease that is very harmful to human health. The disease arises is due to the deletion of or defects in β-globin, which reduces synthesis of the β-globin chain, resulting in a relatively excess number of α-chains. The formation of inclusion bodies deposited on the cell membrane causes a decrease in the ability of red blood cells to deform and a group of hereditary haemolytic diseases caused by massive destruction in the spleen. Methods: In this work, machine learning algorithms were employed to build a prediction model for inhibitors against K562 based on 117 inhibitors and 190 non-inhibitors. Results: The overall accuracy (ACC) of a 10-fold cross-validation test and an independent set test using Adaboost were 83.1% and 78.0%, respectively, surpassing Bayes Net, Random Forest, Random Tree, C4.5, SVM, KNN and Bagging. Conclusion: This study indicated that Adaboost could be applied to build a learning model in the prediction of inhibitors against K526 cells.

Predicting Hub Genes of Glioblastomas Based on Support Vector Machine Combined with CFS algorithms

2020 ◽  
Vol 15 ◽  
Author(s):  
Chun Qiu ◽  
Sai Li ◽  
Shenghui Yang ◽  
Lin Wang ◽  
Aihui Zeng ◽  
...  
Keyword(s):  
Support Vector Machine ◽  
Expression Profiles ◽  
Independent Set ◽  
Classification Model ◽  
Support Vector ◽  
Feature Subset ◽  
Hub Genes ◽  
Effective Prevention ◽  
Key Genes ◽  
Control Samples

Aim: To search the genes related to the mechanisms of the occurrence of glioma and to try to build a prediction model for glioblastomas. Background: The morbidity and mortality of glioblastomas are very high, which seriously endangers human health. At present, the goals of many investigations on gliomas are mainly to understand the cause and mechanism of these tumors at the molecular level and to explore clinical diagnosis and treatment methods. However, there is no effective early diagnosis method for this disease, and there are no effective prevention, diagnosis or treatment measures. Methods: First, the gene expression profiles derived from GEO were downloaded. Then, differentially expressed genes (DEGs) in the disease samples and the control samples were identified. After that, GO and KEGG enrichment analyses of DEGs were performed by DAVID. Furthermore, the correlation-based feature subset (CFS) method was applied to the selection of key DEGs. In addition, the classification model between the glioblastoma samples and the controls was built by an Support Vector Machine (SVM) based on selected key genes. Results and Discussion: Thirty-six DEGs, including 17 upregulated and 19 downregulated genes, were selected as the feature genes to build the classification model between the glioma samples and the control samples by the CFS method. The accuracy of the classification model by using a 10-fold cross-validation test and independent set test was 76.25% and 70.3%, respectively. In addition, PPP2R2B and CYBB can also be found in the top 5 hub genes screened by the protein– protein interaction (PPI) network. Conclusions: This study indicated that the CFS method is a useful tool to identify key genes in glioblastomas. In addition, we also predicted that genes such as PPP2R2B and CYBB might be potential biomarkers for the diagnosis of glioblastomas.

On the Measure and Borel Type of the Set of Points of One-Sided Non-Differentiability

1989 ◽  
Vol 22 (2) ◽  
Author(s):  
Boguslaw Kaczmarski
Keyword(s):  
Set Of Points ◽  
Borel Type

scholarly journals ON THE HEIGHT AND RELATIONAL COMPLEXITY OF A FINITE PERMUTATION GROUP

2021 ◽  
pp. 1-40
Author(s):  
NICK GILL ◽  
BIANCA LODÀ ◽  
PABLO SPIGA
Keyword(s):  
Permutation Group ◽  
Model Theory ◽  
Independent Set ◽  
Maximum Size ◽  
Proper Subset ◽  
Permutation Groups ◽  
Finite Permutation Group ◽  
Pointwise Stabilizer ◽  
Relational Complexity

Abstract Let G be a permutation group on a set $\Omega $ of size t. We say that $\Lambda \subseteq \Omega $ is an independent set if its pointwise stabilizer is not equal to the pointwise stabilizer of any proper subset of $\Lambda $ . We define the height of G to be the maximum size of an independent set, and we denote this quantity $\textrm{H}(G)$ . In this paper, we study $\textrm{H}(G)$ for the case when G is primitive. Our main result asserts that either $\textrm{H}(G)< 9\log t$ or else G is in a particular well-studied family (the primitive large–base groups). An immediate corollary of this result is a characterization of primitive permutation groups with large relational complexity, the latter quantity being a statistic introduced by Cherlin in his study of the model theory of permutation groups. We also study $\textrm{I}(G)$ , the maximum length of an irredundant base of G, in which case we prove that if G is primitive, then either $\textrm{I}(G)<7\log t$ or else, again, G is in a particular family (which includes the primitive large–base groups as well as some others).

scholarly journals Parametric Matroid of Rough Set

2015 ◽  
Vol 23 (06) ◽  
pp. 893-908 ◽  
Author(s):  
Yanfang Liu ◽  
Hong Zhao ◽  
William Zhu
Keyword(s):  
Rough Set ◽  
Equivalence Relation ◽  
Rough Sets ◽  
Rough Set Theory ◽  
Attribute Reduction ◽  
Independent Set ◽  
Approximation Operator ◽  
Approximation Number ◽  
Lower Approximation ◽  
The One

Rough set is mainly concerned with the approximations of objects through an equivalence relation on a universe. Matroid is a generalization of linear algebra and graph theory. Recently, a matroidal structure of rough sets is established and applied to the problem of attribute reduction which is an important application of rough set theory. In this paper, we propose a new matroidal structure of rough sets and call it a parametric matroid. On the one hand, for an equivalence relation on a universe, a parametric set family, with any subset of the universe as its parameter, is defined through the lower approximation operator. This parametric set family is proved to satisfy the independent set axiom of matroids, therefore a matroid is generated, and we call it a parametric matroid of the rough set. Through the lower approximation operator, three equivalent representations of the parametric set family are obtained. Moreover, the parametric matroid of the rough set is proved to be the direct sum of a partition-circuit matroid and a free matroid. On the other hand, partition-circuit matroids are well studied through the lower approximation number, and then we use it to investigate the parametric matroid of the rough set. Several characteristics of the parametric matroid of the rough set, such as independent sets, bases, circuits, the rank function and the closure operator, are expressed by the lower approximation number.

scholarly journals A plane quartic curve with twelve undulations

1945 ◽  
Vol 35 ◽  
pp. 10-13 ◽  
Author(s):  
W. L. Edge
Keyword(s):  
Homogeneous Coordinates ◽  
Quartic Curve ◽  
Base Points ◽  
Octahedral Group ◽  
Quartic Form ◽  
Image Position ◽  
Quartic Curves ◽  
Set Of Points

The pencil of quartic curveswhere x, y, z are homogeneous coordinates in a plane, was encountered by Ciani [Palermo Rendiconli, Vol. 13, 1899] in his search for plane quartic curves that were invariant under harmonic inversions. If x, y, z undergo any permutation the ternary quartic form on the left of (1) is not altered; nor is it altered if any, or all, of x, y, z be multiplied by −1. There thus arises an octahedral group G of ternary collineations for which every curve of the pencil is invariant.Since (1) may also be writtenthe four linesare, as Ciani pointed out, bitangents, at their intersections with the conic C whose equation is x2 + y2 + z2 = 0, to every quartic of the pencil. The 16 base points of the pencil are thus all accounted for—they consist of these eight contacts counted twice—and this set of points must of course be invariant under G. Indeed the 4! collineations of G are precisely those which give rise to the different permutations of the four lines (2), a collineation in a plane being determined when any four non-concurrent lines and the four lines which are to correspond to them are given. The quadrilateral formed by the lines (2) will be called q.

Sign in / Sign up

Export Citation Format

Share Document