5-(4-Methyl­phen­yl)-2,3-diphenyl-5,6-dihydro­imidazo[1,2-c]quinazoline

In the title compound, C29H23N3, the pyrimidine ring adopts an envelope conformation. The dihedral angle between the phenyl rings attached to the pyrimidine-ring double bond is 62.09 (7)°. In the crystal, mol­ecules are linked by N—H⋯N hydrogen bonds, forming extended chains in the c-axis directio

2-(4-Methyl­phen­yl)-2H-indazole

The title compound, C14H12N2, was synthesized by the reaction of 4-methyl-N-(2-nitro­benz­yl)aniline with tin(II) chloride dihydrate in ethanol at 313 K. The indazole ring system is almost planar with a dihedral angle of 1.58 (10)° between the rings, whereas the plane of the attached p-tolyl substituent shows a dihedral angle of 46.26 (5)° with respect to the indazole core

Numerical Characterization of DNA Sequence Based on Dinucleotides

Sequence comparison is a primary technique for the analysis of DNA sequences. In order to make quantitative comparisons, one devises mathematical descriptors that capture the essence of the base composition and distribution of the sequence. Alignment methods and graphical techniques (where each sequence is represented by a curve in high-dimension Euclidean space) have been used popularly for a long time. In this contribution we will introduce a new nongraphical and nonalignment approach based on the frequencies of the dinucleotide XY in DNA sequences. The most important feature of this method is that it not only identifies adjacent XY pairs but also nonadjacent XY ones where X and Y are separated by some number of nucleotides. This methodology preserves information in DNA sequence that is ignored by other methods. We test our method on the coding regions of exon-1 of β–globin for 11 species, and the utility of this new method is demonstrated

A Novel Model for DNA Sequence Similarity Analysis Based on Graph Theory

Determination of sequence similarity is one of the major steps in computational phylogenetic studies. As we know, during evolutionary history, not only DNA mutations for individual nucleotide but also subsequent rearrangements occurred. It has been one of major tasks of computational biologists to develop novel mathematical descriptors for similarity analysis such that various mutation phenomena information would be involved simultaneously. In this paper, different from traditional methods (eg, nucleotide frequency, geometric representations) as bases for construction of mathematical descriptors, we construct novel mathematical descriptors based on graph theory. In particular, for each DNA sequence, we will set up a weighted directed graph. The adjacency matrix of the directed graph will be used to induce a representative vector for DNA sequence. This new approach measures similarity based on both ordering and frequency of nucleotides so that much more information is involved. As an application, the method is tested on a set of 0.9-kb mtDNA sequences of twelve different primate species. All output phylogenetic trees with various distance estimations have the same topology, and are generally consistent with the reported results from early studies, which proves the new method\u27s efficiency; we also test the new method on a simulated data set, which shows our new method performs better than traditional global alignment method when subsequent rearrangements happen frequently during evolutionary history

“Follow the Leader”: A Centrality Guided Clustering and Its Application to Social Network Analysis

Within graph theory and network analysis, centrality of a vertex measures the relative importance of a vertex within a graph. The centrality plays key role in network analysis and has been widely studied using different methods. Inspired by the idea of vertex centrality, a novel centrality guided clustering (CGC) is proposed in this paper. Different from traditional clustering methods which usually choose the initial center of a cluster randomly, the CGC clustering algorithm starts from a “LEADER”—a vertex with the highest centrality score—and a new “member” is added into the same cluster as the “LEADER” when some criterion is satisfied. The CGC algorithm also supports overlapping membership. Experiments on three benchmark social network data sets are presented and the results indicate that the proposed CGC algorithm works well in social network clustering

Xuebijing injection alleviates liver injury by inhibiting secretory function of Kupffer cells in heat stroke rats

AbstractObjectiveTo evaluate the effects of Xuebijing (XBJ) injection in heat stroke (HS) rats and to investigate the mechanisms underlying these effects.MethodsSixty anesthetized rats were randomized into three groups and intravenously injected twice daily for 3 days with 4 mL XBJ (XBJ group) or phosphate buffered saline (HS and Sham groups) per kg body weight. HS was initiated in the HS and XBJ groups by placing rats in a simulated climate chamber (ambient temperature 40°C, humidity 60%). Rectal temperature, aterial pressure, and heart rate were monitored and recorded. Time to HS onset and survival were determined, and serum concentrations of tumor necrosis factor (TNF)-α, interleukin (IL)-1β, IL-6, alanine-aminotransferase (ALT), and aspartate-aminotransferase (AST) were measured. Hepatic tissue was harvested for pathological examination and electron microscopic examination. Kupffer cells (KCs) were separated from liver at HS initiation, and the concentrations of secreted TNF-α, IL-β and IL-6 were measured.ResultsTime to HS onset and survival were significantly longer in the XBJ than in the HS group. Moreover, the concentrations of TNF-α, IL-1β, IL-6, ALT and AST were lower and liver injury was milder in the XBJ than in the HS group. Heat-stress induced structural changes in KCs and hepatic cells were more severe in the HS than in the XBJ group and the concentrations of TNF-α, IL-β and IL-6 secreted by KCs were lower in the XBJ than in the HS group.ConclusionXBJ can alleviate HS-induced systemic inflammatory response syndrome and liver injury in rats, and improve outcomes. These protective effects may be due to the ability of XBJ to inhibit cytokine secretion by KCs

Autonomous Navigation and Configuration of Integrated Access Backhauling for UAV Base Station Using Reinforcement Learning

Fast and reliable connectivity is essential to enhancing situational awareness and operational efficiency for public safety mission-critical (MC) users. In emergency or disaster circumstances, where existing cellular network coverage and capacity may not be available to meet MC communication demands, deployable-network-based solutions such as cells-on-wheels/wings can be utilized swiftly to ensure reliable connection for MC users. In this paper, we consider a scenario where a macro base station (BS) is destroyed due to a natural disaster and an unmanned aerial vehicle carrying BS (UAV-BS) is set up to provide temporary coverage for users in the disaster area. The UAV-BS is integrated into the mobile network using the 5G integrated access and backhaul (IAB) technology. We propose a framework and signalling procedure for applying machine learning to this use case. A deep reinforcement learning algorithm is designed to jointly optimize the access and backhaul antenna tilt as well as the three-dimensional location of the UAV-BS in order to best serve the on-ground MC users while maintaining a good backhaul connection. Our result shows that the proposed algorithm can autonomously navigate and configure the UAV-BS to improve the throughput and reduce the drop rate of MC users.Comment: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessibl

“Follow the Leader”: A Centrality Guided Clustering and Its Application to Social Network Analysis

Within graph theory and network analysis, centrality of a vertex measures the relative importance of a vertex within a graph. The centrality plays key role in network analysis and has been widely studied using different methods. Inspired by the idea of vertex centrality, a novel centrality guided clustering (CGC) is proposed in this paper. Different from traditional clustering methods which usually choose the initial center of a cluster randomly, the CGC clustering algorithm starts from a “LEADER”—a vertex with the highest centrality score—and a new “member” is added into the same cluster as the “LEADER” when some criterion is satisfied. The CGC algorithm also supports overlapping membership. Experiments on three benchmark social network data sets are presented and the results indicate that the proposed CGC algorithm works well in social network clustering