Relationships between dust grain components responsible for observed interstellar extinction and polarization

Ultraviolet extinction properties of interstellar dust are well observed. The amount of extinction measured in the visible (E(B-V)), at the 2200 A feature (E(BUMP)), and in the far ultraviolet (E(1550-V)) are only vaguely correlated indicating that at least 3 fairly independent populations of grains contribute to the overall extinction curve. A search of literature was made for polarimetric observations of the 1415 stars included in the extinction catalog derived from the Astronomical Netherlands Satellite (ANS) data. It was found that about 900 of the stars had at least one unfiltered polarimetric observation, p (%). In addition, 150 stars had calculated values of lambda sub max (wavelength at which maximum polarization occurs). The lambda sub max and p/E(B-V) parameters are discussed

A Dynamically Adaptive Sparse Grid Method for Quasi-Optimal Interpolation of Multidimensional Analytic Functions

In this work we develop a dynamically adaptive sparse grids (SG) method for quasi-optimal interpolation of multidimensional analytic functions defined over a product of one dimensional bounded domains. The goal of such approach is to construct an interpolant in space that corresponds to the "best $M$-terms" based on sharp a priori estimate of polynomial coefficients. In the past, SG methods have been successful in achieving this, with a traditional construction that relies on the solution to a Knapsack problem: only the most profitable hierarchical surpluses are added to the SG. However, this approach requires additional sharp estimates related to the size of the analytic region and the norm of the interpolation operator, i.e., the Lebesgue constant. Instead, we present an iterative SG procedure that adaptively refines an estimate of the region and accounts for the effects of the Lebesgue constant. Our approach does not require any a priori knowledge of the analyticity or operator norm, is easily generalized to both affine and non-affine analytic functions, and can be applied to sparse grids build from one dimensional rules with arbitrary growth of the number of nodes. In several numerical examples, we utilize our dynamically adaptive SG to interpolate quantities of interest related to the solutions of parametrized elliptic and hyperbolic PDEs, and compare the performance of our quasi-optimal interpolant to several alternative SG schemes

A semantics and implementation of a causal logic programming language

The increasingly widespread availability of multicore and manycore computers demands new programming languages that make parallel programming dramatically easier and less error prone. This paper describes a semantics for a new class of declarative programming languages that support massive amounts of implicit parallelism

Datalog as a parallel general purpose programming language

The increasing available parallelism of computers demands new programming languages that make parallel programming dramatically easier and less error prone. It is proposed that datalog with negation and timestamps is a suitable basis for a general purpose programming language for sequential, parallel and distributed computers. This paper develops a fully incremental bottom-up interpreter for datalog that supports a wide range of execution strategies, with trade-offs affecting efficiency, parallelism and control of resource usage. Examples show how the language can accept real-time external inputs and outputs, and mimic assignment, all without departing from its pure logical semantics

A Parallel semantics for normal logic programs plus time

It is proposed that Normal Logic Programs with an explicit time ordering are a suitable basis for a general purpose parallel programming language. Examples show that such a language can accept real-time external inputs and outputs, and mimic assignment, all without departing from its pure logical semantics. This paper describes a fully incremental bottom-up interpreter that supports a wide range of parallel execution strategies and can extract significant potential parallelism from programs with complex dependencies

CEO Pay-for-Performance Heterogeneity Using Quantile Regression (CRI 2009-002)

We provide some examples of how quantile regression can be used to investigate heterogeneity in pay–firm size and pay-performance relationships for U.S. CEOs. For example, do conditionally (predicted) high-wage managers have a stronger relationship between pay and performance than conditionally low-wage managers? Our results using data over a decade show, for some standard specifications, there is considerable heterogeneity in the returns to firm performance across the conditional distribution of wages. Quantile regression adds substantially to our understanding of the pay-performance relationship. This heterogeneity is masked when using more standard empirical techniques