Studies on the bit rate requirements for a HDTV format with 1920 timestimes 1080 pixel resolution, progressive scanning at 50 Hz frame rate targeting large flat panel displays

This paper considers the potential for an HDTV delivery format with 1920 times 1080 pixels progressive scanning and 50 frames per second in broadcast applications. The paper discusses the difficulties in characterizing the display to be assumed for reception. It elaborates on the required bit rate of the 1080p/50 format when critical content is coded in MPEG-4 H.264 AVC Part 10 and subjectively viewed on a large, flat panel display with 1920 times 1080 pixel resolution. The paper describes the initial subjective quality evaluations that have been made in these conditions. The results of these initial tests suggest that the required bit-rate for a 1080p/50 HDTV signal in emission could be kept equal or lower than that of 2nd generation HDTV formats, to achieve equal or better image qualit

Blockwise SVD with error in the operator and application to blind deconvolution

We consider linear inverse problems in a nonparametric statistical framework. Both the signal and the operator are unknown and subject to error measurements. We establish minimax rates of convergence under squared error loss when the operator admits a blockwise singular value decomposition (blockwise SVD) and the smoothness of the signal is measured in a Sobolev sense. We construct a nonlinear procedure adapting simultaneously to the unknown smoothness of both the signal and the operator and achieving the optimal rate of convergence to within logarithmic terms. When the noise level in the operator is dominant, by taking full advantage of the blockwise SVD property, we demonstrate that the block SVD procedure overperforms classical methods based on Galerkin projection or nonlinear wavelet thresholding. We subsequently apply our abstract framework to the specific case of blind deconvolution on the torus and on the sphere

A study of the factors affecting boundary layer two-dimensionality in wind tunnels

The effect of screens, honeycombs, and centrifugal blowers on the two-dimensionality of a boundary layer on the test section floors of low-speed blower tunnels is studied. Surveys of the spanwise variation in surface shear stress in three blower tunnels revealed that the main component responsible for altering the spanwise properties of the test section boundary layer was the last screen, thus confirming previous findings. It was further confirmed that a screen with varying open-area ratio, produced an unstable flow. However, contrary to popular belief, it was also found that for given incoming conditions and a screen free of imperfections, its open-area ratio alone was not enough to describe its performance. The effect of other geometric parameters such as the type of screen, honeycomb, and blower were investigated. In addition, the effect of the order of components in the settling chamber, and of wire Reynolds number were also studied

Radiation-driven winds of hot luminous stars. XVI. Expanding atmospheres of massive and very massive stars and the evolution of dense stellar clusters

Context: Starbursts, and particularly their high-mass stars, play an essential role in the evolution of galaxies. The winds of massive stars not only significantly influence their surroundings, but the mass loss also profoundly affects the evolution of the stars themselves. In addition to the evolution of each star, the evolution of the dense cores of massive starburst clusters is affected by N-body interactions, and the formation of very massive stars via mergers may be decisive for the evolution of the cluster. Aims: To introduce an advanced diagnostic method of O-type stellar atmospheres with winds, including an assessment of the accuracy of the determinations of abundances, stellar and wind parameters. Methods: We combine consistent models of expanding atmospheres with detailed stellar evolutionary calculations of massive and very massive single stars with regard to the evolution of dense stellar clusters. Accurate predictions of the mass loss rates of very massive stars requires a highly consistent treatment of the statistical equilibrium and the hydrodynamic and radiative processes in the expanding atmospheres. Results: We present computed mass loss rates, terminal wind velocities, and spectral energy distributions of massive and very massive stars of different metallicities, calculated from atmospheric models with an improved level of consistency. Conclusions: Stellar evolutionary calculations using our computed mass loss rates show that low-metallicity very massive stars lose only a very small amount of their mass, making it unlikely that very massive population III stars cause a significant helium enrichment of the interstellar medium. Solar-metallicity stars have higher mass-loss rates, but these are not so high to exclude very massive stars formed by mergers in dense clusters from ending their life massive enough to form intermediate-mass black holes.Comment: Accepted by A&

Restoration of woodpasture on former agricultural land: The importance of safe sites and time gaps before grazing for tree seedlings

A

Detection mechanism for ferroelectric domain boundaries with lateral force microscopy

The contrast mechanism for the visualization of ferroelectric domain boundaries with lateral force microscopy is generally assumed to be caused by mechanical deformation of the sample due to the converse piezoelectric effect. We show, however, that electrostatic interactions between the charged tip and the electric fields arising from the surface polarization charges dominate the contrast mechanism. This explanation is sustained by quantitative analysis of the measured forces as well as by comparative measurements on different materials

The Effect of Transformations on the Approximation of Univariate (Convex) Functions with Applications to Pareto Curves

In the literature, methods for the construction of piecewise linear upper and lower bounds for the approximation of univariate convex functions have been proposed.We study the effect of the use of increasing convex or increasing concave transformations on the approximation of univariate (convex) functions.In this paper, we show that these transformations can be used to construct upper and lower bounds for nonconvex functions.Moreover, we show that by using such transformations of the input variable or the output variable, we obtain tighter upper and lower bounds for the approximation of convex functions than without these approximations.We show that these transformations can be applied to the approximation of a (convex) Pareto curve that is associated with a (convex) bi-objective optimization problem.approximation theory;convexity;convex/concave transformation;Pareto curve

Multivariate Convex Approximation and Least-Norm Convex Data-Smoothing

The main contents of this paper is two-fold.First, we present a method to approximate multivariate convex functions by piecewise linear upper and lower bounds.We consider a method that is based on function evaluations only.However, to use this method, the data have to be convex.Unfortunately, even if the underlying function is convex, this is not always the case due to (numerical) errors.Therefore, secondly, we present a multivariate data-smoothing method that smooths nonconvex data.We consider both the case that we have only function evaluations and the case that we also have derivative information.Furthermore, we show that our methods are polynomial time methods.We illustrate this methodology by applying it to some examples.approximation theory;convexity;data-smoothing

A Method For Approximating Univariate Convex Functions Using Only Function Value Evaluations

In this paper, piecewise linear upper and lower bounds for univariate convex functions are derived that are only based on function value information. These upper and lower bounds can be used to approximate univariate convex functions. Furthermore, new Sandwich algo- rithms are proposed, that iteratively add new input data points in a systematic way, until a desired accuracy of the approximation is obtained. We show that our new algorithms that use only function-value evaluations converge quadratically under certain conditions on the derivatives. Under other conditions, linear convergence can be shown. Some numeri- cal examples, including a Strategic investment model, that illustrate the usefulness of the algorithm, are given.approximation;convexity;meta-model;Sandwich algorithm