Parabolic subgroups in FC-type Artin groups

Parabolic subgroups are the building blocks of Artin groups. This paper extends previous results of Cumplido, Gebhardt, Gonzales-Meneses and Wiest, known only for parabolic subgroups of finite type Artin groups, to parabolic subgroups of FC-type Artin groups. We show that the class of finite type parabolic subgroups is closed under intersection. We also study an analog of the curve complex for mapping class group constructed by Cumplido et al. using parabolic subgroups. We extend the construction of this complex, called the complex of parabolic subgroups, to FC-type Artin groups. We show that this simplicial complex is, in most cases, infinite diameter and conjecture that it is δ-hyperbolic.     

On distance-regular Cayley graphs of generalized dicyclic groups

Let G be a generalized dicyclic group with identity 1. An inverse closed subset S of $G?\{1\}$ is called minimal if $〈S〉=G$ and there exists some $s\in S$ such that $〈S?\{s,s^{?1}\}〉\ne G$. In this paper, we characterize distance-regular Cayley graphs $\mathrm{Cay}(G,S)$ of G under the condition that S is minimal.     

SQL注入攻击与防范实验的设计与实现

介绍了SQL注入的原理、攻击和防范技术,并通过设计具体实验方案演示了SQL注入攻击与防范的全过程及细节。通过搭建存在SQL注入漏洞的Web网站并对其进行SQL注入攻击,观察被攻击的效果,进行漏洞修复。对漏洞修复后的系统进行攻击,并对比修复漏洞前后的现象,以此得出SQL注入漏洞的原理、产生原因、对应攻击原理及如何防范漏洞,加深对SQL注入的理解。     

Nucleophilic Activation of Sulfur Hexafluoride by N-Heterocyclic Carbenes and N-Heterocyclic Olefins: A Computational Study

Sulfur hexafluoride (SF₆) is considered as a potent greenhouse gas, whose effective degradation is challenging. Here we report a computational study on the nucleophilic activation of sulfur hexafluoride by N-heterocyclic carbenes and N-heterocyclic olefins. The result shows that the activation of SF₆ is both thermodynamically and kinetically favorable at mild condition using NHOs with fluoro-substituted azolium and sulfur pentafluoride anion being formed. The Gibbs free energy barrier during the activation of SF₆ has a linear relationship with the energy of HOMO of substrates, which could be a guideline for applying those compounds that feature higher energy in HOMO to activate SF₆ in high efficiency.     

Vertex-disjoint rainbow triangles in edge-colored graphs

Let $G$ be an edge-colored graph of order $n$. The minimum color degree of $G$, denoted by ${\delta }^c\left(G\right)$, is the largest integer $k$ such that for every vertex $v$, there are at least $k$ distinct colors on edges incident to $v$. We say that an edge-colored graph is rainbow if all its edges have different colors. In this paper, we consider vertex-disjoint rainbow triangles in edge-colored graphs. Li (2013) showed that if ${\delta }^c\left(G\right)\ge (n+1)∕2$, then $G$ contains a rainbow triangle and the lower bound is tight. Motivated by this result, we prove that if $n\ge 20$ and ${\delta }^c\left(G\right)\ge (n+2)∕2$, then $G$ contains two vertex-disjoint rainbow triangles. In particular, we conjecture that if ${\delta }^c\left(G\right)\ge (n+k)∕2$, then $G$ contains $k$ vertex-disjoint rainbow triangles. For any integer $k\ge 2$, we show that if $n\ge 16k-12$ and ${\delta }^c\left(G\right)\ge n∕2+k-1$, then $G$ contains $k$ vertex-disjoint rainbow triangles. Moreover, we provide sufficient conditions for the existence of $k$ edge-disjoint rainbow triangles.