As an alternative to existing techniques and algorithms, we investigate the merit of the H∞ approach to the linear equalization of communication channels. We first give the formulation of all causal H∞ equalizers using the results of [1] and then look at the finite delay case. We compare the risk sensitive, H∞ equalizer with the MMSE equalizer with respect to both the average and the worst case...

The dominant methodology for short-term forecasting of electoral outcomes uses trial-heat polls, where respondents report their current electoral preferences (not their election-day predictions). Election markets, where self-selected participants trade shares of candidates at prices predictive of election-day results, provide an alternative method that often produces more accurate forecasts. Co...

We revisit the classic problem of estimating the population mean of an unknown singledimensional distribution from samples, taking a game-theoretic viewpoint. In our setting, samples are supplied by strategic agents, who wish to pull the estimate as close as possible to their own value. In this setting, the sample mean gives rise to manipulation opportunities, whereas the sample median does not...

Pricing mechanisms employed by different service providers significantly influence the role of cloud computing within the IT industry. With the increasing cost of electricity, Cloud providers consider power consumption as one of the major cost factors to be maintained within their infrastructures. Consequently, modelling a new pricing mechanism that allow Cloud providers to determine the potent...

The worst-case position error provides valuable information for efficiently designing location based services in wireless networks. In this study, a technique based on a geometric approach is investigated for deriving a reasonable upper bound on the position error in bearingonly target localization. Assuming bounded measurement errors, it is first observed that the target node location belongs ...

Definition: CCρ(f) ≥ s if s-sized circuits can compute f with probability at most ρ for a random input. That is, for every circuit family {Cn} with |Cn| ≤ s(n), Prx←R{0,1}n [Cn(x) = f(x)] < ρ. If CC1−1/(100n)(f) ≥ s we say that f is “mildly hard on the average” for s-sized circuits (every circuit will fail on a 1/(100n) fraction of the inputs) and if CC1(f) ≥ s we say that f is “worst-case hard...

In this paper, we use the house price data ranging from January 2004 to October 2016 to predict the average house price of November and December in 2016 for each district in Beijing, Shanghai, Guangzhou and Shenzhen. We apply Autoregressive Integrated Moving Average model to generate the baseline while LSTM networks to build prediction model. These algorithms are compared in terms of Mean Squar...

Dot maps—drawings of point sets—are a well known cartographic method to visualize density functions over an area. We study the problem of simplifying a given dot map: given a set P of points in the plane, we want to compute a smaller set Q of points whose distribution approximates the distribution of the original set P . We formalize this using the concept of ε-approximations, and we give effic...

This paper describes a low cost error control scheme for transmission control based real time communica tion especially for TDMA implemented Ethernet As the bandwidth allocation scheme decides the capacity vector or slot time based on the worst case condi tion there is usually extra available transmission time for each message stream The proposed error control scheme uses this extra bandwidth f...

We derive simple formulas bounding and approximating the throughput of an end-of-aisle miniload system with exponentially distributed pick times and either uniform or turnover-based storage. For typical configurations, the worst case relative error for the bounds is less than 4%. We use our bounds to show that , for all practical purposes, regardless of the configuration, the picker utilization...