Learn More
Let m and t be positive integers with t ≥ 2. An (m, t)-splitting system is a pair (X, B) where |X| = m and B is a collection of subsets of X called blocks, such that, for every Y ⊆ X with |Y | = t, there exists a block B ∈ B such that |B ∩ Y | = t 2. An (m, t)-splitting system is uniform if every block has size m 2. In this paper, we give several(More)
Space-filling visualizations, such as the TreeMap, are well-suited for displaying the properties of nodes in hierarchies. To browse the contents of the hierarchy, the primary mode of interaction is by drilling-down through many successive layers. In this paper we introduce a distortion algorithm based on fisheye and continuous zooming techniques for(More)
Suppose m and t are integers such that 0 < t ≤ m. An (m, t) splitting system is a pair (X, B) where |X| = m, B is a set of m 2 subsets of X, called blocks such that for every Y ⊆ X and |Y | = t, there exists a block B ∈ B such that |B ∩ Y | = t 2 or |(X \ B) ∩ Y | = t 2. We will give some results on splitting systems for t = 2 or 4 which often depend on(More)
Glioblastoma (GBM) represents one of most common tumors in humans. However, the biological processes and molecular mechanisms of GBM are still unclear. It is known that microRNA-520b (miR-520b) participates in the development of various tumor progressions. The present study was to evaluate the level of miR-520b in GBM tissues and cells. We further(More)
The aim of this study was to elucidate the regulatory role of androgen in the follicular development of wild female ground squirrels. Immunohistochemical staining of FSHR, LHR, P450c17, P450arom, androgen receptor (AR), estrogen receptors (ERa and ERb) were executed in ovaries of female ground squirrels from both breeding and nonbreeding seasons. In(More)
A binary string B of length n = kt is a k-ary Dyck word if it contains t copies of 1, and the number of 0s in every prefix of B is at most k−1 times the number of 1s. We provide two loopless algorithms for generating k-ary Dyck words in cool-lex order: (1) The first requires two index variables and assumes k is a constant; (2) The second requires t index(More)
For any given k, the sequence of k-ary Catalan numbers, C t,k = 1 kt+1 kt t , enumerates a number of combinatorial objects, including k-ary Dyck words of length n = kt and k-ary trees with t internal nodes. We show that these objects can be efficiently ordered using the same variation of lexicographic order known as cool-lex order. In particular, we provide(More)