When being wasteful appears better than feeling wasteful

"Waste not want not" expresses our culture's aversion to waste. "I could have gotten the same thing for less" is a sentiment that can diminish pleasure in a transaction. We study people's willingness to "pay" to avoid this spoiler. In one scenario, participants imagined they were looking for a rental apartment, and had bought a subscription to an apartment listing. If a cheaper subscription had been declined, respondents preferred not to discover post hoc that it would have sufficed. Specifically, they preferred ending their quest for the ideal apartment after seeing more, rather than fewer, apartments, so that the length of the search exceeds that available within the cheaper subscription. Other scenarios produced similar results. We conclude that people may sometimes prefer to be wasteful in order to avoid feeling wasteful.waste aversion, mental accounting, violation of dominance, counterfactual, regret

Combined travel forecasting models - formulations and algorithms

Consistent transportation forecasting models that combine travel demand and network assignment are receiving more attention in recent years. A fixed point formulation for the general combined model is presented. Measures for solution accuracy are discussed. An origin-based algorithm for solving combined models is proposed. Experimental results demonstrate the efficiency of the algorithm in comparison with prevailing alternatives.

Combined travel forecasting models - formulations and algorithms

Consistent transportation forecasting models that combine travel demand and network assignment are receiving more attention in recent years. A fixed point formulation for the general combined model is presented. Measures for solution accuracy are discussed. An origin-based algorithm for solving combined models is proposed. Experimental results demonstrate the efficiency of the algorithm in comparison with prevailing alternatives

A latent variable ranking model for content-based retrieval

34th European Conference on IR Research, ECIR 2012, Barcelona, Spain, April 1-5, 2012. ProceedingsSince their introduction, ranking SVM models [11] have become a powerful tool for training content-based retrieval systems. All we need for training a model are retrieval examples in the form of triplet constraints, i.e. examples specifying that relative to some query, a database item a should be ranked higher than database item b. These types of constraints could be obtained from feedback of users of the retrieval system. Most previous ranking models learn either a global combination of elementary similarity functions or a combination defined with respect to a single database item. Instead, we propose a “coarse to fine” ranking model where given a query we first compute a distribution over “coarse” classes and then use the linear combination that has been optimized for queries of that class. These coarse classes are hidden and need to be induced by the training algorithm. We propose a latent variable ranking model that induces both the latent classes and the weights of the linear combination for each class from ranking triplets. Our experiments over two large image datasets and a text retrieval dataset show the advantages of our model over learning a global combination as well as a combination for each test point (i.e. transductive setting). Furthermore, compared to the transductive approach our model has a clear computational advantages since it does not need to be retrained for each test query.Spanish Ministry of Science and Innovation (JCI-2009-04240)EU PASCAL2 Network of Excellence (FP7-ICT-216886

The Grail theorem prover: Type theory for syntax and semantics

As the name suggests, type-logical grammars are a grammar formalism based on logic and type theory. From the prespective of grammar design, type-logical grammars develop the syntactic and semantic aspects of linguistic phenomena hand-in-hand, letting the desired semantics of an expression inform the syntactic type and vice versa. Prototypical examples of the successful application of type-logical grammars to the syntax-semantics interface include coordination, quantifier scope and extraction.This chapter describes the Grail theorem prover, a series of tools for designing and testing grammars in various modern type-logical grammars which functions as a tool . All tools described in this chapter are freely available

Computing in Additive Networks with Bounded-Information Codes

This paper studies the theory of the additive wireless network model, in which the received signal is abstracted as an addition of the transmitted signals. Our central observation is that the crucial challenge for computing in this model is not high contention, as assumed previously, but rather guaranteeing a bounded amount of \emph{information} in each neighborhood per round, a property that we show is achievable using a new random coding technique. Technically, we provide efficient algorithms for fundamental distributed tasks in additive networks, such as solving various symmetry breaking problems, approximating network parameters, and solving an \emph{asymmetry revealing} problem such as computing a maximal input. The key method used is a novel random coding technique that allows a node to successfully decode the received information, as long as it does not contain too many distinct values. We then design our algorithms to produce a limited amount of information in each neighborhood in order to leverage our enriched toolbox for computing in additive networks