Near-infrared water vapour self-continuum at close to room temperature

The gaseous absorption of solar radiation within near-infrared atmospheric windows in the Earth's atmosphere is dominated by the water vapour continuum. Recent measurements by Baranov et al. (2011) [17] in 2500 cm−1 (4 μm) window and by Ptashnik et al. (2011) [18] in a few near-infrared windows revealed that the self-continuum absorption is typically an order of magnitude stronger than given by the MT_CKD continuum model prior to version 2.5. Most of these measurements, however, were made at elevated temperatures, which makes their application to atmospheric conditions difficult. Here we report new laboratory measurements of the self-continuum absorption at 289 and 318 K in the near-infrared spectral region 1300–8000 cm−1, using a multipass 30 m base cell with total optical path 612 m. Our results confirm the main conclusions of the previous measurements both within bands and in windows. Of particular note is that we present what we believe to be the first near-room temperature measurement using Fourier Transform Spectrometry of the self-continuum in the 6200 cm−1 (1.6 μm) window, which provides tentative evidence that, at such temperatures, the water vapour continuum absorption may be as strong as it is in 2.1 μm and 4 μm windows and up to 2 orders of magnitude stronger than the MT_CKD-2.5 continuum. We note that alternative methods of measuring the continuum in this window have yielded widely differing assessment of its strength, which emphasises the need for further measurements.

Random Prism: a noise-tolerant alternative to Random Forests

Ensemble learning can be used to increase the overall classification accuracy of a classifier by generating multiple base classifiers and combining their classification results. A frequently used family of base classifiers for ensemble learning are decision trees. However, alternative approaches can potentially be used, such as the Prism family of algorithms that also induces classification rules. Compared with decision trees, Prism algorithms generate modular classification rules that cannot necessarily be represented in the form of a decision tree. Prism algorithms produce a similar classification accuracy compared with decision trees. However, in some cases, for example, if there is noise in the training and test data, Prism algorithms can outperform decision trees by achieving a higher classification accuracy. However, Prism still tends to overfit on noisy data; hence, ensemble learners have been adopted in this work to reduce the overfitting. This paper describes the development of an ensemble learner using a member of the Prism family as the base classifier to reduce the overfitting of Prism algorithms on noisy datasets. The developed ensemble classifier is compared with a stand-alone Prism classifier in terms of classification accuracy and resistance to noise.

Sparse polynomial approximation in positive order Sobolev spaces with bounded mixed derivatives and applications to elliptic problems with random loading

In the present paper we study the approximation of functions with bounded mixed derivatives by sparse tensor product polynomials in positive order tensor product Sobolev spaces. We introduce a new sparse polynomial approximation operator which exhibits optimal convergence properties in L2 and tensorized View the MathML source simultaneously on a standard k-dimensional cube. In the special case k=2 the suggested approximation operator is also optimal in L2 and tensorized H1 (without essential boundary conditions). This allows to construct an optimal sparse p-version FEM with sparse piecewise continuous polynomial splines, reducing the number of unknowns from O(p2), needed for the full tensor product computation, to View the MathML source, required for the suggested sparse technique, preserving the same optimal convergence rate in terms of p. We apply this result to an elliptic differential equation and an elliptic integral equation with random loading and compute the covariances of the solutions with View the MathML source unknowns. Several numerical examples support the theoretical estimates.

Updated radiative forcing estimates of 65 halocarbons and nonmethane hydrocarbons

The direct radiative forcing of 65 chlorofluorocarbons, hydrochlorofluorocarbons, hydrofluorocarbons, hydrofluoroethers, halons, iodoalkanes, chloroalkanes, bromoalkanes, perfluorocarbons and nonmethane hydrocarbons has been evaluated using a consistent set of infrared absorption cross sections. For the radiative transfer models, both line-by-line and random band model approaches were employed for each gas. The line-by-line model was first validated against measurements taken by the Airborne Research Interferometer Evaluation System (ARIES) of the U.K. Meteorological Office; the computed spectrally integrated radiance of agreed to within 2% with experimental measurements. Three model atmospheres, derived from a three-dimensional climatology, were used in the radiative forcing calculations to more accurately represent hemispheric differences in water vapor, ozone concentrations, and cloud cover. Instantaneous, clear-sky radiative forcing values calculated by the line-by-line and band models were in close agreement. The band model values were subsequently modified to ensure exact agreement with the line-by-line model values. Calibrated band model radiative forcing values, for atmospheric profiles with clouds and using stratospheric adjustment, are reported and compared with previous literature values. Fourteen of the 65 molecules have forcings that differ by more than 15% from those in the World Meteorological Organization [1999] compilation. Eleven of the molecules have not been reported previously. The 65-molecule data set reported here is the most comprehensive and consistent database yet available to evaluate the relative impact of halocarbons and hydrocarbons on climate change.

Quantitative ventilation assessments of idealized urban canopy layers with various urban layouts and the same building packing density

This paper investigates urban canopy layers (UCL) ventilation under neutral atmospheric condition with the same building area density (λp=0.25) and frontal area density (λf=0.25) but various urban sizes, building height variations, overall urban forms and wind directions. Turbulent airflows are first predicted by CFD simulations with standard k-ε model evaluated by wind tunnel data. Then air change rates per hour (ACH) and canopy purging flow rate (PFR) are numerically analyzed to quantify the rate of air exchange and the net ventilation capacity induced by mean flows and turbulence. With a parallel approaching wind (θ=0o), the velocity ratio first decreases in the adjustment region, followed by the fully-developed region where the flow reaches a balance. Although the flow quantities macroscopically keep constant, however ACH decreases and overall UCL ventilation becomes worse if urban size rises from 390m to 5km. Theoretically if urban size is infinite, ACH may reach a minimum value depending on local roof ventilation, and it rises from 1.7 to 7.5 if the standard deviation of building height variations increases (0% to 83.3%). Overall UCL ventilation capacity (PFR) with a square overall urban form (Lx=Ly=390m) is better as θ=0o than oblique winds (θ=15o, 30o, 45o), and it exceeds that of a staggered urban form under all wind directions (θ=0o to 45o), but is less than that of a rectangular urban form (Lx=570m, Ly=270m) under most wind directions (θ=30o to 90o). Further investigations are still required to quantify the net ventilation efficiency induced by mean flows and turbulence.

On the spectra and pseudospectra of a class of non-self-adjoint random matrices and operators

In this paper we develop and apply methods for the spectral analysis of non-selfadjoint tridiagonal infinite and finite random matrices, and for the spectral analysis of analogous deterministic matrices which are pseudo-ergodic in the sense of E. B. Davies (Commun. Math. Phys. 216 (2001), 687–704). As a major application to illustrate our methods we focus on the “hopping sign model” introduced by J. Feinberg and A. Zee (Phys. Rev. E 59 (1999), 6433–6443), in which the main objects of study are random tridiagonal matrices which have zeros on the main diagonal and random ±1’s as the other entries. We explore the relationship between spectral sets in the finite and infinite matrix cases, and between the semi-infinite and bi-infinite matrix cases, for example showing that the numerical range and p-norm ε - pseudospectra (ε > 0, p ∈ [1,∞] ) of the random finite matrices converge almost surely to their infinite matrix counterparts, and that the finite matrix spectra are contained in the infinite matrix spectrum Σ. We also propose a sequence of inclusion sets for Σ which we show is convergent to Σ, with the nth element of the sequence computable by calculating smallest singular values of (large numbers of) n×n matrices. We propose similar convergent approximations for the 2-norm ε -pseudospectra of the infinite random matrices, these approximations sandwiching the infinite matrix pseudospectra from above and below.

Serotonergic activity influences the cognitive appraisal of close intimate relationships in healthy adults

Our results suggest that central serotonin activity influences the appraisal of close intimate partnerships, raising the possibility that serotonergic dysfunction contributes to altered cognitions about relationships in psychiatric illnesses.

Noisy Monte Carlo: convergence of Markov chains with approximate transition kernels

Monte Carlo algorithms often aim to draw from a distribution π by simulating a Markov chain with transition kernel P such that π is invariant under P. However, there are many situations for which it is impractical or impossible to draw from the transition kernel P. For instance, this is the case with massive datasets, where is it prohibitively expensive to calculate the likelihood and is also the case for intractable likelihood models arising from, for example, Gibbs random fields, such as those found in spatial statistics and network analysis. A natural approach in these cases is to replace P by an approximation Pˆ. Using theory from the stability of Markov chains we explore a variety of situations where it is possible to quantify how ’close’ the chain given by the transition kernel Pˆ is to the chain given by P . We apply these results to several examples from spatial statistics and network analysis.

A scalable expressive ensemble learning using Random Prism: a MapReduce approach

The induction of classification rules from previously unseen examples is one of the most important data mining tasks in science as well as commercial applications. In order to reduce the influence of noise in the data, ensemble learners are often applied. However, most ensemble learners are based on decision tree classifiers which are affected by noise. The Random Prism classifier has recently been proposed as an alternative to the popular Random Forests classifier, which is based on decision trees. Random Prism is based on the Prism family of algorithms, which is more robust to noise. However, like most ensemble classification approaches, Random Prism also does not scale well on large training data. This paper presents a thorough discussion of Random Prism and a recently proposed parallel version of it called Parallel Random Prism. Parallel Random Prism is based on the MapReduce programming paradigm. The paper provides, for the first time, novel theoretical analysis of the proposed technique and in-depth experimental study that show that Parallel Random Prism scales well on a large number of training examples, a large number of data features and a large number of processors. Expressiveness of decision rules that our technique produces makes it a natural choice for Big Data applications where informed decision making increases the user’s trust in the system.

A moment problem for random discrete measures

Let X be a locally compact Polish space. A random measure on X is a probability measure on the space of all (nonnegative) Radon measures on X. Denote by K(X) the cone of all Radon measures η on X which are of the form η =

Recurrence and higher ergodic properties for quenched random Lorentz tubes in dimension bigger than two

We consider the billiard dynamics in a non-compact set of ℝ d that is constructed as a bi-infinite chain of translated copies of the same d-dimensional polytope. A random configuration of semi-dispersing scatterers is placed in each copy. The ensemble of dynamical systems thus defined, one for each global realization of the scatterers, is called quenched random Lorentz tube. Under some fairly general conditions, we prove that every system in the ensemble is hyperbolic and almost every system is recurrent, ergodic, and enjoys some higher chaotic properties.