Movie recommendations based in explicit and implicit features extracted from the filmtipset dataset

This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in CAMRa '10 Proceedings of the Workshop on Context-Aware Movie Recommendation, http://dx.doi.org/10.1145/1869652.1869660In this paper, we describe the experiments conducted by the Information Retrieval Group at the Universidad Autónoma de Madrid (Spain) in order to better recommend movies for the 2010 CAMRa Challenge edition. Experiments were carried out on the dataset corresponding to social Filmtipset track. To obtain the movies recommendations we have used different algorithms based on Random Walks, which are well documented in the literature of collaborative recommendation. We have also included a new proposal in one of the algorithms in order to get better results. The results obtained have been computed by means of the trec_eval standard NIST evaluation procedure.This research was supported by the Spanish Ministry of Science and Innovation (TIN2008-06566-C04-02) and the Scientific Computing Institute at UAM. The third author also wants to acknowledge support from the Chilean Government through the Becas-Chile scholarship progra

An empirical comparison of social, collaborative filtering, and hybrid recommenders

This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in ACM Transactions on Intelligent Systems and Technology, http://dx.doi.org/10.1145/2414425.2414439In the Social Web, a number of diverse recommendation approaches have been proposed to exploit the user generated contents available in the Web, such as rating, tagging, and social networking information. In general, these approaches naturally require the availability of a wide amount of these user preferences. This may represent an important limitation for real applications, and may be somewhat unnoticed in studies focusing on overall precision, in which a failure to produce recommendations gets blurred when averaging the obtained results or, even worse, is just not accounted for, as users with no recommendations are typically excluded from the performance calculations. In this article, we propose a coverage metric that uncovers and compensates for the incompleteness of performance evaluations based only on precision. We use this metric together with precision metrics in an empirical comparison of several social, collaborative filtering, and hybrid recommenders. The obtained results show that a better balance between precision and coverage can be achieved by combining social-based filtering (high accuracy, low coverage) and collaborative filtering (low accuracy, high coverage) recommendation techniques. We thus explore several hybrid recommendation approaches to balance this trade-off. In particular, we compare, on the one hand, techniques integrating collaborative and social information into a single model, and on the other, linear combinations of recommenders. For the last approach, we also propose a novel strategy to dynamically adjust the weight of each recommender on a user-basis, utilizing graph measures as indicators of the target user's connectedness and relevance in a social network.This work was supported by the Spanish Ministry of Science and Innovation (TIN2008-06566-C04-02), Universidad Autonoma de Madrid (CCG10-UAM/TIC-5877), and the Scientific Computing Institute at UAM

Euler-Maruyama and Milstein approximations for stochastic functional differential equations with distributed memory term

We consider the problem of strong approximations of the solution of stochastic functional differential equations of Itô form with a distributed delay term in the drift and diffusion coefficient. We provide necessary background material, and give convergence proofs for the Euler-Maruyama and the Milestein scheme. Numerical examples illustrate the theoretical results

An example of Berglund-H\"ubsch mirror symmetry for a Calabi-Yau complete intersection

We study an example of complete intersection Calabi-Yau threefold due to Libgober and Teitelbaum arXiv:alg-geom/9301001, and verify mirror symmetry at a cohomological level. Direct computations allow us to propose an analogue to the Berglund-H\"ubsch mirror symmetry setup for this example arXiv:hep-th/9201014. We then follow the approach of Krawitz to propose an explicit mirror map arXiv:0906.0796.Comment: 18 pages, 4 table

Space station task force perspective

Space station planning quidelines; architecture; functions; preliminary mission data base; scope for international and commercial participation; schedules; servicing capability; technology development; and space station program interfaces are discussed

Performance comparison of cache coherence protocol on multi-core architecture

Number of cores in multi-core processors is steadily increased to make it faster and more reliable. Increasing the number of cores comes with a numerous issues that need to be addressed. In this dissertation we looked at the cache coherence issue, its importance and solution. Cache coherence is important as two or more cores sharing the same data must maintain the recent updated value to avoid reading of stale value. We have made an extensive study of existing cache coherence methods, such as Snoopy coherence technique and Directory coherence technique. Snoopy coherence technique is studied with the help of MOESI coherence protocol and Directory coherence technique is observed with the help of MI, MESI TWO LEVEL, MESI THREE LEVEL, MOESI, and MOESI TOKEN coherence protocol. We have used GEM5 simulator and Splash-2 benchmark to compare their performance. For simulation a precompiled program called MemTest, Ruby random tester, and Splash-2 suite is used. It is observed that the performance is improved as we move from MI, MESI TWO LEVEL, MESI THREE LEVEL, MOESI, and MOESI TOKEN in Directory coherence technique and for Snoopy coherence we observed the performance through varying parameters like, cache size, block size and associativity. It is also observed that that adding L3 level cache the performance of MESI Three Level is improved over MESI Two Level

Predicted rarity-weighted richness, a new tool to prioritize sites for species representation

abstract: Lack of biodiversity data is a major impediment to prioritizing sites for species representation. Because comprehensive species data are not available in any planning area, planners often use surrogates (such as vegetation communities, or mapped occurrences of a well-inventoried taxon) to prioritize sites. We propose and demonstrate the effectiveness of predicted rarity-weighted richness (PRWR) as a surrogate in situations where species inventories may be available for a portion of the planning area. Use of PRWR as a surrogate involves several steps. First, rarity-weighted richness (RWR) is calculated from species inventories for a q% subset of sites. Then random forest models are used to model RWR as a function of freely available environmental variables for that q% subset. This function is then used to calculate PRWR for all sites (including those for which no species inventories are available), and PRWR is used to prioritize all sites. We tested PRWR on plant and bird datasets, using the species accumulation index to measure efficiency of PRWR. Sites with the highest PRWR represented species with median efficiency of 56% (range 32%–77% across six datasets) when q = 20%, and with median efficiency of 39% (range 20%–63%) when q = 10%. An efficiency of 56% means that selecting sites in order of PRWR rank was 56% as effective as having full knowledge of species distributions in PRWR's ability to improve on the number of species represented in the same number of randomly selected sites. Our results suggest that PRWR may be able to help prioritize sites to represent species if a planner has species inventories for 10%–20% of the sites in the planning area.The final version of this article, as published in Ecology and Evolution, can be viewed online at: http://onlinelibrary.wiley.com/doi/10.1002/ece3.2544/abstract