We build spaces of q.p. (quasi-periodic) functions and we establich some of their properties. They are motivated by the Perceival approach to q.p. solutions of Hamiltonian systems. The periodic solutions of an adequat Partial Differential Equation are related to the q.p. solutions of an Ordinar...

In the first part of this paper we prove that the global quadratic optimization problem over a simplex can be solved with a constant relative accuracy. In the second part we consider some natural extensions of the result.

This paper presents a combinatorial polynomial-time algorithm for minimizing submodular set functions. The algorithm employs a scaling scheme that uses a flow in the complete directed graph on the underlying set with each arc capacity equal to the scaled parameter.

This survey paper prepared for the Handbook of Utility Theory covers the axiomatic foundation of decision making under uncertainty when conditional preferences are allowed to be state dependent, leading to an expected state-dependent utility representation.

We describe an @( n^4 h min{log U, n^2logn}) capacity scaling algorithm for the minimum cost submodular flow problem. Our algorithm modifies and extends the Edmonds-Karp capacity scaling algorithm for minimum cost flow to solve the minimum cost submodular flow problem. The modification entails...

Let {Xn: n=1} be a sequence of independent and identically distributed random variables with a common distribution function F. Let Sk= X1+...+Xk, k=1, denote the partial sums associated to {Xn: n=1}. In this paper, we study the number and times of the maximal and minimal excursion endpoints of...

The purpose of this paper is to present traditional and more recent procedures for estimation and testing of systems that contain non-stationary variables. The aim throughout is not to prove asymptotic results, but rather to weigh the pros and cons of using each method according to the...