Trois vies de moines : Paul, Malchus, Hilarion /

Introduction in French; primary text in Latin and French on opposing pages.

Saint Etienne et son sanctuaire à Jérusalem /

Includes bibliographical references.

Alexandrian Christianity; selected translations of Clement and Origen with introductions and notes by John Ernest Leonard Oulton and Henry Chadwick.

Bibliographical footnotes.

Centons homériques : (Homerocentra) : Patricius, Eudocie, Optimus, Côme de Jérusalem /

Probably written over some time by various authors.

Storia della diaconia cardinalizia, e monistero abaziale di S. Agata alla Suburra : deducata all' emo. e rmo. Sig. cardinale D. Ignazio Busca, protettore della congregazione verginiana /

Signatures: pi⁴ A-L⁴ M⁴(-M4).

Certain tractates; together with the book of four score three questions, & a translation of Vincentius Lirinensis;

V.1. Introduction: Life of Winzet. List of Winzet's works, biographies, mss. [etc.] Appendix to Introduction.- Certane tractatis for reformation of doctryne and maneris set furth at the desyre and in the name of the afflictit Catholikis, in Scotland. 1562. The last blast of the trompet of Godis vvorde aganis the vsurpit auctoritie of Iohne Knox and his Caluiniane brether intrudit Precheouris &c. 1562. The buke of four scoir thre questions, tueching doctrine, ordour, and maneris, proponit to the precheouris of the Protestants in Scotland ... 1563. An exhortation to mature and godly deliberation in the premisses. To John Knox, written 27 oct. 1563. -- v. 2. Introduction. Vincentivs Lirinensis ... for the antiquitie and veritie of the Catholik fayth ... tr. in Scottis.

Sancti Pontii Meropii Pavlini Nolani Epistvlae.

Mode of access: Internet.

San Onofre.

Mode of access: Internet.

Clemens Alexandrinus /

Bd. 1. Protrepticus und Paedagogus -- Bd.2. Stromata, Buch I-VI -- Bd. 3. Stromata, Buch VII-VIII. Excerpta ex Theodoto. Eclogae prophetica. Quis dives salvetur. Fragmente -- Bd. 4. Register.

Deliberatio supra Hymnum trium puerorum. /

Includes indexes.

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.

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.