Under the assumption of normally distributed returns, we analyze whether the Cumulative Prospect Theory of Tversky and Kahneman (1992) is consistent with the Capital Asset Pricing Model. We find that in every financial market equilibrium the Security Market Line Theorem holds. However, under the specific functional form suggested by Tversky and Kahneman (1992) financial market equilibria do not...

Pre/post contracts for higher-order functions, as proposed by Findler and Felleisen and provided in Racket, allow run-time verification and blame assignment of higher-order functions. However these contracts treat contracted functions as black boxes, allowing verification of only input and output. It turns out that many interesting concerns about the behaviour of a function require going beyond...

Nonnegative tensor factorization is an extension of nonnegative matrix factorization(NMF) to a multilinear case, where nonnegative constraints are imposed on the PARAFAC/Tucker model. In this paper, to identify speaker from a noisy environment, we propose a new method based on PARAFAC model called constrained Nonnegative Tensor Factorization (cNTF). Speech signal is encoded as a general higher ...

We study extensions of compressive sensing and low rank matrix recovery (matrix completion) to the recovery of low rank tensors of higher order from a small number of linear measurements. While the theoretical understanding of low rank matrix recovery is already well-developed, only few contributions on the low rank tensor recovery problem are available so far. In this paper, we introduce versi...

It is known that a higher order tensor does not necessarily have an optimal low rank approximation, and that a tensor might not be orthogonally decomposable (i.e., admit a tensor SVD). We provide several sufficient conditions which lead to the failure of the tensor SVD, and characterize the existence of the tensor SVD with respect to the Higher Order SVD (HOSVD). In face of these difficulties t...

It is the aim of this paper to advocate the use of functor categories as a semantic foundation of higher-order abstract syntax (HOAS). By way of example, we will show how functor categories can be used for at least the following applications: relating first-order and higher-order abstract syntax (proofs of adequacy) without using reduction rules, justifying induction principles and other axioms...

In this paper we maximize the utility of a structural model of the demand for multi-destination non-work travel using maximum entropy method introduced by Shanon. A utility value is assigned when only partial information is available about the decision maker’s preferences. The maximum entropy utility solution embeds a large family of utility functions that includes the most commonly used functi...

It is shown that in the estimation of an arbitrary signal corrupted by additive Gaussian noise, the optimum minimum-variance estimator is always a simple linear transformation of the logarithmic gradient of the average likelihood ratio which is obtained in the optimum detection of the same signal. Conversely, the average likelihood ratio can always be expressed in a simple functional form conta...

The language LRTp is a non-deterministic language for exact real number computation. It has been shown that all computable first order relations in the sense of Brattka are definable in the language. If we restrict the language to single-valued total relations (e.g. functions), all polynomials are definable in the language. In this paper we show that the non-deterministic version of the limit o...

The division problem consists of allocating an amount of a perfectly divisible good among a group of n agents with single-peaked preferences. A rule maps preference profiles into n shares of the amount to be allocated. A rule is bribe-proof if no group of agents can compensate another agent to misrepresent his preference and, after an appropriate redistribution of their shares, each obtain a st...