Challenge Open Access

Mind the Gap: The PhysioNet/Computing in Cardiology Challenge 2010

George Moody

Published: Dec. 1, 2010. Version: 1.0.0


Please include the standard citation for PhysioNet: (show more options)
Goldberger, A., Amaral, L., Glass, L., Hausdorff, J., Ivanov, P. C., Mark, R., ... & Stanley, H. E. (2000). PhysioBank, PhysioToolkit, and PhysioNet: Components of a new research resource for complex physiologic signals. Circulation [Online]. 101 (23), pp. e215–e220.

Introduction

In settings ranging from sleep studies to surgery to sports medicine to intensive care, real-time monitoring of a variety of physiologic signals has become an essential tool for clinicians and researchers. Transient corruption or loss of one or more signals, common in all of these settings, can be disruptive, especially when continuous observations are required in order to rule out rare events or as a basis for forecasting. Signal corruption can be particularly challenging when it mimics features that are associated with pathologic states.

Humans can be remarkably adept at dealing with transient noise and signal loss in these settings. Filling in gaps, and making use of context to recognize and ignore noise, are processes that our sensory and cognitive abilities leave us well-equipped to do. Can algorithmic solutions that take account of the same data, in broader contexts and without fatigue, do as well?

The aim of this year's challenge is to develop robust methods for filling in gaps in multiparameter physiologic data (including ECG signals, continuous blood pressure waveforms, and respiration). In a real-world monitoring application, these methods can be applied for many purposes, including:

  • robust estimation of parameters such as heart rate, mean arterial pressure, and respiration when the primary signals used to derive these parameters become unavailable or unreliable;
  • detection of changes in patient state, when the relationships between signals remain consistent even as individual signals change their behavior; and
  • recognition of intervals of signal corruption, when a signal becomes inconsistent not only with respect to its previous history but also with respect to its relationships with other signals.

In this Challenge, participants are asked to reconstruct, using any combination of available prior and concurrent information, segments of signals that have been removed from multiparameter recordings of patients in intensive care units (ICUs).

Data for the Challenge

Participants are provided with three data sets of 100 records each. Each ten-minute record contains 6, 7, or 8 signals acquired from bedside ICU patient monitors. The recorded signals vary across records, and they include ECG, continuous invasive blood pressure, respiration, fingertip plethysmograms, and occasional other signals. In one of these signals, the final 30-second segment (the target signal) has been replaced by a gap (a flat line signal), and the goal is to reconstruct this missing 30-second target signal in each record.

  • Set A is a set of 100 records for participants' use as a training set. Participants can obtain scores for Set A reconstructions at any time, but Set A scores are not included in the final rankings of Challenge entries. The target signals are provided for the records in this set. Additional training data can easily be constructed from any of the multiparameter data available in PhysioBank, such as the MIMIC II Waveform Database.
  • Set B is a set of 100 records for which the target signals are withheld until the conclusion of the challenge. Participants can obtain scores for Set B reconstructions at any time, but Set B scores are not included in the final rankings of Challenge entries.
  • Set C is a set of 100 records, with the target signals withheld. Participants may submit reconstructions of the target signals at any time for the duration of the challenge, but they will not receive scores except for their final submissions, which will determine the final rankings and the winners of the challenge.

Records in all three Challenge data sets are provided in standard PhysioBank (compact binary) formats; read them using the WFDB software package. The Set A files named with the suffix .missing are the target signals; these files are in text format. The datasets, together with the target signals for Set A, are available here

Scoring

A detailed reconstruction of a signal, reproducing all characteristics of the original signal accurately, is more than is necessary in order to be useful. For example, a reconstruction of an invasive blood pressure signal may be useful if it allows a good estimation of mean pressure, or pulse pressure, even if none of the other details of the signal can be reproduced accurately; as another example, a reconstruction of an ECG signal that allows accurate estimation of RR intervals may be useful, even in the absence of other details.

For this reason, this challenge makes use of two scoring algorithms, detailed below. The first, used in event 1, measures the overall accuracy of the reconstruction, and as such will tend to favor those reconstruction methods that succeed in recovering properties of the signal that are derivable from the signal amplitude, such as MAP and pulse pressure. The second, used in event 2, is based on the correlation between the original signal and its reconstruction, and tends to favor those methods that accurately recover the timing of the major fluctuations in the original signal, such as QRS complexes in the ECG needed to derive RR interval series. Each reconstruction is scored using both algorithms, so a single submission is entered in both events of the Challenge.

Scoring for individual reconstructions

Each reconstruction, Vrec, is compared with the corresponding target (reference) signal, Vref. Target signals are known in all cases, but those for the Set B and Set C records are not provided to participants.

Each submitted reconstruction is scored using two different methods, one for each of the two events. Since the scoring methods for the two events have different biases, a change in your reconstruction of a given record may improve your event 1 score and decrease your event 2 score, or vice versa.

Event 1

The target signal is subtracted (sample by sample) from the reconstruction to obtain the residual signal, Vres. The sum of the squares of the residuals, ssvres, is normalized by the energy (sample variance) of the target signal, Eref.

In event 1, the quality, Q1, of a reconstruction is defined as 1 - ssvres/Eref, or 0, whichever is larger. If ssvres is 0, Q1 is 1, even if Eref is also 0.

Use of a figure of merit based on the residual signal reflects the importance in many cases of obtaining a good estimate of target signal levels (such as systolic, mean, and diastolic pressures in a continuous blood pressure signal).

[Note that Q1 was previously defined as 1 - Eres/Eref, or 0, whichever is larger (where Eres is the energy of the residual signal). This definition was changed because it was independent of the magnitude of any constant (DC) component of the residual signal, unlike the revised definition.]

Event 2

In event 2, the quality Q2 of a reconstruction is defined as the correlation coefficient of Vref and Vrec, or 0, whichever is larger. (Correlation coefficients can of course be negative; for the purposes of this challenge, an anticorrelated reconstruction is equivalent to an uncorrelated one, however.)

Use of the correlation coefficient as a figure of merit is motivated by the observation that reconstruction of a filtered signal may be useful in many cases. Such a reconstruction might, for example, provide a basis for reliable estimation of the timing of major fluctuations in a signal (such as QRS complexes in an ECG signal), even if absolute signal levels are not recovered. Unlike Q1, Q2 is relatively insensitive to misestimation of the amplitudes of fluctuations.

Aggregate (summed) scores

The final ranking of participants is based on summing the Q scores obtained for records in Set C. Participants are encouraged, but not required, to provide reconstructions of all records in Set C.

Both Q1 and Q2 are defined so they can vary between 0 and 1, and higher values are better. If you have submitted more than one reconstruction of the same record, only the last one submitted determines your Q1 and Q2 for that record. If you have not submitted a reconstruction for a given record, your Q1 and Q2 scores for that record are zero.

For event 1, your Set C summed score, C1, is the sum of the your final Q1 scores for each record in Set C. Similarly, for event 2, your Set C summed score, C2, is the sum of the your final Q2 scores for each record in Set C. Since Set C contains 100 records, C1 and C2 can vary between 0 and (in theory!) 100.

The summed scores are not normalized by the number of target signals reconstructed, to provide a strong incentive to submit reconstructions of as many of the Set C records as possible.

Entering the Challenge

To be eligible for an award (see below):

  1. Submit reconstructions (see below) of at least 10 Set B target signals, no later than noon GMT on Friday, 30 April 2010.
  2. Submit an abstract (about 300 words) describing your work on the Challenge to Computing in Cardiology (CinC) by Saturday, 1 May 2010. Please select "PhysioNet/CinC Challenge" as the topic of your abstract, so it can be identified easily by the abstract review committee.
  3. Submit reconstructions of as many Set C target signals as you wish no later than noon GMT on Wednesday, 1 September 2010. Since your ranking is determined by the sum of the scores you receive for Set C targets, it is to your advantage to attempt as many of the 100 Set C records as possible.
  4. Attend Computing in Cardiology in Belfast, Northern Ireland, 26-29 September.

If your abstract is accepted, you will be expected to prepare a four-page paper for publication in Computing in Cardiology, and to present a talk or poster about your work at CinC.

Submitting reconstructions for scoring

Reconstructions should be in the same format as the .missing files containing the Set A target signals (text format, with one sample of the reconstructed signal per line). Each file should contain 3750 samples (125 samples/second, for 30 seconds). Although the target signals consist entirely of samples with integer values, reconstructions may contain integer or floating point values. Use a decimal point (.) rather than a comma (,) to separate the integral and fractional components of floating point values.

You may replace any previously submitted reconstruction simply by submitting a new one. The corresponding scores are updated immediately.

Scores are calculated using the code in c2010-score.c, a short C program that you may download and use to compare any two time series.

Participants may submit reconstructions of as many Set A, B, and C target signals as they wish. Each reconstruction is scored separately. For each event, the final ranking of participants is based on the sum of the scores obtained for reconstructions of Set C target signals.

Keep in mind that Sets A and B are intended for experimentation with your methods for reconstruction. You can obtain scores for your Set A and B reconstructions at any time during the Challenge. Set C is the "final examination", and although you have until September to study it, you will not be able to obtain intermediate scores. "Tuning" your methods to Set C will not be possible, so learn what you can from Sets A and B and then apply it to Set C.

Final scores and Challenge awards

Aggregate and individual scores for Set C records will be calculated based on reconstructions submitted no later than noon GMT on 1 September 2010. These scores, which will appear on your page when they have been calculated, determine the final ranking of participants.

During a plenary session of Computing in Cardiology in September, four awards will be presented to the eligible participants in attendance with the best final scores as follows:

  1. (Event 1, open source) Highest C1 score for an open source entry
  2. (Event 1, overall) Highest C1 score
  3. (Event 2, open source) Highest C2 score for an open-source entry
  4. (Event 2, overall) Highest C2 score

Participants may enter one or both events, and open source entries are eligible for the overall awards as well as for the open source awards. If the best results in any category are achieved by two or more entries, the first of these entries to be submitted will receive the award in that category.

Entering the Open Source Division

As in previous years, the Challenge includes an open source division. You may enter the open source division by sending the source code for your challenge entry by email, before noon GMT on Wednesday, 1 September 2010, to PhysioNet. Use the subject line "Challenge 2010 entry source", and be sure to include:

  • Your name and email address
  • All sources needed to produce a working version of your software (except for readily available standard libraries and header files)
  • A note describing how to produce a working version of your software (a commented Makefile is ideal), and how to run your software

Each source file submitted should begin with a comment block containing the names of its authors and a reference to the open source license you have chosen for it, if any; for example:

     /* fill.c - fill signal gaps using large wads of duct tape
        Copyright (C) 2010  Herman Foobar <hbar@uncertain.org>
        This software is released under the terms of the GNU General
        Public License (http://www.gnu.org/copyleft/gpl.html).
     */

Source files in C, C++, Fortran, or Matlab m-code are preferred; other languages may be acceptable, but please ask first. Do not submit any code that cannot be freely redistributed. Following the conclusion of the Challenge, selected entries will be posted, with full credit to their authors, on PhysioNet.

Questions and answers about the Challenge

Must there be an automatic process to choose the set of signals used in the reconstruction of the target signal or is it acceptable that the choice of signals is not done by a program but by the participant?

Either method is acceptable. Keep in mind that the final rankings will be determined by your scores on set C, and that you will receive only one score for each of the set C records (in other words, you will not be able to try several different signal subsets for each set C record and choose the subset that yields the best score in each case).

There are some files in the challenge dataset, where there are several signals with zeros in the last 30 seconds. The determination of the target signal is ambiguous at the following signals: c21, c54, c67. What should be the way of handling this problem?

In each of these cases, there is only one signal that becomes flat (all zero values) after 9 minutes and 30 seconds (i.e., beginning at sample 71250). Reconstruct that signal, not the one that has been flat for a longer period.

  • In c21, ABP and UAP are flat, but UAP is flat throughout; reconstruct ABP.
  • In c54, CVP and ICP are flat, but CVP is flat beginning at sample 49556; reconstruct ICP.
  • In c67, ABP and CVP are flat, but ABP is flat throughout; reconstruct CVP.

Papers

The papers below were presented at Computers in Cardiology 2010. Please cite this publication when referencing any of these papers. These papers have been made available by their authors under the terms of the Creative Commons Attribution License 3.0 (CCAL). We wish to thank all of the authors for their contributions.

The first of these papers is an introduction to the challenge topic, with a summary of the challenge results and a discussion of their implications.

The PhysioNet/Computing in Cardiology Challenge 2010: Mind the Gap
GB Moody

The remaining papers were presented by participants in the Challenge, who describe their approaches to the challenge problem.

Estimation of Missing Data in Multi-channel Physiological Time-series by Average Substitution with Timing from a Reference Channel
P Langley, S King, K Wang, D Zheng, R Giovannini, M Bojarnejad, A Murray

PhysioNet 2010 Challenge: a Robust Multi-Channel Adaptive Filtering Approach to the Estimation of Physiological Recordings
I Silva

Reconstruction of Missing Physiological Signals Using Artificial Neural Networks
AM Sullivan, H Xia, JC McBride, X Zhao

Reconstruction of Missing Cardiovascular Signals using Adaptive Filtering
A Hartmann

Principal Component Analysis Based Method for Reconstruction of Fragments of Corrupted or Lost Signal in Multilead Data Reflecting Electrical Heart Activity and Hemodynamics
R Petrolis, R Simoliuniene, A Krisciukaitis

An Approach to Reconstruct Lost Cardiac Signals Using Pattern Matching and Neural Networks via Related Cardiac Information
TCT Ho, X Chen

Medical Multivariate Signal Reconstruction Using Recurrent Neural Network
LEV Silva, JJ Duque, MG Guzo, I Soares, R Tinós, LO Murta Jr

Reconstructing Missing Signals in Multi-Parameter Physiologic Data by Mining the Aligned Contextual Information
Y Li, Y Sun, P Sondhi, L Sha, C Zhai

Filling in the Gap: a General Method Using Neural Networks
R Rodrigues

The Multi-parameter Physiologic Signal Reconstruction by means of Wavelet Singularity Detection and Signal Correlation
W Wu

A Wavelet Scheme for Reconstruction of Missing Sections in Time Series Signals
TR Rocha, SP Paredes, JH Henriques

Reconstruction of Multivariate Signals Using Q-Gaussian Radial Basis Function Network
LEV Silva, JJ Duque, R Tinós, LO Murta Jr


Share
Access

Access Policy:
Anyone can access the files, as long as they conform to the terms of the specified license.

License (for files):
Open Data Commons Attribution License v1.0

Corresponding Author
You must be logged in to view the contact information.

Files

Total uncompressed size: 0 B.

Access the files
Folder Navigation: <base>/set-b
Name Size Modified
Parent Directory
HEADER.shtml (download) 960 B 2015-08-06
MD5SUMS (download) 8.2 KB 2010-03-19
RECORDS (download) 400 B 2010-03-19
SHA1SUMS (download) 9.9 KB 2010-03-19
SHA256SUMS (download) 14.7 KB 2010-03-19
b00.dat (download) 1.1 MB 2010-03-19
b00.hea (download) 449 B 2010-03-19
b00.missing (download) 18.3 KB 2010-10-29
b01.dat (download) 1.1 MB 2010-03-19
b01.hea (download) 431 B 2010-03-19
b01.missing (download) 17.0 KB 2010-10-29
b02.dat (download) 1.0 MB 2010-03-19
b02.hea (download) 367 B 2010-03-19
b02.missing (download) 18.3 KB 2010-10-29
b03.dat (download) 878.9 KB 2010-03-19
b03.hea (download) 316 B 2010-03-19
b03.missing (download) 18.3 KB 2010-10-29
b04.dat (download) 1.1 MB 2010-03-19
b04.hea (download) 443 B 2010-03-19
b04.missing (download) 17.8 KB 2010-10-29
b05.dat (download) 1.1 MB 2010-03-19
b05.hea (download) 444 B 2010-03-19
b05.missing (download) 18.3 KB 2010-10-29
b06.dat (download) 1.0 MB 2010-03-19
b06.hea (download) 376 B 2010-03-19
b06.missing (download) 18.1 KB 2010-10-29
b07.dat (download) 878.9 KB 2010-03-19
b07.hea (download) 329 B 2010-03-19
b07.missing (download) 17.5 KB 2010-10-29
b08.dat (download) 1.1 MB 2010-03-19
b08.hea (download) 442 B 2010-03-19
b08.missing (download) 18.3 KB 2010-10-29
b09.dat (download) 1.1 MB 2010-03-19
b09.hea (download) 435 B 2010-03-19
b09.missing (download) 18.2 KB 2010-10-29
b10.dat (download) 1.0 MB 2010-03-19
b10.hea (download) 387 B 2010-03-19
b10.missing (download) 18.3 KB 2010-10-29
b11.dat (download) 1.0 MB 2010-03-19
b11.hea (download) 379 B 2010-03-19
b11.missing (download) 18.3 KB 2010-10-29
b12.dat (download) 1.1 MB 2010-03-19
b12.hea (download) 443 B 2010-03-19
b12.missing (download) 18.0 KB 2010-10-29
b13.dat (download) 878.9 KB 2010-03-19
b13.hea (download) 328 B 2010-03-19
b13.missing (download) 14.3 KB 2010-10-29
b14.dat (download) 1.0 MB 2010-03-19
b14.hea (download) 384 B 2010-03-19
b14.missing (download) 18.3 KB 2010-10-29
b15.dat (download) 1.1 MB 2010-03-19
b15.hea (download) 446 B 2010-03-19
b15.missing (download) 18.3 KB 2010-10-29
b16.dat (download) 1.0 MB 2010-03-19
b16.hea (download) 386 B 2010-03-19
b16.missing (download) 18.0 KB 2010-10-29
b17.dat (download) 1.1 MB 2010-03-19
b17.hea (download) 433 B 2010-03-19
b17.missing (download) 18.3 KB 2010-10-29
b18.dat (download) 1.1 MB 2010-03-19
b18.hea (download) 432 B 2010-03-19
b18.missing (download) 17.3 KB 2010-10-29
b19.dat (download) 878.9 KB 2010-03-19
b19.hea (download) 333 B 2010-03-19
b19.missing (download) 18.3 KB 2010-10-29
b20.dat (download) 878.9 KB 2010-03-19
b20.hea (download) 327 B 2010-03-19
b20.missing (download) 18.3 KB 2010-10-29
b21.dat (download) 1.0 MB 2010-03-19
b21.hea (download) 387 B 2010-03-19
b21.missing (download) 17.7 KB 2010-10-29
b22.dat (download) 878.9 KB 2010-03-19
b22.hea (download) 323 B 2010-03-19
b22.missing (download) 18.2 KB 2010-10-29
b23.dat (download) 1.0 MB 2010-03-19
b23.hea (download) 386 B 2010-03-19
b23.missing (download) 18.2 KB 2010-10-29
b24.dat (download) 878.9 KB 2010-03-19
b24.hea (download) 320 B 2010-03-19
b24.missing (download) 18.1 KB 2010-10-29
b25.dat (download) 1.0 MB 2010-03-19
b25.hea (download) 388 B 2010-03-19
b25.missing (download) 18.3 KB 2010-10-29
b26.dat (download) 1.1 MB 2010-03-19
b26.hea (download) 438 B 2010-03-19
b26.missing (download) 18.3 KB 2010-10-29
b27.dat (download) 1.0 MB 2010-03-19
b27.hea (download) 377 B 2010-03-19
b27.missing (download) 18.3 KB 2010-10-29
b28.dat (download) 878.9 KB 2010-03-19
b28.hea (download) 328 B 2010-03-19
b28.missing (download) 18.3 KB 2010-10-29
b29.dat (download) 1.0 MB 2010-03-19
b29.hea (download) 391 B 2010-03-19
b29.missing (download) 18.2 KB 2010-10-29
b30.dat (download) 1.1 MB 2010-03-19
b30.hea (download) 451 B 2010-03-19
b30.missing (download) 18.0 KB 2010-10-29
b31.dat (download) 1.0 MB 2010-03-19
b31.hea (download) 369 B 2010-03-19
b31.missing (download) 14.7 KB 2010-10-29
b32.dat (download) 1.0 MB 2010-03-19
b32.hea (download) 367 B 2010-03-19
b32.missing (download) 14.5 KB 2010-10-29
b33.dat (download) 878.9 KB 2010-03-19
b33.hea (download) 324 B 2010-03-19
b33.missing (download) 12.4 KB 2010-10-29
b34.dat (download) 1.0 MB 2010-03-19
b34.hea (download) 385 B 2010-03-19
b34.missing (download) 18.0 KB 2010-10-29
b35.dat (download) 1.0 MB 2010-03-19
b35.hea (download) 388 B 2010-03-19
b35.missing (download) 18.3 KB 2010-10-29
b36.dat (download) 878.9 KB 2010-03-19
b36.hea (download) 321 B 2010-03-19
b36.missing (download) 17.4 KB 2010-10-29
b37.dat (download) 1.0 MB 2010-03-19
b37.hea (download) 372 B 2010-03-19
b37.missing (download) 18.3 KB 2010-10-29
b38.dat (download) 1.1 MB 2010-03-19
b38.hea (download) 440 B 2010-03-19
b38.missing (download) 18.3 KB 2010-10-29
b39.dat (download) 1.0 MB 2010-03-19
b39.hea (download) 380 B 2010-03-19
b39.missing (download) 18.3 KB 2010-10-29
b40.dat (download) 1.0 MB 2010-03-19
b40.hea (download) 379 B 2010-03-19
b40.missing (download) 18.3 KB 2010-10-29
b41.dat (download) 1.1 MB 2010-03-19
b41.hea (download) 428 B 2010-03-19
b41.missing (download) 18.1 KB 2010-10-29
b42.dat (download) 878.9 KB 2010-03-19
b42.hea (download) 322 B 2010-03-19
b42.missing (download) 18.1 KB 2010-10-29
b43.dat (download) 1.1 MB 2010-03-19
b43.hea (download) 448 B 2010-03-19
b43.missing (download) 18.3 KB 2010-10-29
b44.dat (download) 1.1 MB 2010-03-19
b44.hea (download) 448 B 2010-03-19
b44.missing (download) 18.3 KB 2010-10-29
b45.dat (download) 1.0 MB 2010-03-19
b45.hea (download) 382 B 2010-03-19
b45.missing (download) 17.7 KB 2010-10-29
b46.dat (download) 1.1 MB 2010-03-19
b46.hea (download) 436 B 2010-03-19
b46.missing (download) 12.9 KB 2010-10-29
b47.dat (download) 878.9 KB 2010-03-19
b47.hea (download) 324 B 2010-03-19
b47.missing (download) 18.3 KB 2010-10-29
b48.dat (download) 1.0 MB 2010-03-19
b48.hea (download) 379 B 2010-03-19
b48.missing (download) 16.6 KB 2010-10-29
b49.dat (download) 878.9 KB 2010-03-19
b49.hea (download) 324 B 2010-03-19
b49.missing (download) 18.3 KB 2010-10-29
b50.dat (download) 1.0 MB 2010-03-19
b50.hea (download) 367 B 2010-03-19
b50.missing (download) 14.6 KB 2010-10-29
b51.dat (download) 1.0 MB 2010-03-19
b51.hea (download) 366 B 2010-03-19
b51.missing (download) 18.3 KB 2010-10-29
b52.dat (download) 1.0 MB 2010-03-19
b52.hea (download) 367 B 2010-03-19
b52.missing (download) 14.6 KB 2010-10-29
b53.dat (download) 1.1 MB 2010-03-19
b53.hea (download) 438 B 2010-03-19
b53.missing (download) 18.3 KB 2010-10-29
b54.dat (download) 1.1 MB 2010-03-19
b54.hea (download) 434 B 2010-03-19
b54.missing (download) 16.8 KB 2010-10-29
b55.dat (download) 1.0 MB 2010-03-19
b55.hea (download) 381 B 2010-03-19
b55.missing (download) 18.3 KB 2010-10-29
b56.dat (download) 1.1 MB 2010-03-19
b56.hea (download) 426 B 2010-03-19
b56.missing (download) 18.3 KB 2010-10-29
b57.dat (download) 878.9 KB 2010-03-19
b57.hea (download) 324 B 2010-03-19
b57.missing (download) 17.3 KB 2010-10-29
b58.dat (download) 1.1 MB 2010-03-19
b58.hea (download) 446 B 2010-03-19
b58.missing (download) 18.3 KB 2010-10-29
b59.dat (download) 878.9 KB 2010-03-19
b59.hea (download) 318 B 2010-03-19
b59.missing (download) 18.3 KB 2010-10-29
b60.dat (download) 1.0 MB 2010-03-19
b60.hea (download) 376 B 2010-03-19
b60.missing (download) 18.3 KB 2010-10-29
b61.dat (download) 878.9 KB 2010-03-19
b61.hea (download) 320 B 2010-03-19
b61.missing (download) 18.3 KB 2010-10-29
b62.dat (download) 1.1 MB 2010-03-19
b62.hea (download) 429 B 2010-03-19
b62.missing (download) 18.3 KB 2010-10-29
b63.dat (download) 1.1 MB 2010-03-19
b63.hea (download) 452 B 2010-03-19
b63.missing (download) 17.5 KB 2010-10-29
b64.dat (download) 878.9 KB 2010-03-19
b64.hea (download) 325 B 2010-03-19
b64.missing (download) 18.3 KB 2010-10-29
b65.dat (download) 878.9 KB 2010-03-19
b65.hea (download) 329 B 2010-03-19
b65.missing (download) 18.3 KB 2010-10-29
b66.dat (download) 1.0 MB 2010-03-19
b66.hea (download) 389 B 2010-03-19
b66.missing (download) 18.3 KB 2010-10-29
b67.dat (download) 878.9 KB 2010-03-19
b67.hea (download) 329 B 2010-03-19
b67.missing (download) 18.3 KB 2010-10-29
b68.dat (download) 1.1 MB 2010-03-19
b68.hea (download) 448 B 2010-03-19
b68.missing (download) 14.6 KB 2010-10-29
b69.dat (download) 1.1 MB 2010-03-19
b69.hea (download) 453 B 2010-03-19
b69.missing (download) 18.3 KB 2010-10-29
b70.dat (download) 878.9 KB 2010-03-19
b70.hea (download) 318 B 2010-03-19
b70.missing (download) 18.3 KB 2010-10-29
b71.dat (download) 1.1 MB 2010-03-19
b71.hea (download) 438 B 2010-03-19
b71.missing (download) 12.1 KB 2010-10-29
b72.dat (download) 1.1 MB 2010-03-19
b72.hea (download) 440 B 2010-03-19
b72.missing (download) 18.3 KB 2010-10-29
b73.dat (download) 878.9 KB 2010-03-19
b73.hea (download) 328 B 2010-03-19
b73.missing (download) 15.3 KB 2010-10-29
b74.dat (download) 1.0 MB 2010-03-19
b74.hea (download) 390 B 2010-03-19
b74.missing (download) 18.3 KB 2010-10-29
b75.dat (download) 1.0 MB 2010-03-19
b75.hea (download) 372 B 2010-03-19
b75.missing (download) 18.2 KB 2010-10-29
b76.dat (download) 1.1 MB 2010-03-19
b76.hea (download) 449 B 2010-03-19
b76.missing (download) 16.3 KB 2010-10-29
b77.dat (download) 878.9 KB 2010-03-19
b77.hea (download) 321 B 2010-03-19
b77.missing (download) 18.2 KB 2010-10-29
b78.dat (download) 1.1 MB 2010-03-19
b78.hea (download) 448 B 2010-03-19
b78.missing (download) 18.1 KB 2010-10-29
b79.dat (download) 1.0 MB 2010-03-19
b79.hea (download) 380 B 2010-03-19
b79.missing (download) 18.3 KB 2010-10-29
b80.dat (download) 878.9 KB 2010-03-19
b80.hea (download) 328 B 2010-03-19
b80.missing (download) 18.3 KB 2010-10-29
b81.dat (download) 1.0 MB 2010-03-19
b81.hea (download) 386 B 2010-03-19
b81.missing (download) 18.2 KB 2010-10-29
b82.dat (download) 878.9 KB 2010-03-19
b82.hea (download) 321 B 2010-03-19
b82.missing (download) 18.3 KB 2010-10-29
b83.dat (download) 1.1 MB 2010-03-19
b83.hea (download) 449 B 2010-03-19
b83.missing (download) 18.0 KB 2010-10-29
b84.dat (download) 1.0 MB 2010-03-19
b84.hea (download) 388 B 2010-03-19
b84.missing (download) 18.3 KB 2010-10-29
b85.dat (download) 1.1 MB 2010-03-19
b85.hea (download) 425 B 2010-03-19
b85.missing (download) 18.3 KB 2010-10-29
b86.dat (download) 1.1 MB 2010-03-19
b86.hea (download) 438 B 2010-03-19
b86.missing (download) 17.6 KB 2010-10-29
b87.dat (download) 1.0 MB 2010-03-19
b87.hea (download) 372 B 2010-03-19
b87.missing (download) 16.2 KB 2010-10-29
b88.dat (download) 1.1 MB 2010-03-19
b88.hea (download) 434 B 2010-03-19
b88.missing (download) 15.8 KB 2010-10-29
b89.dat (download) 1.1 MB 2010-03-19
b89.hea (download) 436 B 2010-03-19
b89.missing (download) 18.3 KB 2010-10-29
b90.dat (download) 1.0 MB 2010-03-19
b90.hea (download) 388 B 2010-03-19
b90.missing (download) 18.3 KB 2010-10-29
b91.dat (download) 878.9 KB 2010-03-19
b91.hea (download) 310 B 2010-03-19
b91.missing (download) 12.7 KB 2010-10-29
b92.dat (download) 878.9 KB 2010-03-19
b92.hea (download) 326 B 2010-03-19
b92.missing (download) 18.3 KB 2010-10-29
b93.dat (download) 1.1 MB 2010-03-19
b93.hea (download) 444 B 2010-03-19
b93.missing (download) 18.0 KB 2010-10-29
b94.dat (download) 878.9 KB 2010-03-19
b94.hea (download) 328 B 2010-03-19
b94.missing (download) 17.4 KB 2010-10-29
b95.dat (download) 1.1 MB 2010-03-19
b95.hea (download) 447 B 2010-03-19
b95.missing (download) 18.3 KB 2010-10-29
b96.dat (download) 878.9 KB 2010-03-19
b96.hea (download) 320 B 2010-03-19
b96.missing (download) 18.1 KB 2010-10-29
b97.dat (download) 1.0 MB 2010-03-19
b97.hea (download) 390 B 2010-03-19
b97.missing (download) 18.2 KB 2010-10-29
b98.dat (download) 1.0 MB 2010-03-19
b98.hea (download) 384 B 2010-03-19
b98.missing (download) 18.3 KB 2010-10-29
b99.dat (download) 1.1 MB 2010-03-19
b99.hea (download) 447 B 2010-03-19
b99.missing (download) 18.1 KB 2010-10-29
local.css (download) 3.1 KB 2015-10-28