Hierarchical Cache-Aided Networks for Linear Function Retrieval.

In a hierarchical caching system, a server is connected to multiple mirrors, each of which is connected to a different set of users, and both the mirrors and the users are equipped with caching memories. All the existing schemes focus on single file retrieval, i.e.

Matroidal Entropy Functions: A Quartet of Theories of Information, Matroid, Design, and Coding.

In this paper, we study the entropy functions on extreme rays of the polymatroidal region which contain a matroid, i.e., matroidal entropy functions.

Finding motifs in DNA sequences using low-dispersion sequences.

Motif finding problems, abstracted as the planted (l, d)-motif finding problem, are a major task in molecular biology--finding functioning units and genes. In 2002, the random projection algorithm was introduced to solve the challenging (15, 4)-motif finding problem by using randomly chosen templates. Two years later, a so-called uniform projection algorithm was developed to improve the random projection algorithm by means of low-dispersion sequences generated by coverings.