Nonlinear excitations in strongly-coupled plasma lattices: envelope solitons, kinks and intrinsic localized modes

Ensembles of charged particles (plasmas) are a highly complex form of matter, most often modeled as a many-body system characterized by weak inter-particle interactions (electrostatic coupling). However, strongly-coupled plasma configurations have recently been produced in laboratory, either by creating ultra-cold plasmas confined in a trap or by manipulating dusty plasmas in discharge experiments. In this paper, the nonlinear aspects involved in the motion of charged dust grains in a one-dimensional plasma monolayer (crystal) are discussed. Different types of collective excitations are reviewed, and characteristics and conditions for their occurrence in dusty plasma crystals are discussed, in a quasi-continuum approximation. Dust crystals are shown to support nonlinear kink-shaped supersonic solitary longitudinal excitations, as well as modulated envelope localized modes associated with longitudinal and transverse vibrations. Furthermore, the possibility for intrinsic localized modes (ILMs) — Discrete Breathers (DBs) — to occur is investigated, from first principles. The effect of mode-coupling is also briefly considered. The relation to previous results on atomic chains, and also to experimental results on strongly-coupled dust layers in gas discharge plasmas, is briefly discussed.

QR decomposition-based matrix inversion for high performance embedded MIMO receivers

Real-time matrix inversion is a key enabling technology in multiple-input multiple-output (MIMO) communications systems, such as 802.11n. To date, however, no matrix inversion implementation has been devised which supports real-time operation for these standards. In this paper, we overcome this barrier by presenting a novel matrix inversion algorithm which is ideally suited to high performance floating-point implementation. We show how the resulting architecture offers fundamentally higher performance than currently published matrix inversion approaches and we use it to create the first reported architecture capable of supporting real-time 802.11n operation. Specifically, we present a matrix inversion approach based on modified squared Givens rotations (MSGR). This is a new QR decomposition algorithm which overcomes critical limitations in other QR algorithms that prohibits their application to MIMO systems. In addition, we present a novel modification that further reduces the complexity of MSGR by almost 20%. This enables real-time implementation with negligible reduction in the accuracy of the inversion operation, or the BER of a MIMO receiver based on this.

Optimal glycaemic control, pre-eclampsia and gestational hypertension in women with type 1 diabetes in the Diabetes and Pre-Eclampsia Intervention Trial

OBJECTIVE
To assess the relationship between glycemic control, pre-eclampsia, and gestational hypertension in women with type 1 diabetes.

RESEARCH DESIGN AND METHODS
Pregnancy outcome (pre-eclampsia or gestational hypertension) was assessed prospectively in 749 women from the randomized controlled Diabetes and Pre-eclampsia Intervention Trial (DAPIT). HbA1c (A1C) values were available up to 6 months before pregnancy (n = 542), at the first antenatal visit (median 9 weeks) (n = 721), at 26 weeks’ gestation (n = 592), and at 34 weeks’ gestation (n = 519) and were categorized as optimal (<6.1%: referent), good (6.1–6.9%), moderate (7.0–7.9%), and poor (=8.0%) glycemic control, respectively.

RESULTS
Pre-eclampsia and gestational hypertension developed in 17 and 11% of pregnancies, respectively. Women who developed pre-eclampsia had significantly higher A1C values before and during pregnancy compared with women who did not develop pre-eclampsia (P < 0.05, respectively). In early pregnancy, A1C =8.0% was associated with a significantly increased risk of pre-eclampsia (odds ratio 3.68 [95% CI 1.17–11.6]) compared with optimal control. At 26 weeks’ gestation, A1C values =6.1% (good: 2.09 [1.03–4.21]; moderate: 3.20 [1.47–7.00]; and poor: 3.81 [1.30–11.1]) and at 34 weeks’ gestation A1C values =7.0% (moderate: 3.27 [1.31–8.20] and poor: 8.01 [2.04–31.5]) significantly increased the risk of pre-eclampsia compared with optimal control. The adjusted odds ratios for pre-eclampsia for each 1% decrement in A1C before pregnancy, at the first antenatal visit, at 26 weeks’ gestation, and at 34 weeks’ gestation were 0.88 (0.75–1.03), 0.75 (0.64–0.88), 0.57 (0.42–0.78), and 0.47 (0.31–0.70), respectively. Glycemic control was not significantly associated with gestational hypertension.

CONCLUSIONS
Women who developed pre-eclampsia had significantly higher A1C values before and during pregnancy. These data suggest that optimal glycemic control both early and throughout pregnancy may reduce the risk of pre-eclampsia in women with type 1 diabetes.

Real-valued fixed-complexity sphere decoder for high dimensional QAM-MIMO systems

The development of high performance, low computational complexity detection algorithms is a key challenge for real-time Multiple-Input Multiple-Output (MIMO) communication system design. The Fixed-Complexity Sphere Decoder (FSD) algorithm is one of the most promising approaches, enabling quasi-ML decoding accuracy and high performance implementation due to its deterministic, highly parallel structure. However, it suffers from exponential growth in computational complexity as the number of MIMO transmit antennas increases, critically limiting its scalability to larger MIMO system topologies. In this paper, we present a solution to this problem by applying a novel cutting protocol to the decoding tree of a real-valued FSD algorithm. The new Real-valued Fixed-Complexity Sphere Decoder (RFSD) algorithm derived achieves similar quasi-ML decoding performance as FSD, but with an average 70% reduction in computational complexity, as we demonstrate from both theoretical and implementation perspectives for Quadrature Amplitude Modulation (QAM)-MIMO systems.

Low-complexity iterative method of equalization for single carrier with cyclic prefix in doubly selective channels

Orthogonal frequency division multiplexing (OFDM) requires an expensive linear amplifier at the transmitter due to its high peak-to-average power ratio (PAPR). Single carrier with cyclic prefix (SC-CP) is a closely related transmission scheme that possesses most of the benefits of OFDM but does not have the PAPR problem. Although in a multipath environment, SC-CP is very robust to frequency-selective fading, it is sensitive to the time-selective fading characteristics of the wireless channel that disturbs the orthogonality of the channel matrix (CM) and increases the computational complexity of the receiver. In this paper, we propose a time-domain low-complexity iterative algorithm to compensate for the effects of time selectivity of the channel that exploits the sparsity present in the channel convolution matrix. Simulation results show the superior performance of the proposed algorithm over the standard linear minimum mean-square error (L-MMSE) equalizer for SC-CP.

Image segmentation based on multi-scan constraint satisfaction neural network

A novel image segmentation method based on a constraint satisfaction neural network (CSNN) is presented. The new method uses CSNN-based relaxation but with a modified scanning scheme of the image. The pixels are visited with more distant intervals and wider neighborhoods in the first level of the algorithm. The intervals between pixels and their neighborhoods are reduced in the following stages of the algorithm. This method contributes to the formation of more regular segments rapidly and consistently. A cluster validity index to determine the number of segments is also added to complete the proposed method into a fully automatic unsupervised segmentation scheme. The results are compared quantitatively by means of a novel segmentation evaluation criterion. The results are promising.

On the Performance of Eigenvalue-Based Cooperative Spectrum Sensing for Cognitive Radio

In this paper, the distribution of the ratio of extreme eigenvalues of a complex Wishart matrix is studied in order to calculate the exact decision threshold as a function of the desired probability of false alarm for the maximum-minimum eigenvalue (MME) detector. In contrast to the asymptotic analysis reported in the literature, we consider a finite number of cooperative receivers and a finite number of samples and derive the exact decision threshold for the probability of false alarm. The proposed exact formulation is further reduced to the case of two receiver-based cooperative spectrum sensing. In addition, an approximate closed-form formula of the exact threshold is derived in terms of a desired probability of false alarm for a special case having equal number of receive antennas and signal samples. Finally, the derived analytical exact decision thresholds are verified with Monte-Carlo simulations. We show that the probability of detection performance using the proposed exact decision thresholds achieves significant performance gains compared to the performance of the asymptotic decision threshold.

Nonrigid Structure-From-Motion From 2-D Images Using Markov Chain Monte Carlo

In this paper we present a new method for simultaneously determining three dimensional (3-D) shape and motion of a non-rigid object from uncalibrated two dimensional (2- D) images without assuming the distribution characteristics. A non-rigid motion can be treated as a combination of a rigid rotation and a non-rigid deformation. To seek accurate recovery of deformable structures, we estimate the probability distribution function of the corresponding features through random sampling, incorporating an established probabilistic model. The fitting between the observation and the projection of the estimated 3-D structure will be evaluated using a Markov chain Monte Carlo based expectation maximisation algorithm. Applications of the proposed method to both synthetic and real image sequences are demonstrated with promising results.

A novel method of embedding distributed optical fiber sensor for structural health monitoring

A distributed optical fiber sensor based on Brillouin scattering (BOTDR or BOTDA) can measure and monitor strain and temperature generated along optical fiber. Because it can measure in real-time with high precision and stability, it is quite suitable for health monitoring of large-scale civil infrastructures. However, the main challenge of applying it to structural health monitoring is to ensure it is robust and can be repaired by adopting a suitable embedding method. In this paper, a novel method based on air-blowing and vacuum grouting techniques for embedding long-distance optical fiber sensors was developed. This method had no interference with normal concrete construction during its installation, and it could easily replace the long-distance embedded optical fiber sensor (LEOFS). Two stages of static loading tests were applied to investigate the performance of the LEOFS. The precision and the repeatability of the LEOFS were studied through an overloading test. The durability and the stability of the LEOFS were confirmed by a corrosion test. The strains of the LEOFS were used to evaluate the reinforcing effect of carbon fiber reinforced polymer and thereby the health state of the beams.

Quantum circuits for spin and flavor degrees of freedom of quarks forming nucleons

We discuss the quantum-circuit realization of the state of a nucleon in the scope of simple simmetry groups. Explicit algorithms are presented for the preparation of the state of a neutron or a proton as resulting from the composition of their quark constituents. We estimate the computational resources required for such a simulation and design a photonic network for its implementation. Moreover, we highlight that current work on three-body interactions in lattices of interacting qubits, combined with the measurement-based paradigm for quantum information processing, may also be suitable for the implementation of these nucleonic spin states.

Improved conjugate gradient implementation for least squares support vector machines

As a promising method for pattern recognition and function estimation, least squares support vector machines (LS-SVM) express the training in terms of solving a linear system instead of a quadratic programming problem as for conventional support vector machines (SVM). In this paper, by using the information provided by the equality constraint, we transform the minimization problem with a single equality constraint in LS-SVM into an unconstrained minimization problem, then propose reduced formulations for LS-SVM. By introducing this transformation, the times of using conjugate gradient (CG) method, which is a greatly time-consuming step in obtaining the numerical solution, are reduced to one instead of two as proposed by Suykens et al. (1999). The comparison on computational speed of our method with the CG method proposed by Suykens et al. and the first order and second order SMO methods on several benchmark data sets shows a reduction of training time by up to 44%. (C) 2011 Elsevier B.V. All rights reserved.

Joint complex diversity coding and channel coding over space, time and frequency

This study provides a general diversity analysis for joint complex diversity coding (CDC) and channel coding-based space-time-frequency codeing is provided. The mapping designs from channel coding to CDC are crucial for efficient exploitation of the diversity potential. This study provides and proves a sufficient condition of full diversity construction with joint three-dimensional CDC and channel coding, bit-interleaved coded complex diversity coding and symbol-interleaved coded complex diversity coding. Both non-iterative and iterative detections of joint channel code and CDC transmission are investigated. The proposed minimum mean-square error-based iterative soft decoding achieves the performance of the soft sphere decoding with reduced complexity.

On MIMO Radar Subarrayed Transmit Beamforming

Multiple-input-multiple-output (MIMO) radar schemes whereby the transmit array is partitioned into subarrays have recently been proposed in the literature to combine advantages of phased array and MIMO radar technology. In this work, we utilize this architecture to significantly simplify a transmit procedure in which the covariance matrix across the MIMO radar array is optimized to improve the Cramer-Rao bound (CRB) on target parameter estimation. The MIMO effective array for regular subarrayed transmit apertures is studied, and necessary conditions to obtain a filled effective aperture are presented, which is important for maintaining nonambiguous, low sidelobe beampatterns. The performance of the subarrayed transmit approach is evaluated in terms of the CRB on target parameter estimation, and the optimisation of the beamformer applied to the subarrays to minimize the CRB is considered. The subarrayed transmit scheme is found to have a CRB which is suboptimal to the full diversity transmission, as expected, but is solvable in a small fraction of the time using an iterative beamspace algorithm developed here.