Mark Thom

Mark Thom

Auto-generated profile, based on publicly available information

Mark Thom

In memory of Kevin Henriot

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2015 in Theoretical Computer Science
Verified
Journal Article
Open access
SASelim Akl
Selim Akl
RBRobert Benkoczi
Robert Benkoczi
DGDaya Ram Gaur
Daya Ram Gaur
HHHossam Hassanein
Hossam Hassanein
SHShahadat Hossain
Shahadat Hossain
MTMark Thom
Mark Thom
We consider the problem of allocating clients to base stations in wireless networks. Two design decisions are the location of the base stations, and the power levels of the base stations. We model the interference, due to the increased power usage resulting in greater serving radius, as capacities that are non-increasing with respect to the covering radius. Clients have demands that are not necessarily uniform and the capacity of a facility limits the total demand that can be served by the facility. We consider three models. In the first model, the location of the base stations and the clients are fixed, and the problem is to determine the serving radius for each base station so as to serve a set of clients with maximum total profit subject to the capacity constraints of the base stations. In the second model, each client has an associated demand in addition to its profit. A fixed number of facilities have to be opened from a candidate set of locations. The goal is to serve clients so as to maximize the profit subject to the capacity constraints. In the third model, the location and the serving radius of the base stations are to be determined. There are costs associated with opening the base stations, and the goal is to open a set of base stations of minimum total cost so as to serve the entire demand subject to the capacity constraints at the base stations. We show that for the first model the problem is NP-complete even when there are only two choices for the serving radius, and the capacities are 1,2. For the second model, we give a 1/2 approximation algorithm. For the third model, we give a column generation procedure for solving the standard linear programming model, and a randomized rounding procedure. We establish the efficacy of the column generation based rounding scheme on randomly generated instances

18 May 2017 in arXiv
Verified
Preprint
Open access
PDF file
NNNathan Ng
Nathan Ng
MTMark Thom
Mark Thom
Additive divisor sums play a prominent role in the theory of the moments of the Riemann zeta function. There is a long history of determining sharp asymptotic formula for the shifted convolution sum of the ordinary divisor function. In recent years, it has emerged that a sharp asymptotic formula for the shifted convolution sum of the triple divisor function would be useful in evaluating the sixth moment of the Riemann zeta function. In this article, we study $D_{k,\ell}(x) = \sum_{n \le x} \tau_k(n) \tau_{\ell}(n+h)$ where $\tau_k$ and $\tau_{\ell}$ are the $k$-th and $\ell$-th divisor functions. The main result is a lower bound of the correct order of magnitude for $D_{k,\ell}(x,h)$, uniform in $h$. In addition, the conjectural asymptotic formula for $D_{k,\ell}(x,h)$ is studied. Using an argument of Ivi\'{c} and Conrey-Gonek the leading term in the conjectural asymptotic formula is simplified. In addition, a probabilistic method is presented which gives the same leading term. Finally, we show that these two methods give the same answer as in a recent probabilistic argument of Terry Tao.