No abstract

a b s t r a c tThe water quality of Feng-qing Lake, which is a landscape lake supplemented with reclaimed water, was surveyed to investigate the relationship between phytoplankton and environmental variables. A total of 29 water samples were collected to analyze temporal variations of phytoplankton and environmental factors from July 2013 to June 2014. Six phyla and 39 genera of phytoplankton were identified when the lake was supplied with reclaimed water. Among these, Cyanophyta and Chlorophyta account for 38.46% and 30.77% of phytoplankton, respectively. The dominant species in the lake are Pseudanabaena limnetica and Chlorella vulgaris, which are present the entire year. Other leading species include Cosmarium sp. and Raphidiopsis curvata. Principal component analysis (PCA) was conducted to analyze the relationship among environmental factors. Canonical correspondence analysis (CCA) was performed to investigate the relationship between environment factors and dominant species. The PCA result showed that temperature (T), total phosphorus (TP), total nitrogen (TN), transparency, and dissolved oxygen are the main factors that affect the eutrophication level of the lake. The CCA result revealed that TN, PO 4 3− -P, chemical oxygen demand (COD), T, and chlorophyll a exhibit a close relation with dominant species. In particular, TN, salinity, and COD influence the growth of P. limnetica; T and COD influence the growth of R. curvata; and T, PO 4 3− -P, NH 3 -N, and pH influence the growth of C. vulgaris and Cosmarium sp.

No abstract

A pattern is a string consisting of variables and terminal symbols, and its language is the set of all words that can be obtained by substituting arbitrary words for the variables. The membership problem for pattern languages, i. e., deciding on whether or not a given word is in the pattern language of a given pattern is NP-complete. We show that any parameter of patterns that is an upper bound for the treewidth of appropriate encodings of patterns as relational structures, if restricted, allows the membership problem for pattern languages to be solved in polynomial time. Furthermore, we identify new such parameters.

No abstract