The use of phase codes in ultrasound imaging: SNR gain and bandwidth requirements

Most of the literature on coded excitation describes the signal-to-noise ratio gain of a coded waveform in terms of the time-bandwidth product. We have shown that in the context of ultrasound imaging, the expression for the SNR gain provided by matched filtering a coded waveform, can be reduced to the total number of chips in the transmit signal. Hence, the SNR gain is independent of both the bandwidth and the duration of a single-chip. This concept is described in detail, clarifying this seeming contradiction. The impact of bandwidth and pulse duration on the SNR, SNR gain and axial resolution is described. Bandwidth requirements and the impact of regulatory peak-power limitations are also addressed.     

Design of RLS Wiener fixed-lag smoother using covariance information in linear discrete stochastic systems

In this paper, we propose a new design for the recursive least-squares (RLS) Wiener fixed-lag smoother and filter in linear discrete-time wide-sense stationary stochastic systems. It is assumed that the signal is observed with additive white observation noise. The signal is uncorrelated with the observation noise. The estimators require knowledge of the system matrix, the observation matrix and the variance of the state vector. These quantities can be obtained from the auto-covariance function of the signal. In the estimation algorithms, moreover, the variance of the observation noise is assumed to be known, as a priori information.     

Bell polynomials and binomial type sequences

This paper concerns the study of the Bell polynomials and the binomial type sequences. We mainly establish some relations tied to these important concepts. Furthermore, these obtained results are exploited to deduce some interesting relations concerning the Bell polynomials which enable us to obtain some new identities for the Bell polynomials. Our results are illustrated by some comprehensive examples.     

A two-dimensional matrix Padé-type approximation in the inner product space

By introducing a bivariate matrix-valued linear functional on the scalar polynomial space, a general two-dimensional (2-D) matrix Padé-type approximant (BMPTA) in the inner product space is defined in this paper. The coefficients of its denominator polynomials are determined by taking the direct inner product of matrices. The remainder formula is developed and an algorithm for the numerator polynomials is presented when the generating polynomials are given in advance. By means of the Hankel-like coefficient matrix, a determinantal expression of BMPTA is presented. Moreover, to avoid the computation of the determinants, two efficient recursive algorithms are proposed. At the end the method of BMPTA is applied to partial realization problems of 2-D linear systems.     

Positivity of third order linear recurrence sequences

It is shown that the Positivity Problem for a sequence satisfying a third order linear recurrence with integer coefficients, i.e., the problem whether each element of this sequence is nonnegative, is decidable.     

An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees

The problem of reconstructing the duplication tree of a set of tandemly repeated sequences which are supposed to have arisen by unequal recombination, was first introduced by Fitch (1977), and has recently received a lot of attention. In this paper, we place ourselves in a distance framework and deal with the restricted problem of reconstructing single copy duplication trees. We describe an exact and polynomial distance based algorithm for solving this problem, the parsimony version of which has previously been shown to be NP-hard (like most evolutionary tree reconstruction problems). This algorithm is based on the minimum evolution principle, and thus involves selecting the shortest tree as being the correct duplication tree. After presenting the underlying mathematical concepts behind the minimum evolution principle, and some of its benefits (such as statistical consistency), we provide a new recurrence formula to estimate the tree length using ordinary least-squares, given a matrix of pairwise distances between the copies. We then show how this formula naturally forms the dynamic programming framework on which our algorithm is based, and provide an implementation in O(n³) time and O(n²) space, where n is the number of copies.     

A comparison of rigid and flexible crosslinked polymer-supported peptide synthesis

To correlate the coupling difficulty and nature of the support in solid-phase peptide synthesis, a set of difficult peptides were built under identical conditions on rigid and hydrophobic divinyl benzene-crosslinked polystyrene (DVB-PS) and flexible and polar 1,4-butanediol dimethacrylate-crosslinked polystyrene (BDDMA-PS) resins of same functional capacity (∼2 mmol/g). The difficult coupling stages observed on each support were identified by monitoring the acylation time, coupling yield and deprotection efficiency. The yield and purity of the peptides prepared on BDDMA-PS were higher than when DVB-PS support was used.     

A new sharpened version of the Neuberg–Pedoe inequality

In this work, we present a new sharpened version of the classical Neuberg–Pedoe inequality. As an application, the following improved Neuberg–Pedoe inequality is derived:

     

两两NQD列加权和的安全收敛性

本文研究两两NQD系加权和的完全收敛性，证明了一般双下标加权系数的加权部分和的完全收敛性，改进了吴群英（2002）的结果。