Guarino Veronese : e la polemica sul Carmagnola /

Mode of access: Internet.

Le comte de Carmagnola; et, Adelghis; tragédies.

Part of text in Italian and French.

Les très riches Heures de Jean de France, duc de Berry.

Miniatures by the brothers Jean, Herman and Pol de Limbourg under the direction of Pol; completed by Jean Colombe.

Francia, school of Bologna.

At head of title: Masters in art; a series of illustrated monographs issued monthly.

Horizontal profiles of longwave and shortwave radiation components over sea ice near Barrow, Alaska during the 2011 melt

An integrated instrument package for measuring and understanding the surface radiation budget of sea ice is presented, along with results from its first deployment. The setup simultaneously measures broadband fluxes of upwelling and downwelling terrestrial and solar radiation (four components separately), spectral fluxes of incident and reflected solar radiation, and supporting data such as air temperature and humidity, surface temperature, and location (GPS), in addition to photographing the sky and observed surface during each measurement. The instruments are mounted on a small sled, allowing measurements of the radiation budget to be made at many locations in the study area to see the effect of small-scale surface processes on the large-scale radiation budget. Such observations have many applications, from calibration and validation of remote sensing products to improving our understanding of surface processes that affect atmosphere-snow-ice interactions and drive feedbacks, ultimately leading to the potential to improve climate modelling of ice-covered regions of the ocean. The photographs, spectral data, and other observations allow for improved analysis of the broadband data. An example of this is shown by using the observations made during a partly cloudy day, which show erratic variations due to passing clouds, and creating a careful estimate of what the radiation budget along the observed line would have been under uniform sky conditions, clear or overcast. Other data from the setup's first deployment, in June 2011 on fast ice near Point Barrow, Alaska, are also shown; these illustrate the rapid changes of the radiation budget during a cold period that led to refreezing and new snow well into the melt season.

On approximately universal schemes for two-hop networks

Full-duplex and half-duplex two-hop networks are considered. Explicit coding schemes which are approximately universal over a class of fading distributions are identified, for the case when the network has either one or two relays.

PDB Goodies - a web-based GUI to manipulate the Protein Data Bank file

PDB Goodies is a web-based graphical user interface (GUI) to manipulate the Protein Data Bank file containing the three-dimensional atomic coordinates of protein structures. The program also allows users to save the manipulated three-dimensional atomic coordinate file on their local client system. These fragments are used in various stages of structure elucidation and analysis. This software is incorporated with all the three-dimensional protein structures available in the Protein Data Bank, which presently holds approximately 18 000 structures. In addition, this program works on a three-dimensional atomic coordinate file (Protein Data Bank format) uploaded from the client machine. The program is written using CGI/PERL scripts and is platform independent. The program PDB Goodies can be accessed over the World Wide Web at http:// 144.16.71.11/pdbgoodies/.

Bayesian framework and message passing for joint support and signal recovery of approximately sparse signals

In this paper, we develop a low-complexity message passing algorithm for joint support and signal recovery of approximately sparse signals. The problem of recovery of strictly sparse signals from noisy measurements can be viewed as a problem of recovery of approximately sparse signals from noiseless measurements, making the approach applicable to strictly sparse signal recovery from noisy measurements. The support recovery embedded in the approach makes it suitable for recovery of signals with same sparsity profiles, as in the problem of multiple measurement vectors (MMV). Simulation results show that the proposed algorithm, termed as JSSR-MP (joint support and signal recovery via message passing) algorithm, achieves performance comparable to that of sparse Bayesian learning (M-SBL) algorithm in the literature, at one order less complexity compared to the M-SBL algorithm.

An approximately H-1-optimal Petrov-Galerkin meshfree method: application to computation of scattered light for optical tomography

Nearly pollution-free solutions of the Helmholtz equation for k-values corresponding to visible light are demonstrated and verified through experimentally measured forward scattered intensity from an optical fiber. Numerically accurate solutions are, in particular, obtained through a novel reformulation of the H-1 optimal Petrov-Galerkin weak form of the Helmholtz equation. Specifically, within a globally smooth polynomial reproducing framework, the compact and smooth test functions are so designed that their normal derivatives are zero everywhere on the local boundaries of their compact supports. This circumvents the need for a priori knowledge of the true solution on the support boundary and relieves the weak form of any jump boundary terms. For numerical demonstration of the above formulation, we used a multimode optical fiber in an index matching liquid as the object. The scattered intensity and its normal derivative are computed from the scattered field obtained by solving the Helmholtz equation, using the new formulation and the conventional finite element method. By comparing the results with the experimentally measured scattered intensity, the stability of the solution through the new formulation is demonstrated and its closeness to the experimental measurements verified.

Joint Approximately Sparse Channel Estimation and Data Detection in OFDM Systems Using Sparse Bayesian Learning

It is well known that the impulse response of a wide-band wireless channel is approximately sparse, in the sense that it has a small number of significant components relative to the channel delay spread. In this paper, we consider the estimation of the unknown channel coefficients and its support in OFDM systems using a sparse Bayesian learning (SBL) framework for exact inference. In a quasi-static, block-fading scenario, we employ the SBL algorithm for channel estimation and propose a joint SBL (J-SBL) and a low-complexity recursive J-SBL algorithm for joint channel estimation and data detection. In a time-varying scenario, we use a first-order autoregressive model for the wireless channel and propose a novel, recursive, low-complexity Kalman filtering-based SBL (KSBL) algorithm for channel estimation. We generalize the KSBL algorithm to obtain the recursive joint KSBL algorithm that performs joint channel estimation and data detection. Our algorithms can efficiently recover a group of approximately sparse vectors even when the measurement matrix is partially unknown due to the presence of unknown data symbols. Moreover, the algorithms can fully exploit the correlation structure in the multiple measurements. Monte Carlo simulations illustrate the efficacy of the proposed techniques in terms of the mean-square error and bit error rate performance.

Nanostructuring of p- and n-type skutterudites reaching figures of merit of approximately 1.3 and 1.6, respectively

Thermoelectric (TE) conversion of waste heat into useful electricity demands optimized thermal and electrical transport in the leg material over a wide temperature range. In order to gain a reasonably high figure of merit (ZT) as well as high thermal electric conversion efficiency, various conditions of the starting material were studied: industrially produced skutterudite powders of p-type DDy(Fe1-xCox)(4)Sb-12 (DD: didymium) and n-type (Mm, Sm)(y)Co4Sb12 (Mm: mischmetal) were used. After a rather fast reaction-melting technique, the bulk was crushed and sieved with various strainers in order to obtain particles below the respective mesh sizes, followed by ball-milling under three different conditions. The dependence of the TE properties (after hot pressing) on the micro/nanosized particles, grains and crystallites was investigated. Optimized conditions resulted in an increase of ZT for bulk material to current record-high values: from ZT similar to 1.1 to ZT similar to 1.3 at 775 K for p-type and from ZT similar to 1.0 to ZT similar to 1.6 at 800 K for n-type, resulting in respective efficiencies (300-850 K) of eta > 13% and eta similar to 16%. (C) 2014 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Approximately Uniform Random Sampling in Sensor Networks

Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates broadcast queries to all sensors and use in-network aggregation of responses to minimize messaging costs. In this work, we focus on uniform random sampling across nodes, which can serve both as an alternative building block for aggregation and as an integral component of many other useful randomized algorithms. Prior to our work, the best existing proposals for uniform random sampling of sensors involve contacting all nodes in the network. We propose a practical method which is only approximately uniform, but contacts a number of sensors proportional to the diameter of the network instead of its size. The approximation achieved is tunably close to exact uniform sampling, and only relies on well-known existing primitives, namely geographic routing, distributed computation of Voronoi regions and von Neumann's rejection method. Ultimately, our sampling algorithm has the same worst-case asymptotic cost as routing a point-to-point message, and thus it is asymptotically optimal among request/reply-based sampling methods. We provide experimental results demonstrating the effectiveness of our algorithm on both synthetic and real sensor topologies.

Natural hybridization between genera that diverged from each other approximately 60 million years ago.

A fern from the French Pyrenees-×Cystocarpium roskamianum-is a recently formed intergeneric hybrid between parental lineages that diverged from each other approximately 60 million years ago (mya; 95% highest posterior density: 40.2-76.2 mya). This is an extraordinarily deep hybridization event, roughly akin to an elephant hybridizing with a manatee or a human with a lemur. In the context of other reported deep hybrids, this finding suggests that populations of ferns, and other plants with abiotically mediated fertilization, may evolve reproductive incompatibilities more slowly, perhaps because they lack many of the premating isolation mechanisms that characterize most other groups of organisms. This conclusion implies that major features of Earth's biodiversity-such as the relatively small number of species of ferns compared to those of angiosperms-may be, in part, an indirect by-product of this slower "speciation clock" rather than a direct consequence of adaptive innovations by the more diverse lineages.