This paper describes the work done in Renmin University of China for the Federated Web Search Track of TREC 2014. We participated in the resource selection task. We used the LDA topic modeling approach to select potentially relevant resources for a given query. The initial results are promising.

In this work, applications of the coupled solid set sprinkler irrigation and crop model AdorSim introduced in the companion paper are presented. The sprinkler irrigation model is based on ballistic theory, while the crop model is based on CropWat. AdorSim was used to evaluate the effect of sprinkler spacing on seasonal irrigation water use (WU) and crop yield. The most relevant results were rel...

In this paper, we describe our use of ethnographic techniques for identifying requirements for a web-based system for automatic updates and data exchange in a financial investment company. During a six-month long internship, we observed stakeholders in their daily work, helped them use the system, and discussed the results of our observations with them. This helped us to define a more complete ...

Various techniques, used to optimise on-line principal component analysis, are investigated by methods of statistical mechanics. These include local and global optimisation of node-dependent learning-rates which are shown to be very efficient in speeding up the learning process. They are investigated further for gaining insight into the learning rates’ timedependence, which is then employed for...

In this paper we propose new primal-dual interior point methods (IPMs) for P∗(κ) linear complementarity problems (LCPs) and analyze the iteration complexity of the algorithm. New search directions and proximity measures are defined based on a class of kernel functions, ψ(t) = t 2−1 2 − R t 1 e q “ 1 ξ −1 ” dξ, q ≥ 1. If a strictly feasible starting point is available and the parameter q = log „...

In this paper we present a generic primal-dual interior point methods (IPMs) for linear optimization in which the search direction depends on a univariate kernel function which is also used as proximity measure in the analysis of the algorithm. The proposed kernel function does not satisfy all the conditions proposed in [2]. We show that the corresponding large-update algorithm improves the ite...

1 PROPOSED METHODS 1.1 Proofs of Update Rules In this section, we present the proofs of the update rules in Section 3.5 of the main paper. Specifically, we prove the CDTF update rule for L1 regularization (Theorem 7), the CDTF update rule for the nonnegativity constraint (Theorem 8), the SALS update rule for coupled tensor factorization (Theorem 9), and the update rule for bias terms commonly u...