5 resultados para decomposition rank


Relevância:

20.00% 20.00%

Publicador:

Resumo:

A search query, being a very concise grounding of user intent, could potentially have many possible interpretations. Search engines hedge their bets by diversifying top results to cover multiple such possibilities so that the user is likely to be satisfied, whatever be her intended interpretation. Diversified Query Expansion is the problem of diversifying query expansion suggestions, so that the user can specialize the query to better suit her intent, even before perusing search results. We propose a method, Select-Link-Rank, that exploits semantic information from Wikipedia to generate diversified query expansions. SLR does collective processing of terms and Wikipedia entities in an integrated framework, simultaneously diversifying query expansions and entity recommendations. SLR starts with selecting informative terms from search results of the initial query, links them to Wikipedia entities, performs a diversity-conscious entity scoring and transfers such scoring to the term space to arrive at query expansion suggestions. Through an extensive empirical analysis and user study, we show that our method outperforms the state-of-the-art diversified query expansion and diversified entity recommendation techniques.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Demand response (DR) algorithms manipulate the energy consumption schedules of controllable loads so as to satisfy grid objectives. Implementation of DR algorithms using a centralized agent can be problematic for scalability reasons, and there are issues related to the privacy of data and robustness to communication failures. Thus, it is desirable to use a scalable decentralized algorithm for the implementation of DR. In this paper, a hierarchical DR scheme is proposed for peak minimization based on Dantzig-Wolfe decomposition (DWD). In addition, a time weighted maximization option is included in the cost function, which improves the quality of service for devices seeking to receive their desired energy sooner rather than later. This paper also demonstrates how the DWD algorithm can be implemented more efficiently through the calculation of the upper and lower cost bounds after each DWD iteration.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper studies the energy efficiency (EE) of a point-to-point rank-1 Ricean fading multiple-input-multiple-output (MIMO) channel. In particular, a tight lower bound and an asymptotic approximation for the EE of the considered MIMO system are presented, under the assumption that the channel is unknown at the transmitter and perfectly known at the receiver. Moreover, the effects of different system parameters, namely, transmit power, spectral efficiency (SE), and number of transmit and receive antennas, on the EE are analytically investigated. An important observation is that, in the high signal-to-noise ratio regime and with the other system parameters fixed, the optimal transmit power that maximizes the EE increases as the Ricean-K factor increases. On the contrary, the optimal SE and the optimal number of transmit antennas decrease as K increases.