Exploration Trade-offs in Web Recommender Systems

One of the main problems of web recommender systems is exposure bias, due to the fact that the web system itself is partly generating its own future, as users can only click on items shown to them. This bias not only creates popularity bias for products but also is one of the main challenges for recommender systems that deal with a very dynamic environment, where new items and users appear frequently and also user preferences change (or the market changes as happened with the coronavirus pandemic). The main paradigm to deal with these changes is to explore and exploit, avoiding the filter bubble effect. However, too much exploration also reduces short-term revenue and hence is usually traffic bounded. In this work, we present a counterfactual analysis that shows that web recommender systems could improve their long-term revenue if significantly more exploration is performed. This is good for the web recommender system but also for everyone as it creates more fair and healthy digital markets. This also improves the web user experience so is a double win-win for the e-commerce platform, the sellers, the users, and ultimately society

Ranking structured documents using utility theory in the Bayesian network retrieval model

In this paper a new method based on Utility and Decision theory is presented to deal with structured documents. The aim of the application of these methodologies is to refine a first ranking of structural units, generated by means of an Information Retrieval Model based on Bayesian Networks. Units are newly arranged in the new ranking by combining their posterior probabilities, obtained in the first stage, with the expected utility of retrieving them. The experimental work has been developed using the Shakespeare structured collection and the results show an improvement of the effectiveness of this new approach

Protandric Simultaneous Hermaphroditism in Parhippolyte Misticia (Clark, 1989) (Caridea: Hippolytidae): Implications for the Evolution of Mixed Sexual Systems in Shrimp

The sexual system of the shrimp Parhippolyte misticia (Clark, 1989), inhabiting the rocky subtidal at Okinawa, Japan and Kimbe Bay, Papua New Guinea, was examined. Dissections suggested that the population consisted of male phase (MP) and functional simultaneous euhermaphrodite (EH) individuals. MPs have cincinulli and appendices masculinae on the first and second pair of pleopods, respectively, gonopores located at the coxae of the third pair of walking legs, and ovotestes with a well-developed male portion containing sperm, but an undeveloped female portion. EHs lacked appendices masculinae and cincinulli. However, they have male gonopores and ovotestes with well-developed ovaries containing mature oocytes and testes with sperm. When EHs were maintained in pairs, both shrimp molted and spawned eggs which attached below the pleon and developed as embryos, demonstrating that EHs can reproduce as males and inseminate other Elis acting as females. These results demonstrate that P misticia is a protandric simultaneous hermaphrodite, as reported before for other shrimp of the genera Lysmata and Exhippolysmata. Also, these results suggest that protandric simultaneous hermaphroditism might have evolved more than once independently in shrimp from the diverse and species-rich Infraorder Caridea. Future research aimed at disentangling the phylogenetic relationship of Parhippolyte, Lysmata, Exhippolysmata and other closely related genera (Calliasmata, Lysmatella, Barbouria) and describing the sociobiology of additional representatives from the genera above is needed to understand the evolutionary history of sexual systems in caridean shrimp. © The Crustacean Society, 2012

The impact of using combinatorial optimisation for static caching of posting lists

Abstract. Caching posting lists can reduce the amount of disk I/O required to evaluate a query. Current methods use optimisation proce-dures for maximising the cache hit ratio. A recent method selects posting lists for static caching in a greedy manner and obtains higher hit rates than standard cache eviction policies such as LRU and LFU. However, a greedy method does not formally guarantee an optimal solution. We investigate whether the use of methods guaranteed, in theory, to find an approximately optimal solution would yield higher hit rates. Thus, we cast the selection of posting lists for caching as an integer linear pro-gramming problem and perform a series of experiments using heuristics from combinatorial optimisation (CCO) to find optimal solutions. Using simulated query logs we find that CCO yields comparable results to a greedy baseline using cache sizes between 200 and 1000 MB, with modest improvements for queries of length two to three

Fast Searching in Packed Strings

Given strings $P$ and $Q$ the (exact) string matching problem is to find all positions of substrings in $Q$ matching $P$. The classical Knuth-Morris-Pratt algorithm [SIAM J. Comput., 1977] solves the string matching problem in linear time which is optimal if we can only read one character at the time. However, most strings are stored in a computer in a packed representation with several characters in a single word, giving us the opportunity to read multiple characters simultaneously. In this paper we study the worst-case complexity of string matching on strings given in packed representation. Let $m \leq n$ be the lengths $P$ and $Q$, respectively, and let $\sigma$ denote the size of the alphabet. On a standard unit-cost word-RAM with logarithmic word size we present an algorithm using time O\left(\frac{n}{\log_\sigma n} + m + \occ\right). Here \occ is the number of occurrences of $P$ in $Q$. For $m = o(n)$ this improves the $O(n)$ bound of the Knuth-Morris-Pratt algorithm. Furthermore, if $m = O(n/\log_\sigma n)$ our algorithm is optimal since any algorithm must spend at least \Omega(\frac{(n+m)\log \sigma}{\log n} + \occ) = \Omega(\frac{n}{\log_\sigma n} + \occ) time to read the input and report all occurrences. The result is obtained by a novel automaton construction based on the Knuth-Morris-Pratt algorithm combined with a new compact representation of subautomata allowing an optimal tabulation-based simulation.Comment: To appear in Journal of Discrete Algorithms. Special Issue on CPM 200

Reseña: Contra-Explosión Marshall McLuhan

Se ha comprobado que la cultura patriarcal de la sociedad chilena y su carácter de sociedad neoconservadora, es la principal herencia de los roles sociales del hombre y la mujer, que se han constituido como producto de relaciones de poder y creencias que se tenían de estos; hoy en día estos roles se han visto envueltos en un cambio sustancial en el tiempo, que no ha sido representado del todo en la comunicación publicitaria.¿Qué sucede si la publicidad no representa la realidad de la sociedad y omite ciertas construcciones sociales de los roles del hombre, dando lugar a la Discriminación Publicitaria Masculina

Correlations between structure and dynamics in complex networks

Previous efforts in complex networks research focused mainly on the topological features of such networks, but now also encompass the dynamics. In this Letter we discuss the relationship between structure and dynamics, with an emphasis on identifying whether a topological hub, i.e. a node with high degree or strength, is also a dynamical hub, i.e. a node with high activity. We employ random walk dynamics and establish the necessary conditions for a network to be topologically and dynamically fully correlated, with topological hubs that are also highly active. Zipf's law is then shown to be a reflection of the match between structure and dynamics in a fully correlated network, as well as a consequence of the rich-get-richer evolution inherent in scale-free networks. We also examine a number of real networks for correlations between topology and dynamics and find that many of them are not fully correlated.Comment: 16 pages, 7 figures, 1 tabl

Revisiting the Problem of Searching on a Line

We revisit the problem of searching for a target at an unknown location on a line when given upper and lower bounds on the distance D that separates the initial position of the searcher from the target. Prior to this work, only asymptotic bounds were known for the optimal competitive ratio achievable by any search strategy in the worst case. We present the first tight bounds on the exact optimal competitive ratio achievable, parameterized in terms of the given bounds on D, along with an optimal search strategy that achieves this competitive ratio. We prove that this optimal strategy is unique. We characterize the conditions under which an optimal strategy can be computed exactly and, when it cannot, we explain how numerical methods can be used efficiently. In addition, we answer several related open questions, including the maximal reach problem, and we discuss how to generalize these results to m rays, for any m >= 2

Optimisation of patch distribution strategies for AMR applications

As core counts increase in the world's most powerful supercomputers, applications are becoming limited not only by computational power, but also by data availability. In the race to exascale, efficient and effective communication policies are key to achieving optimal application performance. Applications using adaptive mesh refinement (AMR) trade off communication for computational load balancing, to enable the focused computation of specific areas of interest. This class of application is particularly susceptible to the communication performance of the underlying architectures, and are inherently difficult to scale efficiently. In this paper we present a study of the effect of patch distribution strategies on the scalability of an AMR code. We demonstrate the significance of patch placement on communication overheads, and by balancing the computation and communication costs of patches, we develop a scheme to optimise performance of a specific, industry-strength, benchmark application