MediaWiki API result
This is the HTML representation of the JSON format. HTML is good for debugging, but is unsuitable for application use.
Specify the format parameter to change the output format. To see the non-HTML representation of the JSON format, set format=json.
See the complete documentation, or the API help for more information.
{
"batchcomplete": "",
"continue": {
"lecontinue": "20240306105518|16",
"continue": "-||"
},
"query": {
"logevents": [
{
"logid": 26,
"ns": 0,
"title": "Programme Fall 2023",
"pageid": 26,
"logpage": 26,
"revid": 80,
"params": {},
"type": "create",
"action": "create",
"user": "WikiSysop",
"timestamp": "2024-08-19T13:53:45Z",
"comment": "Created page with \"* 28/08 Lesson 1: [[Databases]] * 04/09 Lesson 2: [[MySQL]] * 11/09 Lesson 3: [[Coding against databases]] * 18/09 Lesson 4: [[Computer design]] * 25/09 Lesson 5: [[Queueing System]] * 02/10 Lesson 6: [[Distributed computing]], [https://evaluering.dtu.dk/ Midterm evaluation] - part 1 * 09/10 Lesson 7: [[What affects performance]], [https://evaluering.dtu.dk/ Midterm evaluation] - part 2 * 23/10 Lesson 8: [[Algorithms]] * 30/10 Lesson 9: [[Parallel programming]] * 06/11 L...\""
},
{
"logid": 25,
"ns": 0,
"title": "Example code - Prime numbers optimization",
"pageid": 25,
"logpage": 25,
"revid": 64,
"params": {},
"type": "create",
"action": "create",
"user": "WikiSysop",
"timestamp": "2024-06-17T11:27:10Z",
"comment": "Created page with \"This is going to be a long, but quite instructive rant about various optimization ideas and techniques.<br> Let us start with my \"classic\" prime number generator. The idea is to see how long time is takes to find/generate the primes between 0 and 10 000 000 and use that as a measure for performance. We know that primes are integers which can only be divided by 1 and the primes itself. Therefore it is an obvious idea to evaluate if a number is a prime by starting to divi...\""
},
{
"logid": 24,
"ns": 0,
"title": "Example code - memoization",
"pageid": 24,
"logpage": 24,
"revid": 59,
"params": {},
"type": "create",
"action": "create",
"user": "WikiSysop",
"timestamp": "2024-06-17T09:50:24Z",
"comment": "Created page with \"Memoization is an optimization technique, which remembers the result of CPU/time expensive function calls.<br> It is an example of the Golden Rule: Do not repeat work that has already been done.<br> You can also call the method for \"caching of results\". <pre> #!/usr/bin/env python3 # Demo of the effectivenes of caching import time class Compute: # Class variable used for caching cache = dict() def __init__(self, computeDelay): # Instance variab...\""
},
{
"logid": 23,
"ns": 0,
"title": "Binary representation",
"pageid": 23,
"logpage": 23,
"revid": 53,
"params": {},
"type": "create",
"action": "create",
"user": "WikiSysop",
"timestamp": "2024-06-17T09:30:53Z",
"comment": "Created page with \"{| width=500 style=\"float:right; margin-left: 10px; margin-top: -56px;\" |Previous: [[More parallelism]] |Next: [[Hash usage]] |} == Material for the lesson == Video: [https://panopto.dtu.dk/Panopto/Pages/Viewer.aspx?id=6d4f429b-c110-4439-9bdb-af170077108e MapReduce Framework, short intro]<br> Video: [https://panopto.dtu.dk/Panopto/Pages/Viewer.aspx?id=a0160728-b8be-4b9b-820e-af170076f2c2 Binary numbers, representation and operations]<br> Powerpoint: [https://teaching.he...\""
},
{
"logid": 22,
"ns": 0,
"title": "Programme",
"pageid": 22,
"logpage": 22,
"revid": 36,
"params": {},
"type": "create",
"action": "create",
"user": "WikiSysop",
"timestamp": "2024-03-06T11:38:02Z",
"comment": "Created page with \"* 28/08 Lesson 1: [[Databases]] * 04/09 Lesson 2: [[MySQL]] * 11/09 Lesson 3: [[Coding against databases]] * 18/09 Lesson 4: [[Computer design]] * 25/09 Lesson 5: [[Queueing System]] * 02/10 Lesson 6: [[Distributed computing]], [https://evaluering.dtu.dk/ Midterm evaluation] - part 1 * 09/10 Lesson 7: [[What affects performance]], [https://evaluering.dtu.dk/ Midterm evaluation] - part 2 * 23/10 Lesson 8: [[Algorithms]] * 30/10 Lesson 9: [[Parallel programming]] * 06/11 L...\""
},
{
"logid": 21,
"ns": 0,
"title": "Aligning expectations",
"pageid": 21,
"logpage": 21,
"revid": 30,
"params": {},
"type": "create",
"action": "create",
"user": "WikiSysop",
"timestamp": "2024-03-06T11:15:51Z",
"comment": "Created page with \"== Prerequisite knowledge == Being comfortable with using the Unix shell and being able to navigate the file system is '''required'''. No help will be forthcoming on the subject on a basic level, only advanced Unix tools and concepts will be discussed and that only as a side note. Consult [http://teaching.healthtech.dtu.dk/unix this unix tutorial] and or this [https://teaching.healthtech.dtu.dk/22113/index.php/Unix lesson in Unix].<br> Having a good skill in Python progr...\""
},
{
"logid": 20,
"ns": 0,
"title": "Exercises and Organization",
"pageid": 20,
"logpage": 20,
"revid": 27,
"params": {},
"type": "create",
"action": "create",
"user": "WikiSysop",
"timestamp": "2024-03-06T10:58:55Z",
"comment": "Created page with \"{| width=500 style=\"float:right; margin-left: 10px; margin-top: -56px;\" |Previous: [[Hash usage]] |Next: [https://teaching.healthtech.dtu.dk/22112/index.php/22112_High_Performance_Computing_in_Life_Science Main page] |} == Material for the lesson == Video: [https://panopto.dtu.dk/Panopto/Pages/Viewer.aspx?id=0ccf3b1b-52b7-4d91-9314-af17007069b8 Organization and Exercises]<br> Powerpoint: [https://teaching.healthtech.dtu.dk/material/22112/HPCLife10-Exercises.ppt Exercise...\""
},
{
"logid": 19,
"ns": 0,
"title": "Hash usage",
"pageid": 19,
"logpage": 19,
"revid": 26,
"params": {},
"type": "create",
"action": "create",
"user": "WikiSysop",
"timestamp": "2024-03-06T10:57:50Z",
"comment": "Created page with \"{| width=500 style=\"float:right; margin-left: 10px; margin-top: -56px;\" |Previous: [[MapReduce and Binary representation]] |Next: [[Exercises and Organization]] |} == Material for the lesson == Video: [https://panopto.dtu.dk/Panopto/Pages/Viewer.aspx?id=f253830c-9a70-4aaa-b61e-af170071451a Hashes, properties and use]<br> Video: [https://panopto.dtu.dk/Panopto/Pages/Viewer.aspx?id=52b59412-1df9-4e2b-b8de-af1700710cab Bloom filter, a probabilistic set]<br> Video: [https:/...\""
},
{
"logid": 18,
"ns": 0,
"title": "MapReduce and Binary representation",
"pageid": 18,
"logpage": 18,
"revid": 24,
"params": {},
"type": "create",
"action": "create",
"user": "WikiSysop",
"timestamp": "2024-03-06T10:56:40Z",
"comment": "Created page with \"{| width=500 style=\"float:right; margin-left: 10px; margin-top: -56px;\" |Previous: [[More parallelism]] |Next: [[Hash usage]] |} == Material for the lesson == Video: [https://panopto.dtu.dk/Panopto/Pages/Viewer.aspx?id=6d4f429b-c110-4439-9bdb-af170077108e MapReduce Framework, short intro]<br> Video: [https://panopto.dtu.dk/Panopto/Pages/Viewer.aspx?id=a0160728-b8be-4b9b-820e-af170076f2c2 Binary numbers, representation and operations]<br> Powerpoint: [https://teaching.he...\""
},
{
"logid": 17,
"ns": 0,
"title": "More parallelism",
"pageid": 17,
"logpage": 17,
"revid": 23,
"params": {},
"type": "create",
"action": "create",
"user": "WikiSysop",
"timestamp": "2024-03-06T10:55:58Z",
"comment": "Created page with \"{| width=500 style=\"float:right; margin-left: 10px; margin-top: -56px;\" |Previous: [[Parallel programming]] |Next: [[MapReduce and Binary representation]] |} == Material for the lesson == Video: [https://panopto.dtu.dk/Panopto/Pages/Viewer.aspx?id=cfc600a9-86b0-4e3b-9ece-af170077af38 Concurrency and semaphores]<br> Video: [https://panopto.dtu.dk/Panopto/Pages/Viewer.aspx?id=57cec219-787d-4ece-8ade-af1700778547 Semaphore demonstration - see video to prepare]<br> Powerpoi...\""
}
]
}
}