Imaging and variability studies of CTA~102 during the 2016 January γ\gamma-ray flare

The $\gamma$-ray bright blazar CTA 102 is studied using imaging (new 15 GHz and archival 43 GHz Very Long Baseline Array, VLBA data) and time variable optical flux density, polarization degree and electric vector position angle (EVPA) spanning between 2015 June 1 and 2016 October 1, covering a prominent $\gamma$-ray flare during 2016 January. The pc-scale jet indicates expansion with oscillatory features upto 17 mas. Component proper motions are in the range 0.04 - 0.33 mas/yr with acceleration upto 1.2 mas followed by a slowing down beyond 1.5 mas. A jet bulk Lorentz factor $\geq$ 17.5, position angle of 128.3 degrees, inclination angle $\leq$ 6.6 degrees and intrinsic half opening angle $\leq$ 1.8 degrees are derived from the VLBA data. These inferences are employed in a helical jet model to infer long term variability in flux density, polarization degree, EVPA and a rotation of the Stokes Q and U parameters. A core distance of $r_{\rm core,43 \ GHz}$ = 22.9 pc, and a magnetic field strength at 1 pc and the core location of 1.57 G and 0.07 G respectively are inferred using the core shift method. The study is useful in the context of estimating jet parameters and in offering clues to distinguish mechanisms responsible for variability over different timescales.Comment: 20 pages, 7 figures, 3 tables; accepted for publication in Ap

Water-Soluble 3D Covalent Organic Framework that Displays an Enhanced Enrichment Effect of Photosensitizers and Catalysts for the Reduction of Protons to H2.

Covalent organic frameworks (COFs) are emerging porous polymers that have 2D or 3D long-range ordering. Currently available COFs are typically insoluble or decompose upon dissolution, which remarkably restricts their practical implementations. For 3D COFs, the achievement of noninterpenetration, which maximizes their porosity-derived applications, also remains a challenge synthetically. Here, we report the synthesis of the first highly water-soluble 3D COF (sCOF-101) from irreversible polymerization of a preorganized supramolecular organic framework through cucurbit[8]uril (CB[8])-controlled [2 + 2] photodimerization. Synchrotron X-ray scattering and diffraction analyses confirm that sCOF-101 exhibits porosity periodicity, with a channel diameter of 2.3 nm, in both water and the solid state and retains the periodicity under both strongly acidic and basic conditions. As an ordered 3D polymer, sCOF-101 can enrich [Ru(bpy)3]2+ photosensitizers and redox-active polyoxometalates in water, which leads to remarkable increase of their photocatalytic activity for proton reduction to produce H2

A Pseudo DNA Cryptography Method

The DNA cryptography is a new and very promising direction in cryptography research. DNA can be used in cryptography for storing and transmitting the information, as well as for computation. Although in its primitive stage, DNA cryptography is shown to be very effective. Currently, several DNA computing algorithms are proposed for quite some cryptography, cryptanalysis and steganography problems, and they are very powerful in these areas. However, the use of the DNA as a means of cryptography has high tech lab requirements and computational limitations, as well as the labor intensive extrapolation means so far. These make the efficient use of DNA cryptography difficult in the security world now. Therefore, more theoretical analysis should be performed before its real applications. In this project, We do not intended to utilize real DNA to perform the cryptography process; rather, We will introduce a new cryptography method based on central dogma of molecular biology. Since this method simulates some critical processes in central dogma, it is a pseudo DNA cryptography method. The theoretical analysis and experiments show this method to be efficient in computation, storage and transmission; and it is very powerful against certain attacks. Thus, this method can be of many uses in cryptography, such as an enhancement insecurity and speed to the other cryptography methods. There are also extensions and variations to this method, which have enhanced security, effectiveness and applicability.Comment: A small work that quite some people asked abou

Exploring the dark matter inelastic frontier with 79.6 days of PandaX-II data

We report here the results of searching for inelastic scattering of dark matter (initial and final state dark matter particles differ by a small mass splitting) with nucleon with the first 79.6-day of PandaX-II data (Run 9). We set the upper limits for the spin independent WIMP-nucleon scattering cross section up to a mass splitting of 300 keV/c$^2$ at two benchmark dark matter masses of 1 and 10 TeV/c$^2$.Comment: 5 pages, 6 figure

Tripool : Graph triplet pooling for 3D skeleton-based action recognition

AbstractGraph Convolutional Network (GCN) has already been successfully applied to skeleton-based action recognition. However, current GCNs in this task are lack of pooling operations such that the architectures are inherently flat, which not only increases the computational complexity but also requires larger memory space to keep the entire graph embedding. More seriously, a flat architecture forces the high-level semantic feature representations to have the same physical structure of the low-level input skeletons, which we argue is unreasonable and harmful for the final performance. To address these issues, we propose Tripool, a novel graph pooling method for 3D action recognition from skeleton data. Tripool provides to optimize a triplet pooling loss, in which both graph topology and global graph context are taken into consideration, to learn a hierarchical graph representation. The training process of graph pooling is efficient since it optimizes the graph topology by minimizing an upper bound of the pooling loss. Besides, Tripool also automatically generates an embedding matrix since the graph is changed after pooling. On one hand, Tripool reduces the computational cost by removing the redundant nodes. On the other hand it overcomes the limitation of the topology constrain for the high-level semantic representations, thus improves the final performance. Tripool can be combined with various graph neural networks in an end-to-end fashion. Comprehensive experiments on two current largest scale 3D datasets are conducted to evaluate our method. With our Tripool, we consistently get the best results in terms of various performance measures.Abstract Graph Convolutional Network (GCN) has already been successfully applied to skeleton-based action recognition. However, current GCNs in this task are lack of pooling operations such that the architectures are inherently flat, which not only increases the computational complexity but also requires larger memory space to keep the entire graph embedding. More seriously, a flat architecture forces the high-level semantic feature representations to have the same physical structure of the low-level input skeletons, which we argue is unreasonable and harmful for the final performance. To address these issues, we propose Tripool, a novel graph pooling method for 3D action recognition from skeleton data. Tripool provides to optimize a triplet pooling loss, in which both graph topology and global graph context are taken into consideration, to learn a hierarchical graph representation. The training process of graph pooling is efficient since it optimizes the graph topology by minimizing an upper bound of the pooling loss. Besides, Tripool also automatically generates an embedding matrix since the graph is changed after pooling. On one hand, Tripool reduces the computational cost by removing the redundant nodes. On the other hand it overcomes the limitation of the topology constrain for the high-level semantic representations, thus improves the final performance. Tripool can be combined with various graph neural networks in an end-to-end fashion. Comprehensive experiments on two current largest scale 3D datasets are conducted to evaluate our method. With our Tripool, we consistently get the best results in terms of various performance measures