Temporal SNR characteristics in segmented 3D-EPI at 7T.

Three-dimensional segmented echo planar imaging (3D-EPI) is a promising approach for high-resolution functional magnetic resonance imaging, as it provides an increased signal-to-noise ratio (SNR) at similar temporal resolution to traditional multislice 2D-EPI readouts. Recently, the 3D-EPI technique has become more frequently used and it is important to better understand its implications for fMRI. In this study, the temporal SNR characteristics of 3D-EPI with varying numbers of segments are studied. It is shown that, in humans, the temporal variance increases with the number of segments used to form the EPI acquisition and that for segmented acquisitions, the maximum available temporal SNR is reduced compared to single shot acquisitions. This reduction with increased segmentation is not found in phantom data and thus likely due to physiological processes. When operating in the thermal noise dominated regime, fMRI experiments with a motor task revealed that the 3D variant outperforms the 2D-EPI in terms of temporal SNR and sensitivity to detect activated brain regions. Thus, the theoretical SNR advantage of a segmented 3D-EPI sequence for fMRI only exists in a low SNR situation. However, other advantages of 3D-EPI, such as the application of parallel imaging techniques in two dimensions and the low specific absorption rate requirements, may encourage the use of the 3D-EPI sequence for fMRI in situations with higher SNR.

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.

Comparison of the polynomial model against explicit measurements of noise components for different mammography systems.

Given the adverse impact of image noise on the perception of important clinical details in digital mammography, routine quality control measurements should include an evaluation of noise. The European Guidelines, for example, employ a second-order polynomial fit of pixel variance as a function of detector air kerma (DAK) to decompose noise into quantum, electronic and fixed pattern (FP) components and assess the DAK range where quantum noise dominates. This work examines the robustness of the polynomial method against an explicit noise decomposition method. The two methods were applied to variance and noise power spectrum (NPS) data from six digital mammography units. Twenty homogeneously exposed images were acquired with PMMA blocks for target DAKs ranging from 6.25 to 1600 µGy. Both methods were explored for the effects of data weighting and squared fit coefficients during the curve fitting, the influence of the additional filter material (2 mm Al versus 40 mm PMMA) and noise de-trending. Finally, spatial stationarity of noise was assessed.Data weighting improved noise model fitting over large DAK ranges, especially at low detector exposures. The polynomial and explicit decompositions generally agreed for quantum and electronic noise but FP noise fraction was consistently underestimated by the polynomial method. Noise decomposition as a function of position in the image showed limited noise stationarity, especially for FP noise; thus the position of the region of interest (ROI) used for noise decomposition may influence fractional noise composition. The ROI area and position used in the Guidelines offer an acceptable estimation of noise components. While there are limitations to the polynomial model, when used with care and with appropriate data weighting, the method offers a simple and robust means of examining the detector noise components as a function of detector exposure.

Genetic parameters for growth traits in pigs estimated using third degree polynomial functions

Selostus: Sian kasvuominaisuuksien perinnölliset tunnusluvut arvioituna kolmannen asteen polynomifunktion avulla

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.

Symmetric periodic orbits near heteroclinic loops at infinity for a class of polynomial vector fields

For polynomial vector fields in R3, in general, it is very difficult to detect the existence of an open set of periodic orbits in their phase portraits. Here, we characterize a class of polynomial vector fields of arbitrary even degree having an open set of periodic orbits. The main two tools for proving this result are, first, the existence in the phase portrait of a symmetry with respect to a plane and, second, the existence of two symmetric heteroclinic loops.

Comparison of 3D segmented gradient-echo and steady-state free precession coronary MRI sequences in patients with coronary artery disease.

OBJECTIVE: Our objective was to compare two state-of-the-art coronary MRI (CMRI) sequences with regard to image quality and diagnostic accuracy for the detection of coronary artery disease (CAD). SUBJECTS AND METHODS: Twenty patients with known CAD were examined with a navigator-gated and corrected free-breathing 3D segmented gradient-echo (turbo field-echo) CMRI sequence and a steady-state free precession sequence (balanced turbo field-echo). CMRI was performed in a transverse plane for the left coronary artery and a double-oblique plane for the right coronary artery system. Subjective image quality (1- to 4-point scale, with 1 indicating excellent quality) and objective image quality parameters were independently determined for both sequences. Sensitivity, specificity, and accuracy for the detection of significant (> or = 50% diameter) coronary artery stenoses were determined as defined in invasive catheter X-ray coronary angiography. RESULTS: Subjective image quality was superior for the balanced turbo field-echo approach (1.8 +/- 0.9 vs 2.3 +/- 1.0 for turbo field-echo; p < 0.001). Vessel sharpness, signal-to-noise ratio, and contrast-to-noise ratio were all superior for the balanced turbo field-echo approach (p < 0.01 for signal-to-noise ratio and contrast-to-noise ratio). Of the 103 segments, 18% of turbo field-echo segments and 9% of balanced turbo field-echo segments had to be excluded from disease evaluation because of insufficient image quality. Sensitivity, specificity, and accuracy for the detection of significant coronary artery stenoses in the evaluated segments were 92%, 67%, 85%, respectively, for turbo field-echo and 82%, 82%, 81%, respectively, for balanced turbo field-echo. CONCLUSION: Balanced turbo field-echo offers improved image quality with significantly fewer nondiagnostic segments when compared with turbo field-echo. For the detection of CAD, both sequences showed comparable accuracy for the visualized segments.

Integrability of a linear center perturbed by a fourth degree homogeneous polynomial

In this work we study the integrability of a two-dimensional autonomous system in the plane with linear part of center type and non-linear part given by homogeneous polynomials of fourth degree. We give sufficient conditions for integrability in polar coordinates. Finally we establish a conjecture about the independence of the two classes of parameters which appear in the system; if this conjecture is true the integrable cases found will be the only possible ones.

Integrability of a linear center perturbed by a fifth degree homogeneous polynomial

In this work we study the integrability of two-dimensional autonomous system in the plane with linear part of center type and non-linear part given by homogeneous polynomials of fifth degree. We give a simple characterisation for the integrable cases in polar coordinates. Finally we formulate a conjecture about the independence of the two classes of parameters which appear on the system; if this conjecture is true the integrable cases found will be the only possible ones.

Multicointegration, polynomial cointegration and I(2) cointegration with structural breaks. An application to the sustainability of the US external deficit

In this paper we model the multicointegration relation, allowing for one structural break. Since multicointegration is a particular case of polynomial or I(2) cointegration, our proposal can also be applied in these cases. The paper proposes the use of a residualbased Dickey-Fuller class of statistic that accounts for one known or unknown structural break. Finite sample performance of the proposed statistic is investigated by using Monte Carlo simulations, which reveals that the statistic shows good properties in terms of empirical size and power. We complete the study with an empirical application of the sustainability of the US external deficit. Contrary to existing evidence, the consideration of one structural break leads to conclude in favour of the sustainability of the US external deficit.

Algorithm to determine the intersection curves between bezier surfaces by the solution of multivariable polynomial system and the differential marching method

The determination of the intersection curve between Bézier Surfaces may be seen as the composition of two separated problems: determining initial points and tracing the intersection curve from these points. The Bézier Surface is represented by a parametric function (polynomial with two variables) that maps a point in the tridimensional space from the bidimensional parametric space. In this article, it is proposed an algorithm to determine the initial points of the intersection curve of Bézier Surfaces, based on the solution of polynomial systems with the Projected Polyhedral Method, followed by a method for tracing the intersection curves (Marching Method with differential equations). In order to allow the use of the Projected Polyhedral Method, the equations of the system must be represented in terms of the Bernstein basis, and towards this goal it is proposed a robust and reliable algorithm to exactly transform a multivariable polynomial in terms of power basis to a polynomial written in terms of Bernstein basis .

Examining the Learning Effects of Segmented Model Demonstrations on the Motor & Cognitive Learning of the Basketball Jump Shot

The purpose of the present experiment was to determine whether learning is optimized when providing the opportunity to observe either segments, or the whole basketball jump shot. Participants performed 50 jump-shots from the free throw line during acquisition, and returned one day later for a 10 shot retention test and a memory recall test of the jump-shot technique. Shot accuracy was assessed on a 5-point scale and technique assessed on a 7-point scale. The number of components recalled correctly by participants assessed mental representation. Retention results showed superior shot technique and recall success for those participants provided control over the frequency and type of modelled information compared to participants not provided control. Furthermore, participants in the self-condition utilized the part-model information more frequently than whole-model information highlighting the effectiveness of providing the learner control over viewing multiple segments of a skill compared to only watching the whole model.

Analysis and Design of an Adaptive Polynomial Predistorter with the Loop Delay Estimator

Most adaptive linearization circuits for the nonlinear amplifier have a feedback loop that returns the output signal oj'tne eunplifier to the lineurizer. The loop delay of the linearizer most be controlled precisely so that the convergence of the linearizer should be assured lot this Letter a delay control circuit is presented. It is a delay lock loop (ULL) with it modified early-lute gate and can he easily applied to a DSP implementation. The proposed DLL circuit is applied to an adaptive linearizer with the use of a polynomial predistorter, and the simulalion for a 16-QAM signal is performed. The simulation results show that the proposed DLL eliminates the delay between the reference input signal and the delayed feedback signal of the linearizing circuit perfectly, so that the predistorter polynomial coefficients converge into the optimum value and a high degree of linearization is achieved

A generic polynomial solution for the differential equation of hypergeometric type and six sequences of orthogonal polynomials related to it

In this work, we present a generic formula for the polynomial solution families of the well-known differential equation of hypergeometric type s(x)y"n(x) + t(x)y'n(x) - lnyn(x) = 0 and show that all the three classical orthogonal polynomial families as well as three finite orthogonal polynomial families, extracted from this equation, can be identified as special cases of this derived polynomial sequence. Some general properties of this sequence are also given.