Polydispersity index from linear viscoelastic data: Unimodal and bimodal linear polymer melts

This article describes a method for determining the polydispersity index Ip2=Mz/Mw of the molecular weight distribution (MWD) of linear polymeric materials from linear viscoelastic data. The method uses the Mellin transform of the relaxation modulus of a simple molecular rheological model. One of the main features of this technique is that it enables interesting MWD information to be obtained directly from dynamic shear experiments. It is not necessary to achieve the relaxation spectrum, so the ill-posed problem is avoided. Furthermore, a determinate shape of the continuous MWD does not have to be assumed in order to obtain the polydispersity index. The technique has been developed to deal with entangled linear polymers, whatever the form of the MWD is. The rheological information required to obtain the polydispersity index is the storage G′(ω) and loss G″(ω) moduli, extending from the terminal zone to the plateau region. The method provides a good agreement between the proposed theoretical approach and the experimental polydispersity indices of several linear polymers for a wide range of average molecular weights and polydispersity indices. It is also applicable to binary blends.

Nuclear magnetic resonance

This article reviews the principles and methods of nuclear magnetic resonance spectroscopy, and gives examples of applications carried out at ourFacility, which illustrate the capabilities of the technique.

On the tractability of the piecewise-linear approximation for general discrete-choice network revenue management

The choice network revenue management (RM) model incorporates customer purchase behavioras customers purchasing products with certain probabilities that are a function of the offeredassortment of products, and is the appropriate model for airline and hotel network revenuemanagement, dynamic sales of bundles, and dynamic assortment optimization. The underlyingstochastic dynamic program is intractable and even its certainty-equivalence approximation, inthe form of a linear program called Choice Deterministic Linear Program (CDLP) is difficultto solve in most cases. The separation problem for CDLP is NP-complete for MNL with justtwo segments when their consideration sets overlap; the affine approximation of the dynamicprogram is NP-complete for even a single-segment MNL. This is in contrast to the independentclass(perfect-segmentation) case where even the piecewise-linear approximation has been shownto be tractable. In this paper we investigate the piecewise-linear approximation for network RMunder a general discrete-choice model of demand. We show that the gap between the CDLP andthe piecewise-linear bounds is within a factor of at most 2. We then show that the piecewiselinearapproximation is polynomially-time solvable for a fixed consideration set size, bringing itinto the realm of tractability for small consideration sets; small consideration sets are a reasonablemodeling tradeoff in many practical applications. Our solution relies on showing that forany discrete-choice model the separation problem for the linear program of the piecewise-linearapproximation can be solved exactly by a Lagrangian relaxation. We give modeling extensionsand show by numerical experiments the improvements from using piecewise-linear approximationfunctions.

SAT Modulo Linear Arithmetic for Solving Polynomial

Polynomial constraint solving plays a prominent role in several areas of hardware and software analysis and verification, e.g., termination proving, program invariant generation and hybrid system verification, to name a few. In this paper we propose a new method for solving non-linear constraints based on encoding the problem into an SMT problem considering only linear arithmetic. Unlike other existing methods, our method focuses on proving satisfiability of the constraints rather than on proving unsatisfiability, which is more relevant in several applications as we illustrate with several examples. Nevertheless, we also present new techniques based on the analysis of unsatisfiable cores that allow one to efficiently prove unsatisfiability too for a broad class of problems. The power of our approach is demonstrated by means of extensive experiments comparing our prototype with state-of-the-art tools on benchmarks taken both from the academic and the industrial world.

Maximum likelihood Linear Programming Data Fusion for Speaker Recognition

Biometric system performance can be improved by means of data fusion. Several kinds of information can be fused in order to obtain a more accurate classification (identification or verification) of an input sample. In this paper we present a method for computing the weights in a weighted sum fusion for score combinations, by means of a likelihood model. The maximum likelihood estimation is set as a linear programming problem. The scores are derived from a GMM classifier working on a different feature extractor. Our experimental results assesed the robustness of the system in front a changes on time (different sessions) and robustness in front a change of microphone. The improvements obtained were significantly better (error bars of two standard deviations) than a uniform weighted sum or a uniform weighted product or the best single classifier. The proposed method scales computationaly with the number of scores to be fussioned as the simplex method for linear programming.

A non-linear VAD for noisy environments

This paper deals with non-linear transformations for improving the performance of an entropy-based voice activity detector (VAD). The idea to use a non-linear transformation has already been applied in the field of speech linear prediction, or linear predictive coding (LPC), based on source separation techniques, where a score function is added to classical equations in order to take into account the true distribution of the signal. We explore the possibility of estimating the entropy of frames after calculating its score function, instead of using original frames. We observe that if the signal is clean, the estimated entropy is essentially the same; if the signal is noisy, however, the frames transformed using the score function may give entropy that is different in voiced frames as compared to nonvoiced ones. Experimental evidence is given to show that this fact enables voice activity detection under high noise, where the simple entropy method fails.

Non-Linear and Non-Conventional Speech Processing: Alternative Techniques

This special issue aims to cover some problems related to non-linear and nonconventional speech processing. The origin of this volume is in the ISCA Tutorial and Research Workshop on Non-Linear Speech Processing, NOLISP’09, held at the Universitat de Vic (Catalonia, Spain) on June 25–27, 2009. The series of NOLISP workshops started in 2003 has become a biannual event whose aim is to discuss alternative techniques for speech processing that, in a sense, do not fit into mainstream approaches. A selected choice of papers based on the presentations delivered at NOLISP’09 has given rise to this issue of Cognitive Computation.

A Canonical Genetic Algorithm for Blind Inversion of Linear Channels

It is well known the relationship between source separation and blind deconvolution: If a filtered version of an unknown i.i.d. signal is observed, temporal independence between samples can be used to retrieve the original signal, in the same manner as spatial independence is used for source separation. In this paper we propose the use of a Genetic Algorithm (GA) to blindly invert linear channels. The use of GA is justified in the case of small number of samples, where other gradient-like methods fails because of poor estimation of statistics.

Stochastic resonance in a dipole

We show that the dipole, a system usually proposed to model relaxation phenomena, exhibits a maximum in the signal-to-noise ratio at a nonzero noise level, thus indicating the appearance of stochastic resonance. The phenomenon occurs in two different situations, i.e., when the minimum of the potential of the dipole remains fixed in time and when it switches periodically between two equilibrium points. We have also found that the signal-to-noise ratio has a maximum for a certain value of the amplitude of the oscillating field.

Cardiac motion estimation by joint alignment of tagged MRI sequences

Image registration has been proposed as an automatic method for recovering cardiac displacement fields from Tagged Magnetic Resonance Imaging (tMRI) sequences. Initially performed as a set of pairwise registrations, these techniques have evolved to the use of 3D+t deformation models, requiring metrics of joint image alignment (JA). However, only linear combinations of cost functions defined with respect to the first frame have been used. In this paper, we have applied k-Nearest Neighbors Graphs (kNNG) estimators of the -entropy (H ) to measure the joint similarity between frames, and to combine the information provided by different cardiac views in an unified metric. Experiments performed on six subjects showed a significantly higher accuracy (p < 0.05) with respect to a standard pairwise alignment (PA) approach in terms of mean positional error and variance with respect to manually placed landmarks. The developed method was used to study strains in patients with myocardial infarction, showing a consistency between strain, infarction location, and coronary occlusion. This paper also presentsan interesting clinical application of graph-based metric estimators, showing their value for solving practical problems found in medical imaging.

Entropic stochastic resonance

We present a novel scheme for the appearance of stochastic resonance when the dynamics of a Brownian particle takes place in a confined medium. The presence of uneven boundaries, giving rise to an entropic contribution to the potential, may upon application of a periodic driving force result in an increase of the spectral amplification at an optimum value of the ambient noise level. The entropic stochastic resonance, characteristic of small-scale systems, may constitute a useful mechanism for the manipulation and control of single molecules and nanodevices.

Endorectal Magnetic Resonance Imaging and Spectroscopy Are Useful for Selecting Candidates for Biopsy among Patients with Persistently Elevated Prostate Specific Antigen

To evaluate the efficacy of endorectal Magnetic Resonance Imaging (MRI) and Magnetic Resonance Spetroscopic Imaging (MRSI) combined with total prostate-specific antigen (tPSA) and free prostate-specific antigen (fPSA) in selecting candidates for biopsy. Subjects and Methods: 246 patients with elevated tPSA (median: 7.81 ng/ml) underwent endorectal MRI and MRSI before Transrectal Ultrasound (TRUS) biopsy (10 peripheral + 2 central cores); patients with positive biopsies were treated with radical intention; those with negative biopsies were followed up and underwent MRSI before each additional biopsy if tPSA rose persistently. Mean follow-up: 27.6 months. We compared MRI, MRSI, tPSA, and fPSA with histopathology by sextant and determined the association between the Gleason score and MRI and MRSI. We determined the most accurate combination to detect prostate cancer (PCa) using receiver operating curves; we estimated the odds ratios (OR) and calculated sensitivity, specificity, and positive and negative predictive values. Results: No difference in tPSA was found between patients with and without PCa (p = 0.551). In the peripheral zone, the risk of PCa increased with MRSI grade; patients with high-grade MRSI had the greatest risk of PCa over time (OR = 328.6); the model including MRI, MRSI, tPSA, and fPSA was more accurate (Area under Curve: AUC = 95.7%) than MRI alone (AUC = 85.1%) or fPSA alone (AUC = 78.1%), but not than MRSI alone (94.5%). In the transitional zone, the model was less accurate (AUC = 84.4%). The association (p = 0.005) between MRSI and Gleason score was significant in both zones. Conclusions: MRSI is useful in patients with elevated tPSA. High-grade MRSI lesions call for repeated biopsies. Men with negative MRSI may forgo further biopsies because a significantly high Gleason lesion is very unlikely

Bayes linear spaces

Linear spaces consisting of σ-finite probability measures and infinite measures (improper priors and likelihood functions) are defined. The commutative group operation, called perturbation, is the updating given by Bayes theorem; the inverse operation is the Radon-Nikodym derivative. Bayes spaces of measures are sets of classes of proportional measures. In this framework, basic notions of mathematical statistics get a simple algebraic interpretation. For example, exponential families appear as affine subspaces with their sufficient statistics as a basis. Bayesian statistics, in particular some well-known properties of conjugated priors and likelihood functions, are revisited and slightly extended

Brain functional abnormality in schizo-affective disorder: an fMRI study.

Background.Schizo-affective disorder has not been studied to any significant extent using functional imaging. The aim of this study was to examine patterns of brain activation and deactivation in patients meeting strict diagnostic criteria for the disorder. METHOD: Thirty-two patients meeting research diagnostic criteria (RDC) for schizo-affective disorder (16 schizomanic and 16 schizodepressive) and 32 matched healthy controls underwent functional magnetic resonance imaging (fMRI) during performance of the n-back task. Linear models were used to obtain maps of activations and deactivations in the groups. RESULTS: Controls showed activation in a network of frontal and other areas and also deactivation in the medial frontal cortex, the precuneus and the parietal cortex. Schizo-affective patients activated significantly less in prefrontal, parietal and temporal regions than the controls, and also showed failure of deactivation in the medial frontal cortex. When task performance was controlled for, the reduced activation in the dorsolateral prefrontal cortex (DLPFC) and the failure of deactivation of the medial frontal cortex remained significant. CONCLUSIONS: Schizo-affective disorder shows a similar pattern of reduced frontal activation to schizophrenia. The disorder is also characterized by failure of deactivation suggestive of default mode network dysfunction.

Brain functional abnormality in schizo-affective disorder: an fMRI study.

Background.Schizo-affective disorder has not been studied to any significant extent using functional imaging. The aim of this study was to examine patterns of brain activation and deactivation in patients meeting strict diagnostic criteria for the disorder. METHOD: Thirty-two patients meeting research diagnostic criteria (RDC) for schizo-affective disorder (16 schizomanic and 16 schizodepressive) and 32 matched healthy controls underwent functional magnetic resonance imaging (fMRI) during performance of the n-back task. Linear models were used to obtain maps of activations and deactivations in the groups. RESULTS: Controls showed activation in a network of frontal and other areas and also deactivation in the medial frontal cortex, the precuneus and the parietal cortex. Schizo-affective patients activated significantly less in prefrontal, parietal and temporal regions than the controls, and also showed failure of deactivation in the medial frontal cortex. When task performance was controlled for, the reduced activation in the dorsolateral prefrontal cortex (DLPFC) and the failure of deactivation of the medial frontal cortex remained significant. CONCLUSIONS: Schizo-affective disorder shows a similar pattern of reduced frontal activation to schizophrenia. The disorder is also characterized by failure of deactivation suggestive of default mode network dysfunction.