Brillouin optical time-domain analysis assisted by second-order Raman amplification

We propose and experimentally demonstrate a new method to extend the range of Brillouin optical time domain analysis (BOTDA) systems. It exploits the virtual transparency created by second-order Raman pumping in optical fibers. The idea is theoretically analyzed and experimentally demonstrated in a 50 km fiber. By working close to transparency, we also show that the measurement length of the BOTDA can be increased up to 100 km with 2 meter resolution. We envisage extensions of this technique to measurement lengths well beyond this value, as long as the issue of relative intensity noise (RIN) of the primary Raman pump can be avoided. © 2010 Optical Society of America.

Raman-assisted BOTDA sensors

We review some recent results on the application of distributed Raman amplification schemes, including ultralong lasers, to the extension of the operating range and contrast in Brillouin optical time domain analysis (BOTDA) distributed sensing systems. © 2010 IEEE.

Independent component analysis for domain independent watermarking

A new principled domain independent watermarking framework is presented. The new approach is based on embedding the message in statistically independent sources of the covertext to mimimise covertext distortion, maximise the information embedding rate and improve the method's robustness against various attacks. Experiments comparing the performance of the new approach, on several standard attacks show the current proposed approach to be competitive with other state of the art domain-specific methods.

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.

Governance of open content creation:a conceptualization and analysis of control and guiding mechanisms in the open content domain

The open content creation process has proven itself to be a powerful and influential way of developing text-based content, as demonstrated by the success of Wikipedia and related sites. Distributed individuals independently edit, revise, or refine content, thereby creating knowledge artifacts of considerable breadth and quality. Our study explores the mechanisms that control and guide the content creation process and develops an understanding of open content governance. The repertory grid method is employed to systematically capture the experiences of individuals involved in the open content creation process and to determine the relative importance of the diverse control and guiding mechanisms. Our findings illustrate the important control and guiding mechanisms and highlight the multifaceted nature of open content governance. A range of governance mechanisms is discussed with regard to the varied levels of formality, the different loci of authority, and the diverse interaction environments involved. Limitations and opportunities for future research are provided.