33,660 research outputs found
A New Cell Association Scheme In Heterogeneous Networks
Cell association scheme determines which base station (BS) and mobile user
(MU) should be associated with and also plays a significant role in determining
the average data rate a MU can achieve in heterogeneous networks. However, the
explosion of digital devices and the scarcity of spectra collectively force us
to carefully re-design cell association scheme which was kind of taken for
granted before. To address this, we develop a new cell association scheme in
heterogeneous networks based on joint consideration of the
signal-to-interference-plus-noise ratio (SINR) which a MU experiences and the
traffic load of candidate BSs1. MUs and BSs in each tier are modeled as several
independent Poisson point processes (PPPs) and all channels experience
independently and identically distributed ( i.i.d.) Rayleigh fading. Data rate
ratio and traffic load ratio distributions are derived to obtain the tier
association probability and the average ergodic MU data rate. Through numerical
results, We find that our proposed cell association scheme outperforms cell
range expansion (CRE) association scheme. Moreover, results indicate that
allocating small sized and high-density BSs will improve spectral efficiency if
using our proposed cell association scheme in heterogeneous networks.Comment: Accepted by IEEE ICC 2015 - Next Generation Networking Symposiu
A Bayesian Clearing Mechanism for Combinatorial Auctions
We cast the problem of combinatorial auction design in a Bayesian framework
in order to incorporate prior information into the auction process and minimize
the number of rounds to convergence. We first develop a generative model of
agent valuations and market prices such that clearing prices become maximum a
posteriori estimates given observed agent valuations. This generative model
then forms the basis of an auction process which alternates between refining
estimates of agent valuations and computing candidate clearing prices. We
provide an implementation of the auction using assumed density filtering to
estimate valuations and expectation maximization to compute prices. An
empirical evaluation over a range of valuation domains demonstrates that our
Bayesian auction mechanism is highly competitive against the combinatorial
clock auction in terms of rounds to convergence, even under the most favorable
choices of price increment for this baseline.Comment: 9 pages, 4 figures, AAAI-1
Sampling Online Social Networks via Heterogeneous Statistics
Most sampling techniques for online social networks (OSNs) are based on a
particular sampling method on a single graph, which is referred to as a
statistics. However, various realizing methods on different graphs could
possibly be used in the same OSN, and they may lead to different sampling
efficiencies, i.e., asymptotic variances. To utilize multiple statistics for
accurate measurements, we formulate a mixture sampling problem, through which
we construct a mixture unbiased estimator which minimizes asymptotic variance.
Given fixed sampling budgets for different statistics, we derive the optimal
weights to combine the individual estimators; given fixed total budget, we show
that a greedy allocation towards the most efficient statistics is optimal. In
practice, the sampling efficiencies of statistics can be quite different for
various targets and are unknown before sampling. To solve this problem, we
design a two-stage framework which adaptively spends a partial budget to test
different statistics and allocates the remaining budget to the inferred best
statistics. We show that our two-stage framework is a generalization of 1)
randomly choosing a statistics and 2) evenly allocating the total budget among
all available statistics, and our adaptive algorithm achieves higher efficiency
than these benchmark strategies in theory and experiment
A MDE-based optimisation process for Real-Time systems
The design and implementation of Real-Time Embedded Systems is now heavily relying on Model-Driven Engineering (MDE) as a central place to define and then analyze or implement a system. MDE toolchains are taking a key role as to gather most of functional and not functional properties in a central framework, and then exploit this information. Such toolchain is based on both 1) a modeling notation, and 2) companion tools to transform or analyse models. In this paper, we present a MDE-based process for system optimisation based on an architectural description. We first define a generic evaluation pipeline, define a library of elementary transformations and then shows how to use it through Domain-Specific Language to evaluate and then transform models. We illustrate this process on an AADL case study modeling a Generic Avionics Platform
Seamlessly Unifying Attributes and Items: Conversational Recommendation for Cold-Start Users
Static recommendation methods like collaborative filtering suffer from the
inherent limitation of performing real-time personalization for cold-start
users. Online recommendation, e.g., multi-armed bandit approach, addresses this
limitation by interactively exploring user preference online and pursuing the
exploration-exploitation (EE) trade-off. However, existing bandit-based methods
model recommendation actions homogeneously. Specifically, they only consider
the items as the arms, being incapable of handling the item attributes, which
naturally provide interpretable information of user's current demands and can
effectively filter out undesired items. In this work, we consider the
conversational recommendation for cold-start users, where a system can both ask
the attributes from and recommend items to a user interactively. This important
scenario was studied in a recent work. However, it employs a hand-crafted
function to decide when to ask attributes or make recommendations. Such
separate modeling of attributes and items makes the effectiveness of the system
highly rely on the choice of the hand-crafted function, thus introducing
fragility to the system. To address this limitation, we seamlessly unify
attributes and items in the same arm space and achieve their EE trade-offs
automatically using the framework of Thompson Sampling. Our Conversational
Thompson Sampling (ConTS) model holistically solves all questions in
conversational recommendation by choosing the arm with the maximal reward to
play. Extensive experiments on three benchmark datasets show that ConTS
outperforms the state-of-the-art methods Conversational UCB (ConUCB) and
Estimation-Action-Reflection model in both metrics of success rate and average
number of conversation turns.Comment: TOIS 202
- …