Yuansheng Yang

Learn More
The multicolor Ramsey number rk(C4) is the smallest integer n for which any k-coloring of the edges of the complete graph Kn must produce a monochromatic 4-cycle. In [6] and [3] it was proved that rk(C4) ≥ k2−k+2 for k − 1 being a prime power. In this note we establish rk(C4) ≥ k2 + 2 for k being an odd prime power. ( Journal of Combinatorial Theory, Series(More)
A graph G is dot-critical if contracting any edge decreases the domination number. It is totally dot-critical if identifying any two vertices decreases the domination number. Burton and Sumner [Discrete Math. 306 (2006) 11–18] posed the problem: Is it true that for k 4, there exists a totally k-dot-critical graph with no critical vertices? In this paper, we(More)
A 96-well plate assay has been devised for estimation of sublethal metabolic activity for compounds administered to in vitro cell cultures during 6- and 24-h exposures. This screen combines a resazurin reduction assay with lactate production and glucose consumption rate assays to assess effects of compounds on both culture viability and metabolic(More)
In this paper, we present a machine learning approach that detects hedge cues and their scope in biomedical texts. Identifying hedged information in texts is a kind of semantic filtering of texts and it is important since it could extract speculative information from factual information. In order to deal with the semantic analysis problem, various(More)