Data handbook for the National Solar Energy Demonstration Program

This preliminary document provides information in a matrix format which lists technical and programmatic data concerning the various project sites selected for the National Solar Energy Demonstration Program. It incorporates into one handbook the commercial, residential, and other demonstration projects which are now a part of the national program. It can be used as a reference source for technical and research purposes on a state-by-state basis

Accelerated Projected Gradient Method for Linear Inverse Problems with Sparsity Constraints

Regularization of ill-posed linear inverse problems via $\ell_1$ penalization has been proposed for cases where the solution is known to be (almost) sparse. One way to obtain the minimizer of such an $\ell_1$ penalized functional is via an iterative soft-thresholding algorithm. We propose an alternative implementation to $\ell_1$-constraints, using a gradient method, with projection on $\ell_1$-balls. The corresponding algorithm uses again iterative soft-thresholding, now with a variable thresholding parameter. We also propose accelerated versions of this iterative method, using ingredients of the (linear) steepest descent method. We prove convergence in norm for one of these projected gradient methods, without and with acceleration.Comment: 24 pages, 5 figures. v2: added reference, some amendments, 27 page

Towards a killer app for the Semantic Web

Killer apps are highly transformative technologies that create new markets and widespread patterns of behaviour. IT generally, and the Web in particular, has benefited from killer apps to create new networks of users and increase its value. The Semantic Web community on the other hand is still awaiting a killer app that proves the superiority of its technologies. There are certain features that distinguish killer apps from other ordinary applications. This paper examines those features in the context of the Semantic Web, in the hope that a better understanding of the characteristics of killer apps might encourage their consideration when developing Semantic Web applications

Scaling in a Nonconservative Earthquake Model of Self-Organised Criticality

We numerically investigate the Olami-Feder-Christensen model for earthquakes in order to characterise its scaling behaviour. We show that ordinary finite size scaling in the model is violated due to global, system wide events. Nevertheless we find that subsystems of linear dimension small compared to the overall system size obey finite (subsystem) size scaling, with universal critical coefficients, for the earthquake events localised within the subsystem. We provide evidence, moreover, that large earthquakes responsible for breaking finite size scaling are initiated predominantly near the boundary.Comment: 6 pages, 6 figures, to be published in Phys. Rev. E; references sorted correctl

A Numerical Investigation of the Effects of Classical Phase Space Structure on a Quantum System

We present a detailed numerical study of a chaotic classical system and its quantum counterpart. The system is a special case of a kicked rotor and for certain parameter values possesses cantori dividing chaotic regions of the classical phase space. We investigate the diffusion of particles through a cantorus; classical diffusion is observed but quantum diffusion is only significant when the classical phase space area escaping through the cantorus per kicking period greatly exceeds Planck's constant. A quantum analysis confirms that the cantori act as barriers. We numerically estimate the classical phase space flux through the cantorus per kick and relate this quantity to the behaviour of the quantum system. We introduce decoherence via environmental interactions with the quantum system and observe the subsequent increase in the transport of quantum particles through the boundary.Comment: 15 pages, 22 figure

A characterization of Schauder frames which are near-Schauder bases

A basic problem of interest in connection with the study of Schauder frames in Banach spaces is that of characterizing those Schauder frames which can essentially be regarded as Schauder bases. In this paper, we give a solution to this problem using the notion of the minimal-associated sequence spaces and the minimal-associated reconstruction operators for Schauder frames. We prove that a Schauder frame is a near-Schauder basis if and only if the kernel of the minimal-associated reconstruction operator contains no copy of $c_0$. In particular, a Schauder frame of a Banach space with no copy of $c_0$ is a near-Schauder basis if and only if the minimal-associated sequence space contains no copy of $c_0$. In these cases, the minimal-associated reconstruction operator has a finite dimensional kernel and the dimension of the kernel is exactly the excess of the near-Schauder basis. Using these results, we make related applications on Besselian frames and near-Riesz bases.Comment: 12 page

Distribution of epicenters in the Olami-Feder-Christensen model

We show that the well established Olami-Feder-Christensen (OFC) model for the dynamics of earthquakes is able to reproduce a new striking property of real earthquake data. Recently, it has been pointed out by Abe and Suzuki that the epicenters of earthquakes could be connected in order to generate a graph, with properties of a scale-free network of the Barabasi-Albert type. However, only the non conservative version of the Olami-Feder-Christensen model is able to reproduce this behavior. The conservative version, instead, behaves like a random graph. Besides indicating the robustness of the model to describe earthquake dynamics, those findings reinforce that conservative and non conservative versions of the OFC model are qualitatively different. Also, we propose a completely new dynamical mechanism that, even without an explicit rule of preferential attachment, generates a free scale network. The preferential attachment is in this case a ``by-product'' of the long term correlations associated with the self-organized critical state. The detailed study of the properties of this network can reveal new aspects of the dynamics of the OFC model, contributing to the understanding of self-organized criticality in non conserving models.Comment: 7 pages, 7 figure

Restricted Isometries for Partial Random Circulant Matrices

In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse and compressible signals. Many recovery algorithms are known to succeed when the restricted isometry constants of the sampling matrix are small. Many potential applications of compressed sensing involve a data-acquisition process that proceeds by convolution with a random pulse followed by (nonrandom) subsampling. At present, the theoretical analysis of this measurement technique is lacking. This paper demonstrates that the $s$th order restricted isometry constant is small when the number $m$ of samples satisfies $m \gtrsim (s \log n)^{3/2}$, where $n$ is the length of the pulse. This bound improves on previous estimates, which exhibit quadratic scaling