Reply to ‘‘Comment on ‘Digital parallel acquisition in frequency domain fluorometry’ ’’ [Rev. Sci. Instrum. 60, 2929 (1989)]

Feddersen, Brett A.; Piston, David W.; Gratton, Enrico
June 1991
Review of Scientific Instruments;Jun91, Vol. 62 Issue 6, p1674
Academic Journal
The duty cycle problem referred to by Alcala has been discussed in our original manuscript, and we calculated the reduction of the signal quite explicitly. His comments on the harmonic content are in error, and the correct values were given in the original paper.


Related Articles

  • Editor's Foreword. Spirakis, Paul // Theory of Computing Systems;1997, Vol. 30 Issue 1, p1 

    Introduces a series of articles about computing systems. Parallel algorithms and architectures.

  • Editor's Foreword. Rosenberg, Arnold L. // Theory of Computing Systems;1997, Vol. 30 Issue 6, p521 

    Introduces the working papers presented at the Seventh ACM Symposium on Parallel Algorithms and Architectures held on July 16-19, 1995 in Santa Barbara, California.

  • Parallel Algorithms for the Circuit Value Update Problem. Leiserson, C. E.; Randall, K. H. // Theory of Computing Systems;1997, Vol. 30 Issue 6, p583 

    The circuit value update problem is the problem of updating values in a representation of a combinational circuit when some of the inputs are changed. We assume for simplicity that each combinational element has bounded fan-in and fan-out and can be evaluated in constant time. This problem is...

  • Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-Up. Luccio, F.; Pagli, L. // Theory of Computing Systems;1998, Vol. 31 Issue 1, p5 

    We discuss the design of sequential and parallel algorithms working on a time-increasing data set, within two paradigms of computation. In Paradigm 1 the process terminates when all the data currently arrived have been treated, independently of future arrivals. In Paradigm 2 an endless process...

  • Guest Editors' Foreword. Cormen, T.; Dehne, F.; Fraigniaud, P.; Matias, Y. // Theory of Computing Systems;2000, Vol. 33 Issue 5/6, p335 

    No Abstract.

  • An Experimental Analysis of Parallel Sorting Algorithms. Blelloch, G. E.; Leiserson, C. E.; Maggs, B. M.; Plaxton, C. G.; Smith, S. J.; Zagha, M. // Theory of Computing Systems;1998, Vol. 31 Issue 2, p135 

    We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a machine by enumerating the primitive operations that it is capable of performing along with the cost of each operation....

  • Automatic Loop Parallelization. Kumar, M.; Patnaik, L. M. // Computer Journal;1997, Vol. 40 Issue 6, p301 

    An introduction is presented in which the authors discuss various articles within the issue on topics including loop parallelization, loop fusion algorithm, and parallel computing paradigms.

  • FOREWORD. Held, Jim // Intel Technology Journal;Dec2009, Vol. 13 Issue 4, p4 

    The article discusses various reports published within this issue including one on parallel algorithms for concurrent software by Tim Mattson and Kurt Koetzer, one by Gilles Pokam on hardware and software approaches for deterministic multiprocessor replay of concurrent programs, and one by Dave...

  • A general parallel solution to the integral transformation and second-order Mo\ller–Plesset energy evaluation on distributed memory parallel machines. Limaye, Ajay C.; Gadre, Shridhar R. // Journal of Chemical Physics;1/15/1994, Vol. 100 Issue 2, p1303 

    We present here a parallel algorithm for four-index (integral) transformation and second-order Mo\ller–Plesset (MP2) energy evaluation, primarily designed for multiple instruction multiple data (MIMD) machines. It is a general algorithm designed to work with equal efficiency on any...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics