Open Access. Powered by Scholars. Published by Universities.®

Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 3 of 3

Full-Text Articles in Mathematics

On Communication For Distributed Babai Point Computation, Maiara F. Bollauf, Vinay A. Vaishampayan, Sueli I.R. Costa Jul 2021

On Communication For Distributed Babai Point Computation, Maiara F. Bollauf, Vinay A. Vaishampayan, Sueli I.R. Costa

Publications and Research

We present a communication-efficient distributed protocol for computing the Babai point, an approximate nearest point for a random vector X∈Rn in a given lattice. We show that the protocol is optimal in the sense that it minimizes the sum rate when the components of X are mutually independent. We then investigate the error probability, i.e. the probability that the Babai point does not coincide with the nearest lattice point, motivated by the fact that for some cases, a distributed algorithm for finding the Babai point is sufficient for finding the nearest lattice point itself. Two different probability models for X …


Recent Trends In The Frequency And Duration Of Global Floods, Nasser Najibi, Naresh Devineni Jun 2018

Recent Trends In The Frequency And Duration Of Global Floods, Nasser Najibi, Naresh Devineni

Publications and Research

Frequency and duration of floods are analyzed using the global flood database of the Dartmouth Flood Observatory (DFO) to explore evidence of trends during 1985–2015 at global and latitudinal scales. Three classes of flood duration (i.e., short: 1–7, moderate: 8–20, and long: 21 days and above) are also considered for this analysis. The nonparametric Mann–Kendall trend analysis is used to evaluate three hypotheses addressing potential monotonic trends in the frequency of flood, moments of duration, and frequency of specific flood duration types. We also evaluated if trends could be related to large-scale atmospheric teleconnections using a generalized linear model framework. …


Scheduling And Resource Allocation In Wireless Sensor Networks, Yosef Alayev Feb 2014

Scheduling And Resource Allocation In Wireless Sensor Networks, Yosef Alayev

Dissertations, Theses, and Capstone Projects

In computer science and telecommunications, wireless sensor networks are an active research area. Each sensor in a wireless sensor network has some pre-defined or on demand tasks such as collecting or disseminating data. Network resources, such as broadcast channels, number of sensors, power, battery life, etc., are limited. Hence, a schedule is required to optimally allocate network resources so as to maximize some profit or minimize some cost. This thesis focuses on scheduling problems in the wireless sensor networks environment. In particular, we study three scheduling problems in the wireless sensor networks: broadcast scheduling, sensor scheduling for area monitoring, and …