351 resultados para distributed feeback lasers
Resumo:
Optically-fed distributed antenna system (DAS) technology is combined with passive ultra high frequency (UHF) radio frequency identification (RFID). It is shown that RFID signals can be carried on directly modulated radio over fiber links without impacting their performance. It is also shown that a multi-antenna DAS can greatly reduce the number of nulls experienced by RFID in a complex radio environment, increasing the likelihood of successful tag detection. Consequently, optimization of the DAS reduces nulls further. We demonstrate RFID tag reading using a three antenna DAS system over a 20mx6m area, limited by building constraints, where 100% of the test points can be successfully read. The detected signal strength from the tag is also observed to increase by an average of approximately 10dB compared with a conventional switched multi-antenna RFID system. This improvement is achieved at +31dBm equivalent isotropically radiated power (EIRP) from all three antenna units (AUs).
Resumo:
Liquid crystal lasers offer wide, continuous tuneability across the visible and near-infrared (450-850 nm). Compared to conventional tuneable laser technology, liquid crystal lasers are highly compact and have simple and scalable manufacturability. Their ability to emit multiple simultaneous emissions of arbitrarily selectable wavelength also gives them functional advantages over competing technologies. This paper describes Förster transfer techniques that have enabled this extended continuously tunable emission range, whilst maintaining a common pump source. © 2012 OSA.
Resumo:
We describe simple yet scalable and distributed algorithms for solving the maximum flow problem and its minimum cost flow variant, motivated by problems of interest in objects similarity visualization. We formulate the fundamental problem as a convex-concave saddle point problem. We then show that this problem can be efficiently solved by a first order method or by exploiting faster quasi-Newton steps. Our proposed approach costs at most O(|ε|) per iteration for a graph with |ε| edges. Further, the number of required iterations can be shown to be independent of number of edges for the first order approximation method. We present experimental results in two applications: mosaic generation and color similarity based image layouting. © 2010 IEEE.
Resumo:
List of major symbols.