Correlation between periostin and SNCG and esophageal cancer invasion, infiltration and apoptosis

AbstractObjectiveTo investigate the correlation between periostin and SNCG and esophageal cancer invasion, infiltration and apoptosis.MethodsA total of 78 cases esophageal surgical resection specimens were collected, expression of periostin and SNCG in esophageal cancer were detected. Effect of periostin and SNCG in esophageal carcinoma invasion and infiltration was analyzed.ResultsThe upregulated rate of periostin had significant difference in esophageal cancer tissues (39.74%), adjacent tissues (17.86%) and normal tissues (0.00%); The positive expression rates of SNCG had significant difference in esophageal cancer tissues (61.54%), adjacent tissues (32.14%) and normal tissues (1.96%); The upregulated rate of periostin had a significant correlation with lymph node metastasis, adventitia invasion, TNM stage; The positive expression rates of SNCG had a significant correlation with differentiation degree, lymph node metastasis, adventitia invasion, TNM stage; Apoptosis index of the positive of expression of SNCG of esophageal cancer tissue (4.541±2.267) was significantly lower than that of the negative expression (7.316±2.582) (P<0.05).ConclusionsSNCG may play an important role in invasion, infiltration and apoptosis of esophageal cancer and serve as target spots in the targeted therapy of esophageal cancer

Braiding higher-order Majorana corner states through their spin degree of freedom

In this work, we study the spin texture of a class of higher-order topological superconductors (HOTSC) and show how it can be used to detect and braid Majorana corner modes (MCMs). This class of HOTSC is composed of two-dimensional topological insulators with s-wave superconductivity and in-plane magnetic fields, which offers advantages in experimental implementation. The spin polarization of the MCMs in this class is perpendicular with the applied magnetic field direction and is opposite on intrinsic orbitals, resulting in an overall ferrimagnetic spin texture. As a result, we find that the spin-selective Andreev reflection can be observed in a transverse instead of parallel direction to the applied magnetic field. Meanwhile, this spin texture leads to the gate-tunable $4\pi$ periodic $\phi_0$ Josephson current that performs qualitatively different behavior from the topologically trivial $\phi_0$-junction under rotating the in-plane magnetic field. Meanwhile, the existence of the MCMs in this class does not depend on the in-plane magnetic field direction. This gives rise to great advantage in constructing all electronically controlled Majorana network for braiding, which is confirmed through our numerical simulation. We thus provide a comprehensive scheme for probing non-Abelian statistics in this class of HOTSCs.Comment: 6 pages, 4 figure

Modulating Linker Composition of Haptens Resulted in Improved Immunoassay for Histamine.

Histamine (HA) is an important food contaminant generated during food fermentation or spoilage. However, an immunoassay for direct (derivatization free) determination of HA has rarely been reported due to its small size to induce the desired antibodies by its current hapten-protein conjugates. In this work, despite violating the classical hapten design criteria which recommend introducing a linear aliphatic (phenyl free) linker into the immunizing hapten, a novel haptens, HA-245 designed and synthesized with a phenyl-contained linker, exhibited significantly enhanced immunological properties. Thus, a quality-improved monoclonal antibody (Mab) against HA was elicited by its hapten-carrier conjugates. Then, as the linear aliphatic linker contained haptens, Hapten B was used as linker-heterologous coating haptens to eliminate the recognition of linker antibodies. Indirect competitive ELISA (ic-ELISA) was developed with a 50% inhibition concentration (IC50) of 0.21 mg/L and a limit of detection (LOD) of 0.06 mg/L in buffer solution. The average recoveries of HA from spiked food samples for this ic-ELISA ranged from 84.1% and 108.5%, and the analysis results agreed well with those of referenced LC-MS/MS. This investigation not only realized derivatization-free immunoassay for HA, but also provided a valuable guidance for hapten design and development of immunoassay for small molecules

Gene and Pathway-Based Analysis: Second Wave of Genome-wide Association Studies

Despite great success of GWAS in identification of common genetic variants associated with complex diseases, the current GWAS have focused on single SNP analysis. However, single SNP analysis often identifies a number of the most significant SNPs that account for only a small proportion of the genetic variants and offers limited understanding of complex diseases. To overcome these limitations, we propose gene and pathway-based association analysis as a new paradigm for GWAS. As a proof of concept, we performed a comprehensive gene and pathway-based association analysis for thirteen published GWAS. Our results showed that the proposed new paradigm for GWAS not only identified the genes that include significant SNPs found by single SNP analysis, but also detected new genes in which each single SNP conferred small disease risk, but their joint actions were implicated in the development of diseases. The results also demonstrated that the new paradigm for GWAS was able to identify biologically meaningful pathways associated with the diseases which were confirmed by gene-set rich analysis using gene expression data

An Efficient Decomposition Algorithm for Large-Scale Network Slicing

In this paper, we consider the network slicing (NS) problem which attempts to map multiple customized virtual network requests to a common shared network infrastructure and allocate network resources to meet diverse service requirements. We propose an efficient decomposition algorithm for solving this NP-hard problem. The proposed algorithm decomposes the large-scale hard NS problem into two relatively easy function placement (FP) and traffic routing (TR) subproblems and iteratively solves them enabling information feedback between each other, which makes it particularly suitable to solve large-scale problems. Specifically, the FP subproblem is to place service functions into cloud nodes in the network, and solving it can return a function placement strategy based on which the TR subproblem is defined; and the TR subproblem is to find paths connecting two nodes hosting two adjacent functions in the network, and solving it can either verify that the solution of the FP subproblem is an optimal solution of the original problem, or return a valid inequality to the FP subproblem that cuts off the current infeasible solution. The proposed algorithm is guaranteed to find the global solution of the NS problem. We demonstrate the effectiveness and efficiency of the proposed algorithm via numerical experiments.Comment: 5 pages, 4 figures, accepted for publication in IEEE SPAWC 202