What to measure?

Quality assurance for measurements in chemistry and the biosciences seems to deal at a first look with questions such as ‘Did we determine the amount of the requested compound (acrylamide, human growth hormone, etc.) accurately?’. Why should the stakeholders of this journal reflect on ‘What to measure?’. Remember, most of the measurements are performed in response to a customer demand (which could be also our own scientific curiosity). And quality is about satisfying the customer. One may argue that the analyst in the measurement laboratory obtains the specifications for the ‘what to measure’ from his/her customer. But according to my experience, even a simple-looking request from a nonmeasurement expert to the analyst that she/he should just perform a ‘routine service’ by analysing a provided sample with respect to pre-specified parameters can turn into a fruitful scientific discussion and collaboration about defining together the analytical problem and designing a measurement strategy which could really answer the original question. By that we are focussing on quality, because we ensure the provision of measurement results allowing the customer to take an informed decision. We are not just producing measurement data about a sample, which would comply with the stereotype of an analyst as ‘service maid’ to other scientists dealing with the ‘grand challenges’ of society. Consequently, delivering measurement results of adequate quality includes also ‘measuring the right target’. Therefore, the first required step to quality is identifying what is the decision-relevant measurand which is— according to ISO Guide 99 (VIM-3)—the ‘quantity intended to be measured’. However, this may not be sufficient for specifying what to measure; as such an ‘intended quantity’ may not be directly accessible by a measurement. This is, for example, the case for a measurand ‘mass fraction of total protein in a foodstuff’. Therefore, the next step requires the intellectual contribution of analysts (‘measurement scientists’) in the problem-solving exercise to an even greater extent. Namely, one has to specify the (physical, chemical or biological) entity that can represent adequately the identity, sometimes called analyte or target species (here ‘total protein’), of the measurand (here mass fraction of total protein in a foodstuff) in the measurement procedure. For example, the nitrogen content in the food sample as measured by using the so-called Kjeldahl method may serve as substituting quantity in the example. But this has to be well thought-out throughout the whole measurement process. For the latter, various operations from taking the analytical subsample via sample preparation, creating and registering the instrumental signal until delivering the quantitative measurement result have to be considered. Otherwise, one may overlook the interference of nitrogen from non-protein sources, such as melamine, in the foodstuff. Many chemical or biological measurement procedures include transformations of the analyte, for instance, by derivatisation or fragmentation. Consequently, ‘measurement’ in chemistry and the biosciences can usually not be reduced to a simple one-step attribution of a value to the predefined measurand. It includes also mastering the changes of identity (chemical nature) for the target species during the whole measurement procedure. For instance, getting to know the mass fraction of acrylamide in toasted bread may include the following steps: extraction (accurate knowledge on extraction yield required), bromination (derivatisation yield has to be known), gas chromatography (separation yield has to be checked) and mass spectrometry. Calibration H. Emons (&) Geel, Belgium e-mail: JRC-IRMM-ACQUAL@ec.europa.eu

[1]  Rakesh Kumar,et al.  Optimal peer selection for P2P downloading and streaming , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  Muriel Médard,et al.  Achieving minimum-cost multicast: a decentralized approach based on network coding , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[3]  J. Zeman,et al.  Initial Validation of the Emotion Expression Scale for Children (EESC) , 2002, Journal of clinical child and adolescent psychology : the official journal for the Society of Clinical Child and Adolescent Psychology, American Psychological Association, Division 53.

[4]  Ion Stoica,et al.  Incentives for Cooperation in Peer-to-Peer Networks , 2003 .

[5]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[6]  N. Z. Shor Cut-off method with space extension in convex programming problems , 1977, Cybernetics.

[7]  Helen J. Wang,et al.  Distributing streaming media content using cooperative networking , 2002, NOSSDAV '02.

[8]  Biplab Sikdar,et al.  Analytic models for the latency and steady-state throughput of TCP tahoe, Reno, and SACK , 2003, TNET.

[9]  Walter Willinger,et al.  A first-principles approach to understanding the internet's router-level topology , 2004, SIGCOMM 2004.

[10]  Shahzad Ali,et al.  Measurement of Commercial Peer-To-Peer Live Video Streaming , 2006 .

[11]  Naveen Garg,et al.  Bandwidth Maximization in Multicasting , 2003, ESA.

[12]  Ian T. Foster,et al.  Predicting the performance of wide area data transfers , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[13]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[14]  Keith W. Ross,et al.  A Measurement Study of a Large-Scale P2P IPTV System , 2007, IEEE Transactions on Multimedia.

[15]  Donald F. Towsley,et al.  Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.

[16]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[17]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

[18]  Jörg Widmer,et al.  TCP Friendly Rate Control (TFRC): Protocol Specification , 2003, RFC.

[19]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[20]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[21]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

[22]  L. G. H. Cijan A polynomial algorithm in linear programming , 1979 .

[23]  Qi He,et al.  On the predictability of large transfer TCP throughput , 2005, SIGCOMM '05.

[24]  Hector Garcia-Molina,et al.  Streaming Live Media over a Peer-to-Peer Network , 2001 .

[25]  Rakesh Kumar,et al.  Stochastic Fluid Theory for P2P Streaming Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[26]  Olivier Fourmaux,et al.  Measuring P2P IPTV Systems , 2007 .

[27]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[28]  Li Zhao,et al.  A peer-to-peer network for live media streaming using a push-pull approach , 2005, MULTIMEDIA '05.

[29]  B. S. Li,et al.  CoolStreaming/DONet: A dData-driven overlay network for live media streaming , 2004 .

[30]  Zongpeng Li,et al.  On achieving optimal throughput with network coding , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[31]  Richard Wolski,et al.  Dynamically forecasting network performance using the Network Weather Service , 1998, Cluster Computing.

[32]  David K. Y. Yau,et al.  A game theoretic approach to provide incentive and service differentiation in P2P networks , 2004, SIGMETRICS '04/Performance '04.

[33]  Amin Vahdat,et al.  Bullet: high bandwidth data dissemination using an overlay mesh , 2003, SOSP '03.

[34]  Reza Rejaie,et al.  PRIME: peer-to-peer receiver-driven mesh-based streaming , 2009, TNET.

[35]  Klara Nahrstedt,et al.  Maxmin overlay multicast: rate allocation and tree construction , 2004, Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004..

[36]  Bharat K. Bhargava,et al.  PROMISE: peer-to-peer media streaming using CollectCast , 2003, MULTIMEDIA '03.

[37]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[38]  Bo Li,et al.  Inside the New Coolstreaming: Principles, Measurements and Performance Implications , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[39]  Daniel Stutzbach,et al.  Characterizing unstructured overlay topologies in modern P2P file-sharing systems , 2008, TNET.

[40]  Matthew Mathis,et al.  The macroscopic behavior of the TCP congestion avoidance algorithm , 1997, CCRV.

[41]  Bobby Bhattacharjee,et al.  Scalable application layer multicast , 2002, SIGCOMM '02.

[42]  Olivier Fourmaux,et al.  P2P IPTV measurement: a case study of TVants , 2006, CoNEXT '06.

[43]  Peter Marbach,et al.  Bandwidth allocation in ad hoc networks: a price-based approach , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[44]  Jean Dickinson Gibbons,et al.  Nonparametric Statistical Inference , 1972, International Encyclopedia of Statistical Science.

[45]  Diego Garlaschelli,et al.  Patterns of link reciprocity in directed networks. , 2004, Physical review letters.

[46]  Bo Li,et al.  An Empirical Study of the Coolstreaming+ System , 2007, IEEE Journal on Selected Areas in Communications.

[47]  Indranil Gupta,et al.  Measurement and modeling of a large-scale overlay for multimedia streaming , 2007, QSHINE.

[48]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[49]  D. Bertsekas,et al.  The auction algorithm for the transportation problem , 1989 .

[50]  Hanif D. Sherali,et al.  Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs , 1996, Oper. Res. Lett..

[51]  Kien A. Hua,et al.  ZIGZAG: an efficient peer-to-peer scheme for media streaming , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[52]  Miguel Castro,et al.  SplitStream: high-bandwidth multicast in cooperative environments , 2003, SOSP '03.

[53]  Ibrahim Matta,et al.  BRITE: Boston University Representative Internet Topology gEnerator: A Flexible Generator of Internet Topologies , 2000 .

[54]  Kevin Leyton-Brown,et al.  Incentives for sharing in peer-to-peer networks , 2001, EC '01.

[55]  Lihao Xu,et al.  Efficient and flexible parallel retrieval using priority encoded transmission , 2004, NOSSDAV '04.

[56]  Stephen A. Jarvis,et al.  A Payment-based Incentive and Service Differentiation Mechanism for Peer-to-Peer Streaming Broadcast , 2006, 200614th IEEE International Workshop on Quality of Service.

[57]  Scott Shenker,et al.  On a network creation game , 2003, PODC '03.

[58]  Vinay S. Pai,et al.  Chainsaw: Eliminating Trees from Overlay Multicast , 2005, IPTPS.

[59]  Amin Vahdat,et al.  Using Random Subsets to Build Scalable Network Services , 2003, USENIX Symposium on Internet Technologies and Systems.

[60]  Peter A. Dinda,et al.  Characterizing and Predicting TCP Throughput on the Wide Area Network , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[61]  M E J Newman Assortative mixing in networks. , 2002, Physical review letters.

[62]  Leandros Tassiulas,et al.  A Simple Rate Control Algorithm for Maximizing Total User Utility. , 2001, INFOCOM 2001.

[63]  Duncan J. Watts,et al.  Six Degrees: The Science of a Connected Age , 2003 .

[64]  Thomas P. Ryan,et al.  Modern Regression Methods , 1996 .

[65]  Keith W. Ross,et al.  Inferring Network-Wide Quality in P2P Live Streaming Systems , 2007, IEEE Journal on Selected Areas in Communications.

[66]  Klara Nahrstedt,et al.  Optimal resource allocation in overlay multicast , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[67]  Jin Li PeerStreaming: A Practical Receiver-Driven Peer-to-Peer Media Streaming System , 2004 .

[68]  Naum Zuselevich Shor,et al.  Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.

[69]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[70]  Srinivasan Seshan,et al.  Analyzing stability in wide-area network performance , 1997, SIGMETRICS '97.

[71]  L. Khachiyan Polynomial algorithms in linear programming , 1980 .

[72]  Scott Shenker,et al.  On the characteristics and origins of internet flow rates , 2002, SIGCOMM.

[73]  Ion Stoica,et al.  Characterizing selfishly constructed overlay routing networks , 2004, IEEE INFOCOM 2004.