Abstract:
Objective: To evaluate the safety and efficacy of Wuling Capsule combined with Deanxit in treating post-stroke depression (PSD).Methods: One hundred and fourteen patients with PSD were randomly divided into Wuling Capsule-treated group (n=39), Deanxit-treated group (n=37) and Wuling Capsule plus Deanxit-treated group (n=38). Patients in Wuling Capsule-treated group were administered with three Wuling Capsules three times a day, and patients in Deanxit-treated group were administered with Deanxit 10.5 mg twice daily, while patients in the Wuling Capsule plus Deanxit-treated group were administered with both Wuling Capsule and Deanxit. Patients in the three groups were all treated for six weeks. Treatment efficacy was evaluated with Hamilton Depression Scale (HAMD) and the side effects were evaluated with Treatment Emergent Symptom Scale (TESS) before treatment and after 2-, 4-, and 6-week treatment. The blood and urine routine examinations were performed, and the hepatorenal functions and electrocardiogram were examined as well.Results: There was no statistical difference in the total efficacy rate between Wuling Capsule-treated group and Deanxit-treated group (64.1% vs 64.9%, P>0.05), but the total efficacy rate of Wuling Capsule plus Deanxit-treated group was higher than that of the monotherapy (89.5% vs 64.1%, 89.5% vs 64.9%, P<0.05). There were no significant side effects in Wuling Capsule-treated group, while the incidence of side effects was 9% in both groups administered with Deanxit.Conclusion: The efficacy of Wuling Capsule plus Deanxit is better than that of the monotherapy in treating PSD.

Abstract:
The title compound, C9H11NO, crystallizes with two independent but essentially identical molecules in the asymmetric unit, which are linked via a C—H...π interaction. In both molecules, the aldehyde and dimethylamine groups are essentially coplanar with the attached benzene ring. In the crystal structure, C—H...O hydrogen bonds link one type of independent molecules into a chain along the a axis. In addition, the structure is stabilized by π–π stacking interactions involving the benzene rings [centroid-to-centroid distance = 3.697 (2) ].

Abstract:
Wu, Zhang and Li [4] conjectured that the set of vertices of any simple graph $G$ can be equitably partitioned into $\lceil(\Delta(G)+1)/2\rceil$ subsets so that each of them induces a forest of $G$. In this note, we prove this conjecture for graphs $G$ with $\Delta(G)\geq |G|/2$.

Abstract:
Should all concrete administration acts violating the legal administration procedure be revoked This has been a disputed issue in the field of law. The article defines the connotation and denotation of the “legal procedure”, and according to the purposes of the enactment of administration procedure, it raises a distinction between the legal administration procedure in broad sense and that in narrow sense. Finally, in the author's theory, all concrete administration against the legal procedure should be revoked.

Abstract:
In order to solve large-scale one-dimensional cutting stock problem of calculating difficulties, according to the characteristics of one-dimensional cutting stock problem, the author used random search technology to improve the greedy algorithm and put forward a kind of simple and practical classification method named AB. Experiments show that the algorithm for larger problems can quickly obtain the optimal solution or approximate optimal solution with high accuracy.

Abstract:
A (1,{\lambda})-embedded graph is a graph that can be embedded on a surface with Euler characteristic {\lambda} so that each edge is crossed by at most one other edge. A graph G is called {\alpha}-linear if there exists an integral constant {\beta} such that e(G') \leq {\alpha} v(G')+{\beta} for each G'\subseteq G. In this paper, it is shown that every (1,{\lambda})-embedded graph G is 4-linear for all possible {\lambda}, and is acyclicly edge-(3{\Delta}(G)+70)-choosable for {\lambda}=1,2.

Abstract:
A graph is called 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we establish a local property of 1-planar graphs which describes the structure in the neighborhood of small vertices (i.e. vertices of degree no more than seven). Meanwhile, some new classes of light graphs in 1-planar graphs with the bounded degree are found. Therefore, two open problems presented by Fabrici and Madaras [The structure of 1-planar graphs, Discrete Mathematics, 307, (2007), 854-865] are solved. Furthermore, we prove that each 1-planar graph $G$ with maximum degree $\Delta(G)$ is acyclically edge $L$-choosable where $L=\max\{2\Delta(G)-2,\Delta(G)+83\}$.

Abstract:
For two positive integers $r$ and $s$ with $r\geq 2s-2$, if $G$ is a graph of order $3r+4s$ such that $d(x)+d(y)\geq 4r+4s$ for every $xy\not\in E(G)$, then $G$ independently contains $r$ triangles and $s$ quadrilaterals, which partially prove the El-Zahar's Conjecture.