A Mean Value Theorem for non Differentiable Mappings in Banach Spaces

We prove that if f is a real valued lower semicontinuous function on a Banach space X and if there exists a C^1, real valued Lipschitz continuous function on X with bounded support and which is not identically equal to zero, then f is Lipschitz continuous of constant K provided all lower subgradients of f are bounded by K. As an application, we give a regularity result of viscosity supersolutions (or subsolutions) of Hamilton-Jacobi equations in infinite dimensions which satisfy a coercive condition. This last result slightly improves some earlier work by G. Barles and H. Ishii.

Convex and exact games with non-transferable utility

We generalize exactness to games with non-transferable utility (NTU). A game is exact if for each coalition there is a core allocation on the boundary of its payoff set. Convex games with transferable utility are well-known to be exact. We consider ve generalizations of convexity in the NTU setting. We show that each of ordinal, coalition merge, individual merge and marginal convexity can be uni¯ed under NTU exactness. We provide an example of a cardinally convex game which is not NTU exact. Finally, we relate the classes of Π-balanced, totally Π-balanced, NTU exact, totally NTU exact, ordinally convex, cardinally convex, coalition merge convex, individual merge convex and marginal convex games to one another.

Corrigendum to “The envelope theorem for multiobjective convex programming via contingent derivatives” [J. Math. Anal. Appl. 372 (1) (2010) 197–207]

The aim of this note is to formulate an envelope theorem for vector convex programs. This version corrects an earlier work, “The envelope theorem for multiobjective convex programming via contingent derivatives” by Jiménez Guerra et al. (2010) [3]. We first propose a necessary and sufficient condition allowing to restate the main result proved in the alluded paper. Second, we introduce a new Lagrange multiplier in order to obtain an envelope theorem avoiding the aforementioned error.

Anomalous diffusion in non-Markovian walks having amnestically induced persistence

We report numerically and analytically estimated values for the Hurst exponent for a recently proposed non-Markovian walk characterized by amnestically induced persistence. These results are consistent with earlier studies showing that log-periodic oscillations arise only for large memory losses of the recent past. We also report numerical estimates of the Hurst exponent for non-Markovian walks with diluted memory. Finally, we study walks with a fractal memory of the past for a Thue-Morse and Fibonacci memory patterns. These results are interpreted and discussed in the context of the necessary and sufficient conditions for the central limit theorem to hold.

An algorithmic Friedman-Pippenger theorem on tree embeddings and applications

An (n, d)-expander is a graph G = (V, E) such that for every X subset of V with vertical bar X vertical bar <= 2n - 2 we have vertical bar Gamma(G)(X) vertical bar >= (d + 1) vertical bar X vertical bar. A tree T is small if it has at most n vertices and has maximum degree at most d. Friedman and Pippenger (1987) proved that any ( n; d)- expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for obtaining the tree. In this paper, we give an alternative result that does admit a polynomial time algorithm for finding the immersion of any small tree in subgraphs G of (N, D, lambda)-graphs Lambda, as long as G contains a positive fraction of the edges of Lambda and lambda/D is small enough. In several applications of the Friedman-Pippenger theorem, including the ones in the original paper of those authors, the (n, d)-expander G is a subgraph of an (N, D, lambda)-graph as above. Therefore, our result suffices to provide efficient algorithms for such previously non-constructive applications. As an example, we discuss a recent result of Alon, Krivelevich, and Sudakov (2007) concerning embedding nearly spanning bounded degree trees, the proof of which makes use of the Friedman-Pippenger theorem. We shall also show a construction inspired on Wigderson-Zuckerman expander graphs for which any sufficiently dense subgraph contains all trees of sizes and maximum degrees achieving essentially optimal parameters. Our algorithmic approach is based on a reduction of the tree embedding problem to a certain on-line matching problem for bipartite graphs, solved by Aggarwal et al. (1996).

GLOBAL WELL-POSEDNESS AND NON-LINEAR STABILITY OF PERIODIC TRAVELING WAVES FOR A SCHRODINGER-BENJAMIN-ONO SYSTEM

The objective of this paper is two-fold: firstly, we develop a local and global (in time) well-posedness theory for a system describing the motion of two fluids with different densities under capillary-gravity waves in a deep water flow (namely, a Schrodinger-Benjamin-Ono system) for low-regularity initial data in both periodic and continuous cases; secondly, a family of new periodic traveling waves for the Schrodinger-Benjamin-Ono system is given: by fixing a minimal period we obtain, via the implicit function theorem, a smooth branch of periodic solutions bifurcating a Jacobian elliptic function called dnoidal, and, moreover, we prove that all these periodic traveling waves are nonlinearly stable by perturbations with the same wavelength.

Exponential Rates of Convergence in the Ergodic Theorem: A Constructive Approach

We prove that, once an algorithm of perfect simulation for a stationary and ergodic random field F taking values in S(Zd), S a bounded subset of R(n), is provided, the speed of convergence in the mean ergodic theorem occurs exponentially fast for F. Applications from (non-equilibrium) statistical mechanics and interacting particle systems are presented.

The non-existence of a utility function and the structure of non-representable preference relations

In this paper we investigate the structure of non-representable preference relations. While there is a vast literature on different kinds of preference relations that can be represented by a real-valued utility function, very little is known or understood about preference relations that cannot be represented by a real-valued utility function. There has been no systematic analysis of the non-representation problem. In this paper we give a complete description of non-representable preference relations which are total preorders or chains. We introduce and study the properties of four classes of non-representable chains: long chains, planar chains, Aronszajn-like chains and Souslin chains. In the main theorem of the paper we prove that a chain is non-representable if and only it is a long chain, a planar chain, an Aronszajn-like chain or a Souslin chain. (C) 2002 Published by Elsevier Science B.V.

On lattices from combinatorial game theory modularity and a representation theorem: finite case

We show that a self-generated set of combinatorial games, S. may not be hereditarily closed but, strong self-generation and hereditary closure are equivalent in the universe of short games. In [13], the question "Is there a set which will give a non-distributive but modular lattice?" appears. A useful necessary condition for the existence of a finite non-distributive modular L(S) is proved. We show the existence of S such that L(S) is modular and not distributive, exhibiting the first known example. More, we prove a Representation Theorem with Games that allows the generation of all finite lattices in game context. Finally, a computational tool for drawing lattices of games is presented. (C) 2014 Elsevier B.V. All rights reserved.

Efficacy of prescribed injectable diacetylmorphine in the Andalusian trial: Bayesian analysis of responders and non-responders according to a multi domain outcome index.

BACKGROUND The objective of this research was to evaluate data from a randomized clinical trial that tested injectable diacetylmorphine (DAM) and oral methadone (MMT) for substitution treatment, using a multi-domain dichotomous index, with a Bayesian approach. METHODS Sixty two long-term, socially-excluded heroin injectors, not benefiting from available treatments were randomized to receive either DAM or MMT for 9 months in Granada, Spain. Completers were 44 and data at the end of the study period was obtained for 50. Participants were determined to be responders or non responders using a multi-domain outcome index accounting for their physical and mental health and psychosocial integration, used in a previous trial. Data was analyzed with Bayesian methods, using information from a similar study conducted in The Netherlands to select a priori distributions. On adding the data from the present study to update the a priori information, the distribution of the difference in response rates were obtained and used to build credibility intervals and relevant probability computations. RESULTS In the experimental group (n = 27), the rate of responders to treatment was 70.4% (95% CI 53.287.6), and in the control group (n = 23), it was 34.8% (95% CI 15.354.3). The probability of success in the experimental group using the a posteriori distributions was higher after a proper sensitivity analysis. Almost the whole distribution of the rates difference (the one for diacetylmorphine minus methadone) was located to the right of the zero, indicating the superiority of the experimental treatment. CONCLUSION The present analysis suggests a clinical superiority of injectable diacetylmorphine compared to oral methadone in the treatment of severely affected heroin injectors not benefiting sufficiently from the available treatments. TRIAL REGISTRATION Current Controlled Trials ISRCTN52023186.

Efficacy and safety of acupuncture for the treatment of non-specific acute low back pain: a randomised controlled multicentre trial protocol [ISRCTN65814467]

BACKGROUND Low back pain and its associated incapacitating effects constitute an important healthcare and socioeconomic problem, as well as being one of the main causes of disability among adults of working age. The prevalence of non-specific low back pain is very high among the general population, and 60-70% of adults are believed to have suffered this problem at some time. Nevertheless, few randomised clinical trials have been made of the efficacy and efficiency of acupuncture with respect to acute low back pain. The present study is intended to assess the efficacy of acupuncture for acute low back pain in terms of the improvement reported on the Roland Morris Questionnaire (RMQ) on low back pain incapacity, to estimate the specific and non-specific effects produced by the technique, and to carry out a cost-effectiveness analysis. METHODS/DESIGN Randomised four-branch controlled multicentre prospective study made to compare semi-standardised real acupuncture, sham acupuncture (acupuncture at non-specific points), placebo acupuncture and conventional treatment. The patients are blinded to the real, sham and placebo acupuncture treatments. Patients in the sample present symptoms of non specific acute low back pain, with a case history of 2 weeks or less, and will be selected from working-age patients, whether in paid employment or not, referred by General Practitioners from Primary Healthcare Clinics to the four clinics participating in this study. In order to assess the primary and secondary result measures, the patients will be requested to fill in a questionnaire before the randomisation and again at 3, 12 and 48 weeks after starting the treatment. The primary result measure will be the clinical relevant improvement (CRI) at 3 weeks after randomisation. We define CRI as a reduction of 35% or more in the RMQ results. DISCUSSION This study is intended to obtain further evidence on the effectiveness of acupuncture on acute low back pain and to isolate the specific and non-specific effects of the treatment.

Max-convex decompositions for cooperative TU games

We show that any cooperative TU game is the maximum of a finite collection of convex games. This max-convex decomposition can be refined by using convex games with non-negative dividends for all coalitions of at least two players. As a consequence of the above results we show that the class of modular games is a set of generators of the distributive lattice of all cooperative TU games. Finally, we characterize zero-monotonic games using a strong max-convex decomposition

Accelerated Microstructure Imaging via Convex Optimization (AMICO) from diffusion MRI data.

Microstructure imaging from diffusion magnetic resonance (MR) data represents an invaluable tool to study non-invasively the morphology of tissues and to provide a biological insight into their microstructural organization. In recent years, a variety of biophysical models have been proposed to associate particular patterns observed in the measured signal with specific microstructural properties of the neuronal tissue, such as axon diameter and fiber density. Despite very appealing results showing that the estimated microstructure indices agree very well with histological examinations, existing techniques require computationally very expensive non-linear procedures to fit the models to the data which, in practice, demand the use of powerful computer clusters for large-scale applications. In this work, we present a general framework for Accelerated Microstructure Imaging via Convex Optimization (AMICO) and show how to re-formulate this class of techniques as convenient linear systems which, then, can be efficiently solved using very fast algorithms. We demonstrate this linearization of the fitting problem for two specific models, i.e. ActiveAx and NODDI, providing a very attractive alternative for parameter estimation in those techniques; however, the AMICO framework is general and flexible enough to work also for the wider space of microstructure imaging methods. Results demonstrate that AMICO represents an effective means to accelerate the fit of existing techniques drastically (up to four orders of magnitude faster) while preserving accuracy and precision in the estimated model parameters (correlation above 0.9). We believe that the availability of such ultrafast algorithms will help to accelerate the spread of microstructure imaging to larger cohorts of patients and to study a wider spectrum of neurological disorders.

The Foundational Significance of Leggett's Non-local Hidden-Variable Theories

Laudisa (Found. Phys. 38:1110-1132, 2008) claims that experimental research on the class of non-local hidden-variable theories introduced by Leggett is misguided, because these theories are irrelevant for the foundations of quantum mechanics. I show that Laudisa's arguments fail to establish the pessimistic conclusion he draws from them. In particular, it is not the case that Leggett-inspired research is based on a mistaken understanding of Bell's theorem, nor that previous no-hidden-variable theorems already exclude Leggett's models. Finally, I argue that the framework of Bohmian mechanics brings out the importance of Leggett tests, rather than proving their irrelevance, as Laudisa supposes.

Max-convex decompositions for cooperative TU games

We show that any cooperative TU game is the maximum of a finite collection of convex games. This max-convex decomposition can be refined by using convex games with non-negative dividends for all coalitions of at least two players. As a consequence of the above results we show that the class of modular games is a set of generators of the distributive lattice of all cooperative TU games. Finally, we characterize zero-monotonic games using a strong max-convex decomposition