8 resultados para MULTIPLICATION
em Aston University Research Archive
Resumo:
We demonstrate a simple lossless method for the implementation of repetition-rate multiplication of a periodic pulse train. As it is showed, a single all-pass optical cavity (APOC) can increase the repetition rate of the output pulse train by factors of 2, 3, and 4. Two different APOC implementations, based on a Gires-Tournois interferometer and an all-pass ring resonator, are proposed and numerically demonstrated.
Resumo:
Optical Engineering: New waveform generation provides the experimentalist with interesting new tools.
Resumo:
We propose several all-pass spectrally-periodic optical structures composed of simple optical cavities for the implementation of repetition rate multipliers of periodic pulse train with uniform output train envelope by phase-only filtering, and analyze them in terms of robustness and accuracy.
Resumo:
We present a parallel genetic algorithm for nding matrix multiplication algo-rithms. For 3 x 3 matrices our genetic algorithm successfully discovered algo-rithms requiring 23 multiplications, which are equivalent to the currently best known human-developed algorithms. We also studied the cases with less mul-tiplications and evaluated the suitability of the methods discovered. Although our evolutionary method did not reach the theoretical lower bound it led to an approximate solution for 22 multiplications.
Resumo:
We propose and analyze several simple all-pass spectrally-periodic optical structures, in terms of accuracy and robustness, for the implementation of repetition rate multipliers of periodic pulse train with uniform output train envelope, finding optimum solutions for multiplication factors of 3, 4, 6, and 12.
Resumo:
Background The objective of this study was to determine whether neonatal nasogastric enteral feeding tubes are colonised by the opportunistic pathogen Cronobacter spp. (Enterobacter sakazakii) and other Enterobacteriaceae, and whether their presence was influenced by the feeding regime. Methods One hundred and twenty-nine tubes were collected from two neonatal intensive care units (NICU). A questionnaire on feeding regime was completed with each sample. Enterobacteriaceae present in the tubes were identified using conventional and molecular methods, and their antibiograms determined. Results The neonates were fed breast milk (16%), fortified breast milk (28%), ready to feed formula (20%), reconstituted powdered infant formula (PIF, 6%), or a mixture of these (21%). Eight percent of tubes were received from neonates who were 'nil by mouth'. Organisms were isolated from 76% of enteral feeding tubes as a biofilm (up to 107 cfu/tube from neonates fed fortified breast milk and reconstituted PIF) and in the residual lumen liquid (up to 107 Enterobacteriaceae cfu/ml, average volume 250 µl). The most common isolates were Enterobacter cancerogenus (41%), Serratia marcescens (36%), E. hormaechei (33%), Escherichia coli (29%), Klebsiella pneumoniae (25%), Raoultella terrigena (10%), and S. liquefaciens (12%). Other organisms isolated included C. sakazakii (2%),Yersinia enterocolitica (1%),Citrobacter freundii (1%), E. vulneris (1%), Pseudomonas fluorescens (1%), and P. luteola (1%). The enteral feeding tubes were in place between < 6 h (22%) to > 48 h (13%). All the S. marcescens isolates from the enteral feeding tubes were resistant to amoxicillin and co-amoxiclav. Of additional importance was that a quarter of E. hormaechei isolates were resistant to the 3rd generation cephalosporins ceftazidime and cefotaxime. During the period of the study, K. pneumoniae and S. marcescens caused infections in the two NICUs. Conclusion This study shows that neonatal enteral feeding tubes, irrespective of feeding regime, act as loci for the bacterial attachment and multiplication of numerous opportunistic pathogens within the Enterobacteriaceae family. Subsequently, these organisms will enter the stomach as a bolus with each feed. Therefore, enteral feeding tubes are an important risk factor to consider with respect to neonatal infections.
Resumo:
We propose - as a modification of the optical (RF) pilot scheme -a balanced phase modulation between two polarizations of the optical signal in order to generate correlated equalization enhanced phase noise (EEPN) contributions in the two polarizations. The method is applicable for n-level PSK system. The EEPN can be compensated, the carrier phase extracted and the nPSK signal regenerated by complex conjugation and multiplication in the receiver. The method is tested by system simulations in a single channel QPSK system at 56 Gb/s system rate. It is found that the conjugation and multiplication scheme in the Rx can mitigate the EEPN to within 1/2 orders of magnitude. Results are compared to using the Viterbi-Viterbi algorithm to mitigate the EEPN. The latter method improves the sensitivity more than two orders of magnitude. Important novel insight into the statistical properties of EEPN is identified and discussed in the paper. © 2013 Optical Society of America.
Resumo:
Random Walk with Restart (RWR) is an appealing measure of proximity between nodes based on graph structures. Since real graphs are often large and subject to minor changes, it is prohibitively expensive to recompute proximities from scratch. Previous methods use LU decomposition and degree reordering heuristics, entailing O(|V|^3) time and O(|V|^2) memory to compute all (|V|^2) pairs of node proximities in a static graph. In this paper, a dynamic scheme to assess RWR proximities is proposed: (1) For unit update, we characterize the changes to all-pairs proximities as the outer product of two vectors. We notice that the multiplication of an RWR matrix and its transition matrix, unlike traditional matrix multiplications, is commutative. This can greatly reduce the computation of all-pairs proximities from O(|V|^3) to O(|delta|) time for each update without loss of accuracy, where |delta| (<<|V|^2) is the number of affected proximities. (2) To avoid O(|V|^2) memory for all pairs of outputs, we also devise efficient partitioning techniques for our dynamic model, which can compute all pairs of proximities segment-wisely within O(l|V|) memory and O(|V|/l) I/O costs, where 1<=l<=|V| is a user-controlled trade-off between memory and I/O costs. (3) For bulk updates, we also devise aggregation and hashing methods, which can discard many unnecessary updates further and handle chunks of unit updates simultaneously. Our experimental results on various datasets demonstrate that our methods can be 1–2 orders of magnitude faster than other competitors while securing scalability and exactness.