Add verified challenge-2018 original-source files (7 files)
Browse files- challenge-2018/LICENSE.html +788 -0
- challenge-2018/README.md +13 -0
- challenge-2018/SHA256SUMS.txt +0 -0
- challenge-2018/SOURCE.html +1464 -0
- challenge-2018/mirror_scope.json +74 -0
- challenge-2018/provenance.json +57 -0
- challenge-2018/source_object_sizes.json +0 -0
challenge-2018/LICENSE.html
ADDED
|
@@ -0,0 +1,788 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
<!DOCTYPE html>
|
| 2 |
+
|
| 3 |
+
<html lang="en">
|
| 4 |
+
<head>
|
| 5 |
+
<meta charset="UTF-8">
|
| 6 |
+
<title>
|
| 7 |
+
License for You Snooze You Win: The PhysioNet/Computing in Cardiology Challenge 2018 v1.0.0
|
| 8 |
+
</title>
|
| 9 |
+
|
| 10 |
+
|
| 11 |
+
<link rel="stylesheet" type="text/css" href="/static/bootstrap/css/bootstrap.css"/>
|
| 12 |
+
<link rel="stylesheet" type="text/css" href="/static/font-awesome/css/all.css"/>
|
| 13 |
+
<link rel="stylesheet" type="text/css" href="/static/custom/css/physionet.css?v=2"/>
|
| 14 |
+
|
| 15 |
+
|
| 16 |
+
<script src="/static/jquery/jquery.min.js"></script>
|
| 17 |
+
<script src="/static/popper/popper.min.js"></script>
|
| 18 |
+
<script async src="https://www.googletagmanager.com/gtag/js?id=UA-87592301-7"></script>
|
| 19 |
+
<script>
|
| 20 |
+
window.dataLayer = window.dataLayer || [];
|
| 21 |
+
function gtag(){dataLayer.push(arguments);}
|
| 22 |
+
gtag('js', new Date());
|
| 23 |
+
|
| 24 |
+
gtag('config', 'UA-87592301-7');
|
| 25 |
+
</script>
|
| 26 |
+
|
| 27 |
+
<link rel="shortcut icon" type="image/png" href="/static/favicon.ico"/>
|
| 28 |
+
<meta name="viewport" content="width=device-width, initial-scale=1.0">
|
| 29 |
+
<link rel="stylesheet" href="/static/bootstrap/bootstrap-icons/bootstrap-icons.css">
|
| 30 |
+
<link rel="stylesheet" href="/static/fonts/inter-local.css">
|
| 31 |
+
<link rel="stylesheet" type="text/css" href="/static/custom/css/style.css?v=2">
|
| 32 |
+
</head>
|
| 33 |
+
|
| 34 |
+
|
| 35 |
+
<body class="modern-ui flexbody">
|
| 36 |
+
|
| 37 |
+
|
| 38 |
+
|
| 39 |
+
|
| 40 |
+
|
| 41 |
+
<div class="modern-ui nav-wrapper">
|
| 42 |
+
<nav class="nav">
|
| 43 |
+
<div class="container my-0 h-100 d-flex justify-content-between align-items-center">
|
| 44 |
+
<button type="button" class="nav__hamburger circle-button mr-2"
|
| 45 |
+
popovertarget="nav__hamburger_popup"
|
| 46 |
+
title="Menu">
|
| 47 |
+
<i class="nav__hamburger__list bi bi-list"></i>
|
| 48 |
+
<i class="nav__hamburger__x bi bi-x"></i>
|
| 49 |
+
<span class="visually-hidden">Menu</span>
|
| 50 |
+
</button>
|
| 51 |
+
<a href="/">
|
| 52 |
+
|
| 53 |
+
<img src="/static/images/physionet-logo.svg" width="200px" alt="PhysioNet">
|
| 54 |
+
|
| 55 |
+
</a>
|
| 56 |
+
<div class="nav__links align-items-center">
|
| 57 |
+
|
| 58 |
+
|
| 59 |
+
<a href="/about/publish/" class="nav-link">Share</a>
|
| 60 |
+
|
| 61 |
+
|
| 62 |
+
|
| 63 |
+
<a href="/about/" class="nav-link">About</a>
|
| 64 |
+
|
| 65 |
+
|
| 66 |
+
|
| 67 |
+
|
| 68 |
+
|
| 69 |
+
|
| 70 |
+
|
| 71 |
+
|
| 72 |
+
|
| 73 |
+
<a href="/about/faqs/" class="nav-link">FAQs</a>
|
| 74 |
+
|
| 75 |
+
|
| 76 |
+
|
| 77 |
+
|
| 78 |
+
|
| 79 |
+
|
| 80 |
+
|
| 81 |
+
<div>
|
| 82 |
+
<button type="button" class="nav-link nav-link--expandable"
|
| 83 |
+
popovertarget="nav__explore_popup">
|
| 84 |
+
Explore <i class="bi bi-chevron-down ml-2"></i>
|
| 85 |
+
</button>
|
| 86 |
+
<dialog class="nav-link__popup" id="nav__explore_popup" popover
|
| 87 |
+
aria-label="Explore">
|
| 88 |
+
<div class="nav-sublinks">
|
| 89 |
+
|
| 90 |
+
<a class="nav-sublink" href="/about/database/">
|
| 91 |
+
<div class="nav-sublink__icon">
|
| 92 |
+
|
| 93 |
+
<img src="/static/images/icons/data.png" alt="" height="32px">
|
| 94 |
+
|
| 95 |
+
</div>
|
| 96 |
+
<div class="nav-sublink__text">
|
| 97 |
+
<span class="nav-sublink__title">Data</span>
|
| 98 |
+
<span class="nav-sublink__description">View datasets</span>
|
| 99 |
+
</div>
|
| 100 |
+
</a>
|
| 101 |
+
|
| 102 |
+
<a class="nav-sublink" href="/about/software/">
|
| 103 |
+
<div class="nav-sublink__icon">
|
| 104 |
+
|
| 105 |
+
<img src="/static/images/icons/software.png" alt="" height="32px">
|
| 106 |
+
|
| 107 |
+
</div>
|
| 108 |
+
<div class="nav-sublink__text">
|
| 109 |
+
<span class="nav-sublink__title">Software</span>
|
| 110 |
+
<span class="nav-sublink__description">View software</span>
|
| 111 |
+
</div>
|
| 112 |
+
</a>
|
| 113 |
+
|
| 114 |
+
<a class="nav-sublink" href="/about/challenge/">
|
| 115 |
+
<div class="nav-sublink__icon">
|
| 116 |
+
|
| 117 |
+
<img src="/static/images/icons/challenges.png" alt="" height="32px">
|
| 118 |
+
|
| 119 |
+
</div>
|
| 120 |
+
<div class="nav-sublink__text">
|
| 121 |
+
<span class="nav-sublink__title">Challenges</span>
|
| 122 |
+
<span class="nav-sublink__description">View challenges</span>
|
| 123 |
+
</div>
|
| 124 |
+
</a>
|
| 125 |
+
|
| 126 |
+
<a class="nav-sublink" href="/about/tutorial/">
|
| 127 |
+
<div class="nav-sublink__icon">
|
| 128 |
+
|
| 129 |
+
<img src="/static/images/icons/tutorials.png" alt="" height="32px">
|
| 130 |
+
|
| 131 |
+
</div>
|
| 132 |
+
<div class="nav-sublink__text">
|
| 133 |
+
<span class="nav-sublink__title">Tutorials</span>
|
| 134 |
+
<span class="nav-sublink__description">View tutorials</span>
|
| 135 |
+
</div>
|
| 136 |
+
</a>
|
| 137 |
+
|
| 138 |
+
</div>
|
| 139 |
+
</dialog>
|
| 140 |
+
</div>
|
| 141 |
+
</div>
|
| 142 |
+
<div class="nav__actions d-flex ml-md-4">
|
| 143 |
+
<form action="/content/" class="mr-2">
|
| 144 |
+
<div class="nav__search">
|
| 145 |
+
<input type="text" name="topic" placeholder="Search for anything...">
|
| 146 |
+
<div class="nav__search__actions">
|
| 147 |
+
<button type="button" class="nav__search__close mr-2"
|
| 148 |
+
title="Cancel">
|
| 149 |
+
<i class="bi bi-x"></i>
|
| 150 |
+
<span class="visually-hidden">Cancel</span>
|
| 151 |
+
</button>
|
| 152 |
+
<button type="submit" class="circle-button">Search</button>
|
| 153 |
+
</div>
|
| 154 |
+
</div>
|
| 155 |
+
</form>
|
| 156 |
+
<button type="button" class="nav__search__open circle-button mr-md-2"
|
| 157 |
+
title="Search PhysioNet">
|
| 158 |
+
<i class="bi bi-search"></i>
|
| 159 |
+
<span class="visually-hidden">Search PhysioNet</span>
|
| 160 |
+
</button>
|
| 161 |
+
|
| 162 |
+
<a class="nav__user" href="/login/"
|
| 163 |
+
title="Log in">
|
| 164 |
+
<i class="bi bi-person"></i>
|
| 165 |
+
<span class="visually-hidden">Log in</span>
|
| 166 |
+
</a>
|
| 167 |
+
|
| 168 |
+
</div>
|
| 169 |
+
</div>
|
| 170 |
+
|
| 171 |
+
<dialog class="nav__mobile" id="nav__hamburger_popup" popover
|
| 172 |
+
aria-label="Menu">
|
| 173 |
+
|
| 174 |
+
|
| 175 |
+
<a href="/about/publish/" class="nav-link">Share</a>
|
| 176 |
+
|
| 177 |
+
|
| 178 |
+
|
| 179 |
+
<a href="/about/" class="nav-link">About</a>
|
| 180 |
+
|
| 181 |
+
|
| 182 |
+
|
| 183 |
+
|
| 184 |
+
|
| 185 |
+
|
| 186 |
+
|
| 187 |
+
|
| 188 |
+
|
| 189 |
+
<a href="/about/faqs/" class="nav-link">FAQs</a>
|
| 190 |
+
|
| 191 |
+
|
| 192 |
+
|
| 193 |
+
|
| 194 |
+
|
| 195 |
+
|
| 196 |
+
<hr>
|
| 197 |
+
<div class="nav-sublinks">
|
| 198 |
+
|
| 199 |
+
<a class="nav-sublink" href="/about/database/">
|
| 200 |
+
<div class="nav-sublink__icon">
|
| 201 |
+
|
| 202 |
+
<img src="/static/images/icons/data.png" alt="" height="32px">
|
| 203 |
+
|
| 204 |
+
</div>
|
| 205 |
+
<div class="nav-sublink__text">
|
| 206 |
+
<span class="nav-sublink__title">Data</span>
|
| 207 |
+
<span class="nav-sublink__description">View datasets</span>
|
| 208 |
+
</div>
|
| 209 |
+
</a>
|
| 210 |
+
|
| 211 |
+
<a class="nav-sublink" href="/about/software/">
|
| 212 |
+
<div class="nav-sublink__icon">
|
| 213 |
+
|
| 214 |
+
<img src="/static/images/icons/software.png" alt="" height="32px">
|
| 215 |
+
|
| 216 |
+
</div>
|
| 217 |
+
<div class="nav-sublink__text">
|
| 218 |
+
<span class="nav-sublink__title">Software</span>
|
| 219 |
+
<span class="nav-sublink__description">View software</span>
|
| 220 |
+
</div>
|
| 221 |
+
</a>
|
| 222 |
+
|
| 223 |
+
<a class="nav-sublink" href="/about/challenge/">
|
| 224 |
+
<div class="nav-sublink__icon">
|
| 225 |
+
|
| 226 |
+
<img src="/static/images/icons/challenges.png" alt="" height="32px">
|
| 227 |
+
|
| 228 |
+
</div>
|
| 229 |
+
<div class="nav-sublink__text">
|
| 230 |
+
<span class="nav-sublink__title">Challenges</span>
|
| 231 |
+
<span class="nav-sublink__description">View challenges</span>
|
| 232 |
+
</div>
|
| 233 |
+
</a>
|
| 234 |
+
|
| 235 |
+
<a class="nav-sublink" href="/about/tutorial/">
|
| 236 |
+
<div class="nav-sublink__icon">
|
| 237 |
+
|
| 238 |
+
<img src="/static/images/icons/tutorials.png" alt="" height="32px">
|
| 239 |
+
|
| 240 |
+
</div>
|
| 241 |
+
<div class="nav-sublink__text">
|
| 242 |
+
<span class="nav-sublink__title">Tutorials</span>
|
| 243 |
+
<span class="nav-sublink__description">View tutorials</span>
|
| 244 |
+
</div>
|
| 245 |
+
</a>
|
| 246 |
+
|
| 247 |
+
</div>
|
| 248 |
+
</dialog>
|
| 249 |
+
</nav>
|
| 250 |
+
</div>
|
| 251 |
+
|
| 252 |
+
<div class="nav-spacer"></div>
|
| 253 |
+
|
| 254 |
+
<main>
|
| 255 |
+
<div class="container">
|
| 256 |
+
<h1 class="text-center">Open Data Commons Attribution License v1.0 <a href="https://opendatacommons.org/licenses/by/index.html"><i class="fas fa-external-link-alt"></i></a></h1>
|
| 257 |
+
<hr>
|
| 258 |
+
<p><strong>Open Data Commons Attribution License (ODC-By) v1.0</strong></p>
|
| 259 |
+
|
| 260 |
+
<h3>Disclaimer</h3>
|
| 261 |
+
|
| 262 |
+
<p>Open Data Commons is not a law firm and does not provide legal services of any kind.</p>
|
| 263 |
+
|
| 264 |
+
<p>Open Data Commons has no formal relationship with you. Your receipt of this document does not create any kind of agent-client relationship. Please seek the advice of a suitably qualified legal professional licensed to practice in your jurisdiction before using this document.</p>
|
| 265 |
+
|
| 266 |
+
<p>No warranties and disclaimer of any damages. This information is provided ‘as is‘, and this site makes no warranties on the information provided. Any damages resulting from its use are disclaimed.</p>
|
| 267 |
+
|
| 268 |
+
<h3>Plain language summary</h3>
|
| 269 |
+
|
| 270 |
+
<p><a href="https://www.opendatacommons.org/licenses/by/summary/index.html">A plain language summary of the ODC Attribution License (ODC-BY)</a> is available.</p>
|
| 271 |
+
|
| 272 |
+
<h3>Alternative formats:</h3>
|
| 273 |
+
|
| 274 |
+
<p>Plain Text <a href="https://www.opendatacommons.org/files/2018/02/odc_by_1.0_public_text.txt">odc_by_1.0_public_text</a></p>
|
| 275 |
+
|
| 276 |
+
<p>ODC Attribution License (ODC-By)</p>
|
| 277 |
+
|
| 278 |
+
<h3>Preamble</h3>
|
| 279 |
+
|
| 280 |
+
<p>The Open Data Commons Attribution License is a license agreement<br />
|
| 281 |
+
intended to allow users to freely share, modify, and use this Database<br />
|
| 282 |
+
subject only to the attribution requirements set out in Section 4.</p>
|
| 283 |
+
|
| 284 |
+
<p>Databases can contain a wide variety of types of content (images,<br />
|
| 285 |
+
audiovisual material, and sounds all in the same database, for example),<br />
|
| 286 |
+
and so this license only governs the rights over the Database, and not<br />
|
| 287 |
+
the contents of the Database individually. Licensors may therefore wish<br />
|
| 288 |
+
to use this license together with another license for the contents.</p>
|
| 289 |
+
|
| 290 |
+
<p>Sometimes the contents of a database, or the database itself, can be<br />
|
| 291 |
+
covered by other rights not addressed here (such as private contracts,<br />
|
| 292 |
+
trademark over the name, or privacy rights / data protection rights<br />
|
| 293 |
+
over information in the contents), and so you are advised that you may<br />
|
| 294 |
+
have to consult other documents or clear other rights before doing<br />
|
| 295 |
+
activities not covered by this License.</p>
|
| 296 |
+
|
| 297 |
+
<p>The Licensor (as defined below)</p>
|
| 298 |
+
|
| 299 |
+
<p>and</p>
|
| 300 |
+
|
| 301 |
+
<p>You (as defined below)</p>
|
| 302 |
+
|
| 303 |
+
<p>agree as follows:</p>
|
| 304 |
+
|
| 305 |
+
<h3>1.0 Definitions of Capitalised Words</h3>
|
| 306 |
+
|
| 307 |
+
<p>“Collective Database” – Means this Database in unmodified form as part<br />
|
| 308 |
+
of a collection of independent databases in themselves that together are<br />
|
| 309 |
+
assembled into a collective whole. A work that constitutes a Collective<br />
|
| 310 |
+
Database will not be considered a Derivative Database.</p>
|
| 311 |
+
|
| 312 |
+
<p>“Convey” – As a verb, means Using the Database, a Derivative Database,<br />
|
| 313 |
+
or the Database as part of a Collective Database in any way that enables<br />
|
| 314 |
+
a Person to make or receive copies of the Database or a Derivative<br />
|
| 315 |
+
Database. Conveying does not include interaction with a user through a<br />
|
| 316 |
+
computer network, or creating and Using a Produced Work, where no<br />
|
| 317 |
+
transfer of a copy of the Database or a Derivative Database occurs.</p>
|
| 318 |
+
|
| 319 |
+
<p>“Contents” – The contents of this Database, which includes the<br />
|
| 320 |
+
information, independent works, or other material collected into the<br />
|
| 321 |
+
Database. For example, the contents of the Database could be factual<br />
|
| 322 |
+
data or works such as images, audiovisual material, text, or sounds.</p>
|
| 323 |
+
|
| 324 |
+
<p>“Database” – A collection of material (the Contents) arranged in a<br />
|
| 325 |
+
systematic or methodical way and individually accessible by electronic<br />
|
| 326 |
+
or other means offered under the terms of this License.</p>
|
| 327 |
+
|
| 328 |
+
<p>“Database Directive” – Means Directive 96/9/EC of the European<br />
|
| 329 |
+
Parliament and of the Council of 11 March 1996 on the legal protection<br />
|
| 330 |
+
of databases, as amended or succeeded.</p>
|
| 331 |
+
|
| 332 |
+
<p>“Database Right” – Means rights resulting from the Chapter III (“sui<br />
|
| 333 |
+
generis”) rights in the Database Directive (as amended and as transposed<br />
|
| 334 |
+
by member states), which includes the Extraction and Re-utilisation of<br />
|
| 335 |
+
the whole or a Substantial part of the Contents, as well as any similar<br />
|
| 336 |
+
rights available in the relevant jurisdiction under Section 10.4.</p>
|
| 337 |
+
|
| 338 |
+
<p>“Derivative Database” – Means a database based upon the Database, and<br />
|
| 339 |
+
includes any translation, adaptation, arrangement, modification, or any<br />
|
| 340 |
+
other alteration of the Database or of a Substantial part of the<br />
|
| 341 |
+
Contents. This includes, but is not limited to, Extracting or<br />
|
| 342 |
+
Re-utilising the whole or a Substantial part of the Contents in a new<br />
|
| 343 |
+
Database.</p>
|
| 344 |
+
|
| 345 |
+
<p>“Extraction” – Means the permanent or temporary transfer of all or a<br />
|
| 346 |
+
Substantial part of the Contents to another medium by any means or in<br />
|
| 347 |
+
any form.</p>
|
| 348 |
+
|
| 349 |
+
<p>“License” – Means this license agreement and is both a license of rights<br />
|
| 350 |
+
such as copyright and Database Rights and an agreement in contract.</p>
|
| 351 |
+
|
| 352 |
+
<p>“Licensor” – Means the Person that offers the Database under the terms<br />
|
| 353 |
+
of this License.</p>
|
| 354 |
+
|
| 355 |
+
<p>“Person” – Means a natural or legal person or a body of persons<br />
|
| 356 |
+
corporate or incorporate.</p>
|
| 357 |
+
|
| 358 |
+
<p>“Produced Work” – a work (such as an image, audiovisual material, text,<br />
|
| 359 |
+
or sounds) resulting from using the whole or a Substantial part of the<br />
|
| 360 |
+
Contents (via a search or other query) from this Database, a Derivative<br />
|
| 361 |
+
Database, or this Database as part of a Collective Database.</p>
|
| 362 |
+
|
| 363 |
+
<p>“Publicly” – means to Persons other than You or under Your control by<br />
|
| 364 |
+
either more than 50% ownership or by the power to direct their<br />
|
| 365 |
+
activities (such as contracting with an independent consultant).</p>
|
| 366 |
+
|
| 367 |
+
<p>“Re-utilisation” – means any form of making available to the public all<br />
|
| 368 |
+
or a Substantial part of the Contents by the distribution of copies, by<br />
|
| 369 |
+
renting, by online or other forms of transmission.</p>
|
| 370 |
+
|
| 371 |
+
<p>“Substantial” – Means substantial in terms of quantity or quality or a<br />
|
| 372 |
+
combination of both. The repeated and systematic Extraction or<br />
|
| 373 |
+
Re-utilisation of insubstantial parts of the Contents may amount to the<br />
|
| 374 |
+
Extraction or Re-utilisation of a Substantial part of the Contents.</p>
|
| 375 |
+
|
| 376 |
+
<p>“Use” – As a verb, means doing any act that is restricted by copyright<br />
|
| 377 |
+
or Database Rights whether in the original medium or any other; and<br />
|
| 378 |
+
includes without limitation distributing, copying, publicly performing,<br />
|
| 379 |
+
publicly displaying, and preparing derivative works of the Database, as<br />
|
| 380 |
+
well as modifying the Database as may be technically necessary to use it<br />
|
| 381 |
+
in a different mode or format.</p>
|
| 382 |
+
|
| 383 |
+
<p>“You” – Means a Person exercising rights under this License who has not<br />
|
| 384 |
+
previously violated the terms of this License with respect to the<br />
|
| 385 |
+
Database, or who has received express permission from the Licensor to<br />
|
| 386 |
+
exercise rights under this License despite a previous violation.</p>
|
| 387 |
+
|
| 388 |
+
<p>Words in the singular include the plural and vice versa.</p>
|
| 389 |
+
|
| 390 |
+
<h3>2.0 What this License covers</h3>
|
| 391 |
+
|
| 392 |
+
<p>2.1. Legal effect of this document. This License is:</p>
|
| 393 |
+
|
| 394 |
+
<p>a. A license of applicable copyright and neighbouring rights;</p>
|
| 395 |
+
|
| 396 |
+
<p>b. A license of the Database Right; and</p>
|
| 397 |
+
|
| 398 |
+
<p>c. An agreement in contract between You and the Licensor.</p>
|
| 399 |
+
|
| 400 |
+
<p>2.2 Legal rights covered. This License covers the legal rights in the<br />
|
| 401 |
+
Database, including:</p>
|
| 402 |
+
|
| 403 |
+
<p>a. Copyright. Any copyright or neighbouring rights in the Database.<br />
|
| 404 |
+
The copyright licensed includes any individual elements of the<br />
|
| 405 |
+
Database, but does not cover the copyright over the Contents<br />
|
| 406 |
+
independent of this Database. See Section 2.4 for details. Copyright<br />
|
| 407 |
+
law varies between jurisdictions, but is likely to cover: the Database<br />
|
| 408 |
+
model or schema, which is the structure, arrangement, and organisation<br />
|
| 409 |
+
of the Database, and can also include the Database tables and table<br />
|
| 410 |
+
indexes; the data entry and output sheets; and the Field names of<br />
|
| 411 |
+
Contents stored in the Database;</p>
|
| 412 |
+
|
| 413 |
+
<p>b. Database Rights. Database Rights only extend to the Extraction and<br />
|
| 414 |
+
Re-utilisation of the whole or a Substantial part of the Contents.<br />
|
| 415 |
+
Database Rights can apply even when there is no copyright over the<br />
|
| 416 |
+
Database. Database Rights can also apply when the Contents are removed<br />
|
| 417 |
+
from the Database and are selected and arranged in a way that would<br />
|
| 418 |
+
not infringe any applicable copyright; and</p>
|
| 419 |
+
|
| 420 |
+
<p>c. Contract. This is an agreement between You and the Licensor for<br />
|
| 421 |
+
access to the Database. In return you agree to certain conditions of<br />
|
| 422 |
+
use on this access as outlined in this License.</p>
|
| 423 |
+
|
| 424 |
+
<p>2.3 Rights not covered.</p>
|
| 425 |
+
|
| 426 |
+
<p>a. This License does not apply to computer programs used in the making<br />
|
| 427 |
+
or operation of the Database;</p>
|
| 428 |
+
|
| 429 |
+
<p>b. This License does not cover any patents over the Contents or the<br />
|
| 430 |
+
Database; and</p>
|
| 431 |
+
|
| 432 |
+
<p>c. This License does not cover any trademarks associated with the<br />
|
| 433 |
+
Database.</p>
|
| 434 |
+
|
| 435 |
+
<p>2.4 Relationship to Contents in the Database. The individual items of<br />
|
| 436 |
+
the Contents contained in this Database may be covered by other rights,<br />
|
| 437 |
+
including copyright, patent, data protection, privacy, or personality<br />
|
| 438 |
+
rights, and this License does not cover any rights (other than Database<br />
|
| 439 |
+
Rights or in contract) in individual Contents contained in the Database.<br />
|
| 440 |
+
For example, if used on a Database of images (the Contents), this<br />
|
| 441 |
+
License would not apply to copyright over individual images, which could<br />
|
| 442 |
+
have their own separate licenses, or one single license covering all of<br />
|
| 443 |
+
the rights over the images.</p>
|
| 444 |
+
|
| 445 |
+
<h3>3.0 Rights granted</h3>
|
| 446 |
+
|
| 447 |
+
<p>3.1 Subject to the terms and conditions of this License, the Licensor<br />
|
| 448 |
+
grants to You a worldwide, royalty-free, non-exclusive, terminable (but<br />
|
| 449 |
+
only under Section 9) license to Use the Database for the duration of<br />
|
| 450 |
+
any applicable copyright and Database Rights. These rights explicitly<br />
|
| 451 |
+
include commercial use, and do not exclude any field of endeavour. To<br />
|
| 452 |
+
the extent possible in the relevant jurisdiction, these rights may be<br />
|
| 453 |
+
exercised in all media and formats whether now known or created in the<br />
|
| 454 |
+
future.</p>
|
| 455 |
+
|
| 456 |
+
<p>The rights granted cover, for example:</p>
|
| 457 |
+
|
| 458 |
+
<p>a. Extraction and Re-utilisation of the whole or a Substantial part of<br />
|
| 459 |
+
the Contents;</p>
|
| 460 |
+
|
| 461 |
+
<p>b. Creation of Derivative Databases;</p>
|
| 462 |
+
|
| 463 |
+
<p>c. Creation of Collective Databases;</p>
|
| 464 |
+
|
| 465 |
+
<p>d. Creation of temporary or permanent reproductions by any means and<br />
|
| 466 |
+
in any form, in whole or in part, including of any Derivative<br />
|
| 467 |
+
Databases or as a part of Collective Databases; and</p>
|
| 468 |
+
|
| 469 |
+
<p>e. Distribution, communication, display, lending, making available, or<br />
|
| 470 |
+
performance to the public by any means and in any form, in whole or in<br />
|
| 471 |
+
part, including of any Derivative Database or as a part of Collective<br />
|
| 472 |
+
Databases.</p>
|
| 473 |
+
|
| 474 |
+
<p>3.2 Compulsory license schemes. For the avoidance of doubt:</p>
|
| 475 |
+
|
| 476 |
+
<p>a. Non-waivable compulsory license schemes. In those jurisdictions in<br />
|
| 477 |
+
which the right to collect royalties through any statutory or<br />
|
| 478 |
+
compulsory licensing scheme cannot be waived, the Licensor reserves<br />
|
| 479 |
+
the exclusive right to collect such royalties for any exercise by You<br />
|
| 480 |
+
of the rights granted under this License;</p>
|
| 481 |
+
|
| 482 |
+
<p>b. Waivable compulsory license schemes. In those jurisdictions in<br />
|
| 483 |
+
which the right to collect royalties through any statutory or<br />
|
| 484 |
+
compulsory licensing scheme can be waived, the Licensor waives the<br />
|
| 485 |
+
exclusive right to collect such royalties for any exercise by You of<br />
|
| 486 |
+
the rights granted under this License; and,</p>
|
| 487 |
+
|
| 488 |
+
<p>c. Voluntary license schemes. The Licensor waives the right to collect<br />
|
| 489 |
+
royalties, whether individually or, in the event that the Licensor is<br />
|
| 490 |
+
a member of a collecting society that administers voluntary licensing<br />
|
| 491 |
+
schemes, via that society, from any exercise by You of the rights<br />
|
| 492 |
+
granted under this License.</p>
|
| 493 |
+
|
| 494 |
+
<p>3.3 The right to release the Database under different terms, or to stop<br />
|
| 495 |
+
distributing or making available the Database, is reserved. Note that<br />
|
| 496 |
+
this Database may be multiple-licensed, and so You may have the choice<br />
|
| 497 |
+
of using alternative licenses for this Database. Subject to Section<br />
|
| 498 |
+
10.4, all other rights not expressly granted by Licensor are reserved.</p>
|
| 499 |
+
|
| 500 |
+
<h3>4.0 Conditions of Use</h3>
|
| 501 |
+
|
| 502 |
+
<p>4.1 The rights granted in Section 3 above are expressly made subject to<br />
|
| 503 |
+
Your complying with the following conditions of use. These are important<br />
|
| 504 |
+
conditions of this License, and if You fail to follow them, You will be<br />
|
| 505 |
+
in material breach of its terms.</p>
|
| 506 |
+
|
| 507 |
+
<p>4.2 Notices. If You Publicly Convey this Database, any Derivative<br />
|
| 508 |
+
Database, or the Database as part of a Collective Database, then You<br />
|
| 509 |
+
must:</p>
|
| 510 |
+
|
| 511 |
+
<p>a. Do so only under the terms of this License;</p>
|
| 512 |
+
|
| 513 |
+
<p>b. Include a copy of this License or its Uniform Resource Identifier (URI)<br />
|
| 514 |
+
with the Database or Derivative Database, including both in the<br />
|
| 515 |
+
Database or Derivative Database and in any relevant documentation;</p>
|
| 516 |
+
|
| 517 |
+
<p>c. Keep intact any copyright or Database Right notices and notices<br />
|
| 518 |
+
that refer to this License; and</p>
|
| 519 |
+
|
| 520 |
+
<p>d. If it is not possible to put the required notices in a particular<br />
|
| 521 |
+
file due to its structure, then You must include the notices in a<br />
|
| 522 |
+
location (such as a relevant directory) where users would be likely to<br />
|
| 523 |
+
look for it.</p>
|
| 524 |
+
|
| 525 |
+
<p>4.3 Notice for using output (Contents). Creating and Using a Produced<br />
|
| 526 |
+
Work does not require the notice in Section 4.2. However, if you<br />
|
| 527 |
+
Publicly Use a Produced Work, You must include a notice associated with<br />
|
| 528 |
+
the Produced Work reasonably calculated to make any Person that uses,<br />
|
| 529 |
+
views, accesses, interacts with, or is otherwise exposed to the Produced<br />
|
| 530 |
+
Work aware that Content was obtained from the Database, Derivative<br />
|
| 531 |
+
Database, or the Database as part of a Collective Database, and that it<br />
|
| 532 |
+
is available under this License.</p>
|
| 533 |
+
|
| 534 |
+
<p>a. Example notice. The following text will satisfy notice under<br />
|
| 535 |
+
Section 4.3:</p>
|
| 536 |
+
|
| 537 |
+
<p>Contains information from DATABASE NAME which is made available under the ODC Attribution License.</p>
|
| 538 |
+
|
| 539 |
+
<p>DATABASE NAME should be replaced with the name of the Database and a<br />
|
| 540 |
+
hyperlink to the location of the Database. “ODC Attribution License”<br />
|
| 541 |
+
should contain a hyperlink to the URI of the text of this License. If<br />
|
| 542 |
+
hyperlinks are not possible, You should include the plain text of the<br />
|
| 543 |
+
required URI’s with the above notice.</p>
|
| 544 |
+
|
| 545 |
+
<p>4.4 Licensing of others. You may not sublicense the Database. Each time<br />
|
| 546 |
+
You communicate the Database, the whole or Substantial part of the<br />
|
| 547 |
+
Contents, or any Derivative Database to anyone else in any way, the<br />
|
| 548 |
+
Licensor offers to the recipient a license to the Database on the same<br />
|
| 549 |
+
terms and conditions as this License. You are not responsible for<br />
|
| 550 |
+
enforcing compliance by third parties with this License, but You may<br />
|
| 551 |
+
enforce any rights that You have over a Derivative Database. You are<br />
|
| 552 |
+
solely responsible for any modifications of a Derivative Database made<br />
|
| 553 |
+
by You or another Person at Your direction. You may not impose any<br />
|
| 554 |
+
further restrictions on the exercise of the rights granted or affirmed<br />
|
| 555 |
+
under this License.</p>
|
| 556 |
+
|
| 557 |
+
<h3>5.0 Moral rights</h3>
|
| 558 |
+
|
| 559 |
+
<p>5.1 Moral rights. This section covers moral rights, including any rights<br />
|
| 560 |
+
to be identified as the author of the Database or to object to treatment<br />
|
| 561 |
+
that would otherwise prejudice the author’s honour and reputation, or<br />
|
| 562 |
+
any other derogatory treatment:</p>
|
| 563 |
+
|
| 564 |
+
<p>a. For jurisdictions allowing waiver of moral rights, Licensor waives<br />
|
| 565 |
+
all moral rights that Licensor may have in the Database to the fullest<br />
|
| 566 |
+
extent possible by the law of the relevant jurisdiction under Section<br />
|
| 567 |
+
10.4;</p>
|
| 568 |
+
|
| 569 |
+
<p>b. If waiver of moral rights under Section 5.1 a in the relevant<br />
|
| 570 |
+
jurisdiction is not possible, Licensor agrees not to assert any moral<br />
|
| 571 |
+
rights over the Database and waives all claims in moral rights to the<br />
|
| 572 |
+
fullest extent possible by the law of the relevant jurisdiction under<br />
|
| 573 |
+
Section 10.4; and</p>
|
| 574 |
+
|
| 575 |
+
<p>c. For jurisdictions not allowing waiver or an agreement not to assert<br />
|
| 576 |
+
moral rights under Section 5.1 a and b, the author may retain their<br />
|
| 577 |
+
moral rights over certain aspects of the Database.</p>
|
| 578 |
+
|
| 579 |
+
<p>Please note that some jurisdictions do not allow for the waiver of moral<br />
|
| 580 |
+
rights, and so moral rights may still subsist over the Database in some<br />
|
| 581 |
+
jurisdictions.</p>
|
| 582 |
+
|
| 583 |
+
<h3>6.0 Fair dealing, Database exceptions, and other rights not affected</h3>
|
| 584 |
+
|
| 585 |
+
<p>6.1 This License does not affect any rights that You or anyone else may<br />
|
| 586 |
+
independently have under any applicable law to make any use of this<br />
|
| 587 |
+
Database, including without limitation:</p>
|
| 588 |
+
|
| 589 |
+
<p>a. Exceptions to the Database Right including: Extraction of Contents<br />
|
| 590 |
+
from non-electronic Databases for private purposes, Extraction for<br />
|
| 591 |
+
purposes of illustration for teaching or scientific research, and<br />
|
| 592 |
+
Extraction or Re-utilisation for public security or an administrative<br />
|
| 593 |
+
or judicial procedure.</p>
|
| 594 |
+
|
| 595 |
+
<p>b. Fair dealing, fair use, or any other legally recognised limitation<br />
|
| 596 |
+
or exception to infringement of copyright or other applicable laws.</p>
|
| 597 |
+
|
| 598 |
+
<p>6.2 This License does not affect any rights of lawful users to Extract<br />
|
| 599 |
+
and Re-utilise insubstantial parts of the Contents, evaluated<br />
|
| 600 |
+
quantitatively or qualitatively, for any purposes whatsoever, including<br />
|
| 601 |
+
creating a Derivative Database (subject to other rights over the<br />
|
| 602 |
+
Contents, see Section 2.4). The repeated and systematic Extraction or<br />
|
| 603 |
+
Re-utilisation of insubstantial parts of the Contents may however amount<br />
|
| 604 |
+
to the Extraction or Re-utilisation of a Substantial part of the<br />
|
| 605 |
+
Contents.</p>
|
| 606 |
+
|
| 607 |
+
<h3>7.0 Warranties and Disclaimer</h3>
|
| 608 |
+
|
| 609 |
+
<p>7.1 The Database is licensed by the Licensor “as is” and without any<br />
|
| 610 |
+
warranty of any kind, either express, implied, or arising by statute,<br />
|
| 611 |
+
custom, course of dealing, or trade usage. Licensor specifically<br />
|
| 612 |
+
disclaims any and all implied warranties or conditions of title,<br />
|
| 613 |
+
non-infringement, accuracy or completeness, the presence or absence of<br />
|
| 614 |
+
errors, fitness for a particular purpose, merchantability, or otherwise.<br />
|
| 615 |
+
Some jurisdictions do not allow the exclusion of implied warranties, so<br />
|
| 616 |
+
this exclusion may not apply to You.</p>
|
| 617 |
+
|
| 618 |
+
<h3>8.0 Limitation of liability</h3>
|
| 619 |
+
|
| 620 |
+
<p>8.1 Subject to any liability that may not be excluded or limited by law,<br />
|
| 621 |
+
the Licensor is not liable for, and expressly excludes, all liability<br />
|
| 622 |
+
for loss or damage however and whenever caused to anyone by any use<br />
|
| 623 |
+
under this License, whether by You or by anyone else, and whether caused<br />
|
| 624 |
+
by any fault on the part of the Licensor or not. This exclusion of<br />
|
| 625 |
+
liability includes, but is not limited to, any special, incidental,<br />
|
| 626 |
+
consequential, punitive, or exemplary damages such as loss of revenue,<br />
|
| 627 |
+
data, anticipated profits, and lost business. This exclusion applies<br />
|
| 628 |
+
even if the Licensor has been advised of the possibility of such<br />
|
| 629 |
+
damages.</p>
|
| 630 |
+
|
| 631 |
+
<p>8.2 If liability may not be excluded by law, it is limited to actual and<br />
|
| 632 |
+
direct financial loss to the extent it is caused by proved negligence on<br />
|
| 633 |
+
the part of the Licensor.</p>
|
| 634 |
+
|
| 635 |
+
<h3>9.0 Termination of Your rights under this License</h3>
|
| 636 |
+
|
| 637 |
+
<p>9.1 Any breach by You of the terms and conditions of this License<br />
|
| 638 |
+
automatically terminates this License with immediate effect and without<br />
|
| 639 |
+
notice to You. For the avoidance of doubt, Persons who have received the<br />
|
| 640 |
+
Database, the whole or a Substantial part of the Contents, Derivative<br />
|
| 641 |
+
Databases, or the Database as part of a Collective Database from You<br />
|
| 642 |
+
under this License will not have their licenses terminated provided<br />
|
| 643 |
+
their use is in full compliance with this License or a license granted<br />
|
| 644 |
+
under Section 4.8 of this License. Sections 1, 2, 7, 8, 9 and 10 will<br />
|
| 645 |
+
survive any termination of this License.</p>
|
| 646 |
+
|
| 647 |
+
<p>9.2 If You are not in breach of the terms of this License, the Licensor<br />
|
| 648 |
+
will not terminate Your rights under it.</p>
|
| 649 |
+
|
| 650 |
+
<p>9.3 Unless terminated under Section 9.1, this License is granted to You<br />
|
| 651 |
+
for the duration of applicable rights in the Database.</p>
|
| 652 |
+
|
| 653 |
+
<p>9.4 Reinstatement of rights. If you cease any breach of the terms and<br />
|
| 654 |
+
conditions of this License, then your full rights under this License<br />
|
| 655 |
+
will be reinstated:</p>
|
| 656 |
+
|
| 657 |
+
<p>a. Provisionally and subject to permanent termination until the 60th<br />
|
| 658 |
+
day after cessation of breach;</p>
|
| 659 |
+
|
| 660 |
+
<p>b. Permanently on the 60th day after cessation of breach unless<br />
|
| 661 |
+
otherwise reasonably notified by the Licensor; or</p>
|
| 662 |
+
|
| 663 |
+
<p>c. Permanently if reasonably notified by the Licensor of the<br />
|
| 664 |
+
violation, this is the first time You have received notice of<br />
|
| 665 |
+
violation of this License from the Licensor, and You cure the<br />
|
| 666 |
+
violation prior to 30 days after your receipt of the notice.</p>
|
| 667 |
+
|
| 668 |
+
<p>9.5 Notwithstanding the above, Licensor reserves the right to release<br />
|
| 669 |
+
the Database under different license terms or to stop distributing or<br />
|
| 670 |
+
making available the Database. Releasing the Database under different<br />
|
| 671 |
+
license terms or stopping the distribution of the Database will not<br />
|
| 672 |
+
withdraw this License (or any other license that has been, or is<br />
|
| 673 |
+
required to be, granted under the terms of this License), and this<br />
|
| 674 |
+
License will continue in full force and effect unless terminated as<br />
|
| 675 |
+
stated above.</p>
|
| 676 |
+
|
| 677 |
+
<h3>10.0 General</h3>
|
| 678 |
+
|
| 679 |
+
<p>10.1 If any provision of this License is held to be invalid or<br />
|
| 680 |
+
unenforceable, that must not affect the validity or enforceability of<br />
|
| 681 |
+
the remainder of the terms and conditions of this License and each<br />
|
| 682 |
+
remaining provision of this License shall be valid and enforced to the<br />
|
| 683 |
+
fullest extent permitted by law.</p>
|
| 684 |
+
|
| 685 |
+
<p>10.2 This License is the entire agreement between the parties with<br />
|
| 686 |
+
respect to the rights granted here over the Database. It replaces any<br />
|
| 687 |
+
earlier understandings, agreements or representations with respect to<br />
|
| 688 |
+
the Database.</p>
|
| 689 |
+
|
| 690 |
+
<p>10.3 If You are in breach of the terms of this License, You will not be<br />
|
| 691 |
+
entitled to rely on the terms of this License or to complain of any<br />
|
| 692 |
+
breach by the Licensor.</p>
|
| 693 |
+
|
| 694 |
+
<p>10.4 Choice of law. This License takes effect in and will be governed by<br />
|
| 695 |
+
the laws of the relevant jurisdiction in which the License terms are<br />
|
| 696 |
+
sought to be enforced. If the standard suite of rights granted under<br />
|
| 697 |
+
applicable copyright law and Database Rights in the relevant<br />
|
| 698 |
+
jurisdiction includes additional rights not granted under this License,<br />
|
| 699 |
+
these additional rights are granted in this License in order to meet the<br />
|
| 700 |
+
terms of this License.</p>
|
| 701 |
+
<hr>
|
| 702 |
+
<p><a href="/content/challenge-2018/1.0.0/">Back to You Snooze You Win: The PhysioNet/Computing in Cardiology Challenge 2018 v1.0.0</a></p>
|
| 703 |
+
</div>
|
| 704 |
+
</main>
|
| 705 |
+
|
| 706 |
+
|
| 707 |
+
<link rel="stylesheet" type="text/css" href="/static/custom/css/footer.css"/>
|
| 708 |
+
|
| 709 |
+
<div class="modern-ui">
|
| 710 |
+
<footer class="footer w-100 secondary-bg py-5">
|
| 711 |
+
<div class="container my-0 py-0 py-md-5">
|
| 712 |
+
|
| 713 |
+
<img src="/static/images/physionet-logo-white.svg" width="180px" alt="PhysioNet" class="pb-2" />
|
| 714 |
+
|
| 715 |
+
<div class="footer__columns light-text">
|
| 716 |
+
<div>
|
| 717 |
+
|
| 718 |
+
<p class="dark-light-text mb-2">Maintained by the MIT Laboratory for Computational Physiology</p>
|
| 719 |
+
|
| 720 |
+
|
| 721 |
+
<p class="dark-light-text mb-2">Supported by the National Institute of Biomedical Imaging and Bioengineering (NIBIB), National Heart Lung and Blood Institute (NHLBI), and NIH Office of the Director under NIH grant numbers U24EB037545 and R01EB030362</p>
|
| 722 |
+
|
| 723 |
+
</div>
|
| 724 |
+
<div class="d-flex flex-column pl-0 pl-md-5 pt-4 pt-md-0">
|
| 725 |
+
<h2 class="text-white font-weight-bold">Navigation</h2>
|
| 726 |
+
<a href="/content" class="pb-3 dark-light-text">Discover Data</a>
|
| 727 |
+
<a href="/about/publish" class="pb-3 dark-light-text">Share Data</a>
|
| 728 |
+
<a href="/about" class="pb-3 dark-light-text">About</a>
|
| 729 |
+
<a href="/news" class="pb-3 dark-light-text">News</a>
|
| 730 |
+
</div>
|
| 731 |
+
<div class="d-flex flex-column pt-4 pt-md-0">
|
| 732 |
+
<h2 class="text-white font-weight-bold">Explore</h2>
|
| 733 |
+
|
| 734 |
+
<a href="/about/database/" class="pb-3 dark-light-text">Data</a>
|
| 735 |
+
|
| 736 |
+
<a href="/about/software/" class="pb-3 dark-light-text">Software</a>
|
| 737 |
+
|
| 738 |
+
<a href="/about/challenge/" class="pb-3 dark-light-text">Challenges</a>
|
| 739 |
+
|
| 740 |
+
<a href="/about/tutorial/" class="pb-3 dark-light-text">Tutorials</a>
|
| 741 |
+
|
| 742 |
+
</div>
|
| 743 |
+
<!-- <div class="d-flex flex-column flex-grow">
|
| 744 |
+
<h2 class="text-white font-weight-bold">Subscribe to our Newsletter</h2>
|
| 745 |
+
<input type="email" class="form-control mb-2" placeholder="Your email">
|
| 746 |
+
<button type="button" class="primary-button">Subscribe Now</button>
|
| 747 |
+
</div> -->
|
| 748 |
+
</div>
|
| 749 |
+
<hr >
|
| 750 |
+
<div class="d-flex flex-column align-items-center justify-content-between flex-md-row">
|
| 751 |
+
<div class="d-flex pt-2 pt-md-0">
|
| 752 |
+
|
| 753 |
+
<a class="mr-3" href="https://github.com/MIT-LCP/physionet-build/"><img src="/static/images/icons/github.png" height="18px"></a>
|
| 754 |
+
|
| 755 |
+
|
| 756 |
+
|
| 757 |
+
<a class="mr-3" href="http://linkedin.com/company/physionet"><img src="/static/images/icons/linkedin.png" height="18px"></a>
|
| 758 |
+
|
| 759 |
+
|
| 760 |
+
</div>
|
| 761 |
+
<div class="pt-4 pt-md-0">
|
| 762 |
+
|
| 763 |
+
|
| 764 |
+
|
| 765 |
+
<a class="dark-light-text" href="https://accessibility.mit.edu/">Accessibility</a>
|
| 766 |
+
|
| 767 |
+
</div>
|
| 768 |
+
</div>
|
| 769 |
+
|
| 770 |
+
<p class="footer__software-credit dark-light-text text-center mt-4 mb-0">
|
| 771 |
+
Built with <a class="dark-light-text" href="https://github.com/MIT-LCP/physionet-build">PhysioNet software</a>
|
| 772 |
+
from the MIT Laboratory for Computational Physiology, supported by NIH grant U24EB037545.
|
| 773 |
+
</p>
|
| 774 |
+
</div>
|
| 775 |
+
</footer>
|
| 776 |
+
</div>
|
| 777 |
+
|
| 778 |
+
|
| 779 |
+
|
| 780 |
+
<script src="/static/bootstrap/js/bootstrap.min.js"></script>
|
| 781 |
+
<script src="/static/bootstrap/js/ie10-viewport-bug-workaround.js"></script>
|
| 782 |
+
<script src="/static/custom/js/navbar.js"></script>
|
| 783 |
+
|
| 784 |
+
|
| 785 |
+
|
| 786 |
+
</body>
|
| 787 |
+
|
| 788 |
+
</html>
|
challenge-2018/README.md
ADDED
|
@@ -0,0 +1,13 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# You Snooze You Win: The PhysioNet/Computing in Cardiology Challenge 2018 1.0.0
|
| 2 |
+
|
| 3 |
+
Unmodified research-data mirror. Source: [You Snooze You Win: The PhysioNet/Computing in Cardiology Challenge 2018](https://physionet.org/content/challenge-2018/1.0.0/). Attribution: Mohammad Ghassemi, Benjamin Moody, Li-wei Lehman, Roger Mark, Gari D. Clifford. Dataset DOI: https://doi.org/10.13026/6phb-r450.
|
| 4 |
+
|
| 5 |
+
License: [https://opendatacommons.org/licenses/by/index.html](https://opendatacommons.org/licenses/by/index.html). Preserve the original notices in `LICENSE.html`, `SOURCE.html`, and `provenance.json`, and cite the original dataset and PhysioNet.
|
| 6 |
+
|
| 7 |
+
The goal of the challenge is use information from the available signals to correctly classify target arousal regions.
|
| 8 |
+
|
| 9 |
+
Files are verified against the original PhysioNet SHA256 manifest before upload, then checked against remote content-addressed hashes. No signal preprocessing or conversion is performed. Completion is recorded in the collection inventory, not implied by the presence of this card. Do not attempt to identify participants. This collection is not a clinical diagnostic tool.
|
| 10 |
+
|
| 11 |
+
## Original source references
|
| 12 |
+
|
| 13 |
+
|
challenge-2018/SHA256SUMS.txt
ADDED
|
The diff for this file is too large to render.
See raw diff
|
|
|
challenge-2018/SOURCE.html
ADDED
|
@@ -0,0 +1,1464 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
<!DOCTYPE html>
|
| 2 |
+
|
| 3 |
+
<html lang="en">
|
| 4 |
+
<head>
|
| 5 |
+
<meta charset="UTF-8">
|
| 6 |
+
<title>You Snooze You Win: The PhysioNet/Computing in Cardiology Challenge 2018 v1.0.0</title>
|
| 7 |
+
|
| 8 |
+
<!-- wfdb-python: <p>Version: 1.0.0</p> -->
|
| 9 |
+
|
| 10 |
+
|
| 11 |
+
|
| 12 |
+
|
| 13 |
+
<link rel="stylesheet" type="text/css" href="/static/bootstrap/css/bootstrap.css"/>
|
| 14 |
+
<link rel="stylesheet" type="text/css" href="/static/font-awesome/css/all.css"/>
|
| 15 |
+
<link rel="stylesheet" type="text/css" href="/static/custom/css/physionet.css?v=2"/>
|
| 16 |
+
|
| 17 |
+
<link rel="stylesheet" type="text/css" href="/static/project/css/project-content.css?v=3"/>
|
| 18 |
+
<link rel="stylesheet" type="text/css" href="/static/highlight/css/default.min.css"/>
|
| 19 |
+
|
| 20 |
+
|
| 21 |
+
<script src="/static/jquery/jquery.min.js"></script>
|
| 22 |
+
<script src="/static/popper/popper.min.js"></script>
|
| 23 |
+
<script async src="https://www.googletagmanager.com/gtag/js?id=UA-87592301-7"></script>
|
| 24 |
+
<script>
|
| 25 |
+
window.dataLayer = window.dataLayer || [];
|
| 26 |
+
function gtag(){dataLayer.push(arguments);}
|
| 27 |
+
gtag('js', new Date());
|
| 28 |
+
|
| 29 |
+
gtag('config', 'UA-87592301-7');
|
| 30 |
+
</script>
|
| 31 |
+
|
| 32 |
+
<script src="/static/mathjax/MathJax.js?config=MML_HTMLorMML"></script>
|
| 33 |
+
<script src="/static/highlight/js/highlight.min.js"></script>
|
| 34 |
+
<script src="/static/custom/js/copy-to-clipboard.js"></script>
|
| 35 |
+
|
| 36 |
+
<link rel="shortcut icon" type="image/png" href="/static/favicon.ico"/>
|
| 37 |
+
<meta name="viewport" content="width=device-width, initial-scale=1.0">
|
| 38 |
+
<link rel="stylesheet" href="/static/bootstrap/bootstrap-icons/bootstrap-icons.css">
|
| 39 |
+
<link rel="stylesheet" href="/static/fonts/inter-local.css">
|
| 40 |
+
<link rel="stylesheet" type="text/css" href="/static/custom/css/style.css?v=2">
|
| 41 |
+
</head>
|
| 42 |
+
|
| 43 |
+
|
| 44 |
+
<body class="modern-ui flexbody">
|
| 45 |
+
|
| 46 |
+
|
| 47 |
+
|
| 48 |
+
|
| 49 |
+
|
| 50 |
+
<div class="modern-ui nav-wrapper">
|
| 51 |
+
<nav class="nav">
|
| 52 |
+
<div class="container my-0 h-100 d-flex justify-content-between align-items-center">
|
| 53 |
+
<button type="button" class="nav__hamburger circle-button mr-2"
|
| 54 |
+
popovertarget="nav__hamburger_popup"
|
| 55 |
+
title="Menu">
|
| 56 |
+
<i class="nav__hamburger__list bi bi-list"></i>
|
| 57 |
+
<i class="nav__hamburger__x bi bi-x"></i>
|
| 58 |
+
<span class="visually-hidden">Menu</span>
|
| 59 |
+
</button>
|
| 60 |
+
<a href="/">
|
| 61 |
+
|
| 62 |
+
<img src="/static/images/physionet-logo.svg" width="200px" alt="PhysioNet">
|
| 63 |
+
|
| 64 |
+
</a>
|
| 65 |
+
<div class="nav__links align-items-center">
|
| 66 |
+
|
| 67 |
+
|
| 68 |
+
<a href="/about/publish/" class="nav-link">Share</a>
|
| 69 |
+
|
| 70 |
+
|
| 71 |
+
|
| 72 |
+
<a href="/about/" class="nav-link">About</a>
|
| 73 |
+
|
| 74 |
+
|
| 75 |
+
|
| 76 |
+
|
| 77 |
+
|
| 78 |
+
|
| 79 |
+
|
| 80 |
+
|
| 81 |
+
|
| 82 |
+
<a href="/about/faqs/" class="nav-link">FAQs</a>
|
| 83 |
+
|
| 84 |
+
|
| 85 |
+
|
| 86 |
+
|
| 87 |
+
|
| 88 |
+
|
| 89 |
+
|
| 90 |
+
<div>
|
| 91 |
+
<button type="button" class="nav-link nav-link--expandable"
|
| 92 |
+
popovertarget="nav__explore_popup">
|
| 93 |
+
Explore <i class="bi bi-chevron-down ml-2"></i>
|
| 94 |
+
</button>
|
| 95 |
+
<dialog class="nav-link__popup" id="nav__explore_popup" popover
|
| 96 |
+
aria-label="Explore">
|
| 97 |
+
<div class="nav-sublinks">
|
| 98 |
+
|
| 99 |
+
<a class="nav-sublink" href="/about/database/">
|
| 100 |
+
<div class="nav-sublink__icon">
|
| 101 |
+
|
| 102 |
+
<img src="/static/images/icons/data.png" alt="" height="32px">
|
| 103 |
+
|
| 104 |
+
</div>
|
| 105 |
+
<div class="nav-sublink__text">
|
| 106 |
+
<span class="nav-sublink__title">Data</span>
|
| 107 |
+
<span class="nav-sublink__description">View datasets</span>
|
| 108 |
+
</div>
|
| 109 |
+
</a>
|
| 110 |
+
|
| 111 |
+
<a class="nav-sublink" href="/about/software/">
|
| 112 |
+
<div class="nav-sublink__icon">
|
| 113 |
+
|
| 114 |
+
<img src="/static/images/icons/software.png" alt="" height="32px">
|
| 115 |
+
|
| 116 |
+
</div>
|
| 117 |
+
<div class="nav-sublink__text">
|
| 118 |
+
<span class="nav-sublink__title">Software</span>
|
| 119 |
+
<span class="nav-sublink__description">View software</span>
|
| 120 |
+
</div>
|
| 121 |
+
</a>
|
| 122 |
+
|
| 123 |
+
<a class="nav-sublink" href="/about/challenge/">
|
| 124 |
+
<div class="nav-sublink__icon">
|
| 125 |
+
|
| 126 |
+
<img src="/static/images/icons/challenges.png" alt="" height="32px">
|
| 127 |
+
|
| 128 |
+
</div>
|
| 129 |
+
<div class="nav-sublink__text">
|
| 130 |
+
<span class="nav-sublink__title">Challenges</span>
|
| 131 |
+
<span class="nav-sublink__description">View challenges</span>
|
| 132 |
+
</div>
|
| 133 |
+
</a>
|
| 134 |
+
|
| 135 |
+
<a class="nav-sublink" href="/about/tutorial/">
|
| 136 |
+
<div class="nav-sublink__icon">
|
| 137 |
+
|
| 138 |
+
<img src="/static/images/icons/tutorials.png" alt="" height="32px">
|
| 139 |
+
|
| 140 |
+
</div>
|
| 141 |
+
<div class="nav-sublink__text">
|
| 142 |
+
<span class="nav-sublink__title">Tutorials</span>
|
| 143 |
+
<span class="nav-sublink__description">View tutorials</span>
|
| 144 |
+
</div>
|
| 145 |
+
</a>
|
| 146 |
+
|
| 147 |
+
</div>
|
| 148 |
+
</dialog>
|
| 149 |
+
</div>
|
| 150 |
+
</div>
|
| 151 |
+
<div class="nav__actions d-flex ml-md-4">
|
| 152 |
+
<form action="/content/" class="mr-2">
|
| 153 |
+
<div class="nav__search">
|
| 154 |
+
<input type="text" name="topic" placeholder="Search for anything...">
|
| 155 |
+
<div class="nav__search__actions">
|
| 156 |
+
<button type="button" class="nav__search__close mr-2"
|
| 157 |
+
title="Cancel">
|
| 158 |
+
<i class="bi bi-x"></i>
|
| 159 |
+
<span class="visually-hidden">Cancel</span>
|
| 160 |
+
</button>
|
| 161 |
+
<button type="submit" class="circle-button">Search</button>
|
| 162 |
+
</div>
|
| 163 |
+
</div>
|
| 164 |
+
</form>
|
| 165 |
+
<button type="button" class="nav__search__open circle-button mr-md-2"
|
| 166 |
+
title="Search PhysioNet">
|
| 167 |
+
<i class="bi bi-search"></i>
|
| 168 |
+
<span class="visually-hidden">Search PhysioNet</span>
|
| 169 |
+
</button>
|
| 170 |
+
|
| 171 |
+
<a class="nav__user" href="/login/"
|
| 172 |
+
title="Log in">
|
| 173 |
+
<i class="bi bi-person"></i>
|
| 174 |
+
<span class="visually-hidden">Log in</span>
|
| 175 |
+
</a>
|
| 176 |
+
|
| 177 |
+
</div>
|
| 178 |
+
</div>
|
| 179 |
+
|
| 180 |
+
<dialog class="nav__mobile" id="nav__hamburger_popup" popover
|
| 181 |
+
aria-label="Menu">
|
| 182 |
+
|
| 183 |
+
|
| 184 |
+
<a href="/about/publish/" class="nav-link">Share</a>
|
| 185 |
+
|
| 186 |
+
|
| 187 |
+
|
| 188 |
+
<a href="/about/" class="nav-link">About</a>
|
| 189 |
+
|
| 190 |
+
|
| 191 |
+
|
| 192 |
+
|
| 193 |
+
|
| 194 |
+
|
| 195 |
+
|
| 196 |
+
|
| 197 |
+
|
| 198 |
+
<a href="/about/faqs/" class="nav-link">FAQs</a>
|
| 199 |
+
|
| 200 |
+
|
| 201 |
+
|
| 202 |
+
|
| 203 |
+
|
| 204 |
+
|
| 205 |
+
<hr>
|
| 206 |
+
<div class="nav-sublinks">
|
| 207 |
+
|
| 208 |
+
<a class="nav-sublink" href="/about/database/">
|
| 209 |
+
<div class="nav-sublink__icon">
|
| 210 |
+
|
| 211 |
+
<img src="/static/images/icons/data.png" alt="" height="32px">
|
| 212 |
+
|
| 213 |
+
</div>
|
| 214 |
+
<div class="nav-sublink__text">
|
| 215 |
+
<span class="nav-sublink__title">Data</span>
|
| 216 |
+
<span class="nav-sublink__description">View datasets</span>
|
| 217 |
+
</div>
|
| 218 |
+
</a>
|
| 219 |
+
|
| 220 |
+
<a class="nav-sublink" href="/about/software/">
|
| 221 |
+
<div class="nav-sublink__icon">
|
| 222 |
+
|
| 223 |
+
<img src="/static/images/icons/software.png" alt="" height="32px">
|
| 224 |
+
|
| 225 |
+
</div>
|
| 226 |
+
<div class="nav-sublink__text">
|
| 227 |
+
<span class="nav-sublink__title">Software</span>
|
| 228 |
+
<span class="nav-sublink__description">View software</span>
|
| 229 |
+
</div>
|
| 230 |
+
</a>
|
| 231 |
+
|
| 232 |
+
<a class="nav-sublink" href="/about/challenge/">
|
| 233 |
+
<div class="nav-sublink__icon">
|
| 234 |
+
|
| 235 |
+
<img src="/static/images/icons/challenges.png" alt="" height="32px">
|
| 236 |
+
|
| 237 |
+
</div>
|
| 238 |
+
<div class="nav-sublink__text">
|
| 239 |
+
<span class="nav-sublink__title">Challenges</span>
|
| 240 |
+
<span class="nav-sublink__description">View challenges</span>
|
| 241 |
+
</div>
|
| 242 |
+
</a>
|
| 243 |
+
|
| 244 |
+
<a class="nav-sublink" href="/about/tutorial/">
|
| 245 |
+
<div class="nav-sublink__icon">
|
| 246 |
+
|
| 247 |
+
<img src="/static/images/icons/tutorials.png" alt="" height="32px">
|
| 248 |
+
|
| 249 |
+
</div>
|
| 250 |
+
<div class="nav-sublink__text">
|
| 251 |
+
<span class="nav-sublink__title">Tutorials</span>
|
| 252 |
+
<span class="nav-sublink__description">View tutorials</span>
|
| 253 |
+
</div>
|
| 254 |
+
</a>
|
| 255 |
+
|
| 256 |
+
</div>
|
| 257 |
+
</dialog>
|
| 258 |
+
</nav>
|
| 259 |
+
</div>
|
| 260 |
+
|
| 261 |
+
<div class="nav-spacer"></div>
|
| 262 |
+
|
| 263 |
+
<main>
|
| 264 |
+
<div class="container">
|
| 265 |
+
|
| 266 |
+
|
| 267 |
+
<div class="project-header">
|
| 268 |
+
<div class="mb-2">
|
| 269 |
+
<span class="badge badge-dark"><i class="fa fa-bullseye"></i> Challenge</span>
|
| 270 |
+
<span class="badge badge-success"><i class="fas fa-lock-open"></i> Open Access</span>
|
| 271 |
+
<a href="/content/challenge-2018/metrics/1.0.0/" class="badge badge-dataset-index" title="Dataset Index (2023) from Scholar Data"><span class="badge-dataset-index-label"><i class="fas fa-chart-line"></i> Dataset Index</span><span class="badge-dataset-index-value">1</span></a>
|
| 272 |
+
</div>
|
| 273 |
+
<h1>You Snooze You Win: The PhysioNet/Computing in Cardiology Challenge 2018</h1>
|
| 274 |
+
<p class="project-authors">
|
| 275 |
+
|
| 276 |
+
<button type="button" class="author-popover-trigger" data-toggle="popover" data-placement="bottom" data-html="true" data-content="<p><strong>Affiliations</strong><br>MIT Laboratory for Computational Physiology, Cambridge, USA</p><p><strong>Profile</strong><br><a href="/users/ghassemi/" target="_blank">ghassemi</a></p>" aria-label="Mohammad Ghassemi: show author information" aria-expanded="false">Mohammad Ghassemi<i class="fas fa-caret-down" aria-hidden="true"></i></button>,
|
| 277 |
+
|
| 278 |
+
<button type="button" class="author-popover-trigger" data-toggle="popover" data-placement="bottom" data-html="true" data-content="<p><strong>Affiliations</strong><br>MIT Laboratory for Computational Physiology, Cambridge, USA</p><p><strong>Profile</strong><br><a href="/users/benjamin/" target="_blank">benjamin</a></p>" aria-label="Benjamin Moody: show author information" aria-expanded="false">Benjamin Moody<i class="fas fa-caret-down" aria-hidden="true"></i></button>,
|
| 279 |
+
|
| 280 |
+
<button type="button" class="author-popover-trigger" data-toggle="popover" data-placement="bottom" data-html="true" data-content="<p><strong>Affiliations</strong><br>MIT Laboratory for Computational Physiology, Cambridge, USA</p><p><strong>Profile</strong><br><a href="/users/lilehman/" target="_blank">lilehman</a></p>" aria-label="Li-wei Lehman: show author information" aria-expanded="false">Li-wei Lehman<i class="fas fa-caret-down" aria-hidden="true"></i></button>,
|
| 281 |
+
|
| 282 |
+
<button type="button" class="author-popover-trigger" data-toggle="popover" data-placement="bottom" data-html="true" data-content="<p><strong>Affiliations</strong><br>MIT Laboratory for Computational Physiology, Cambridge, USA</p><p><strong>Profile</strong><br><a href="/users/rgmark/" target="_blank">rgmark</a></p>" aria-label="Roger Mark: show author information" aria-expanded="false">Roger Mark<i class="fas fa-caret-down" aria-hidden="true"></i></button><a class="author-orcid" href="https://orcid.org/0000-0002-6318-2978" target="_blank" rel="noopener" title="ORCID iD: https://orcid.org/0000-0002-6318-2978"><img src="/static/images/orcid-id-icon.svg" alt="ORCID iD for Roger Mark" width="16" height="16"></a>,
|
| 283 |
+
|
| 284 |
+
<button type="button" class="author-popover-trigger" data-toggle="popover" data-placement="bottom" data-html="true" data-content="<p><strong>Affiliations</strong><br>Emory University &amp; Georgia Institute of Technology, Atlanta, USA</p><p><strong>Profile</strong><br><a href="/users/gari/" target="_blank">gari</a></p>" aria-label="Gari D. Clifford: show author information" aria-expanded="false">Gari D. Clifford<i class="fas fa-caret-down" aria-hidden="true"></i></button>
|
| 285 |
+
|
| 286 |
+
</p>
|
| 287 |
+
<div class="project-meta">
|
| 288 |
+
<span>Published Feb. 21, 2018</span>
|
| 289 |
+
<span class="project-meta-sep">·</span>
|
| 290 |
+
<span>Version 1.0.0</span>
|
| 291 |
+
</div>
|
| 292 |
+
</div>
|
| 293 |
+
|
| 294 |
+
|
| 295 |
+
|
| 296 |
+
|
| 297 |
+
|
| 298 |
+
<!-- Latest news and announcements -->
|
| 299 |
+
|
| 300 |
+
<div class="alert alert-primary" role="alert">
|
| 301 |
+
|
| 302 |
+
|
| 303 |
+
|
| 304 |
+
|
| 305 |
+
<p>
|
| 306 |
+
<strong>Community forum for the 2018 PhysioNet/CinC Challenge</strong>
|
| 307 |
+
<em>(Feb. 23, 2019, 12:54 p.m.)</em>
|
| 308 |
+
<p>If you have any questions or comments regarding this challenge, please post it directly in our <a href="https://groups.google.com/forum/#!forum/physionet-challenges">Community Discussion Forum</a>. This will increase transparency (benefiting all the competitors) and ensure that all the challenge organizers see your question.</p>
|
| 309 |
+
|
| 310 |
+
|
| 311 |
+
|
| 312 |
+
</p>
|
| 313 |
+
|
| 314 |
+
|
| 315 |
+
|
| 316 |
+
|
| 317 |
+
<p>
|
| 318 |
+
<strong>2018 Challenge publications</strong>
|
| 319 |
+
<em>(Feb. 22, 2019, midnight)</em>
|
| 320 |
+
<ul>
|
| 321 |
+
<li>Publications from the 2018 Challenge are now available.</li>
|
| 322 |
+
</ul>
|
| 323 |
+
|
| 324 |
+
|
| 325 |
+
|
| 326 |
+
</p>
|
| 327 |
+
|
| 328 |
+
|
| 329 |
+
|
| 330 |
+
<details>
|
| 331 |
+
<summary>More news</summary>
|
| 332 |
+
|
| 333 |
+
|
| 334 |
+
<p>
|
| 335 |
+
<strong>Journal of Physiological Measurement is now accepting submissions for the 2018 Challenge</strong>
|
| 336 |
+
<em>(Nov. 28, 2018, midnight)</em>
|
| 337 |
+
<ul>
|
| 338 |
+
<li>The Journal of Physiological Measurement is now accepting submissions in the focus issue: <a href="http://iopscience.iop.org/journal/0967-3334/page/Automated_Analysis_Arousals_Sleep_Sleep-Related_Disorders">Automated Analysis of Arousals, Sleep and Sleep-Related Disorders Using Physiological Time Series</a>. Please included updated results from the test dataset if you develop a new algorithm. Note that the scope does not confine you to the data and topic of this year's Challenge. Please see <a href="http://iopscience.iop.org/journal/0967-3334/page/Automated_Analysis_Arousals_Sleep_Sleep-Related_Disorders">here</a> for more information on the scope and how to submit. The deadline is set for the end of February 2019.</li>
|
| 339 |
+
</ul>
|
| 340 |
+
|
| 341 |
+
|
| 342 |
+
|
| 343 |
+
</p>
|
| 344 |
+
|
| 345 |
+
|
| 346 |
+
|
| 347 |
+
|
| 348 |
+
<p>
|
| 349 |
+
<strong>Official results for the 2018 Challenge</strong>
|
| 350 |
+
<em>(Oct. 10, 2018, midnight)</em>
|
| 351 |
+
<ul>
|
| 352 |
+
<li><a href="/content/challenge-2018/1.0.0/results.csv">Official results</a>, as well as a <a href="/content/challenge-2018/1.0.0/challenge2018cinc.pdf">paper describing the Challenge</a>, are now available. Top scores were achieved by
|
| 353 |
+
<ol>
|
| 354 |
+
<li>Matthew Howe-Patterson, Bahareh Pourbabaee, and Frederic Benard (0.54)</li>
|
| 355 |
+
<li>Guðni Fannar Kristjansson, Heiðar Már Þráinsson, Hanna Ragnarsdóttir, Bragi Marinósson, Eysteinn Gunnlaugsson, Eysteinn Finnsson, Sigurður Ægir Jónsson, Halla Helgadóttir, and Jón Skírnir Ágústsson (0.45)</li>
|
| 356 |
+
<li>Runnan He, Kuanquan Wang, Yang Liu, Na Zhao, Yongfeng Yuan, Qince Li, and Henggui Zhang (0.43)</li>
|
| 357 |
+
</ol>
|
| 358 |
+
</li>
|
| 359 |
+
<li>An unofficial entry from Hongyang Li and Yuanfang Guan (who unfortunately missed the deadline to submit an abstract) achieved a score of 0.55.</li>
|
| 360 |
+
</ul>
|
| 361 |
+
|
| 362 |
+
|
| 363 |
+
|
| 364 |
+
</p>
|
| 365 |
+
|
| 366 |
+
|
| 367 |
+
|
| 368 |
+
|
| 369 |
+
<p>
|
| 370 |
+
<strong>Submission is now closed for the 2018 Challenge</strong>
|
| 371 |
+
<em>(Sept. 1, 2018, midnight)</em>
|
| 372 |
+
<ul>
|
| 373 |
+
<li>Challenge entry submission is now closed. Authors must select the entry they wish to be run against the full Challenge data set before 10 Sept 2018 (midnight GMT, 7pm EDT). After this deadline the most recent entry (only) will be selected and evaluated on the full test data.</li>
|
| 374 |
+
<li>Winners will be announced and prizes presented at <a href="http://www.cinc.org"> Computing in Cardiology </a> on 26 Sept 2018.</li>
|
| 375 |
+
</ul>
|
| 376 |
+
|
| 377 |
+
|
| 378 |
+
|
| 379 |
+
</p>
|
| 380 |
+
|
| 381 |
+
|
| 382 |
+
|
| 383 |
+
|
| 384 |
+
<p>
|
| 385 |
+
<strong>Notices of acceptance have been sent for CinC abstracts</strong>
|
| 386 |
+
<em>(June 20, 2018, midnight)</em>
|
| 387 |
+
<ul>
|
| 388 |
+
<li>CinC abstract acceptances/rejections have now been sent out.</li>
|
| 389 |
+
<li>If your abstract was rejected, do not be despondent - please see the Rules and Deadlines below for a second chance to have your abstract accepted for and stay in the official running for the Challenge. This is chance is open to everyone, not just those with rejected abstracts.</li>
|
| 390 |
+
<li>If your abstract was accepted, please <a href="https://www.softconf.com/i/cinc2018/">log in to the conference site</a> and agree that you will attend. Then, you must submit a full article describing your results and mark it as a preprint (for others to read) by September 15th. (Don't forget that the competition deadline is noon GMT on the 1st September - this deadline will <em>not</em> be extended)</li>
|
| 391 |
+
<li>If you will need a visa to attend CinC, please do this immediately, and <a href="http://www.cinc2018.org/visa/">follow these instructions</a>.</li>
|
| 392 |
+
</ul>
|
| 393 |
+
|
| 394 |
+
|
| 395 |
+
|
| 396 |
+
</p>
|
| 397 |
+
|
| 398 |
+
|
| 399 |
+
|
| 400 |
+
|
| 401 |
+
<p>
|
| 402 |
+
<strong>Top scores in the unofficial phase of the 2018 Challenge</strong>
|
| 403 |
+
<em>(May 7, 2018, midnight)</em>
|
| 404 |
+
<ul>
|
| 405 |
+
<li><a href="/content/challenge-2018/1.0.0/unofficial-phase-results.csv">Top scores in the Unofficial Phase</a> were achieved by Matthew HP and Bahareh Pourbabaee with a score of 0.439, Yang Liu and Runnan He with a score of 0.244, and Márton Görög, Bálint Varga, and Péter Hajas with a score of 0.228.</li>
|
| 406 |
+
<li>An <a href="/content/challenge-2018/1.0.0/new-arousals.zip">updated set of arousal files</a> are now available.</li>
|
| 407 |
+
<li>A <a href="/content/challenge-2018/1.0.0/score2018.m">Matlab implementation of the scoring function</a> is now available.</li>
|
| 408 |
+
<li>Both the Python and Matlab sample submissions have been updated to use the new scoring code.</li>
|
| 409 |
+
</ul>
|
| 410 |
+
|
| 411 |
+
|
| 412 |
+
|
| 413 |
+
</p>
|
| 414 |
+
|
| 415 |
+
|
| 416 |
+
|
| 417 |
+
|
| 418 |
+
<p>
|
| 419 |
+
<strong>Python scoring function now available for the 2018 Challenge</strong>
|
| 420 |
+
<em>(April 19, 2018, midnight)</em>
|
| 421 |
+
<ul>
|
| 422 |
+
<li>A Python implementation of the scoring function (gross area under precision-recall curve) is available <a href="/content/challenge-2018/1.0.0/score.py">here</a>.</li>
|
| 423 |
+
</ul>
|
| 424 |
+
|
| 425 |
+
|
| 426 |
+
|
| 427 |
+
</p>
|
| 428 |
+
|
| 429 |
+
|
| 430 |
+
|
| 431 |
+
|
| 432 |
+
<p>
|
| 433 |
+
<strong>A second sample submission is available for the 2018 Challenge</strong>
|
| 434 |
+
<em>(April 10, 2018, midnight)</em>
|
| 435 |
+
<ul>
|
| 436 |
+
<li>A second <a href="/content/challenge-2018/1.0.0/sample-matlab#files-panel">sample submission, implemented using Matlab</a>, has been posted.</li>
|
| 437 |
+
<li><em>Be sure to submit your abstract for Computing in Cardiology before April 15!</em> See <a href="http://www.cinc.org/cinc-conference-program-abstracts">the CinC site</a> for more information. Please submit an abstract with your <em>training</em> results, even if you have not yet been able to obtain a score on the test set.</li>
|
| 438 |
+
</ul>
|
| 439 |
+
|
| 440 |
+
|
| 441 |
+
|
| 442 |
+
</p>
|
| 443 |
+
|
| 444 |
+
|
| 445 |
+
|
| 446 |
+
|
| 447 |
+
<p>
|
| 448 |
+
<strong>Submission and scoring functions for the 2018 Challenge are now online.</strong>
|
| 449 |
+
<em>(April 7, 2018, midnight)</em>
|
| 450 |
+
<ul>
|
| 451 |
+
<li>A <a href="/content/challenge-2018/1.0.0/sample#files-panel">sample submission and scoring function</a> are now online.</li>
|
| 452 |
+
<li>The entry submission system is now open; you can access it <a href="https://challenge.physionet.org/">here</a>.</li>
|
| 453 |
+
<li>The deadline for the Unofficial Phase has been extended. The new deadline is noon GMT, April 13.</li>
|
| 454 |
+
</ul>
|
| 455 |
+
|
| 456 |
+
|
| 457 |
+
|
| 458 |
+
</p>
|
| 459 |
+
|
| 460 |
+
|
| 461 |
+
|
| 462 |
+
|
| 463 |
+
<p>
|
| 464 |
+
<strong>The 2018 PhysioNet Challenge is now open</strong>
|
| 465 |
+
<em>(Feb. 21, 2018, midnight)</em>
|
| 466 |
+
<p>The 2018 PhysioNet/Computing in Cardiology Challenge is now open. This year's Challenge, "You Snooze, You Win", is focused on the problem of automatically detecting disturbances in a patient's sleep. Given a collection of physiological signals recorded during sleep, including EEG, ECG, and EMG, participants are invited to develop an algorithm to automatically identify arousal events, and will be scored based on how well their algorithm's results agree with those of expert human annotators.</p>
|
| 467 |
+
|
| 468 |
+
|
| 469 |
+
|
| 470 |
+
</p>
|
| 471 |
+
|
| 472 |
+
|
| 473 |
+
|
| 474 |
+
|
| 475 |
+
<p>
|
| 476 |
+
<strong>2018 Challenge data is now available</strong>
|
| 477 |
+
<em>(Feb. 21, 2018, midnight)</em>
|
| 478 |
+
<ul>
|
| 479 |
+
<li>PhysioNet Challenge data can now be <a href="/content/challenge-2018">downloaded here.</a></li>
|
| 480 |
+
</ul>
|
| 481 |
+
|
| 482 |
+
</span>
|
| 483 |
+
|
| 484 |
+
</p>
|
| 485 |
+
|
| 486 |
+
|
| 487 |
+
</details>
|
| 488 |
+
|
| 489 |
+
</div>
|
| 490 |
+
|
| 491 |
+
|
| 492 |
+
<div class="row">
|
| 493 |
+
<!-- Main column -->
|
| 494 |
+
<div class="col-md-8">
|
| 495 |
+
|
| 496 |
+
|
| 497 |
+
|
| 498 |
+
<div class="citation-box">
|
| 499 |
+
|
| 500 |
+
|
| 501 |
+
|
| 502 |
+
|
| 503 |
+
<div class="citation-section">
|
| 504 |
+
<span class="citation-label">When using this resource, please cite the original publication:</span>
|
| 505 |
+
<p class="citation-text">Ghassemi MM, Moody BE, Lehman LW, Song C, Li Q, Sun H, Mark RG, Westover MB, Clifford GD. You snooze, you win: the physionet/computing in cardiology challenge 2018. In 2018 Computing in Cardiology Conference (CinC) 2018 Sep 23 (Vol. 45, pp. 1-4). IEEE. doi: 10.22489/CinC.2018.049. <a href="https://doi.org/10.22489/CinC.2018.049" rel="nofollow">https://doi.org/10.22489/CinC.2018.049</a></p>
|
| 506 |
+
</div>
|
| 507 |
+
|
| 508 |
+
|
| 509 |
+
|
| 510 |
+
<div class="citation-section">
|
| 511 |
+
<span class="citation-label">Please include the standard citation for PhysioNet:</span>
|
| 512 |
+
<span class="citation-actions">
|
| 513 |
+
<button type="button" class="btn btn-sm btn-outline-secondary" data-toggle="modal" data-target="#citationModalPlatform" title="View citation formats"><i class="bi bi-quote"></i> Cite</button>
|
| 514 |
+
|
| 515 |
+
<button type="button" class="btn btn-sm btn-outline-secondary ml-1 btn-copy-bibtex" title="Copy BibTeX" data-clipboard-target="bibtex-data-platform"><i class="bi bi-clipboard"></i> Copy BibTeX</button>
|
| 516 |
+
|
| 517 |
+
</span>
|
| 518 |
+
<p class="citation-text">Pollard, T., Moody, B. E., Lehman, L., Gow, B., Fernandes, C., Xie, C., Johnson, A., Mark, R. G., & Heldt, T. (2026). PhysioNet as a global platform for biomedical research. Nature Health. <a href="https://doi.org/10.1038/s44360-026-00096-z" rel="nofollow">https://doi.org/10.1038/s44360-026-00096-z</a>. Available from: <a href="https://pmc.ncbi.nlm.nih.gov/articles/PMC13641116/" rel="nofollow">https://pmc.ncbi.nlm.nih.gov/articles/PMC13641116/</a></p>
|
| 519 |
+
<textarea id="bibtex-data-platform" style="display:none;">@article{pollard_physionet_2026, title = {{PhysioNet} as a global platform for biomedical research}, volume = {1}, issn = {3005-0693}, url = {https://doi.org/10.1038/s44360-026-00096-z}, doi = {10.1038/s44360-026-00096-z}, abstract = {Twenty-five years after its first public repository was established, the PhysioNet resource for biomedical and clinical data has enabled tens of thousands of research papers. Further efforts are ongoing to advance secure data sharing, community engagement and scalable research infrastructure.}, number = {8}, journal = {Nature Health}, author = {Pollard, Tom and Moody, Benjamin E. and Lehman, Li-wei H. and Gow, Brian J. and Fernandes, Chrystinne and Xie, Chen and Johnson, Alistair and Mark, Roger G. and Heldt, Thomas}, month = aug, year = {2026}, pages = {792--795},}</textarea>
|
| 520 |
+
</div>
|
| 521 |
+
|
| 522 |
+
|
| 523 |
+
<div class="modal fade" id="citationModalPlatform">
|
| 524 |
+
<div class="modal-dialog citation" role="document">
|
| 525 |
+
<div class="modal-content">
|
| 526 |
+
<div class="modal-header">
|
| 527 |
+
<h5 class="modal-title">Cite</h5>
|
| 528 |
+
<button type="button" class="close" data-dismiss="modal" aria-label="Close">
|
| 529 |
+
<span aria-hidden="true">×</span>
|
| 530 |
+
</button>
|
| 531 |
+
</div>
|
| 532 |
+
<div class="modal-body">
|
| 533 |
+
|
| 534 |
+
<table><tbody>
|
| 535 |
+
|
| 536 |
+
|
| 537 |
+
<tr>
|
| 538 |
+
<th>APA</th>
|
| 539 |
+
<td>Pollard, T., Moody, B. E., Lehman, L., Gow, B., Fernandes, C., Xie, C., Johnson, A., Mark, R. G., & Heldt, T. (2026). PhysioNet as a global platform for biomedical research. Nature Health. <a href="https://doi.org/10.1038/s44360-026-00096-z" rel="nofollow">https://doi.org/10.1038/s44360-026-00096-z</a>. Available from: <a href="https://pmc.ncbi.nlm.nih.gov/articles/PMC13641116/" rel="nofollow">https://pmc.ncbi.nlm.nih.gov/articles/PMC13641116/</a></td>
|
| 540 |
+
</tr>
|
| 541 |
+
|
| 542 |
+
|
| 543 |
+
|
| 544 |
+
<tr>
|
| 545 |
+
<th>MLA</th>
|
| 546 |
+
<td>Pollard, Tom, et al. “PhysioNet as a Global Platform for Biomedical Research.” Nature Health, 2026, <a href="https://doi.org/10.1038/s44360-026-00096-z" rel="nofollow">https://doi.org/10.1038/s44360-026-00096-z</a>. Available from: <a href="https://pmc.ncbi.nlm.nih.gov/articles/PMC13641116/" rel="nofollow">https://pmc.ncbi.nlm.nih.gov/articles/PMC13641116/</a></td>
|
| 547 |
+
</tr>
|
| 548 |
+
|
| 549 |
+
|
| 550 |
+
|
| 551 |
+
<tr>
|
| 552 |
+
<th>CHICAGO</th>
|
| 553 |
+
<td>Pollard, Tom, Benjamin E. Moody, Li-wei Lehman, Brian Gow, Chrystinne Fernandes, Chen Xie, Alistair Johnson, Roger G. Mark, and Thomas Heldt. “PhysioNet as a Global Platform for Biomedical Research.” Nature Health (2026). <a href="https://doi.org/10.1038/s44360-026-00096-z.i" rel="nofollow">https://doi.org/10.1038/s44360-026-00096-z.i</a> Available from: <a href="https://pmc.ncbi.nlm.nih.gov/articles/PMC13641116/" rel="nofollow">https://pmc.ncbi.nlm.nih.gov/articles/PMC13641116/</a></td>
|
| 554 |
+
</tr>
|
| 555 |
+
|
| 556 |
+
|
| 557 |
+
|
| 558 |
+
<tr>
|
| 559 |
+
<th>HARVARD</th>
|
| 560 |
+
<td>Pollard, T., Moody, B.E., Lehman, L., Gow, B., Fernandes, C., Xie, C., Johnson, A., Mark, R.G. and Heldt, T., 2026. PhysioNet as a global platform for biomedical research. Nature Health. Available at: <a href="https://doi.org/10.1038/s44360-026-00096-z" rel="nofollow">https://doi.org/10.1038/s44360-026-00096-z</a>. Available from: <a href="https://pmc.ncbi.nlm.nih.gov/articles/PMC13641116/" rel="nofollow">https://pmc.ncbi.nlm.nih.gov/articles/PMC13641116/</a></td>
|
| 561 |
+
</tr>
|
| 562 |
+
|
| 563 |
+
|
| 564 |
+
|
| 565 |
+
<tr>
|
| 566 |
+
<th>VANCOUVER</th>
|
| 567 |
+
<td>Pollard T, Moody BE, Lehman L, Gow B, Fernandes C, Xie C, et al. PhysioNet as a global platform for biomedical research. Nature Health. 2026. doi:10.1038/s44360-026-00096-z. Available from: <a href="https://pmc.ncbi.nlm.nih.gov/articles/PMC13641116/" rel="nofollow">https://pmc.ncbi.nlm.nih.gov/articles/PMC13641116/</a></td>
|
| 568 |
+
</tr>
|
| 569 |
+
|
| 570 |
+
|
| 571 |
+
|
| 572 |
+
|
| 573 |
+
</tbody></table>
|
| 574 |
+
|
| 575 |
+
<div class="mt-3">
|
| 576 |
+
<strong>BibTeX</strong>
|
| 577 |
+
<button class="btn btn-sm btn-outline-secondary ml-2 btn-copy-bibtex btn-copy-bibtex-modal" data-clipboard-target="bibtex-data-platform">Copy</button>
|
| 578 |
+
<pre class="mt-2 p-2 border rounded" style="white-space: pre-wrap; background-color: #f8f9fa;">@article{pollard_physionet_2026, title = {{PhysioNet} as a global platform for biomedical research}, volume = {1}, issn = {3005-0693}, url = {https://doi.org/10.1038/s44360-026-00096-z}, doi = {10.1038/s44360-026-00096-z}, abstract = {Twenty-five years after its first public repository was established, the PhysioNet resource for biomedical and clinical data has enabled tens of thousands of research papers. Further efforts are ongoing to advance secure data sharing, community engagement and scalable research infrastructure.}, number = {8}, journal = {Nature Health}, author = {Pollard, Tom and Moody, Benjamin E. and Lehman, Li-wei H. and Gow, Brian J. and Fernandes, Chrystinne and Xie, Chen and Johnson, Alistair and Mark, Roger G. and Heldt, Thomas}, month = aug, year = {2026}, pages = {792--795},}</pre>
|
| 579 |
+
</div>
|
| 580 |
+
|
| 581 |
+
</div>
|
| 582 |
+
<div class="modal-footer">
|
| 583 |
+
<button type="button" class="btn btn-secondary" data-dismiss="modal">Close</button>
|
| 584 |
+
</div>
|
| 585 |
+
</div>
|
| 586 |
+
</div>
|
| 587 |
+
</div>
|
| 588 |
+
|
| 589 |
+
|
| 590 |
+
</div>
|
| 591 |
+
|
| 592 |
+
|
| 593 |
+
|
| 594 |
+
<h3>Introduction</h3>
|
| 595 |
+
<p>At the end of last year, American scientists Jeffrey Hall, Michael Rosbash and Michael Young received a Nobel Prize in Physiology <em>“for their discoveries of molecular mechanisms controlling the circadian rhythm"</em>— the mechanism that regulates sleep (<a href="http://www.newsweek.com/nobel-prize-medicine-2017-winners-jeffrey-c-hall-michael-rosbash-and-michael-675266">Osborn, 2017</a>). The precise reasons why humans sleep (and even how much sleep we need) remains a topic of scientific inquiry. Contemporary theorists indicate that sleep may be responsible for learning and/or the clearing of neural waste products (<a href="https://www.health.harvard.edu/press_releases/importance_of_sleep_and_health">Ogilvie and Patel, 2017</a>).</p>
|
| 596 |
+
<p>While the precise reasons why we sleep are not perfectly understood, there is consensus on the importance of sleep for our overall health, and well-being. Inadequate sleep is associated with a wide range of negative outcomes including: impaired memory and learning, obesity, irritability, cardiovascular dysfunction, hypotension, diminished immune function (<a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3181883/%23!po%3D3.33333">Harvard Medical School, 2006</a>), depression (<a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3988690/">Nutt et al, 2008</a>), and quality of life (<a href="https://sleep.org/articles/what-happens-during-sleep/">Lee, 2009</a>). Further studies even suggest <em>causal</em> links between quality of sleep, and important outcomes including mental health.</p>
|
| 597 |
+
<p>It follows that improving the quality of sleep could be used to improve a range of societal health outcomes, more generally. Of course, the treatment of sleep disorders is necessarily preceded by the diagnosis of sleep disorders. Traditionally, such diagnoses are developed in sleep laboratory settings, where polysomnography, audio, and videography of sleeping subject may be carefully inspected by sleep experts to identify potential sleep disorders.</p>
|
| 598 |
+
|
| 599 |
+
<p>One of the more well-studied sleep disorders is Obstructive Sleep Apnea Hypopnea Syndrome (or simply, apnea). Apneas are characterized by a complete collapse of the airway, leading to awakening, and consequent disturbances of sleep. While apneas are arguably the best understood of sleep disturbances, they are not the only cause of disturbance. Sleep arousals can also be spontaneous, result from teeth grinding, partial airway obstructions, or even snoring. In this year's PhysioNet Challenge we will use a variety of physiological signals, collected during polysomnographic sleep studies, to detect these other sources of arousal (non-apnea) during sleep.</p>
|
| 600 |
+
|
| 601 |
+
<h3>Challenge Data</h3>
|
| 602 |
+
|
| 603 |
+
<p>Data for this challenge were contributed by the Massachusetts General Hospital’s (MGH) Computational Clinical Neurophysiology Laboratory (CCNL), and the Clinical Data Animation Laboratory (CDAC). The dataset includes 1,985 subjects which were monitored at an MGH sleep laboratory for the diagnosis of sleep disorders. The data were partitioned into balanced training (n = 994), and test sets (n = 989).</p>
|
| 604 |
+
|
| 605 |
+
<p>The sleep stages of the subjects were annotated by clinical staff at the MGH according to the American Academy of Sleep Medicine (AASM) manual for the scoring of sleep. More specifically, the following six sleep stages were annotated in 30 second contiguous intervals: <em>wakefulness, stage 1, stage 2, stage 3, rapid eye movement (REM), and undefined</em>.</p>
|
| 606 |
+
|
| 607 |
+
<p>Certified sleep technologists at the MGH also annotated waveforms for the presence of arousals that interrupted the sleep of the subjects. The annotated arousals were classified as either: <em>spontaneous arousals, respiratory effort related arousals (RERA), bruxisms, hypoventilations, hypopneas, apneas (central, obstructive and mixed), vocalizations, snores, periodic leg movements, Cheyne-Stokes breathing or partial airway obstructions.</em></p>
|
| 608 |
+
|
| 609 |
+
<p>The subjects had a variety of physiological signals recorded as they slept through the night including: electroencephalography (EEG), electrooculography (EOG), electromyography (EMG), electrocardiology (EKG), and oxygen saturation (SaO2). Excluding SaO2, all signals were sampled to 200 Hz and were measured in microvolts. For analytic convenience, SaO2 was resampled to 200 Hz, and is measured as a percentage.</p>
|
| 610 |
+
|
| 611 |
+
<h3>Objective of the Challenge</h3>
|
| 612 |
+
|
| 613 |
+
<p>The goal of the challenge is use information from the available signals to correctly classify target arousal regions. For the purpose of the Challenge, <em>target arousals</em> are defined as regions where either of the following conditions were met:</p>
|
| 614 |
+
|
| 615 |
+
<ul>
|
| 616 |
+
<li>From 2 seconds before a RERA arousal begins, up to 10 seconds after it ends or,</li>
|
| 617 |
+
<li>From 2 seconds before a non-RERA, non-apnea arousal begins, up to 2 seconds after it ends.</li>
|
| 618 |
+
</ul>
|
| 619 |
+
|
| 620 |
+
<p>Please note that regions falling within 10 seconds before or after a subject wakes up, has an apnea arousal, or a hypopnea arousal <strong>will not be scored</strong> for the Challenge.</p>
|
| 621 |
+
|
| 622 |
+
<p>We have pre-computed the target arousals for you. They are contained in a sample-wise vector (described below in “Accessing the Data”), marked by “1”. Regions that will not be scored are marked by a “-1”, and regions that will be penalized if marked by your algorithm are marked by “0”. <em>You do not need to recompute these scores.</em></p>
|
| 623 |
+
|
| 624 |
+
<h3>Accessing the Data</h3>
|
| 625 |
+
|
| 626 |
+
<p>The <a href="https://physionet.org/content/challenge-2018/#files">Challenge data repository</a> contains two directories (<code>training</code> and <code>test</code>) which are each approximately 135 GB in size. Each directory contains one subdirectory per subject (e.g. <code>training/tr03-0005</code>). Each subdirectory contains signal, header, and arousal files; for example:</p>
|
| 627 |
+
|
| 628 |
+
<ol>
|
| 629 |
+
<li><code>tr03-0005.mat</code>: a Matlab V4 file containing the signal data.</li>
|
| 630 |
+
<li><code>tr03-0005.hea</code>: record header file - a text file which describes the format of the signal data.</li>
|
| 631 |
+
<li><code>tr03-0005.arousal</code>: arousal and sleep stage annotations, in WFDB annotation format.</li>
|
| 632 |
+
<li><code>tr03-0005-arousal.mat</code>: a Matlab V7 structure containing a sample-wise vector with three distinct values (+1, 0, -1) where:
|
| 633 |
+
<ul>
|
| 634 |
+
<li>+1: Designates arousal regions</li>
|
| 635 |
+
<li>0: Designates non-arousal regions</li>
|
| 636 |
+
<li>-1: Designates regions that <strong>will not be scored</strong></li>
|
| 637 |
+
</ul>
|
| 638 |
+
</li>
|
| 639 |
+
</ol>
|
| 640 |
+
|
| 641 |
+
<p>Table 1 lists functions that can be used to import the data into Python, Matlab, and C programs.</p>
|
| 642 |
+
|
| 643 |
+
<p> </p>
|
| 644 |
+
|
| 645 |
+
<table>
|
| 646 |
+
<caption><strong>Table 1:</strong> Functions that can be used to import Challenge data.</caption>
|
| 647 |
+
<tbody>
|
| 648 |
+
<tr>
|
| 649 |
+
<th>File type</th>
|
| 650 |
+
<th style="text-align: center;">Python</th>
|
| 651 |
+
<th style="text-align: center;">Matlab</th>
|
| 652 |
+
<th style="text-align: center;">C / C++</th>
|
| 653 |
+
</tr>
|
| 654 |
+
<tr>
|
| 655 |
+
<td style="text-align: left;">Signal (.mat) and header (.hea) files</td>
|
| 656 |
+
<td><a href="http://wfdb.readthedocs.io/en/latest/wfdb.html#wfdb.rdrecord">wfdb.rdrecord</a></td>
|
| 657 |
+
<td>rdmat</td>
|
| 658 |
+
<td>isigopen</td>
|
| 659 |
+
</tr>
|
| 660 |
+
<tr>
|
| 661 |
+
<td style="text-align: left;">Arousal annotation files (.arousal)</td>
|
| 662 |
+
<td><a href="http://wfdb.readthedocs.io/en/latest/wfdb.html#wfdb.rdann">wfdb.rdann</a></td>
|
| 663 |
+
<td>rdann</td>
|
| 664 |
+
<td>annopen</td>
|
| 665 |
+
</tr>
|
| 666 |
+
<tr>
|
| 667 |
+
<td style="text-align: left;">Arousal files (.mat)</td>
|
| 668 |
+
<td><a href="https://docs.scipy.org/doc/scipy/reference/generated/scipy.io.loadmat.html">scipy.io.loadmat</a></td>
|
| 669 |
+
<td><a href="https://www.mathworks.com/help/matlab/ref/load.html">load</a></td>
|
| 670 |
+
<td><a href="https://sourceforge.net/projects/matio/">libmatio</a></td>
|
| 671 |
+
</tr>
|
| 672 |
+
</tbody>
|
| 673 |
+
</table>
|
| 674 |
+
|
| 675 |
+
<h3> </h3>
|
| 676 |
+
|
| 677 |
+
<h3>Submitting your Entry</h3>
|
| 678 |
+
|
| 679 |
+
<p>Participants should use the provided signal and arousal data to develop a model that classifies test-set subjects. More specifically, for each subject in /test, participants must generate a <code>.vec</code> text file that describes the probability of arousal at each sample, such as:</p>
|
| 680 |
+
|
| 681 |
+
<pre>0.001
|
| 682 |
+
0.000
|
| 683 |
+
0.024
|
| 684 |
+
0.051</pre>
|
| 685 |
+
|
| 686 |
+
<p>The names of the generated annotation files should match the name of the test subject. For instance, <code>test/te09-0094.mat</code> should have a corresponding file named <code>annotations/te09-0094.vec</code>.</p>
|
| 687 |
+
|
| 688 |
+
<p>Entries must be submitted as a zip file containing:</p>
|
| 689 |
+
|
| 690 |
+
<ul>
|
| 691 |
+
<li>All of the code and data files needed to train and run your algorithm</li>
|
| 692 |
+
<li>An <code>AUTHORS.txt</code> file containing the list of authors</li>
|
| 693 |
+
<li>A <code>LICENSE.txt</code> file containing the license for your code</li>
|
| 694 |
+
<li>The <code>.vec</code> files described above</li>
|
| 695 |
+
</ul>
|
| 696 |
+
|
| 697 |
+
<p>To upload your entry, create a PhysioNet account (if you don't have one), and go to <a href="https://challenge.physionet.org/">challenge.physionet.org</a>. Entries must be uploaded prior to the deadline in order to be eligible.</p>
|
| 698 |
+
|
| 699 |
+
<h3>Scoring</h3>
|
| 700 |
+
|
| 701 |
+
<p>Your final algorithm will only be graded for its binary classification performance on target arousal and non-arousal regions (designated by +1 and 0 in <code>te<em>NN-NNNN</em>-arousals.mat</code>), measured by the area under the precision-recall curve. The area is defined as follows:</p>
|
| 702 |
+
|
| 703 |
+
<p> </p>
|
| 704 |
+
|
| 705 |
+
<div><math display="block"> <semantics> <mrow> <msub> <mi>R</mi> <mi>j</mi> </msub> <mo>=</mo> <mfrac> <mrow> <mi>n</mi> <mi>u</mi> <mi>m</mi> <mi>b</mi> <mi>e</mi> <mi>r</mi> <mspace width="thinmathspace"></mspace> <mi>o</mi> <mi>f</mi> <mspace width="thinmathspace"></mspace> <mi>a</mi> <mi>r</mi> <mi>o</mi> <mi>u</mi> <mi>s</mi> <mi>a</mi> <mi>l</mi> <mspace width="thinmathspace"></mspace> <mi>s</mi> <mi>a</mi> <mi>m</mi> <mi>p</mi> <mi>l</mi> <mi>e</mi> <mi>s</mi> <mspace width="thinmathspace"></mspace> <mi>w</mi> <mi>i</mi> <mi>t</mi> <mi>h</mi> <mspace width="thinmathspace"></mspace> <mi>p</mi> <mi>r</mi> <mi>e</mi> <mi>d</mi> <mi>i</mi> <mi>c</mi> <mi>t</mi> <mi>e</mi> <mi>d</mi> <mspace width="thinmathspace"></mspace> <mi>p</mi> <mi>r</mi> <mi>o</mi> <mi>b</mi> <mi>a</mi> <mi>b</mi> <mi>i</mi> <mi>l</mi> <mi>i</mi> <mi>t</mi> <mi>y</mi> <mspace width="thinmathspace"></mspace> <mo stretchy="false">(</mo> <mi>j</mi> <mrow class="MJX-TeXAtom-ORD"> <mo>/</mo> </mrow> <mn>1000</mn> <mo stretchy="false">)</mo> <mspace width="thinmathspace"></mspace> <mi>o</mi> <mi>r</mi> <mspace width="thinmathspace"></mspace> <mi>g</mi> <mi>r</mi> <mi>e</mi> <mi>a</mi> <mi>t</mi> <mi>e</mi> <mi>r</mi> </mrow> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> <mi>a</mi> <mi>l</mi> <mspace width="thinmathspace"></mspace> <mi>n</mi> <mi>u</mi> <mi>m</mi> <mi>b</mi> <mi>e</mi> <mi>r</mi> <mspace width="thinmathspace"></mspace> <mi>o</mi> <mi>f</mi> <mspace width="thinmathspace"></mspace> <mi>a</mi> <mi>r</mi> <mi>o</mi> <mi>u</mi> <mi>s</mi> <mi>a</mi> <mi>l</mi> <mspace width="thinmathspace"></mspace> <mi>s</mi> <mi>a</mi> <mi>m</mi> <mi>p</mi> <mi>l</mi> <mi>e</mi> <mi>s</mi> </mrow> </mfrac> </mrow> <annotation encoding="application/x-tex">R_j = \frac{number\,of\,arousal\,samples\,with\,predicted\,probability\,(j/1000)\,or\,greater}{total\,number\,of\,arousal\,samples}</annotation> </semantics> </math></div>
|
| 706 |
+
|
| 707 |
+
<p> </p>
|
| 708 |
+
|
| 709 |
+
<div><math display="block"> <semantics> <mrow> <msub> <mi>P</mi> <mi>j</mi> </msub> <mo>=</mo> <mfrac> <mrow> <mi>n</mi> <mi>u</mi> <mi>m</mi> <mi>b</mi> <mi>e</mi> <mi>r</mi> <mspace width="thinmathspace"></mspace> <mi>o</mi> <mi>f</mi> <mspace width="thinmathspace"></mspace> <mi>a</mi> <mi>r</mi> <mi>o</mi> <mi>u</mi> <mi>s</mi> <mi>a</mi> <mi>l</mi> <mspace width="thinmathspace"></mspace> <mi>s</mi> <mi>a</mi> <mi>m</mi> <mi>p</mi> <mi>l</mi> <mi>e</mi> <mi>s</mi> <mspace width="thinmathspace"></mspace> <mi>w</mi> <mi>i</mi> <mi>t</mi> <mi>h</mi> <mspace width="thinmathspace"></mspace> <mi>p</mi> <mi>r</mi> <mi>e</mi> <mi>d</mi> <mi>i</mi> <mi>c</mi> <mi>t</mi> <mi>e</mi> <mi>d</mi> <mspace width="thinmathspace"></mspace> <mi>p</mi> <mi>r</mi> <mi>o</mi> <mi>b</mi> <mi>a</mi> <mi>b</mi> <mi>i</mi> <mi>l</mi> <mi>i</mi> <mi>t</mi> <mi>y</mi> <mspace width="thinmathspace"></mspace> <mo stretchy="false">(</mo> <mi>j</mi> <mrow class="MJX-TeXAtom-ORD"> <mo>/</mo> </mrow> <mn>1000</mn> <mo stretchy="false">)</mo> <mspace width="thinmathspace"></mspace> <mi>o</mi> <mi>r</mi> <mspace width="thinmathspace"></mspace> <mi>g</mi> <mi>r</mi> <mi>e</mi> <mi>a</mi> <mi>t</mi> <mi>e</mi> <mi>r</mi> </mrow> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> <mi>a</mi> <mi>l</mi> <mspace width="thinmathspace"></mspace> <mi>n</mi> <mi>u</mi> <mi>m</mi> <mi>b</mi> <mi>e</mi> <mi>r</mi> <mspace width="thinmathspace"></mspace> <mi>o</mi> <mi>f</mi> <mspace width="thinmathspace"></mspace> <mi>s</mi> <mi>a</mi> <mi>m</mi> <mi>p</mi> <mi>l</mi> <mi>e</mi> <mi>s</mi> <mspace width="thinmathspace"></mspace> <mi>w</mi> <mi>i</mi> <mi>t</mi> <mi>h</mi> <mspace width="thinmathspace"></mspace> <mi>p</mi> <mi>r</mi> <mi>e</mi> <mi>d</mi> <mi>i</mi> <mi>c</mi> <mi>t</mi> <mi>e</mi> <mi>d</mi> <mspace width="thinmathspace"></mspace> <mi>p</mi> <mi>r</mi> <mi>o</mi> <mi>b</mi> <mi>a</mi> <mi>b</mi> <mi>i</mi> <mi>l</mi> <mi>i</mi> <mi>t</mi> <mi>y</mi> <mspace width="thinmathspace"></mspace> <mo stretchy="false">(</mo> <mi>j</mi> <mrow class="MJX-TeXAtom-ORD"> <mo>/</mo> </mrow> <mn>1000</mn> <mo stretchy="false">)</mo> <mspace width="thinmathspace"></mspace> <mi>o</mi> <mi>r</mi> <mspace width="thinmathspace"></mspace> <mi>g</mi> <mi>r</mi> <mi>e</mi> <mi>a</mi> <mi>t</mi> <mi>e</mi> <mi>r</mi> </mrow> </mfrac> </mrow> <annotation encoding="application/x-tex">P_j = \frac{number\,of\,arousal\,samples\,with\,predicted\,probability\,(j/1000)\,or\,greater}{total\,number\,of\,samples\,with\,predicted\,probability\,(j/1000)\,or\,greater}</annotation> </semantics> </math></div>
|
| 710 |
+
|
| 711 |
+
<p> </p>
|
| 712 |
+
|
| 713 |
+
<div><math display="block"> <semantics> <mrow> <mi>A</mi> <mi>U</mi> <mi>P</mi> <mi>R</mi> <mi>C</mi> <mo>=</mo> <munder> <mo>∑</mo> <mrow class="MJX-TeXAtom-ORD"> <mi>j</mi> </mrow> </munder> <msub> <mi>P</mi> <mi>j</mi> </msub> <mo stretchy="false">(</mo> <msub> <mi>R</mi> <mi>j</mi> </msub> <mo>−</mo> <msub> <mi>R</mi> <mrow class="MJX-TeXAtom-ORD"> <mi>j</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo stretchy="false">)</mo> </mrow> <annotation encoding="application/x-tex">AUPRC = \sum_{j} P_j(R_j -R_{j+1})</annotation> </semantics> </math></div>
|
| 714 |
+
|
| 715 |
+
<p>Note that this is the <em>gross</em> AUPRC (i.e., for each possible value of <span>j</span>, the precision and recall are calculated for the <em>entire test database</em>), which is not the same as averaging the AUPRC for each record.</p>
|
| 716 |
+
|
| 717 |
+
<p>Python (score2018.py) and Matlab/Octave (score2018.m) implementations of the scoring algorithm are available in the <a href="https://physionet.org/content/challenge-2018/#files">challenge files</a>.</p>
|
| 718 |
+
|
| 719 |
+
<h3>Sample Submission</h3>
|
| 720 |
+
|
| 721 |
+
<p>Two simple example algorithms are provided and may be used as a template for your own submission:</p>
|
| 722 |
+
|
| 723 |
+
<ul>
|
| 724 |
+
<li>Python (2.7 or 3.x), using scikit-learn (<a href="/content/challenge-2018/1.0.0/sample.zip">download</a>)</li>
|
| 725 |
+
<li>Matlab (<a href="/content/challenge-2018/1.0.0/sample-matlab.zip">download</a>)</li>
|
| 726 |
+
</ul>
|
| 727 |
+
|
| 728 |
+
<h3>Rules and Deadlines</h3>
|
| 729 |
+
|
| 730 |
+
<p>Entrants may have an overall total of up to three submitted entries over both the unofficial and official phases of the competition (see Table 2). Following submission, entrants will receive an email confirming their submission and reporting how well their arousal annotations match those of the held-out test set.</p>
|
| 731 |
+
|
| 732 |
+
<p>All deadlines occur at noon GMT (UTC) on the dates mentioned below. If you do not know the difference between GMT and your local time, find out what it is <em>before</em> the deadline!</p>
|
| 733 |
+
|
| 734 |
+
<p> </p>
|
| 735 |
+
|
| 736 |
+
<table>
|
| 737 |
+
<caption><strong>Table 2:</strong> Rules and deadlines.</caption>
|
| 738 |
+
<tbody>
|
| 739 |
+
<tr>
|
| 740 |
+
<th> </th>
|
| 741 |
+
<th><em>Start at noon GMT on</em></th>
|
| 742 |
+
<th><em>Entry limit</em></th>
|
| 743 |
+
<th><em>End at noon GMT on</em></th>
|
| 744 |
+
</tr>
|
| 745 |
+
<tr>
|
| 746 |
+
<th><strong>Unofficial Phase</strong></th>
|
| 747 |
+
<td>15 February</td>
|
| 748 |
+
<td>1</td>
|
| 749 |
+
<td>13 April</td>
|
| 750 |
+
</tr>
|
| 751 |
+
<tr>
|
| 752 |
+
<th>[Hiatus]</th>
|
| 753 |
+
<td>13 April</td>
|
| 754 |
+
<td>0</td>
|
| 755 |
+
<td>22 April</td>
|
| 756 |
+
</tr>
|
| 757 |
+
<tr>
|
| 758 |
+
<th><strong>Official Phase</strong></th>
|
| 759 |
+
<td>23 April</td>
|
| 760 |
+
<td>2</td>
|
| 761 |
+
<td>1 September</td>
|
| 762 |
+
</tr>
|
| 763 |
+
<tr>
|
| 764 |
+
<td><em>* Wildcard submissions due</em></td>
|
| 765 |
+
<td> </td>
|
| 766 |
+
<td> </td>
|
| 767 |
+
<td>15 July</td>
|
| 768 |
+
</tr>
|
| 769 |
+
</tbody>
|
| 770 |
+
</table>
|
| 771 |
+
|
| 772 |
+
<p> </p>
|
| 773 |
+
|
| 774 |
+
<p>All official entries must be received no later than <strong>noon GMT on Saturday, 1 September 2018</strong>. In the interest of fairness to all participants, late entries will not be accepted or scored. Entries that cannot be scored (because of missing components, improper formatting, or excessive run time) are not counted against the entry limits.</p>
|
| 775 |
+
|
| 776 |
+
<p>To be eligible for the <strong>open-source award</strong>, you must do all of the following:</p>
|
| 777 |
+
|
| 778 |
+
<ol>
|
| 779 |
+
<li>Submit at least one open-source entry that can be scored before the Phase I deadline <strong>(noon GMT on Monday, 9 April 2018)</strong>.</li>
|
| 780 |
+
<li>Submit at least one entry during the second phase <strong>(between noon GMT on Monday, 16 April 2018 and noon GMT on Saturday, 1 September 2018)</strong>. <em>Only your final entry will count for ranking.</em></li>
|
| 781 |
+
<li><strong>Entering an Abstract to CinC</strong>: Submit an acceptable abstract (about 299 words) on your work on the Challenge to <a href="http://www.cinc.org/information-for-computing-in-cardiology-authors/">Computing in Cardiology</a> no later than <strong>15 April 2018</strong>. Include the overall score for your Phase I entry in your abstract. Please select “PhysioNet/CinC Challenge” as the topic of your abstract, so it can be identified easily by the abstract review committee. You will be notified if your abstract has been accepted by email from CinC during the first week in June.</li>
|
| 782 |
+
<li><strong>Wildcard submissions</strong>: For teams who did not submit an abstract in time, or whose abstracts were not accepted, the team who submits the highest-scoring entry before <strong>15 July 2018</strong> will have another chance to compete, if they submit a high-quality abstract and present their work at the CinC conference. We will contact the winners in July with more information.</li>
|
| 783 |
+
<li>Submit a full (4-page) paper on your work on the Challenge to CinC no later than the deadline of conference paper submission.</li>
|
| 784 |
+
<li>Attend CinC 2018 (<strong>23-26 September 2018</strong>) in Maastricht and present your work there.</li>
|
| 785 |
+
</ol>
|
| 786 |
+
|
| 787 |
+
<p>Please do not submit analysis of this year’s Challenge data to other Conferences or Journals until after CinC 2018 has taken place, so the competitors are able to discuss the results in a single forum. We expect a special issue from the journal <a href="http://iopscience.iop.org/journal/0967-3334"><em>Physiological Measurement</em></a> to follow the conference and encourage all entrants (and those who missed the opportunity to compete or attend CinC 2018) to submit extended analysis and articles to that issue, taking into account the publications and discussions at CinC 2018.</p>
|
| 788 |
+
|
| 789 |
+
<h3>Attending the Conference</h3>
|
| 790 |
+
|
| 791 |
+
<p>If your abstract is accepted, you must <a href="https://www.softconf.com/i/cinc2018/">log in to the conference site</a> and agree that you will attend. Then, you must submit a full article describing your results and mark it as a preprint (for others to read) by September 15th. (Don't forget that the competition deadline is noon GMT on the 1st September - this deadline will *not* be extended.)</p>
|
| 792 |
+
|
| 793 |
+
<p>After agreeing to attend, you must register for the conference, pay the conference fee (prices go up after July ends), and secure a visa if you need one. See <a href="http://www.cinc.org/information-for-computing-in-cardiology-authors/">the Computing in Cardiology site</a> for more information.</p>
|
| 794 |
+
|
| 795 |
+
<p>If you need a visa, we <em>strongly</em> suggest you register this week and begin the process. Visas can take months to issue and attendance is mandatory - you cannot receive a prize if you do not attend because defending your work is part of the Challenge. The conference (not PhysioNet) will supply you with a letter for your visa. Please <a href="http://www.cinc2018.org/visa/">see the CinC 2018 site</a> for details on how to obtain that letter and who to contact. If you have any questions about this process, or are concerned about paying the conference fee before securing a visa, please contact the conference organizers, not PhysioNet.</p>
|
| 796 |
+
|
| 797 |
+
<p>If your abstract is rejected, then you have one more chance! This year we are introducing a 'wildcard' submission. On July the 15th, the top scoring entry that has <em>not</em> so far been accepted to CinC will be offered the opportunity to submit another (or a new) abstract to the conference system (containing full results). If the team can submit a quality abstract (with performance results) and register for the conference then it's members will be eligible for a prize (assuming they also attend the conference and present a poster). Don't forget, your abstract was probably rejected because it didn't contain any useful results (even on training data) and/or did not describe your methods well. So please pay attention to the abstract when submitting - it won't be automatic. We strongly believe that if you are unable to explain what you did and why, then the code is of very limited value.</p>
|
| 798 |
+
|
| 799 |
+
<p>We hope this is a suitable encouragement for teams that are either late to the Challenge or failed to secure a place at the conference to continue with their efforts in the competition. It would be a shame not to see potentially great works at the conference.</p>
|
| 800 |
+
|
| 801 |
+
<p>Look out for future announcements via <a href="https://groups.google.com/group/physionet-challenges">the community discussion forum</a>.</p>
|
| 802 |
+
|
| 803 |
+
<h3>After the Challenge</h3>
|
| 804 |
+
|
| 805 |
+
<p>As is customary, we hope to run a special issue in <a href="http://iopscience.iop.org/journal/0967-3334"><em>Physiological Measurement</em></a> with a closing date of 31 January 2019. We will therefore encourage competitors (and non-competitors) to submit updates and further reworks based on the Challenge after the award ceremony at the Computing in Cardiology Conference in Maastricht in September.</p>
|
| 806 |
+
|
| 807 |
+
<h3>Obtaining complimentary MATLAB licenses</h3>
|
| 808 |
+
|
| 809 |
+
<p><a href="http://www.mathworks.com/">The MathWorks</a> has kindly decided to sponsor Physionet’s 2018 Challenge providing licenses. The MathWorks is offering to all teams that wish to use MATLAB, complimentary licenses. User can apply for a license and learn more about MATLAB support through The Mathworks’ <a href="https://www.mathworks.com/academia/student-competitions/physionet.html">PhysioNet Challenge</a> link. If you have questions or need technical support, please contact The MathWorks at <a href="mailto:studentcompetitions@mathworks.com">studentcompetitions@mathworks.com</a>.</p>
|
| 810 |
+
|
| 811 |
+
<h3>Challenge Results</h3>
|
| 812 |
+
|
| 813 |
+
<p><a href="/content/challenge-2018/1.0.0/results.csv">Official results</a>, as well as a <a href="/content/challenge-2018/1.0.0/challenge2018cinc.pdf">paper describing the Challenge</a>, are now available. Top scores were achieved by</p>
|
| 814 |
+
|
| 815 |
+
<ol>
|
| 816 |
+
<li>Matthew Howe-Patterson, Bahareh Pourbabaee, and Frederic Benard (0.54)</li>
|
| 817 |
+
<li>Guðni Fannar Kristjansson, Heiðar Már Þráinsson, Hanna Ragnarsdóttir, Bragi Marinósson, Eysteinn Gunnlaugsson, Eysteinn Finnsson, Sigurður Ægir Jónsson, Halla Helgadóttir, and Jón Skírnir Ágústsson (0.45)</li>
|
| 818 |
+
<li>Runnan He, Kuanquan Wang, Yang Liu, Na Zhao, Yongfeng Yuan, Qince Li, and Henggui Zhang (0.43)</li>
|
| 819 |
+
</ol>
|
| 820 |
+
|
| 821 |
+
<p>An unofficial entry from Hongyang Li<strong> </strong>and Yuanfang Guan (who unfortunately missed the deadline to submit an abstract) achieved a score of 0.55.</p>
|
| 822 |
+
|
| 823 |
+
<h3>Papers</h3>
|
| 824 |
+
|
| 825 |
+
<div>
|
| 826 |
+
<p>The following paper is an introduction to the challenge topic, with a summary of the challenge results and a discussion of their implications. Please cite this publication when referencing the Challenge.</p>
|
| 827 |
+
</div>
|
| 828 |
+
<blockquote>
|
| 829 |
+
Ghassemi MM, Moody B, Lehman L, Song C, Li Q, Sun H, Westover M, Clifford GD., "You Snooze, You Win: the PhysioNet/Computing in Cardiology Challenge 2018," 2018 Computing in Cardiology Conference (CinC), 2018, pp. 1-4, <a href="https://doi.org/10.22489/CinC.2018.049">doi: 10.22489/CinC.2018.049.</a>
|
| 830 |
+
</blockquote>
|
| 831 |
+
<p>Over 20 papers were presented at <a href="http://www.cinc.org/"><em>Computers in Cardiology 2018</em></a>. These papers have been made available under the terms of the Creative Commons Attribution License 3.0 (<a href="http://creativecommons.org/licenses/by/3.0/">CCAL</a>). See <a href="/files/challenge-2018/1.0.0/papers/index.html">this page</a> for details. We wish to thank all of the authors for their contributions.</p>
|
| 832 |
+
<hr>
|
| 833 |
+
|
| 834 |
+
|
| 835 |
+
<h2 id="cited-by">Cited by</h2>
|
| 836 |
+
<p>
|
| 837 |
+
202 publications cite this project.
|
| 838 |
+
The most recent are listed below.
|
| 839 |
+
</p>
|
| 840 |
+
|
| 841 |
+
<ul class="list-unstyled citing-works">
|
| 842 |
+
|
| 843 |
+
<li class="mb-3">
|
| 844 |
+
<a href="https://doi.org/10.1038/s41746-026-03406-7" rel="noopener">AnySleep: a channel-agnostic deep learning system for high-resolution sleep staging in multi-center cohorts</a><br>
|
| 845 |
+
<small class="text-muted">
|
| 846 |
+
Niklas Grieger, Jannik Raskob, Siamak Mehrkanoon et al.
|
| 847 |
+
<em>npj Digital Medicine</em>,
|
| 848 |
+
2026.
|
| 849 |
+
|
| 850 |
+
</small>
|
| 851 |
+
</li>
|
| 852 |
+
|
| 853 |
+
<li class="mb-3">
|
| 854 |
+
<a href="https://doi.org/10.1007/s11571-026-10574-5" rel="noopener">Sleep Stage Classification Across Heterogeneous EEG/EOG Channels with Multi-channel Differential Transformer</a><br>
|
| 855 |
+
<small class="text-muted">
|
| 856 |
+
Benjamin M. Chin, Yuin Torng Yew, Jia Hong Puah et al.
|
| 857 |
+
<em>Cognitive Neurodynamics</em>,
|
| 858 |
+
2026.
|
| 859 |
+
|
| 860 |
+
</small>
|
| 861 |
+
</li>
|
| 862 |
+
|
| 863 |
+
<li class="mb-3">
|
| 864 |
+
<a href="https://doi.org/10.82901/nemar.nm000225" rel="noopener">PhysioNet 2018 Challenge: Sleep Arousal Detection PSG (Training)</a><br>
|
| 865 |
+
<small class="text-muted">
|
| 866 |
+
Mohammad M. Ghassemi, Benjamin Moody, Li-wei H. Lehman et al.
|
| 867 |
+
<em>UC San Diego</em>,
|
| 868 |
+
2026.
|
| 869 |
+
|
| 870 |
+
</small>
|
| 871 |
+
</li>
|
| 872 |
+
|
| 873 |
+
<li class="mb-3">
|
| 874 |
+
<a href="https://doi.org/10.1007/978-3-032-38239-9_42" rel="noopener">Omni-Sleep: A Sleep Foundation Model via Hierarchical Contrastive Learning of CNS–ANS Dynamics</a><br>
|
| 875 |
+
<small class="text-muted">
|
| 876 |
+
Zhoujie Hou, Song Wang, Kexin Lou et al.
|
| 877 |
+
<em>Lecture notes in computer science</em>,
|
| 878 |
+
2026.
|
| 879 |
+
|
| 880 |
+
</small>
|
| 881 |
+
</li>
|
| 882 |
+
|
| 883 |
+
<li class="mb-3">
|
| 884 |
+
<a href="https://doi.org/10.1145/3770855.3817622" rel="noopener">REM-Flow: Robust and Extensible Multi-Center Sleep Staging via Generative Knowledge Replay</a><br>
|
| 885 |
+
<small class="text-muted">
|
| 886 |
+
Xiaojun Ning, Jing Wang, Chenzhang Li et al.
|
| 887 |
+
<em>ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)</em>,
|
| 888 |
+
2026.
|
| 889 |
+
|
| 890 |
+
</small>
|
| 891 |
+
</li>
|
| 892 |
+
|
| 893 |
+
</ul>
|
| 894 |
+
|
| 895 |
+
<p>
|
| 896 |
+
<a href="/content/challenge-2018/citations/1.0.0/">View all 202 publications</a>
|
| 897 |
+
</p>
|
| 898 |
+
<p><small class="text-muted">Citation data from <a href="https://openalex.org" rel="noopener">OpenAlex</a>. Papers that use the project without citing it may be missing.</small></p>
|
| 899 |
+
<hr>
|
| 900 |
+
|
| 901 |
+
|
| 902 |
+
|
| 903 |
+
</div>
|
| 904 |
+
<!-- /.main column -->
|
| 905 |
+
|
| 906 |
+
<!-- Sidebar Column -->
|
| 907 |
+
<div class="col-md-4">
|
| 908 |
+
|
| 909 |
+
|
| 910 |
+
|
| 911 |
+
|
| 912 |
+
|
| 913 |
+
|
| 914 |
+
<div class="card mb-3">
|
| 915 |
+
<div class="card-body sidebar-info">
|
| 916 |
+
<h6 class="sidebar-heading">Share</h6>
|
| 917 |
+
<div class="d-flex flex-wrap" style="gap: 8px;">
|
| 918 |
+
<a class="sharebtn"
|
| 919 |
+
href="mailto:?subject=You%20Snooze%20You%20Win%3A%20The%20PhysioNet/Computing%20in%20Cardiology%20Challenge%202018&body=https://physionet.org/content/challenge-2018/1.0.0/"
|
| 920 |
+
title="Share with email"><i class="far fa-envelope"></i> Email</a>
|
| 921 |
+
<a class="sharebtn"
|
| 922 |
+
href="https://www.linkedin.com/shareArticle?url=https://physionet.org/content/challenge-2018/1.0.0/"
|
| 923 |
+
title="Share on LinkedIn"><i class="fab fa-linkedin"></i> LinkedIn</a>
|
| 924 |
+
<a class="sharebtn"
|
| 925 |
+
href="https://www.reddit.com/submit?url=https://physionet.org/content/challenge-2018/1.0.0/&title=You%20Snooze%20You%20Win%3A%20The%20PhysioNet/Computing%20in%20Cardiology%20Challenge%202018"
|
| 926 |
+
title="Share on Reddit"><i class="fab fa-reddit"></i> Reddit</a>
|
| 927 |
+
</div>
|
| 928 |
+
</div>
|
| 929 |
+
</div>
|
| 930 |
+
|
| 931 |
+
<div class="card mb-3">
|
| 932 |
+
<div class="card-body sidebar-info">
|
| 933 |
+
<h6 class="sidebar-heading">Access</h6>
|
| 934 |
+
<dl class="sidebar-dl">
|
| 935 |
+
<dt>Access Policy</dt>
|
| 936 |
+
<dd>Anyone can access the files, as long as they conform to the terms of the specified license.</dd>
|
| 937 |
+
<dt>License</dt>
|
| 938 |
+
<dd><a href="/content/challenge-2018/view-license/1.0.0/">Open Data Commons Attribution License v1.0</a></dd>
|
| 939 |
+
|
| 940 |
+
|
| 941 |
+
</dl>
|
| 942 |
+
</div>
|
| 943 |
+
</div>
|
| 944 |
+
|
| 945 |
+
<div class="card mb-3">
|
| 946 |
+
<div class="card-body sidebar-info">
|
| 947 |
+
<h6 class="sidebar-heading">Discovery</h6>
|
| 948 |
+
<dl class="sidebar-dl">
|
| 949 |
+
|
| 950 |
+
<dt>DOI (v1.0.0)</dt>
|
| 951 |
+
<dd><a href="https://doi.org/10.13026/6phb-r450">10.13026/6phb-r450</a></dd>
|
| 952 |
+
|
| 953 |
+
|
| 954 |
+
<dt>DOI (latest)</dt>
|
| 955 |
+
<dd><a href="https://doi.org/10.13026/1q9b-ge17">10.13026/1q9b-ge17</a></dd>
|
| 956 |
+
|
| 957 |
+
|
| 958 |
+
|
| 959 |
+
<dt>Topics</dt>
|
| 960 |
+
<dd><a href="/content/?topic=apnea"><span class="badge badge-pn">apnea</span></a> <a href="/content/?topic=circadian"><span class="badge badge-pn">circadian</span></a> <a href="/content/?topic=challenge"><span class="badge badge-pn">challenge</span></a> <a href="/content/?topic=sleep"><span class="badge badge-pn">sleep</span></a> <a href="/content/?topic=polysomnography"><span class="badge badge-pn">polysomnography</span></a> </dd>
|
| 961 |
+
|
| 962 |
+
|
| 963 |
+
<dt>Cited by</dt>
|
| 964 |
+
<dd><a href="/content/challenge-2018/citations/1.0.0/">202 publications</a></dd>
|
| 965 |
+
|
| 966 |
+
|
| 967 |
+
</dl>
|
| 968 |
+
</div>
|
| 969 |
+
</div>
|
| 970 |
+
|
| 971 |
+
<div class="card mb-3">
|
| 972 |
+
<div class="card-body sidebar-info">
|
| 973 |
+
<h6 class="sidebar-heading">Project Views</h6>
|
| 974 |
+
<dl class="sidebar-dl">
|
| 975 |
+
<dt>Current Version</dt>
|
| 976 |
+
<dd>556</dd>
|
| 977 |
+
<dt>All Versions</dt>
|
| 978 |
+
<dd>556</dd>
|
| 979 |
+
</dl>
|
| 980 |
+
<div class="mt-2">
|
| 981 |
+
<a href="/content/challenge-2018/metrics/1.0.0/" class="btn btn-sm btn-outline-secondary">View Details</a>
|
| 982 |
+
</div>
|
| 983 |
+
</div>
|
| 984 |
+
</div>
|
| 985 |
+
|
| 986 |
+
<div class="card mb-3">
|
| 987 |
+
<div class="card-body sidebar-info">
|
| 988 |
+
<h6 class="sidebar-heading">Corresponding Author</h6>
|
| 989 |
+
|
| 990 |
+
<em>You must be logged in to view the contact information.</em>
|
| 991 |
+
|
| 992 |
+
</div>
|
| 993 |
+
</div>
|
| 994 |
+
|
| 995 |
+
<div class="card mb-3">
|
| 996 |
+
<div class="card-body sidebar-info">
|
| 997 |
+
<h6 class="sidebar-heading">Versions</h6>
|
| 998 |
+
<ul class="list-group list-group-flush project-version-list">
|
| 999 |
+
|
| 1000 |
+
<li class="list-group-item px-0">
|
| 1001 |
+
<a href="/content/challenge-2018/1.0.0/">
|
| 1002 |
+
<span class="project-version">1.0.0</span>
|
| 1003 |
+
<time datetime="2018-02-21">
|
| 1004 |
+
Feb. 21, 2018
|
| 1005 |
+
</time>
|
| 1006 |
+
</a>
|
| 1007 |
+
</li>
|
| 1008 |
+
|
| 1009 |
+
</ul>
|
| 1010 |
+
</div>
|
| 1011 |
+
</div>
|
| 1012 |
+
|
| 1013 |
+
</div>
|
| 1014 |
+
<!-- /.sidebar -->
|
| 1015 |
+
</div>
|
| 1016 |
+
<h2 id="files">Files</h2>
|
| 1017 |
+
|
| 1018 |
+
|
| 1019 |
+
|
| 1020 |
+
|
| 1021 |
+
<p>Total uncompressed size: 266.6 GB.</p>
|
| 1022 |
+
|
| 1023 |
+
|
| 1024 |
+
<h5>Access the files</h5>
|
| 1025 |
+
|
| 1026 |
+
|
| 1027 |
+
<ul>
|
| 1028 |
+
|
| 1029 |
+
<li><a href="/content/challenge-2018/get-zip/1.0.0/">Download
|
| 1030 |
+
the ZIP file</a> (45.8 MB)
|
| 1031 |
+
</li>
|
| 1032 |
+
|
| 1033 |
+
|
| 1034 |
+
|
| 1035 |
+
|
| 1036 |
+
|
| 1037 |
+
|
| 1038 |
+
|
| 1039 |
+
|
| 1040 |
+
<li>
|
| 1041 |
+
Download with the <a href="https://github.com/MIT-LCP/physionet#installation">PhysioNet Python package</a>:
|
| 1042 |
+
<pre class="shell-command">physionet download challenge-2018 --version 1.0.0</pre>
|
| 1043 |
+
|
| 1044 |
+
</li>
|
| 1045 |
+
|
| 1046 |
+
<li>
|
| 1047 |
+
Download the files using your terminal:
|
| 1048 |
+
<pre class="shell-command">wget -r -N -c -np https://physionet.org/files/challenge-2018/1.0.0/</pre>
|
| 1049 |
+
</li>
|
| 1050 |
+
|
| 1051 |
+
|
| 1052 |
+
|
| 1053 |
+
|
| 1054 |
+
<li>
|
| 1055 |
+
Download the files using AWS command line tools:
|
| 1056 |
+
<pre class="shell-command">aws s3 sync --no-sign-request s3://physionet-open/challenge-2018/1.0.0/ DESTINATION</pre>
|
| 1057 |
+
</li>
|
| 1058 |
+
|
| 1059 |
+
|
| 1060 |
+
|
| 1061 |
+
</ul>
|
| 1062 |
+
|
| 1063 |
+
|
| 1064 |
+
|
| 1065 |
+
|
| 1066 |
+
|
| 1067 |
+
|
| 1068 |
+
<div id="files-panel" class="card">
|
| 1069 |
+
|
| 1070 |
+
<div class="card-header"
|
| 1071 |
+
data-dfp-panel-url="/content/challenge-2018/files-panel/1.0.0/"
|
| 1072 |
+
data-dfp-cur-dir="">
|
| 1073 |
+
Folder Navigation:
|
| 1074 |
+
<span class="dir-breadcrumbs"><span class="dir-breadcrumb-self"><base></span></span>
|
| 1075 |
+
</div>
|
| 1076 |
+
|
| 1077 |
+
|
| 1078 |
+
<table class="files-panel">
|
| 1079 |
+
<col class="files-panel-name"></col>
|
| 1080 |
+
<col class="files-panel-size"></col>
|
| 1081 |
+
<col class="files-panel-date"></col>
|
| 1082 |
+
<thead>
|
| 1083 |
+
<tr>
|
| 1084 |
+
<th>Name</th>
|
| 1085 |
+
<th>Size</th>
|
| 1086 |
+
<th>Modified</th>
|
| 1087 |
+
</tr>
|
| 1088 |
+
</thead>
|
| 1089 |
+
<tbody>
|
| 1090 |
+
|
| 1091 |
+
|
| 1092 |
+
<tr class="subdir">
|
| 1093 |
+
<td><a href="papers/#files-panel" data-dfp-dir="papers">papers</a></td>
|
| 1094 |
+
<td></td>
|
| 1095 |
+
<td></td>
|
| 1096 |
+
</tr>
|
| 1097 |
+
|
| 1098 |
+
<tr class="subdir">
|
| 1099 |
+
<td><a href="sample/#files-panel" data-dfp-dir="sample">sample</a></td>
|
| 1100 |
+
<td></td>
|
| 1101 |
+
<td></td>
|
| 1102 |
+
</tr>
|
| 1103 |
+
|
| 1104 |
+
<tr class="subdir">
|
| 1105 |
+
<td><a href="sample-matlab/#files-panel" data-dfp-dir="sample-matlab">sample-matlab</a></td>
|
| 1106 |
+
<td></td>
|
| 1107 |
+
<td></td>
|
| 1108 |
+
</tr>
|
| 1109 |
+
|
| 1110 |
+
<tr class="subdir">
|
| 1111 |
+
<td><a href="sources/#files-panel" data-dfp-dir="sources">sources</a></td>
|
| 1112 |
+
<td></td>
|
| 1113 |
+
<td></td>
|
| 1114 |
+
</tr>
|
| 1115 |
+
|
| 1116 |
+
<tr class="subdir">
|
| 1117 |
+
<td><a href="test/#files-panel" data-dfp-dir="test">test</a></td>
|
| 1118 |
+
<td></td>
|
| 1119 |
+
<td></td>
|
| 1120 |
+
</tr>
|
| 1121 |
+
|
| 1122 |
+
<tr class="subdir">
|
| 1123 |
+
<td><a href="training/#files-panel" data-dfp-dir="training">training</a></td>
|
| 1124 |
+
<td></td>
|
| 1125 |
+
<td></td>
|
| 1126 |
+
</tr>
|
| 1127 |
+
|
| 1128 |
+
|
| 1129 |
+
<tr>
|
| 1130 |
+
<td><a href=".challenge-2018.torrent">.challenge-2018.torrent</a>
|
| 1131 |
+
<a class="download" href="/files/challenge-2018/1.0.0/.challenge-2018.torrent?download"
|
| 1132 |
+
title="Download .challenge-2018.torrent">
|
| 1133 |
+
<span class="visually-hidden">(download)</span>
|
| 1134 |
+
</a>
|
| 1135 |
+
</td>
|
| 1136 |
+
<td>3.0 MB</td>
|
| 1137 |
+
<td>2019-04-17</td>
|
| 1138 |
+
</tr>
|
| 1139 |
+
|
| 1140 |
+
<tr>
|
| 1141 |
+
<td><a href="RECORDS">RECORDS</a>
|
| 1142 |
+
<a class="download" href="/files/challenge-2018/1.0.0/RECORDS?download"
|
| 1143 |
+
title="Download RECORDS">
|
| 1144 |
+
<span class="visually-hidden">(download)</span>
|
| 1145 |
+
</a>
|
| 1146 |
+
</td>
|
| 1147 |
+
<td>52.3 KB</td>
|
| 1148 |
+
<td>2018-02-20</td>
|
| 1149 |
+
</tr>
|
| 1150 |
+
|
| 1151 |
+
<tr>
|
| 1152 |
+
<td><a href="SHA256SUMS.txt">SHA256SUMS.txt</a>
|
| 1153 |
+
<a class="download" href="/files/challenge-2018/1.0.0/SHA256SUMS.txt?download"
|
| 1154 |
+
title="Download SHA256SUMS.txt">
|
| 1155 |
+
<span class="visually-hidden">(download)</span>
|
| 1156 |
+
</a>
|
| 1157 |
+
</td>
|
| 1158 |
+
<td>580.3 KB</td>
|
| 1159 |
+
<td>2021-04-12</td>
|
| 1160 |
+
</tr>
|
| 1161 |
+
|
| 1162 |
+
<tr>
|
| 1163 |
+
<td><a href="age-sex.csv">age-sex.csv</a>
|
| 1164 |
+
<a class="download" href="/files/challenge-2018/1.0.0/age-sex.csv?download"
|
| 1165 |
+
title="Download age-sex.csv">
|
| 1166 |
+
<span class="visually-hidden">(download)</span>
|
| 1167 |
+
</a>
|
| 1168 |
+
</td>
|
| 1169 |
+
<td>29.1 KB</td>
|
| 1170 |
+
<td>2018-03-26</td>
|
| 1171 |
+
</tr>
|
| 1172 |
+
|
| 1173 |
+
<tr>
|
| 1174 |
+
<td><a href="challenge2018cinc.pdf">challenge2018cinc.pdf</a>
|
| 1175 |
+
<a class="download" href="/files/challenge-2018/1.0.0/challenge2018cinc.pdf?download"
|
| 1176 |
+
title="Download challenge2018cinc.pdf">
|
| 1177 |
+
<span class="visually-hidden">(download)</span>
|
| 1178 |
+
</a>
|
| 1179 |
+
</td>
|
| 1180 |
+
<td>180.3 KB</td>
|
| 1181 |
+
<td>2019-04-17</td>
|
| 1182 |
+
</tr>
|
| 1183 |
+
|
| 1184 |
+
<tr>
|
| 1185 |
+
<td><a href="new-arousals.zip">new-arousals.zip</a>
|
| 1186 |
+
<a class="download" href="/files/challenge-2018/1.0.0/new-arousals.zip?download"
|
| 1187 |
+
title="Download new-arousals.zip">
|
| 1188 |
+
<span class="visually-hidden">(download)</span>
|
| 1189 |
+
</a>
|
| 1190 |
+
</td>
|
| 1191 |
+
<td>26.8 MB</td>
|
| 1192 |
+
<td>2019-04-17</td>
|
| 1193 |
+
</tr>
|
| 1194 |
+
|
| 1195 |
+
<tr>
|
| 1196 |
+
<td><a href="results.csv">results.csv</a>
|
| 1197 |
+
<a class="download" href="/files/challenge-2018/1.0.0/results.csv?download"
|
| 1198 |
+
title="Download results.csv">
|
| 1199 |
+
<span class="visually-hidden">(download)</span>
|
| 1200 |
+
</a>
|
| 1201 |
+
</td>
|
| 1202 |
+
<td>1.6 KB</td>
|
| 1203 |
+
<td>2019-10-22</td>
|
| 1204 |
+
</tr>
|
| 1205 |
+
|
| 1206 |
+
<tr>
|
| 1207 |
+
<td><a href="sample-matlab-v1.zip">sample-matlab-v1.zip</a>
|
| 1208 |
+
<a class="download" href="/files/challenge-2018/1.0.0/sample-matlab-v1.zip?download"
|
| 1209 |
+
title="Download sample-matlab-v1.zip">
|
| 1210 |
+
<span class="visually-hidden">(download)</span>
|
| 1211 |
+
</a>
|
| 1212 |
+
</td>
|
| 1213 |
+
<td>7.4 KB</td>
|
| 1214 |
+
<td>2019-04-17</td>
|
| 1215 |
+
</tr>
|
| 1216 |
+
|
| 1217 |
+
<tr>
|
| 1218 |
+
<td><a href="sample-matlab.zip">sample-matlab.zip</a>
|
| 1219 |
+
<a class="download" href="/files/challenge-2018/1.0.0/sample-matlab.zip?download"
|
| 1220 |
+
title="Download sample-matlab.zip">
|
| 1221 |
+
<span class="visually-hidden">(download)</span>
|
| 1222 |
+
</a>
|
| 1223 |
+
</td>
|
| 1224 |
+
<td>9.3 KB</td>
|
| 1225 |
+
<td>2019-04-17</td>
|
| 1226 |
+
</tr>
|
| 1227 |
+
|
| 1228 |
+
<tr>
|
| 1229 |
+
<td><a href="sample-v1.zip">sample-v1.zip</a>
|
| 1230 |
+
<a class="download" href="/files/challenge-2018/1.0.0/sample-v1.zip?download"
|
| 1231 |
+
title="Download sample-v1.zip">
|
| 1232 |
+
<span class="visually-hidden">(download)</span>
|
| 1233 |
+
</a>
|
| 1234 |
+
</td>
|
| 1235 |
+
<td>18.7 KB</td>
|
| 1236 |
+
<td>2019-04-17</td>
|
| 1237 |
+
</tr>
|
| 1238 |
+
|
| 1239 |
+
<tr>
|
| 1240 |
+
<td><a href="sample.zip">sample.zip</a>
|
| 1241 |
+
<a class="download" href="/files/challenge-2018/1.0.0/sample.zip?download"
|
| 1242 |
+
title="Download sample.zip">
|
| 1243 |
+
<span class="visually-hidden">(download)</span>
|
| 1244 |
+
</a>
|
| 1245 |
+
</td>
|
| 1246 |
+
<td>21.2 KB</td>
|
| 1247 |
+
<td>2019-04-17</td>
|
| 1248 |
+
</tr>
|
| 1249 |
+
|
| 1250 |
+
<tr>
|
| 1251 |
+
<td><a href="score.py">score.py</a>
|
| 1252 |
+
<a class="download" href="/files/challenge-2018/1.0.0/score.py?download"
|
| 1253 |
+
title="Download score.py">
|
| 1254 |
+
<span class="visually-hidden">(download)</span>
|
| 1255 |
+
</a>
|
| 1256 |
+
</td>
|
| 1257 |
+
<td>1.7 KB</td>
|
| 1258 |
+
<td>2019-04-17</td>
|
| 1259 |
+
</tr>
|
| 1260 |
+
|
| 1261 |
+
<tr>
|
| 1262 |
+
<td><a href="score2018.m">score2018.m</a>
|
| 1263 |
+
<a class="download" href="/files/challenge-2018/1.0.0/score2018.m?download"
|
| 1264 |
+
title="Download score2018.m">
|
| 1265 |
+
<span class="visually-hidden">(download)</span>
|
| 1266 |
+
</a>
|
| 1267 |
+
</td>
|
| 1268 |
+
<td>4.1 KB</td>
|
| 1269 |
+
<td>2019-04-17</td>
|
| 1270 |
+
</tr>
|
| 1271 |
+
|
| 1272 |
+
<tr>
|
| 1273 |
+
<td><a href="score2018.py">score2018.py</a>
|
| 1274 |
+
<a class="download" href="/files/challenge-2018/1.0.0/score2018.py?download"
|
| 1275 |
+
title="Download score2018.py">
|
| 1276 |
+
<span class="visually-hidden">(download)</span>
|
| 1277 |
+
</a>
|
| 1278 |
+
</td>
|
| 1279 |
+
<td>8.0 KB</td>
|
| 1280 |
+
<td>2019-04-17</td>
|
| 1281 |
+
</tr>
|
| 1282 |
+
|
| 1283 |
+
<tr>
|
| 1284 |
+
<td><a href="unofficial-phase-results.csv">unofficial-phase-results.csv</a>
|
| 1285 |
+
<a class="download" href="/files/challenge-2018/1.0.0/unofficial-phase-results.csv?download"
|
| 1286 |
+
title="Download unofficial-phase-results.csv">
|
| 1287 |
+
<span class="visually-hidden">(download)</span>
|
| 1288 |
+
</a>
|
| 1289 |
+
</td>
|
| 1290 |
+
<td>1.5 KB</td>
|
| 1291 |
+
<td>2019-04-17</td>
|
| 1292 |
+
</tr>
|
| 1293 |
+
|
| 1294 |
+
</tbody>
|
| 1295 |
+
</table>
|
| 1296 |
+
|
| 1297 |
+
|
| 1298 |
+
</div>
|
| 1299 |
+
|
| 1300 |
+
|
| 1301 |
+
|
| 1302 |
+
|
| 1303 |
+
<br>
|
| 1304 |
+
|
| 1305 |
+
</div>
|
| 1306 |
+
|
| 1307 |
+
|
| 1308 |
+
|
| 1309 |
+
</main>
|
| 1310 |
+
|
| 1311 |
+
|
| 1312 |
+
<link rel="stylesheet" type="text/css" href="/static/custom/css/footer.css"/>
|
| 1313 |
+
|
| 1314 |
+
<div class="modern-ui">
|
| 1315 |
+
<footer class="footer w-100 secondary-bg py-5">
|
| 1316 |
+
<div class="container my-0 py-0 py-md-5">
|
| 1317 |
+
|
| 1318 |
+
<img src="/static/images/physionet-logo-white.svg" width="180px" alt="PhysioNet" class="pb-2" />
|
| 1319 |
+
|
| 1320 |
+
<div class="footer__columns light-text">
|
| 1321 |
+
<div>
|
| 1322 |
+
|
| 1323 |
+
<p class="dark-light-text mb-2">Maintained by the MIT Laboratory for Computational Physiology</p>
|
| 1324 |
+
|
| 1325 |
+
|
| 1326 |
+
<p class="dark-light-text mb-2">Supported by the National Institute of Biomedical Imaging and Bioengineering (NIBIB), National Heart Lung and Blood Institute (NHLBI), and NIH Office of the Director under NIH grant numbers U24EB037545 and R01EB030362</p>
|
| 1327 |
+
|
| 1328 |
+
</div>
|
| 1329 |
+
<div class="d-flex flex-column pl-0 pl-md-5 pt-4 pt-md-0">
|
| 1330 |
+
<h2 class="text-white font-weight-bold">Navigation</h2>
|
| 1331 |
+
<a href="/content" class="pb-3 dark-light-text">Discover Data</a>
|
| 1332 |
+
<a href="/about/publish" class="pb-3 dark-light-text">Share Data</a>
|
| 1333 |
+
<a href="/about" class="pb-3 dark-light-text">About</a>
|
| 1334 |
+
<a href="/news" class="pb-3 dark-light-text">News</a>
|
| 1335 |
+
</div>
|
| 1336 |
+
<div class="d-flex flex-column pt-4 pt-md-0">
|
| 1337 |
+
<h2 class="text-white font-weight-bold">Explore</h2>
|
| 1338 |
+
|
| 1339 |
+
<a href="/about/database/" class="pb-3 dark-light-text">Data</a>
|
| 1340 |
+
|
| 1341 |
+
<a href="/about/software/" class="pb-3 dark-light-text">Software</a>
|
| 1342 |
+
|
| 1343 |
+
<a href="/about/challenge/" class="pb-3 dark-light-text">Challenges</a>
|
| 1344 |
+
|
| 1345 |
+
<a href="/about/tutorial/" class="pb-3 dark-light-text">Tutorials</a>
|
| 1346 |
+
|
| 1347 |
+
</div>
|
| 1348 |
+
<!-- <div class="d-flex flex-column flex-grow">
|
| 1349 |
+
<h2 class="text-white font-weight-bold">Subscribe to our Newsletter</h2>
|
| 1350 |
+
<input type="email" class="form-control mb-2" placeholder="Your email">
|
| 1351 |
+
<button type="button" class="primary-button">Subscribe Now</button>
|
| 1352 |
+
</div> -->
|
| 1353 |
+
</div>
|
| 1354 |
+
<hr >
|
| 1355 |
+
<div class="d-flex flex-column align-items-center justify-content-between flex-md-row">
|
| 1356 |
+
<div class="d-flex pt-2 pt-md-0">
|
| 1357 |
+
|
| 1358 |
+
<a class="mr-3" href="https://github.com/MIT-LCP/physionet-build/"><img src="/static/images/icons/github.png" height="18px"></a>
|
| 1359 |
+
|
| 1360 |
+
|
| 1361 |
+
|
| 1362 |
+
<a class="mr-3" href="http://linkedin.com/company/physionet"><img src="/static/images/icons/linkedin.png" height="18px"></a>
|
| 1363 |
+
|
| 1364 |
+
|
| 1365 |
+
</div>
|
| 1366 |
+
<div class="pt-4 pt-md-0">
|
| 1367 |
+
|
| 1368 |
+
|
| 1369 |
+
|
| 1370 |
+
<a class="dark-light-text" href="https://accessibility.mit.edu/">Accessibility</a>
|
| 1371 |
+
|
| 1372 |
+
</div>
|
| 1373 |
+
</div>
|
| 1374 |
+
|
| 1375 |
+
<p class="footer__software-credit dark-light-text text-center mt-4 mb-0">
|
| 1376 |
+
Built with <a class="dark-light-text" href="https://github.com/MIT-LCP/physionet-build">PhysioNet software</a>
|
| 1377 |
+
from the MIT Laboratory for Computational Physiology, supported by NIH grant U24EB037545.
|
| 1378 |
+
</p>
|
| 1379 |
+
</div>
|
| 1380 |
+
</footer>
|
| 1381 |
+
</div>
|
| 1382 |
+
|
| 1383 |
+
|
| 1384 |
+
|
| 1385 |
+
<script src="/static/bootstrap/js/bootstrap.min.js"></script>
|
| 1386 |
+
<script src="/static/bootstrap/js/ie10-viewport-bug-workaround.js"></script>
|
| 1387 |
+
<script src="/static/custom/js/navbar.js"></script>
|
| 1388 |
+
|
| 1389 |
+
|
| 1390 |
+
<script src="/static/project/js/dynamic-files-panel.js"></script>
|
| 1391 |
+
<script src="/static/custom/js/enable-popover.js?v=3"></script>
|
| 1392 |
+
<script>hljs.initHighlightingOnLoad();</script>
|
| 1393 |
+
|
| 1394 |
+
|
| 1395 |
+
<!-- https://schema.org/ metadata for discovery -->
|
| 1396 |
+
<script type="application/ld+json">
|
| 1397 |
+
{
|
| 1398 |
+
"@context": "https://schema.org/",
|
| 1399 |
+
"@type": "Dataset",
|
| 1400 |
+
"name": "You Snooze You Win: The PhysioNet/Computing in Cardiology Challenge 2018",
|
| 1401 |
+
"description": "The goal of the challenge is use information from the available signals to correctly classify target arousal regions.",
|
| 1402 |
+
"version": "1.0.0",
|
| 1403 |
+
"license": "https://opendatacommons.org/licenses/by/index.html",
|
| 1404 |
+
"datePublished" : "Feb. 21, 2018",
|
| 1405 |
+
"url": "https://physionet.org/content/challenge-2018/1.0.0/",
|
| 1406 |
+
|
| 1407 |
+
"identifier": "https://doi.org/10.13026/6phb\u002Dr450",
|
| 1408 |
+
|
| 1409 |
+
|
| 1410 |
+
|
| 1411 |
+
"creator": [
|
| 1412 |
+
|
| 1413 |
+
{
|
| 1414 |
+
"@type": "Person",
|
| 1415 |
+
"givenName": "Mohammad",
|
| 1416 |
+
"familyName": "Ghassemi",
|
| 1417 |
+
"name": "Mohammad Ghassemi"
|
| 1418 |
+
},
|
| 1419 |
+
|
| 1420 |
+
{
|
| 1421 |
+
"@type": "Person",
|
| 1422 |
+
"givenName": "Benjamin",
|
| 1423 |
+
"familyName": "Moody",
|
| 1424 |
+
"name": "Benjamin Moody"
|
| 1425 |
+
},
|
| 1426 |
+
|
| 1427 |
+
{
|
| 1428 |
+
"@type": "Person",
|
| 1429 |
+
"givenName": "Li\u002Dwei",
|
| 1430 |
+
"familyName": "Lehman",
|
| 1431 |
+
"name": "Li\u002Dwei Lehman"
|
| 1432 |
+
},
|
| 1433 |
+
|
| 1434 |
+
{
|
| 1435 |
+
"@type": "Person",
|
| 1436 |
+
"givenName": "Roger",
|
| 1437 |
+
"familyName": "Mark",
|
| 1438 |
+
"name": "Roger Mark"
|
| 1439 |
+
},
|
| 1440 |
+
|
| 1441 |
+
{
|
| 1442 |
+
"@type": "Person",
|
| 1443 |
+
"givenName": "Gari D.",
|
| 1444 |
+
"familyName": "Clifford",
|
| 1445 |
+
"name": "Gari D. Clifford"
|
| 1446 |
+
}
|
| 1447 |
+
|
| 1448 |
+
],
|
| 1449 |
+
"includedInDataCatalog":{
|
| 1450 |
+
"@type": "DataCatalog",
|
| 1451 |
+
"name": "physionet.org"
|
| 1452 |
+
},
|
| 1453 |
+
"distribution": [
|
| 1454 |
+
{
|
| 1455 |
+
"@type": "DataDownload",
|
| 1456 |
+
"contentUrl": "https://physionet.org/content/challenge-2018/1.0.0/#files"
|
| 1457 |
+
}
|
| 1458 |
+
]
|
| 1459 |
+
}
|
| 1460 |
+
</script>
|
| 1461 |
+
|
| 1462 |
+
</body>
|
| 1463 |
+
|
| 1464 |
+
</html>
|
challenge-2018/mirror_scope.json
ADDED
|
@@ -0,0 +1,74 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{
|
| 2 |
+
"requested_files": 5966,
|
| 3 |
+
"excluded_nondata_assets": [
|
| 4 |
+
".challenge-2018.torrent",
|
| 5 |
+
"challenge2018cinc.pdf",
|
| 6 |
+
"papers/CinC2018-040.pdf",
|
| 7 |
+
"papers/CinC2018-049.pdf",
|
| 8 |
+
"papers/CinC2018-050.pdf",
|
| 9 |
+
"papers/CinC2018-060.pdf",
|
| 10 |
+
"papers/CinC2018-083.pdf",
|
| 11 |
+
"papers/CinC2018-089.pdf",
|
| 12 |
+
"papers/CinC2018-104.pdf",
|
| 13 |
+
"papers/CinC2018-126.pdf",
|
| 14 |
+
"papers/CinC2018-152.pdf",
|
| 15 |
+
"papers/CinC2018-226.pdf",
|
| 16 |
+
"papers/CinC2018-230.pdf",
|
| 17 |
+
"papers/CinC2018-232.pdf",
|
| 18 |
+
"papers/CinC2018-242.pdf",
|
| 19 |
+
"papers/CinC2018-245.pdf",
|
| 20 |
+
"papers/CinC2018-247.pdf",
|
| 21 |
+
"papers/CinC2018-252.pdf",
|
| 22 |
+
"papers/CinC2018-256.pdf",
|
| 23 |
+
"papers/CinC2018-257.pdf",
|
| 24 |
+
"papers/CinC2018-284.pdf",
|
| 25 |
+
"papers/CinC2018-330.pdf",
|
| 26 |
+
"papers/CinC2018-332.pdf",
|
| 27 |
+
"papers/CinC2018-349.pdf",
|
| 28 |
+
"papers/CinC2018-368.pdf",
|
| 29 |
+
"papers/CinC2018-371.pdf",
|
| 30 |
+
"papers/challenge2018cinc.pdf",
|
| 31 |
+
"papers/howe-patterson.pdf",
|
| 32 |
+
"papers/index.html",
|
| 33 |
+
"papers/macias.pdf",
|
| 34 |
+
"papers/nesaragi.pdf",
|
| 35 |
+
"papers/patane.pdf",
|
| 36 |
+
"papers/plesinger.pdf",
|
| 37 |
+
"papers/shen.pdf",
|
| 38 |
+
"papers/zabihi.pdf",
|
| 39 |
+
"results.csv",
|
| 40 |
+
"sample-matlab-v1.zip",
|
| 41 |
+
"sample-matlab.zip",
|
| 42 |
+
"sample-matlab/AUTHORS.txt",
|
| 43 |
+
"sample-matlab/LICENSE.txt",
|
| 44 |
+
"sample-matlab/README.md",
|
| 45 |
+
"sample-matlab/dependencies.txt",
|
| 46 |
+
"sample-matlab/get_file_info.m",
|
| 47 |
+
"sample-matlab/next.sh",
|
| 48 |
+
"sample-matlab/parse_header.m",
|
| 49 |
+
"sample-matlab/prepare_submission.m",
|
| 50 |
+
"sample-matlab/run_classifier.m",
|
| 51 |
+
"sample-matlab/score2018.m",
|
| 52 |
+
"sample-matlab/setup.sh",
|
| 53 |
+
"sample-matlab/train_classifier.m",
|
| 54 |
+
"sample-v1.zip",
|
| 55 |
+
"sample.zip",
|
| 56 |
+
"sample/AUTHORS.txt",
|
| 57 |
+
"sample/LICENSE.txt",
|
| 58 |
+
"sample/Prepare_Entry.py",
|
| 59 |
+
"sample/dependencies.txt",
|
| 60 |
+
"sample/next.sh",
|
| 61 |
+
"sample/physionetchallenge2018_lib.py",
|
| 62 |
+
"sample/run_my_classifier.py",
|
| 63 |
+
"sample/score2018.py",
|
| 64 |
+
"sample/setup.sh",
|
| 65 |
+
"sample/train_classifier.py",
|
| 66 |
+
"score.py",
|
| 67 |
+
"score2018.m",
|
| 68 |
+
"score2018.py",
|
| 69 |
+
"unofficial-phase-results.csv"
|
| 70 |
+
],
|
| 71 |
+
"scope": "all training/test data, labels, record lists, demographics and updated arousals; publication PDFs and sample-analysis code not mirrored",
|
| 72 |
+
"transport": "Official public S3 mirror documented on the PhysioNet source page",
|
| 73 |
+
"download_base_url": "https://physionet-open.s3.amazonaws.com/challenge-2018/1.0.0/"
|
| 74 |
+
}
|
challenge-2018/provenance.json
ADDED
|
@@ -0,0 +1,57 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{
|
| 2 |
+
"dataset": "challenge-2018",
|
| 3 |
+
"source": {
|
| 4 |
+
"@context": "https://schema.org/",
|
| 5 |
+
"@type": "Dataset",
|
| 6 |
+
"name": "You Snooze You Win: The PhysioNet/Computing in Cardiology Challenge 2018",
|
| 7 |
+
"description": "The goal of the challenge is use information from the available signals to correctly classify target arousal regions.",
|
| 8 |
+
"version": "1.0.0",
|
| 9 |
+
"license": "https://opendatacommons.org/licenses/by/index.html",
|
| 10 |
+
"datePublished": "Feb. 21, 2018",
|
| 11 |
+
"url": "https://physionet.org/content/challenge-2018/1.0.0/",
|
| 12 |
+
"identifier": "https://doi.org/10.13026/6phb-r450",
|
| 13 |
+
"creator": [
|
| 14 |
+
{
|
| 15 |
+
"@type": "Person",
|
| 16 |
+
"givenName": "Mohammad",
|
| 17 |
+
"familyName": "Ghassemi",
|
| 18 |
+
"name": "Mohammad Ghassemi"
|
| 19 |
+
},
|
| 20 |
+
{
|
| 21 |
+
"@type": "Person",
|
| 22 |
+
"givenName": "Benjamin",
|
| 23 |
+
"familyName": "Moody",
|
| 24 |
+
"name": "Benjamin Moody"
|
| 25 |
+
},
|
| 26 |
+
{
|
| 27 |
+
"@type": "Person",
|
| 28 |
+
"givenName": "Li-wei",
|
| 29 |
+
"familyName": "Lehman",
|
| 30 |
+
"name": "Li-wei Lehman"
|
| 31 |
+
},
|
| 32 |
+
{
|
| 33 |
+
"@type": "Person",
|
| 34 |
+
"givenName": "Roger",
|
| 35 |
+
"familyName": "Mark",
|
| 36 |
+
"name": "Roger Mark"
|
| 37 |
+
},
|
| 38 |
+
{
|
| 39 |
+
"@type": "Person",
|
| 40 |
+
"givenName": "Gari D.",
|
| 41 |
+
"familyName": "Clifford",
|
| 42 |
+
"name": "Gari D. Clifford"
|
| 43 |
+
}
|
| 44 |
+
],
|
| 45 |
+
"includedInDataCatalog": {
|
| 46 |
+
"@type": "DataCatalog",
|
| 47 |
+
"name": "physionet.org"
|
| 48 |
+
},
|
| 49 |
+
"distribution": [
|
| 50 |
+
{
|
| 51 |
+
"@type": "DataDownload",
|
| 52 |
+
"contentUrl": "https://physionet.org/content/challenge-2018/1.0.0/#files"
|
| 53 |
+
}
|
| 54 |
+
]
|
| 55 |
+
},
|
| 56 |
+
"modifications": "none"
|
| 57 |
+
}
|
challenge-2018/source_object_sizes.json
ADDED
|
The diff for this file is too large to render.
See raw diff
|
|
|