Convergence analysis of a discrete-time single-unit gradient ICA algorithm

We revisit the one-unit gradient ICA algorithm derived from the kurtosis function. By carefully studying properties of the stationary points of the discrete-time one-unit gradient ICA algorithm, with suitable condition on the learning rate, convergence can be proved. The condition on the learning rate helps alleviate the guesswork that accompanies the problem of choosing suitable learning rate in practical computation. These results may be useful to extract independent source signals on-line.

Minimising cold damage during reproductive development among temperate rice genotypes. I. Avoiding low temperature with the use of appropriate sowing time and photoperiod-sensitive varieties

Multiple-sown field trials in 4 consecutive years in the Riverina region of south-eastern Australia provided 24 different combinations of temperature and day length, which enabled the development of crop phenology models. A crop model was developed for 7 cultivars from diverse origins to identify if photoperiod sensitivity is involved in determining phenological development, and if that is advantageous in avoiding low-temperature damage. Cultivars that were mildly photoperiod-sensitive were identified from sowing to flowering and from panicle initiation to flowering. The crop models were run for 47 years of temperature data to quantify the risk of encountering low temperature during the critical young microspore stage for 5 different sowing dates. Cultivars that were mildly photoperiod-sensitive, such as Amaroo, had a reduced likelihood of encountering low temperature for a wider range of sowing dates compared with photoperiod-insensitive cultivars. The benefits of increased photoperiod sensitivity include greater sowing flexibility and reduced water use as growth duration is shortened when sowing is delayed. Determining the optimal sowing date also requires other considerations, e. g. the risk of cold damage at other sensitive stages such as flowering and the response of yield to a delay in flowering under non-limiting conditions. It was concluded that appropriate sowing time and the use of photoperiod-sensitive cultivars can be advantageous in the Riverina region in avoiding low temperature damage during reproductive development.

Are echo techniques comparable for measurement of left ventricular dysynchrony? Comparison of real time 3D and tissue Doppler echocardiography in patients with ischaemic cardiomyopathy

Tissue Doppler (TD) assessment of dysynchrony (DYS) is established in evaluation for bi-ventricular pacing. Time to regional minimal volume by real-time 3D echo (3D) has been applied to DYS. 3D offers simultaneous assessment of all segments and may limit errors in localization of maximum delay due to off-axis images.We compared TD and 3D for assessment of DYS. 27 patients with ischaemic cardiomyopathy (aged 60±11 years, 85% male) underwent TD with generation of regional velocity curves. The interval between QRS onset and maximal systolic velocity (TTV) was measured in 6 basal and 6 mid-cavity segments. Onthe same day,3Dwas performed and data analysed offline with Q-Lab software (Philips, Andover, MA). Using 12 analogous regional time-volume curves time to minimal volume (T3D)was calculated. The standard deviation (S.D.) between segments in TTV and T3D was calculated as a measure ofDYS. In 7 patients itwas not possible to measureT3D due to poor images. In the remaining 20, LV diastolic volume, systolic volume and EF were 128±35 ml, 68±23 ml and 46±13%, respectively. Mean TTV was less than mean T3D (150±33ms versus 348±54 ms; p < 0.01). The intrapatient range was 20–210ms for TTV and 0–410ms for T3D. Of 9 patients (45%) with significantDYS (S.D. TTV > 32 ms), S.D. T3D was 69±37ms compared to 48±34ms in those without DYS (p = ns). In DYS patients there was concordance of the most delayed segment in 4 (44%) cases.Therefore, different techniques for assessing DYS are not directly comparable. Specific cut-offs for DYS are needed for each technique.

Mixture density network training by computation in parameter space

Training Mixture Density Network (MDN) configurations within the NETLAB framework takes time due to the nature of the computation of the error function and the gradient of the error function. By optimising the computation of these functions, so that gradient information is computed in parameter space, training time is decreased by at least a factor of sixty for the example given. Decreased training time increases the spectrum of problems to which MDNs can be practically applied making the MDN framework an attractive method to the applied problem solver.

Time complexity and convergence analysis of domain theoretic Picard method

We present an implementation of the domain-theoretic Picard method for solving initial value problems (IVPs) introduced by Edalat and Pattinson [1]. Compared to Edalat and Pattinson's implementation, our algorithm uses a more efficient arithmetic based on an arbitrary precision floating-point library. Despite the additional overestimations due to floating-point rounding, we obtain a similar bound on the convergence rate of the produced approximations. Moreover, our convergence analysis is detailed enough to allow a static optimisation in the growth of the precision used in successive Picard iterations. Such optimisation greatly improves the efficiency of the solving process. Although a similar optimisation could be performed dynamically without our analysis, a static one gives us a significant advantage: we are able to predict the time it will take the solver to obtain an approximation of a certain (arbitrarily high) quality.

Enhanced slotted aloha protocols for underwater sensor networks with large propagation delay

Recently underwater sensor networks (UWSN) attracted large research interests. Medium access control (MAC) is one of the major challenges faced by UWSN due to the large propagation delay and narrow channel bandwidth of acoustic communications used for UWSN. Widely used slotted aloha (S-Aloha) protocol suffers large performance loss in UWSNs, which can only achieve performance close to pure aloha (P-Aloha). In this paper we theoretically model the performances of S-Aloha and P-Aloha protocols and analyze the adverse impact of propagation delay. According to the observation on the performances of S-Aloha protocol we propose two enhanced S-Aloha protocols in order to minimize the adverse impact of propagation delay on S-Aloha protocol. The first enhancement is a synchronized arrival S-Aloha (SA-Aloha) protocol, in which frames are transmitted at carefully calculated time to align the frame arrival time with the start of time slots. Propagation delay is taken into consideration in the calculation of transmit time. As estimation error on propagation delay may exist and can affect network performance, an improved SA-Aloha (denoted by ISA-Aloha) is proposed, which adjusts the slot size according to the range of delay estimation errors. Simulation results show that both SA-Aloha and ISA-Aloha perform remarkably better than S-Aloha and P-Aloha for UWSN, and ISA-Aloha is more robust even when the propagation delay estimation error is large. © 2011 IEEE.

Delay of light in an optical bottle resonator with nanoscale radius variation : dispersionless, broadband, and low-loss

It is shown theoretically that an optical bottle resonator with a nanoscale radius variation can perform a multinanosecond long dispersionless delay of light in a nanometer-order bandwidth with minimal losses. Experimentally, a 3 mm long resonator with a 2.8 nm deep semiparabolic radius variation is fabricated from a 19??µm radius silica fiber with a subangstrom precision. In excellent agreement with theory, the resonator exhibits the impedance-matched 2.58 ns (3 bytes) delay of 100 ps pulses with 0.44??dB/ns intrinsic loss. This is a miniature slow light delay line with the record large delay time, record small transmission loss, dispersion, and effective speed of light.

Delay of light in an optical bottle resonator with nanoscale radius variation:dispersionless, broadband, and low-loss

It is shown theoretically that an optical bottle resonator with a nanoscale radius variation can perform a multinanosecond long dispersionless delay of light in a nanometer-order bandwidth with minimal losses. Experimentally, a 3 mm long resonator with a 2.8 nm deep semiparabolic radius variation is fabricated from a 19??µm radius silica fiber with a subangstrom precision. In excellent agreement with theory, the resonator exhibits the impedance-matched 2.58 ns (3 bytes) delay of 100 ps pulses with 0.44??dB/ns intrinsic loss. This is a miniature slow light delay line with the record large delay time, record small transmission loss, dispersion, and effective speed of light.

Impact of linear mode coupling on the group delay spread in few-mode fibers

We report an investigation on the group delay spread in few-mode fibers operating in the weak and strong linear coupling regimes, and for the first time, we study the transition region between them. A single expression linking the group delay spread to the fiber correlation length is validated for any coupling regime, considering 3 guided modes.

Dispersionless low-loss miniature slow light delay lines based on optical fibers

A miniature slow light delay line with the record large delay time, small transmission loss, dispersion, and effective speed of light is proposed and demonstrated using the SNAP (Surface Nanoscale Axial Photonics) technology. © 2014 OSA.

Phase noise influence in long-range coherent optical OFDM systems with delay detection, IFFT multiplexing and FFT demodulation

We present a study of the influence of dispersion induced phase noise for CO-OFDM systems using FFT multiplexing/IFFT demultiplexing techniques (software based). The software based system provides a method for a rigorous evaluation of the phase noise variance caused by Common Phase Error (CPE) and Inter-Carrier Interference (ICI) including - for the first time to our knowledge - in explicit form the effect of equalization enhanced phase noise (EEPN). This, in turns, leads to an analytic BER specification. Numerical results focus on a CO-OFDM system with 10-25 GS/s QPSK channel modulation. A worst case constellation configuration is identified for the phase noise influence and the resulting BER is compared to the BER of a conventional single channel QPSK system with the same capacity as the CO-OFDM implementation. Results are evaluated as a function of transmission distance. For both types of systems, the phase noise variance increases significantly with increasing transmission distance. For a total capacity of 400 (1000) Gbit/s, the transmission distance to have the BER < 10-2 for the worst case CO-OFDM design is less than 800 and 460 km, respectively, whereas for a single channel QPSK system it is less than 1400 and 560 km.

Impulsive Partial Hyperbolic Functional Differential Equations of Fractional Order with State-Dependent Delay

MSC 2010: 26A33, 34A37, 34K37, 34K40, 35R11

Approximate Model Checking of Real-Time Systems for Linear Duration Invariants

Real-time systems are usually modelled with timed automata and real-time requirements relating to the state durations of the system are often specifiable using Linear Duration Invariants, which is a decidable subclass of Duration Calculus formulas. Various algorithms have been developed to check timed automata or real-time automata for linear duration invariants, but each needs complicated preprocessing and exponential calculation. To the best of our knowledge, these algorithms have not been implemented. In this paper, we present an approximate model checking technique based on a genetic algorithm to check real-time automata for linear durration invariants in reasonable times. Genetic algorithm is a good optimization method when a problem needs massive computation and it works particularly well in our case because the fitness function which is derived from the linear duration invariant is linear. ACM Computing Classification System (1998): D.2.4, C.3.

Efficient computation of decoherent quantum walks through eigenvalue perturbation

A number of recent studies have investigated the introduction of decoherence in quantum walks and the resulting transition to classical random walks. Interestingly,it has been shown that algorithmic properties of quantum walks with decoherence such as the spreading rate are sometimes better than their purely quantum counterparts. Not only quantum walks with decoherence provide a generalization of quantum walks that naturally encompasses both the quantum and classical case, but they also give rise to new and different probability distribution. The application of quantum walks with decoherence to large graphs is limited by the necessity of evolving state vector whose sizes quadratic in the number of nodes of the graph, as opposed to the linear state vector of the purely quantum (or classical) case. In this technical report,we show how to use perturbation theory to reduce the computational complexity of evolving a continuous-time quantum walk subject to decoherence. More specifically, given a graph over n nodes, we show how to approximate the eigendecomposition of the n2×n2 Lindblad super-operator from the eigendecomposition of the n×n graph Hamiltonian.

The impact of parent participation in a hospital-based kangaroo care program on time spent with their preterm infant in the neonatal intensive care unit

Occupational therapists and other health professionals are faced with the challenge of helping parents cope with the birth of their preterm infant and fostering parent-infant bonding and attachment. Kangaroo care, or skin to skin contact, has the potential to minimize the delay in the parent-infant attachment process and facilitate more normal infant growth and development. The present study investigated the impact of parent participation in a hospital-based kangaroo care program on time spent with their preterm infant in the NICU. Fourteen parents with preterm infants in the NICU participated in the study. The results indicated that parents who participated in the kangaroo care program spent significantly more time with their infant than the parents who did not participate in the program (p $<$.022). In addition, parents in the kangaroo care group visited their infant more frequently than the control group (p $<$.037). However, the mean time with baby per day did not show a significant difference between the groups (p $<$.194). This information may assist occupational therapists in developing family-centered early intervention programs beginning in the NICU. ^