Datasets:
averoo
/
sc_JSON

Dataset card Data Studio Files
xet
 Community
1
text
stringlengths
6
2.91M
{"geometry": {"type": "Point", "coordinates": [-95.3698, 29.7604]}, "@context": ["https://raw.githubusercontent.com/geojson/geojson-ld/master/contexts/geojson-base.jsonld", {"@vocab": "https://api.weather.gov/ontology#", "geo": "http://www.opengis.net/ont/geosparql#", "unit": "http://codes.wmo.int/common/unit/", "wx": "https://api.weather.gov/ontology#"}], "type": "Feature", "properties": {"units": "us", "updated": "2017-09-17T02:13:47+00:00", "generatedAt": "2017-09-17T02:32:49+00:00", "periods": [{"temperature": 73, "icon": "https://api.weather.gov/icons/land/night/few/fog?size=medium", "temperatureTrend": null, "shortForecast": "Mostly Clear then Patchy Fog", "temperatureUnit": "F", "number": 1, "detailedForecast": "Patchy fog after 4am. Mostly clear, with a low around 73. Southeast wind 2 to 7 mph.", "windSpeed": "2 to 7 mph", "startTime": "2017-09-16T21:00:00-05:00", "isDaytime": false, "endTime": "2017-09-17T06:00:00-05:00", "windDirection": "SE", "name": "Tonight"}, {"temperature": 93, "icon": "https://api.weather.gov/icons/land/day/tsra_hi,20/tsra_hi,30?size=medium", "temperatureTrend": null, "shortForecast": "Patchy Fog", "temperatureUnit": "F", "number": 2, "detailedForecast": "Patchy fog before 8am, then patchy fog and a slight chance of showers and thunderstorms between 8am and 1pm, then a chance of showers and thunderstorms. Partly sunny, with a high near 93. East northeast wind 1 to 8 mph. Chance of precipitation is 30%. New rainfall amounts less than a tenth of an inch possible.", "windSpeed": "1 to 8 mph", "startTime": "2017-09-17T06:00:00-05:00", "isDaytime": true, "endTime": "2017-09-17T18:00:00-05:00", "windDirection": "ENE", "name": "Sunday"}, {"temperature": 75, "icon": "https://api.weather.gov/icons/land/night/tsra_hi,30/bkn?size=medium", "temperatureTrend": null, "shortForecast": "Chance Showers And Thunderstorms then Mostly Cloudy", "temperatureUnit": "F", "number": 3, "detailedForecast": "A chance of showers and thunderstorms before 7pm. Mostly cloudy, with a low around 75. East southeast wind 3 to 8 mph. Chance of precipitation is 30%. New rainfall amounts less than a tenth of an inch possible.", "windSpeed": "3 to 8 mph", "startTime": "2017-09-17T18:00:00-05:00", "isDaytime": false, "endTime": "2017-09-18T06:00:00-05:00", "windDirection": "ESE", "name": "Sunday Night"}, {"temperature": 90, "icon": "https://api.weather.gov/icons/land/day/tsra_sct,30/tsra_sct,40?size=medium", "temperatureTrend": null, "shortForecast": "Chance Showers And Thunderstorms", "temperatureUnit": "F", "number": 4, "detailedForecast": "A chance of showers and thunderstorms after 7am. Partly sunny, with a high near 90. East southeast wind 3 to 8 mph. Chance of precipitation is 40%. New rainfall amounts between a tenth and quarter of an inch possible.", "windSpeed": "3 to 8 mph", "startTime": "2017-09-18T06:00:00-05:00", "isDaytime": true, "endTime": "2017-09-18T18:00:00-05:00", "windDirection": "ESE", "name": "Monday"}, {"temperature": 76, "icon": "https://api.weather.gov/icons/land/night/tsra_hi,40/bkn?size=medium", "temperatureTrend": null, "shortForecast": "Chance Showers And Thunderstorms then Mostly Cloudy", "temperatureUnit": "F", "number": 5, "detailedForecast": "A chance of showers and thunderstorms before 7pm. Mostly cloudy, with a low around 76. South southeast wind 5 to 8 mph. Chance of precipitation is 40%. New rainfall amounts less than a tenth of an inch possible.", "windSpeed": "5 to 8 mph", "startTime": "2017-09-18T18:00:00-05:00", "isDaytime": false, "endTime": "2017-09-19T06:00:00-05:00", "windDirection": "SSE", "name": "Monday Night"}, {"temperature": 91, "icon": "https://api.weather.gov/icons/land/day/tsra_sct,40?size=medium", "temperatureTrend": null, "shortForecast": "Chance Showers And Thunderstorms", "temperatureUnit": "F", "number": 6, "detailedForecast": "A chance of showers and thunderstorms after 7am. Partly sunny, with a high near 91. Chance of precipitation is 40%. New rainfall amounts between a tenth and quarter of an inch possible.", "windSpeed": "5 to 9 mph", "startTime": "2017-09-19T06:00:00-05:00", "isDaytime": true, "endTime": "2017-09-19T18:00:00-05:00", "windDirection": "S", "name": "Tuesday"}, {"temperature": 77, "icon": "https://api.weather.gov/icons/land/night/tsra_hi,40/sct?size=medium", "temperatureTrend": null, "shortForecast": "Chance Showers And Thunderstorms then Partly Cloudy", "temperatureUnit": "F", "number": 7, "detailedForecast": "A chance of showers and thunderstorms before 7pm. Partly cloudy, with a low around 77. Chance of precipitation is 40%. New rainfall amounts between a tenth and quarter of an inch possible.", "windSpeed": "9 mph", "startTime": "2017-09-19T18:00:00-05:00", "isDaytime": false, "endTime": "2017-09-20T06:00:00-05:00", "windDirection": "S", "name": "Tuesday Night"}, {"temperature": 91, "icon": "https://api.weather.gov/icons/land/day/tsra_hi,20/tsra_hi,30?size=medium", "temperatureTrend": null, "shortForecast": "Chance Showers And Thunderstorms", "temperatureUnit": "F", "number": 8, "detailedForecast": "A chance of showers and thunderstorms after 7am. Partly sunny, with a high near 91. Chance of precipitation is 30%. New rainfall amounts less than a tenth of an inch possible.", "windSpeed": "7 to 10 mph", "startTime": "2017-09-20T06:00:00-05:00", "isDaytime": true, "endTime": "2017-09-20T18:00:00-05:00", "windDirection": "S", "name": "Wednesday"}, {"temperature": 77, "icon": "https://api.weather.gov/icons/land/night/tsra_hi,30/bkn?size=medium", "temperatureTrend": null, "shortForecast": "Chance Showers And Thunderstorms then Mostly Cloudy", "temperatureUnit": "F", "number": 9, "detailedForecast": "A chance of showers and thunderstorms before 7pm. Mostly cloudy, with a low around 77. Chance of precipitation is 30%. New rainfall amounts less than a tenth of an inch possible.", "windSpeed": "7 to 10 mph", "startTime": "2017-09-20T18:00:00-05:00", "isDaytime": false, "endTime": "2017-09-21T06:00:00-05:00", "windDirection": "SSE", "name": "Wednesday Night"}, {"temperature": 89, "icon": "https://api.weather.gov/icons/land/day/tsra_sct,30?size=medium", "temperatureTrend": null, "shortForecast": "Chance Showers And Thunderstorms", "temperatureUnit": "F", "number": 10, "detailedForecast": "A chance of showers and thunderstorms after 7am. Partly sunny, with a high near 89. Chance of precipitation is 30%.", "windSpeed": "7 to 10 mph", "startTime": "2017-09-21T06:00:00-05:00", "isDaytime": true, "endTime": "2017-09-21T18:00:00-05:00", "windDirection": "SSE", "name": "Thursday"}, {"temperature": 76, "icon": "https://api.weather.gov/icons/land/night/tsra_hi,30/bkn?size=medium", "temperatureTrend": null, "shortForecast": "Chance Showers And Thunderstorms then Mostly Cloudy", "temperatureUnit": "F", "number": 11, "detailedForecast": "A chance of showers and thunderstorms before 7pm. Mostly cloudy, with a low around 76. Chance of precipitation is 30%.", "windSpeed": "7 to 10 mph", "startTime": "2017-09-21T18:00:00-05:00", "isDaytime": false, "endTime": "2017-09-22T06:00:00-05:00", "windDirection": "SE", "name": "Thursday Night"}, {"temperature": 89, "icon": "https://api.weather.gov/icons/land/day/tsra_hi,20?size=medium", "temperatureTrend": null, "shortForecast": "Slight Chance Showers And Thunderstorms", "temperatureUnit": "F", "number": 12, "detailedForecast": "A slight chance of showers and thunderstorms after 7am. Mostly sunny, with a high near 89. Chance of precipitation is 20%.", "windSpeed": "7 to 12 mph", "startTime": "2017-09-22T06:00:00-05:00", "isDaytime": true, "endTime": "2017-09-22T18:00:00-05:00", "windDirection": "SE", "name": "Friday"}, {"temperature": 75, "icon": "https://api.weather.gov/icons/land/night/tsra_hi,20/sct?size=medium", "temperatureTrend": null, "shortForecast": "Slight Chance Showers And Thunderstorms then Partly Cloudy", "temperatureUnit": "F", "number": 13, "detailedForecast": "A slight chance of showers and thunderstorms before 7pm. Partly cloudy, with a low around 75. Chance of precipitation is 20%.", "windSpeed": "7 to 12 mph", "startTime": "2017-09-22T18:00:00-05:00", "isDaytime": false, "endTime": "2017-09-23T06:00:00-05:00", "windDirection": "SE", "name": "Friday Night"}, {"temperature": 89, "icon": "https://api.weather.gov/icons/land/day/tsra_hi,20?size=medium", "temperatureTrend": null, "shortForecast": "Slight Chance Showers And Thunderstorms", "temperatureUnit": "F", "number": 14, "detailedForecast": "A slight chance of showers and thunderstorms after 7am. Mostly sunny, with a high near 89. Chance of precipitation is 20%.", "windSpeed": "7 to 10 mph", "startTime": "2017-09-23T06:00:00-05:00", "isDaytime": true, "endTime": "2017-09-23T18:00:00-05:00", "windDirection": "SE", "name": "Saturday"}], "forecastGenerator": "BaselineForecastGenerator"}}
{ "name": "bbc-radio-1xtra", "main": "./index.html", "version": "0.0.1", "window": { "title": "BBC Radio 1xtra", "icon": "icon/icon.png", "toolbar": false, "frame": true, "width": 380, "height": 620, "resizable": false, "position": "mouse" }, "webkit": { "plugin": true }, "repository": { "type" : "git", "url" : "https://github.com/florentsolt/bbc-radio-1xtra.git" }, "dependencies": { }, "devDependencies": { "grunt": "*", "grunt-contrib-clean": "*", "grunt-node-webkit-builder": "*" } }
{"code":"331009","province_code":"33","regency_code":"3310","name":"MANISRENGGO"}
{"id":"12/29/1983","name":"1983-12-29","date":"0001-01-01T00:00:00","entries":[{"id":"1-across","group":["1-across"],"separatorLocations":{},"number":1,"humanNumber":"1","clue":" Old hat","direction":"across","length":5,"position":{"x":0,"y":0},"solution":"PASSE"},{"id":"6-across","group":["6-across"],"separatorLocations":{},"number":6,"humanNumber":"6","clue":" ___ Sec. of State","direction":"across","length":4,"position":{"x":6,"y":0},"solution":"ASST"},{"id":"10-across","group":["10-across"],"separatorLocations":{},"number":10,"humanNumber":"10","clue":" Anagram for gore","direction":"across","length":4,"position":{"x":11,"y":0},"solution":"OGRE"},{"id":"14-across","group":["14-across"],"separatorLocations":{},"number":14,"humanNumber":"14","clue":" Havelock of England","direction":"across","length":5,"position":{"x":0,"y":1},"solution":"ELLIS"},{"id":"15-across","group":["15-across"],"separatorLocations":{},"number":15,"humanNumber":"15","clue":" Riviera city","direction":"across","length":4,"position":{"x":6,"y":1},"solution":"NICE"},{"id":"16-across","group":["16-across"],"separatorLocations":{},"number":16,"humanNumber":"16","clue":" Seed cover","direction":"across","length":4,"position":{"x":11,"y":1},"solution":"ARIL"},{"id":"17-across","group":["17-across"],"separatorLocations":{},"number":17,"humanNumber":"17","clue":" Joey or Julie","direction":"across","length":5,"position":{"x":0,"y":2},"solution":"ADAMS"},{"id":"18-across","group":["18-across"],"separatorLocations":{},"number":18,"humanNumber":"18","clue":" Standard used in measurement","direction":"across","length":9,"position":{"x":6,"y":2},"solution":"YARDSTICK"},{"id":"20-across","group":["20-across"],"separatorLocations":{},"number":20,"humanNumber":"20","clue":" Record, in a way","direction":"across","length":4,"position":{"x":0,"y":3},"solution":"TAPE"},{"id":"21-across","group":["21-across"],"separatorLocations":{},"number":21,"humanNumber":"21","clue":" Pie à ___","direction":"across","length":6,"position":{"x":5,"y":3},"solution":"LAMODE"},{"id":"22-across","group":["22-across"],"separatorLocations":{},"number":22,"humanNumber":"22","clue":" \"He/___,\" H. Gold novel","direction":"across","length":3,"position":{"x":12,"y":3},"solution":"SHE"},{"id":"23-across","group":["23-across"],"separatorLocations":{},"number":23,"humanNumber":"23","clue":" Arias for Vickers","direction":"across","length":4,"position":{"x":2,"y":4},"solution":"SOLI"},{"id":"25-across","group":["25-across"],"separatorLocations":{},"number":25,"humanNumber":"25","clue":" Aluminous mineral","direction":"across","length":7,"position":{"x":7,"y":4},"solution":"EDENITE"},{"id":"27-across","group":["27-across"],"separatorLocations":{},"number":27,"humanNumber":"27","clue":" Sugar, Toots et al.","direction":"across","length":8,"position":{"x":0,"y":5},"solution":"PETNAMES"},{"id":"30-across","group":["30-across"],"separatorLocations":{},"number":30,"humanNumber":"30","clue":" Hair accessory","direction":"across","length":3,"position":{"x":9,"y":5},"solution":"RAT"},{"id":"31-across","group":["31-across"],"separatorLocations":{},"number":31,"humanNumber":"31","clue":" Egg: Comb. form","direction":"across","length":3,"position":{"x":0,"y":6},"solution":"OVI"},{"id":"32-across","group":["32-across"],"separatorLocations":{},"number":32,"humanNumber":"32","clue":" Heaped","direction":"across","length":5,"position":{"x":4,"y":6},"solution":"PILED"},{"id":"34-across","group":["34-across"],"separatorLocations":{},"number":34,"humanNumber":"34","clue":" Benito's daughter","direction":"across","length":4,"position":{"x":11,"y":6},"solution":"EDDA"},{"id":"38-across","group":["38-across"],"separatorLocations":{},"number":38,"humanNumber":"38","clue":" Seventeen-year visitors","direction":"across","length":7,"position":{"x":0,"y":7},"solution":"LOCUSTS"},{"id":"40-across","group":["40-across"],"separatorLocations":{},"number":40,"humanNumber":"40","clue":" Defeated","direction":"across","length":7,"position":{"x":8,"y":7},"solution":"OVERRAN"},{"id":"43-across","group":["43-across"],"separatorLocations":{},"number":43,"humanNumber":"43","clue":" \"Mousy\" cries in comics","direction":"across","length":4,"position":{"x":0,"y":8},"solution":"EEKS"},{"id":"44-across","group":["44-across"],"separatorLocations":{},"number":44,"humanNumber":"44","clue":" Sharp","direction":"across","length":5,"position":{"x":6,"y":8},"solution":"ACRID"},{"id":"46-across","group":["46-across"],"separatorLocations":{},"number":46,"humanNumber":"46","clue":" Enrico's counting start","direction":"across","length":3,"position":{"x":12,"y":8},"solution":"UNO"},{"id":"47-across","group":["47-across"],"separatorLocations":{},"number":47,"humanNumber":"47","clue":" Flightless bird","direction":"across","length":3,"position":{"x":3,"y":9},"solution":"EMU"},{"id":"50-across","group":["50-across"],"separatorLocations":{},"number":50,"humanNumber":"50","clue":" Odd-job adept","direction":"across","length":8,"position":{"x":7,"y":9},"solution":"HANDYMAN"},{"id":"52-across","group":["52-across"],"separatorLocations":{},"number":52,"humanNumber":"52","clue":" Raphael subject","direction":"across","length":7,"position":{"x":1,"y":10},"solution":"MADONNA"},{"id":"55-across","group":["55-across"],"separatorLocations":{},"number":55,"humanNumber":"55","clue":" \"The ___ of Texas . . . \"","direction":"across","length":4,"position":{"x":9,"y":10},"solution":"EYES"},{"id":"56-across","group":["56-across"],"separatorLocations":{},"number":56,"humanNumber":"56","clue":" Nosh","direction":"across","length":3,"position":{"x":0,"y":11},"solution":"EAT"},{"id":"57-across","group":["57-across"],"separatorLocations":{},"number":57,"humanNumber":"57","clue":" Uprights","direction":"across","length":6,"position":{"x":4,"y":11},"solution":"PIANOS"},{"id":"59-across","group":["59-across"],"separatorLocations":{},"number":59,"humanNumber":"59","clue":" Pack","direction":"across","length":4,"position":{"x":11,"y":11},"solution":"STOW"},{"id":"62-across","group":["62-across"],"separatorLocations":{},"number":62,"humanNumber":"62","clue":" Utensil for O-Lan","direction":"across","length":9,"position":{"x":0,"y":12},"solution":"CHOPSTICK"},{"id":"64-across","group":["64-across"],"separatorLocations":{},"number":64,"humanNumber":"64","clue":" Esteban's friend","direction":"across","length":5,"position":{"x":10,"y":12},"solution":"AMIGO"},{"id":"65-across","group":["65-across"],"separatorLocations":{},"number":65,"humanNumber":"65","clue":" Tammany follower","direction":"across","length":4,"position":{"x":0,"y":13},"solution":"HALL"},{"id":"66-across","group":["66-across"],"separatorLocations":{},"number":66,"humanNumber":"66","clue":" Knievel","direction":"across","length":4,"position":{"x":5,"y":13},"solution":"EVEL"},{"id":"67-across","group":["67-across"],"separatorLocations":{},"number":67,"humanNumber":"67","clue":" Grand Prix car","direction":"across","length":5,"position":{"x":10,"y":13},"solution":"RACER"},{"id":"68-across","group":["68-across"],"separatorLocations":{},"number":68,"humanNumber":"68","clue":" Sans anything else","direction":"across","length":4,"position":{"x":0,"y":14},"solution":"ONLY"},{"id":"69-across","group":["69-across"],"separatorLocations":{},"number":69,"humanNumber":"69","clue":" Baron ___ Warr","direction":"across","length":4,"position":{"x":5,"y":14},"solution":"DELA"},{"id":"70-across","group":["70-across"],"separatorLocations":{},"number":70,"humanNumber":"70","clue":" Signed","direction":"across","length":5,"position":{"x":10,"y":14},"solution":"INKED"},{"id":"1-down","group":["1-down"],"separatorLocations":{},"number":1,"humanNumber":"1","clue":" Bog fuel","direction":"down","length":4,"position":{"x":0,"y":0},"solution":"PEAT"},{"id":"2-down","group":["2-down"],"separatorLocations":{},"number":2,"humanNumber":"2","clue":" Alan or Robert","direction":"down","length":4,"position":{"x":1,"y":0},"solution":"ALDA"},{"id":"3-down","group":["3-down"],"separatorLocations":{},"number":3,"humanNumber":"3","clue":" Mack Sennett comedy","direction":"down","length":9,"position":{"x":2,"y":0},"solution":"SLAPSTICK"},{"id":"4-down","group":["4-down"],"separatorLocations":{},"number":4,"humanNumber":"4","clue":" Second son of Jacob and Leah","direction":"down","length":6,"position":{"x":3,"y":0},"solution":"SIMEON"},{"id":"5-down","group":["5-down"],"separatorLocations":{},"number":5,"humanNumber":"5","clue":" Curve in the road","direction":"down","length":3,"position":{"x":4,"y":0},"solution":"ESS"},{"id":"6-down","group":["6-down"],"separatorLocations":{},"number":6,"humanNumber":"6","clue":" ___ Seton, author of \"My Theodosia\"","direction":"down","length":4,"position":{"x":6,"y":0},"solution":"ANYA"},{"id":"7-down","group":["7-down"],"separatorLocations":{},"number":7,"humanNumber":"7","clue":" Kind of cat","direction":"down","length":7,"position":{"x":7,"y":0},"solution":"SIAMESE"},{"id":"8-down","group":["8-down"],"separatorLocations":{},"number":8,"humanNumber":"8","clue":" Yound cod","direction":"down","length":5,"position":{"x":8,"y":0},"solution":"SCROD"},{"id":"9-down","group":["9-down"],"separatorLocations":{},"number":9,"humanNumber":"9","clue":" Hay spreader","direction":"down","length":6,"position":{"x":9,"y":0},"solution":"TEDDER"},{"id":"10-down","group":["10-down"],"separatorLocations":{},"number":10,"humanNumber":"10","clue":" Kind of meal or cake","direction":"down","length":3,"position":{"x":11,"y":0},"solution":"OAT"},{"id":"11-down","group":["11-down"],"separatorLocations":{},"number":11,"humanNumber":"11","clue":" Grain for the miller","direction":"down","length":5,"position":{"x":12,"y":0},"solution":"GRIST"},{"id":"12-down","group":["12-down"],"separatorLocations":{},"number":12,"humanNumber":"12","clue":" Nouveau ___","direction":"down","length":5,"position":{"x":13,"y":0},"solution":"RICHE"},{"id":"13-down","group":["13-down"],"separatorLocations":{},"number":13,"humanNumber":"13","clue":" Sommer of films","direction":"down","length":4,"position":{"x":14,"y":0},"solution":"ELKE"},{"id":"19-down","group":["19-down"],"separatorLocations":{},"number":19,"humanNumber":"19","clue":" The Seine, to Sergio","direction":"down","length":4,"position":{"x":10,"y":2},"solution":"SENA"},{"id":"21-down","group":["21-down"],"separatorLocations":{},"number":21,"humanNumber":"21","clue":" Confine","direction":"down","length":5,"position":{"x":5,"y":3},"solution":"LIMIT"},{"id":"24-down","group":["24-down"],"separatorLocations":{},"number":24,"humanNumber":"24","clue":" Circuits","direction":"down","length":4,"position":{"x":4,"y":4},"solution":"LAPS"},{"id":"26-down","group":["26-down"],"separatorLocations":{},"number":26,"humanNumber":"26","clue":" Chariot trail","direction":"down","length":4,"position":{"x":11,"y":4},"solution":"ITER"},{"id":"27-down","group":["27-down"],"separatorLocations":{},"number":27,"humanNumber":"27","clue":" Cathode, e.g.","direction":"down","length":4,"position":{"x":0,"y":5},"solution":"POLE"},{"id":"28-down","group":["28-down"],"separatorLocations":{},"number":28,"humanNumber":"28","clue":" Old orgy cry","direction":"down","length":4,"position":{"x":1,"y":5},"solution":"EVOE"},{"id":"29-down","group":["29-down"],"separatorLocations":{},"number":29,"humanNumber":"29","clue":" Adamson heroine","direction":"down","length":4,"position":{"x":6,"y":5},"solution":"ELSA"},{"id":"33-down","group":["33-down"],"separatorLocations":{},"number":33,"humanNumber":"33","clue":" \"Gifted\" girl","direction":"down","length":4,"position":{"x":8,"y":6},"solution":"DORA"},{"id":"35-down","group":["35-down"],"separatorLocations":{},"number":35,"humanNumber":"35","clue":" Thanksgiving Day prize","direction":"down","length":9,"position":{"x":12,"y":6},"solution":"DRUMSTICK"},{"id":"36-down","group":["36-down"],"separatorLocations":{},"number":36,"humanNumber":"36","clue":" Wynter or Andrews","direction":"down","length":4,"position":{"x":13,"y":6},"solution":"DANA"},{"id":"37-down","group":["37-down"],"separatorLocations":{},"number":37,"humanNumber":"37","clue":" Ever and ___","direction":"down","length":4,"position":{"x":14,"y":6},"solution":"ANON"},{"id":"39-down","group":["39-down"],"separatorLocations":{},"number":39,"humanNumber":"39","clue":" Secondhand","direction":"down","length":4,"position":{"x":3,"y":7},"solution":"USED"},{"id":"41-down","group":["41-down"],"separatorLocations":{},"number":41,"humanNumber":"41","clue":" Twining plants","direction":"down","length":5,"position":{"x":9,"y":7},"solution":"VINES"},{"id":"42-down","group":["42-down"],"separatorLocations":{},"number":42,"humanNumber":"42","clue":" Mary Baker or Nelson","direction":"down","length":4,"position":{"x":10,"y":7},"solution":"EDDY"},{"id":"45-down","group":["45-down"],"separatorLocations":{},"number":45,"humanNumber":"45","clue":" Church part","direction":"down","length":7,"position":{"x":7,"y":8},"solution":"CHANCEL"},{"id":"48-down","group":["48-down"],"separatorLocations":{},"number":48,"humanNumber":"48","clue":" Swabs","direction":"down","length":4,"position":{"x":4,"y":9},"solution":"MOPS"},{"id":"49-down","group":["49-down"],"separatorLocations":{},"number":49,"humanNumber":"49","clue":" Part of U.A.R.","direction":"down","length":6,"position":{"x":5,"y":9},"solution":"UNITED"},{"id":"51-down","group":["51-down"],"separatorLocations":{},"number":51,"humanNumber":"51","clue":" Sycophant","direction":"down","length":6,"position":{"x":11,"y":9},"solution":"YESMAN"},{"id":"52-down","group":["52-down"],"separatorLocations":{},"number":52,"humanNumber":"52","clue":" U.S. naval historian: 1840–1914","direction":"down","length":5,"position":{"x":1,"y":10},"solution":"MAHAN"},{"id":"53-down","group":["53-down"],"separatorLocations":{},"number":53,"humanNumber":"53","clue":" Christmas Island, e.g.","direction":"down","length":5,"position":{"x":2,"y":10},"solution":"ATOLL"},{"id":"54-down","group":["54-down"],"separatorLocations":{},"number":54,"humanNumber":"54","clue":" Unsophisticated","direction":"down","length":5,"position":{"x":6,"y":10},"solution":"NAIVE"},{"id":"56-down","group":["56-down"],"separatorLocations":{},"number":56,"humanNumber":"56","clue":" Reverberate","direction":"down","length":4,"position":{"x":0,"y":11},"solution":"ECHO"},{"id":"58-down","group":["58-down"],"separatorLocations":{},"number":58,"humanNumber":"58","clue":" Gov. Nigh's state","direction":"down","length":4,"position":{"x":8,"y":11},"solution":"OKLA"},{"id":"60-down","group":["60-down"],"separatorLocations":{},"number":60,"humanNumber":"60","clue":" Pointed arch","direction":"down","length":4,"position":{"x":13,"y":11},"solution":"OGEE"},{"id":"61-down","group":["61-down"],"separatorLocations":{},"number":61,"humanNumber":"61","clue":" Neologist's product","direction":"down","length":4,"position":{"x":14,"y":11},"solution":"WORD"},{"id":"63-down","group":["63-down"],"separatorLocations":{},"number":63,"humanNumber":"63","clue":" Kind of wood","direction":"down","length":3,"position":{"x":3,"y":12},"solution":"PLY"},{"id":"64-down","group":["64-down"],"separatorLocations":{},"number":64,"humanNumber":"64","clue":" Jackie's second","direction":"down","length":3,"position":{"x":10,"y":12},"solution":"ARI"}],"dimensions":{"cols":15,"rows":15},"crosswordType":"genius"}
{"code":"6502072001","province_code":"65","regency_code":"6502","district_code":"650207","name":"KALIAMOK"}
{"forum_title": "RÖFL", "id": "16705", "title": "Fyrir þá sem aka undir áhrifum", "url": "http://www.live2cruize.com/spjall/showthread.php/16705-Fyrir-þá-sem-aka-undir-áhrifum", "posts": [{"user_name": "sonur", "text": "fyrir bjór og bílaáhugamenn!!! <<<icon_cool.gif>>> \n\nhttp://www.humorpix.com/lib/image.php?id=888", "date": "2006-07-25 03:02:00", "post_id": 1}, {"user_name": "Fríða Björk", "text": "hahaha <<<icon_lol.gif>>>", "date": "2006-07-25 03:14:00", "post_id": 2}, {"user_name": "Coney", "text": "Þetta vantar hérna á íslandi <<<drunken_smilie.gif>>>", "date": "2006-07-25 04:12:00", "post_id": 3}, {"user_name": "Sergio", "text": "ætlaru vera alla nott að posta öllu sem þu finnur a humorpix?", "date": "2006-07-25 06:53:00", "post_id": 4}, {"user_name": "Aron Fridrik", "text": "hahahaha <<<icon_lol.gif>>>", "date": "2006-07-25 09:07:00", "post_id": 5}], "file_urls": ["http://live2cruize.com/spjall/images/smilies/icon_cool.gif", "http://live2cruize.com/spjall/images/smilies/icon_lol.gif", "http://live2cruize.com/spjall/images/smilies/drunken_smilie.gif", "http://live2cruize.com/spjall/images/smilies/icon_lol.gif"], "date": "2006-07-25 03:02:00", "files": [{"url": "http://live2cruize.com/spjall/images/smilies/icon_cool.gif", "path": "full/268b6de7ac68d94c2755e424eca1572f6620d521.gif", "checksum": "25c83ea511f206e88f214719dad9c88c"}, {"url": "http://live2cruize.com/spjall/images/smilies/icon_lol.gif", "path": "full/fa705ed47e899453195f9b57838cc55ca8fdd97f.gif", "checksum": "b76e7729d43c4a49182d020741285bef"}, {"url": "http://live2cruize.com/spjall/images/smilies/drunken_smilie.gif", "path": "full/b601b67e63a495e69bf9241fbe279161d81727c2.gif", "checksum": "0ad55663e86c33e6cfeb81d4eef2fe45"}, {"url": "http://live2cruize.com/spjall/images/smilies/icon_lol.gif", "path": "full/fa705ed47e899453195f9b57838cc55ca8fdd97f.gif", "checksum": "b76e7729d43c4a49182d020741285bef"}]}
{"poster":"Brate the best","date":"2017-09-21T15:30:38.420+0000","title":"Jhin ad oder lethality runen?","subforum":"Champions & Gameplay","up_votes":1,"down_votes":0,"body":"Ich spiele schon seit einiger zeit Jhin auf der mid lane und frage mich, ob ich ad oder lethality runen nehmen sollte und wollte deshalb fragen, ob ihr mir vielleicht helfen k&ouml;nntet indem ihr mir die \nvorteile der jeweiligen runen auf jhin ( mid ) gebt und welche besser geeignet wären.\nPs: wäre exhaust oder heal auf mid jhin besser geeignet ? ","replies":[{"poster":"OwE Trickster","date":"2017-09-21T15:40:31.194+0000","up_votes":1,"down_votes":0,"body":"Naja auf{{champion:202}} Mid würde ich eigentlich lethality Runen empfehlen dennoch gibt es Games wo es sich Crit zu gehen mehr lohnt und da bringen lethality Runen nicht viel! Am besten machst du dir 2 Runenpages 1x für crit {{champion:202}} und einmal lethality und vor dem Game musst du entscheiden ob du auf lethality oder auf crit gehst. Es gibt natürlich die Variante die du erwähnt hast(halb halb) dennoch finde ich es nicht wirckllich gut auf Jhin","replies":[{"poster":"Brate the best","date":"2017-09-21T15:53:45.916+0000","up_votes":1,"down_votes":0,"body":"Ist es nicht nicht gut auf jhin lethality runes zu nehmen und dann ein crit build zu spielen ?","replies":[{"poster":"OwE Trickster","date":"2017-09-21T17:45:23.848+0000","up_votes":2,"down_votes":0,"body":"> [{quoted}](name=Señor BIack,realm=EUW,application-id=Wj1wcocU,discussion-id=axWg2Eze,comment-id=00000000,timestamp=2017-09-21T15:53:45.916+0000)\n>\n> Ist es nicht nicht gut auf jhin lethality runes zu nehmen und dann ein crit build zu spielen?\n\n\nMan geht lethality weil man mehr mit den Spells arbeitet.\nMan geht crit weil man mit den AA´s arbeitet.\nWas bringt dir lethality wenn du crit gehst? In tf´s als crit jhin AA´s du nur und wenn du aufladest benutzt du q oder w.\nAls lethality Jhin stellst du dich meistens ganz hinten damit du ultest weil deine Ulti mehr schaden macht als deine AA´s.","replies":[]},{"poster":"Allerbester Biss","date":"2017-09-21T16:09:28.386+0000","up_votes":1,"down_votes":0,"body":"XD nein ist es nicht.","replies":[]}]}]},{"poster":"Akazoo21","date":"2017-09-27T05:05:26.468+0000","up_votes":1,"down_votes":0,"body":"Blöde Frage du nimmst beide runensets .. hat das gegnerische Team viel armor nimmst du lethal if Not ad logisch oder?? Ich wette du kommst dir jetz dumm vor 😁 😗😗 by the Way lethal is total underpowered ausser das gegnerische Team hat wirklich nur Tanks Spiel am besten einfach +15 ad","replies":[]}]}
{"poster":"Incarceration","date":"2019-07-19T16:57:42.370+0000","title":"Placed Top 4 But I Didn't Gain LP?","subforum":"Teamfight Tactics Bug Report","up_votes":1,"down_votes":0,"body":"I placed top 4 just barely because the guy to-be 5th place died just before I did. However, I still didn't gain LP and I'm still IRON II 0 LP.","replies":[{"poster":"PikemanDim","date":"2019-07-19T21:06:34.173+0000","up_votes":1,"down_votes":0,"body":"Was it a normal game? Have to make sure and check it everytime before you click play. I have done this a few times as well.","replies":[]}]}
{"kind":"NatMeta","apiVersion":"v1alpha1","display-name":"Nat Meta","format":"JSON","metadata":{"logo-URL":"","model":"netris-operator","modelDisplayName":"Netris","primaryColor":"","secondaryColor":"","shape":"","svgColor":"","svgWhite":""},"model":{"name":"netris-operator","version":"1.1.0","display-name":"Netris","category":"Not Found","sub-category":"Not Found"},"schema":"{\n \"description\": \"NatMetaSpec defines the desired state of NatMeta\",\n \"properties\": {\n \"action\": {\n \"type\": \"string\"\n },\n \"comment\": {\n \"type\": \"string\"\n },\n \"dnatToIp\": {\n \"type\": \"string\"\n },\n \"dnatToPort\": {\n \"type\": \"integer\"\n },\n \"dstAddress\": {\n \"type\": \"string\"\n },\n \"dstPort\": {\n \"type\": \"string\"\n },\n \"id\": {\n \"type\": \"integer\"\n },\n \"imported\": {\n \"description\": \"INSERT ADDITIONAL SPEC FIELDS - desired state of cluster Important: Run \\\"make\\\" to regenerate code after modifying this file\",\n \"type\": \"boolean\"\n },\n \"natGeneration\": {\n \"format\": \"int64\",\n \"type\": \"integer\"\n },\n \"natName\": {\n \"type\": \"string\"\n },\n \"protocol\": {\n \"type\": \"string\"\n },\n \"reclaimPolicy\": {\n \"type\": \"boolean\"\n },\n \"siteID\": {\n \"type\": \"integer\"\n },\n \"snatToIp\": {\n \"type\": \"string\"\n },\n \"snatToPool\": {\n \"type\": \"string\"\n },\n \"srcAddress\": {\n \"type\": \"string\"\n },\n \"srcPort\": {\n \"type\": \"string\"\n },\n \"state\": {\n \"type\": \"string\"\n }\n },\n \"required\": [\n \"action\",\n \"dstAddress\",\n \"id\",\n \"imported\",\n \"natGeneration\",\n \"natName\",\n \"protocol\",\n \"reclaimPolicy\",\n \"siteID\",\n \"srcAddress\"\n ],\n \"title\": \"Nat Meta\",\n \"type\": \"object\"\n}"}
{"code":"3309122004","province_code":"33","regency_code":"3309","district_code":"330912","name":"JERON"}
{"poster":"ReyZør","date":"2016-06-01T10:56:53.296+0000","title":"Taliyah: Problema W in SmartCast","subforum":"Campioni e gameplay","up_votes":1,"down_votes":0,"body":"Salve vorrei far presente che la W di Taliyah se usata con lo smartcast non si comporta come dovrebbe: il primo lancio tutto ok, ma quando c&#039;&egrave; da scegliere la direzione in cui far saltare l&#039;avversario non viene presa in considerazione la posizione del cursore ma semplicemente sbalza l&#039;avversario sul posto","replies":[{"poster":"Ringiel","date":"2016-06-01T12:58:10.120+0000","up_votes":2,"down_votes":1,"body":">ma quando c'è da scegliere la direzione in cui far saltare l'avversario non viene presa in considerazione la posizione del cursore ma semplicemente sbalza l'avversario sul posto\n\ndevi ripremere W per far andare il \"malcapitato\" verso la direzioni che desideri,altrimenti salta sul posto","replies":[{"poster":"GreenArroww","date":"2016-06-01T20:59:25.839+0000","up_votes":1,"down_votes":1,"body":"> [{quoted}](name=Ringiel,realm=EUW,application-id=cAOZwaUi,discussion-id=YYtf8uEN,comment-id=0001,timestamp=2016-06-01T12:58:10.120+0000)\n>\n> devi ripremere W per far andare il &quot;malcapitato&quot; verso la direzioni che desideri,altrimenti salta sul posto\n\nMa no.. basta che clicchi col sinsitro nelal direzione in cui mandarla","replies":[{"poster":"Ringiel","date":"2016-06-02T10:45:32.431+0000","up_votes":1,"down_votes":0,"body":"devi ripremere W,altrimenti non serve a nulla \n\n>Taliyah**_ can recast Seismic Shove_** before it erupts at no additional cost. This will aim its Airborne icon knockup trajectory X units towards the target direction.","replies":[]}]}]},{"poster":"ReyZør","date":"2016-06-01T20:07:21.257+0000","up_votes":1,"down_votes":1,"body":"Ah ok grazie, poi proverò! Peccato però che la direzione dello \"sbalzo\" non si possa decidere solo con la posizione del cursore {{item:3070}}","replies":[]},{"poster":"Azharidan","date":"2016-06-01T11:45:13.640+0000","up_votes":1,"down_votes":1,"body":"Dopo che Clicchi W e premi tasto sinistro, devi ripremere la W mirare nella zona dove vuoi buttare e ripremere il tasto sinistro .\nSe hai fatto questo è c'è comunque un problema non saprei, a me va bene .","replies":[]}]}
{"title":"BreeOlson.Stage.Presents.XXX.WMV-TBP","uid":8750084,"size":301968567,"categoryP":"porn","categoryS":"other","magnet":"?xt=urn:btih:692f2856483d949358d6f1842539fa2332958033&amp;dn=BreeOlson.Stage.Presents.XXX.WMV-TBP&amp;tr=udp%3A%2F%2Ftracker.openbittorrent.com%3A80&amp;tr=udp%3A%2F%2Fopen.demonii.com%3A1337&amp;tr=udp%3A%2F%2Ftracker.coppersurfer.tk%3A6969&amp;tr=udp%3A%2F%2Fexodus.desync.com%3A6969","seeders":0,"leechers":1,"uploader":"Drarbg","files":2,"time":1375011549,"description":"BreeOlson.Stage.Presents.XXX.WMV-TBP\n-----------------------------------------\nScreens : &lt;a href=&quot;\nhttp://imagecurl.org/viewer.php?file=19661304971449429255.jpg&quot; rel=&quot;nofollow&quot; target=&quot;_NEW&quot;&gt;\nhttp://imagecurl.org/viewer.php?file=19661304971449429255.jpg&lt;/a&gt;\n\n","torrent":{"xt":"urn:btih:692f2856483d949358d6f1842539fa2332958033","amp;dn":"BreeOlson.Stage.Presents.XXX.WMV-TBP","amp;tr":["udp%3A%2F%2Ftracker.openbittorrent.com%3A80","udp%3A%2F%2Fopen.demonii.com%3A1337","udp%3A%2F%2Ftracker.coppersurfer.tk%3A6969","udp%3A%2F%2Fexodus.desync.com%3A6969"],"infoHash":"692f2856483d949358d6f1842539fa2332958033","infoHashBuffer":{"type":"Buffer","data":[105,47,40,86,72,61,148,147,88,214,241,132,37,57,250,35,50,149,128,51]},"announce":[],"urlList":[]}}
[{"lineNumber": 8, "col_offset": 0, "nodeName": "DOMAIN", "type": "str"}, {"lineNumber": 9, "col_offset": 0, "nodeName": "URL", "type": "str"}, {"lineNumber": 10, "col_offset": 0, "nodeName": "MAX_PENDING_MSG", "type": "int"}, {"lineNumber": 12, "col_offset": 0, "nodeName": "ERR_ID_REUSE", "type": "str"}, {"lineNumber": 13, "col_offset": 0, "nodeName": "ERR_INVALID_FORMAT", "type": "str"}, {"lineNumber": 14, "col_offset": 0, "nodeName": "ERR_NOT_FOUND", "type": "str"}, {"lineNumber": 15, "col_offset": 0, "nodeName": "ERR_HOME_ASSISTANT_ERROR", "type": "str"}, {"lineNumber": 16, "col_offset": 0, "nodeName": "ERR_UNKNOWN_COMMAND", "type": "str"}, {"lineNumber": 17, "col_offset": 0, "nodeName": "ERR_UNKNOWN_ERROR", "type": "str"}, {"lineNumber": 18, "col_offset": 0, "nodeName": "ERR_UNAUTHORIZED", "type": "str"}, {"lineNumber": 19, "col_offset": 0, "nodeName": "ERR_TIMEOUT", "type": "str"}, {"lineNumber": 21, "col_offset": 0, "nodeName": "TYPE_RESULT", "type": "str"}, {"lineNumber": 26, "col_offset": 0, "nodeName": "CANCELLATION_ERRORS", "type": "Tuple[Any, Type[concurrent.futures._base.CancelledError]]"}, {"lineNumber": 29, "col_offset": 0, "nodeName": "SIGNAL_WEBSOCKET_CONNECTED", "type": "str"}, {"lineNumber": 30, "col_offset": 0, "nodeName": "SIGNAL_WEBSOCKET_DISCONNECTED", "type": "str"}, {"lineNumber": 33, "col_offset": 0, "nodeName": "DATA_CONNECTIONS", "type": "str"}, {"lineNumber": 35, "col_offset": 0, "nodeName": "JSON_DUMP", "type": "functools.partial[nothing]"}, {"lineNumber": 26, "col_offset": 23, "nodeName": "CancelledError", "type": "Any"}, {"lineNumber": 26, "col_offset": 47, "nodeName": "CancelledError", "type": "Type[concurrent.futures._base.CancelledError]"}, {"lineNumber": 33, "col_offset": 19, "nodeName": "DOMAIN", "type": "str"}, {"lineNumber": 35, "col_offset": 12, "nodeName": "partial", "type": "Type[functools.partial[Any]]"}, {"lineNumber": 35, "col_offset": 20, "nodeName": "dumps", "type": "Callable[..., str]"}, {"lineNumber": 26, "col_offset": 23, "nodeName": "asyncio", "type": "Any"}, {"lineNumber": 26, "col_offset": 47, "nodeName": "futures", "type": "module"}, {"lineNumber": 35, "col_offset": 20, "nodeName": "json", "type": "module"}, {"lineNumber": 35, "col_offset": 36, "nodeName": "JSONEncoder", "type": "Any"}]
{ "name": "the-perfect-express-ts-server", "version": "0.0.7", "private": true, "main": "dist/server.js", "description": "A best practices express/ts server with clustering and socket.io", "scripts": { "start": "pm2-runtime start ./dist/server.js --env production -i max", "poststart": "pm2 logs", "postinstall": "yarn build && husky install", "build": "tsc", "dev": "ts-node-dev --respawn --transpile-only src/server.ts", "migrate": "ts-node src/migrations.ts", "eslint": "eslint --quiet --fix", "prettier": "prettier src/**/*.ts --write", "lint": "yarn prettier && yarn eslint", "test": "NODE_ENV=test nyc mocha" }, "husky": { "hooks": { "pre-commit": "lint-staged", "pre-push": "NODE_ENV=test yarn test && yarn build && yarn version --patch" } }, "lint-staged": { "*.{js,ts}": "yarn lint" }, "dependencies": { "bcrypt": "^5.0.1", "compression": "^1.7.4", "cookie-parser": "~1.4.4", "cors": "^2.8.5", "dotenv": "^10.0.0", "express": "~4.17.1", "express-validator": "^6.12.1", "helmet": "^4.6.0", "jsend": "^1.1.0", "morgan": "~1.10.0", "multer": "^1.4.3", "pg": "^8.7.1", "pg-hstore": "^2.3.4", "pm2": "^5.1.1", "sequelize": "^6.6.5", "socket.io": "^4.1.3", "umzug": "^2.3.0", "winston": "^3.3.3" }, "devDependencies": { "@types/debug": "^4.1.7", "@types/express": "^4.17.13", "@types/jsend": "^1.0.29", "@types/mocha": "^9.0.0", "@types/node": "^16.7.4", "@types/umzug": "^2.3.2", "@typescript-eslint/eslint-plugin": "^4.29.3", "@typescript-eslint/parser": "^4.29.3", "chai": "^4.3.4", "eslint": "^7.32.0", "eslint-config-prettier": "^8.3.0", "eslint-plugin-prettier": "^3.4.1", "faker": "^5.5.3", "husky": "^7.0.2", "lint-staged": "^11.1.2", "mocha": "^9.1.0", "nyc": "^15.1.0", "prettier": "^2.3.2", "supertest": "^6.1.6", "ts-node": "^10.2.1", "ts-node-dev": "^1.1.8", "typescript": "^4.4.2" } }
{"geometry":{"type":"Polygon","coordinates":[[[0.992269,48.314913],[0.992429,48.314021],[0.993769,48.314131],[0.994089,48.312347],[0.999447,48.312785],[0.999768,48.311001],[1.001107,48.311110],[1.001427,48.309326],[0.997409,48.308998],[0.997729,48.307213],[0.995050,48.306994],[0.995210,48.306102],[0.992532,48.305883],[0.992692,48.304991],[0.987335,48.304553],[0.986694,48.308121],[0.982675,48.307792],[0.982355,48.309576],[0.985034,48.309795],[0.984873,48.310687],[0.988892,48.311016],[0.988731,48.311908],[0.990071,48.312018],[0.989910,48.312910],[0.991250,48.313019],[0.990930,48.314803],[0.992269,48.314913]]]},"properties":{"qs:a1r":"0Centre","qs:la":"Saint-Denis-d'Authou","geom:longitude":0.992106,"name:fre_v":["Thiron-Gardais"],"lbl:latitude":48.316670,"qs:loc_alt":"Thiron-Gardais","iso:country":"FR","src:geom_alt":[],"wof:geomhash":"9a16fdd35e20a262766d6dc4e1f1f1d0","qs:level":"locality","wof:name":"Thiron-Gardais","src:geom":"quattroshapes","qs:adm0":"France","wof:breaches":[],"wof:hierarchy":[{"locality_id":101762339,"country_id":85633147,"region_id":85683189,"county_id":102068679}],"qs:la_lc":"*FR2428423331","qs:loc":"Thiron-Gardais","wof:id":101762339,"qs:pop":0,"lbl:longitude":0.983330,"wof:supersedes":[],"geom:area":0.000096,"qs:id":0,"geom:latitude":48.309360,"qs:source":"ACustom EuroGlobalMap + UMZ Urban Polygons + Geonames + GeoPlanet","name:fre_p":["Thiron Gardais"],"src:centroid_lbl":"geonames","wof:belongsto":[85633147,85683189,102068679],"qs:type":"rural point-in-poly","wof:placetype":"locality","gn:population":1157,"qs:a0":"France","qs:a1":"*Eure-et-Loir","wof:lastmodified":1439924389,"wof:superseded_by":[],"wof:concordances":{"gn:id":2972801,"gp:id":628506,"fct:id":"0a63644a-8f76-11e1-848f-cfd5bf3ef515"},"wof:parent_id":102068679},"type":"Feature","bbox":[0.982355,48.304553,1.001427,48.314913],"id":101762339}
{ "name": "pudding-loader", "version": "0.0.3", "description": "Pudding loader for Webpack to call solidity contracts", "main": "index.js", "scripts": { "test": "test" }, "repository": { "type": "git", "url": "git+https://github.com/jeffscottward/pudding-loader.git" }, "keywords": [ "Pudding", "Ethereum", "Solidity", "Javascript" ], "author": "jeffscottward", "license": "ISC", "bugs": { "url": "https://github.com/jeffscottward/pudding-loader/issues" }, "homepage": "https://github.com/jeffscottward/pudding-loader#readme", "devDependencies": { "ether-pudding": "^1.1.1" } }
{"title":"RealExGirlfriends - Tiffany Fox XXX","uid":7675191,"size":613853693,"categoryP":"porn","categoryS":"movies","magnet":"?xt=urn:btih:fb4ed369b36d3224d81944f2ed40b5b0f91474e7&amp;dn=RealExGirlfriends+-+Tiffany+Fox+XXX&amp;tr=udp%3A%2F%2Ftracker.openbittorrent.com%3A80&amp;tr=udp%3A%2F%2Fopen.demonii.com%3A1337&amp;tr=udp%3A%2F%2Ftracker.coppersurfer.tk%3A6969&amp;tr=udp%3A%2F%2Fexodus.desync.com%3A6969","seeders":0,"leechers":1,"uploader":null,"files":1,"time":1348677907,"description":"SCREENSHOTS:\n\n &lt;a href=&quot;\nhttp://nottypic.net/IMAGE2/share-68FD_506314BE.html&quot; rel=&quot;nofollow&quot; target=&quot;_NEW&quot;&gt;\nhttp://nottypic.net/IMAGE2/share-68FD_506314BE.html&lt;/a&gt;\n &lt;a href=&quot;\nhttp://nottypic.net/IMAGE3/share-6E7B_506314CC.html&quot; rel=&quot;nofollow&quot; target=&quot;_NEW&quot;&gt;\nhttp://nottypic.net/IMAGE3/share-6E7B_506314CC.html&lt;/a&gt;\n\nTiffany Fox just loves sex, she loves it so much that anytime she has a rock hard cock in her bed she wants to make sure she get's all the bone-ing she can get.\nTo entice her latest partner, she decides to work his stomach with some food first but once he sees that horny petite body he gets right to business!","torrent":{"xt":"urn:btih:fb4ed369b36d3224d81944f2ed40b5b0f91474e7","amp;dn":"RealExGirlfriends+-+Tiffany+Fox+XXX","amp;tr":["udp%3A%2F%2Ftracker.openbittorrent.com%3A80","udp%3A%2F%2Fopen.demonii.com%3A1337","udp%3A%2F%2Ftracker.coppersurfer.tk%3A6969","udp%3A%2F%2Fexodus.desync.com%3A6969"],"infoHash":"fb4ed369b36d3224d81944f2ed40b5b0f91474e7","infoHashBuffer":{"type":"Buffer","data":[251,78,211,105,179,109,50,36,216,25,68,242,237,64,181,176,249,20,116,231]},"announce":[],"urlList":[]}}
{"notes": [{"tddate": null, "ddate": null, "tmdate": 1518730188334, "tcdate": 1509010991173, "number": 121, "cdate": 1518730188319, "id": "HkwVAXyCW", "invitation": "ICLR.cc/2018/Conference/-/Blind_Submission", "forum": "HkwVAXyCW", "original": "HJUE0Q1AW", "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "writers": ["ICLR.cc/2018/Conference"], "content": {"title": "Skip RNN: Learning to Skip State Updates in Recurrent Neural Networks", "abstract": "Recurrent Neural Networks (RNNs) continue to show outstanding performance in sequence modeling tasks. However, training RNNs on long sequences often face challenges like slow inference, vanishing gradients and difficulty in capturing long term dependencies. In backpropagation through time settings, these issues are tightly coupled with the large, sequential computational graph resulting from unfolding the RNN in time. We introduce the Skip RNN model which extends existing RNN models by learning to skip state updates and shortens the effective size of the computational graph. This model can also be encouraged to perform fewer state updates through a budget constraint. We evaluate the proposed model on various tasks and show how it can reduce the number of required RNN updates while preserving, and sometimes even improving, the performance of the baseline RNN models. Source code is publicly available at https://imatge-upc.github.io/skiprnn-2017-telecombcn/.", "pdf": "/pdf/919fe6caf1816ef3918ffc35e15fdd5da3449b44.pdf", "TL;DR": "A modification for existing RNN architectures which allows them to skip state updates while preserving the performance of the original architectures.", "paperhash": "campos|skip_rnn_learning_to_skip_state_updates_in_recurrent_neural_networks", "_bibtex": "@inproceedings{\ncampos2018skip,\ntitle={Skip {RNN}: Learning to Skip State Updates in Recurrent Neural Networks},\nauthor={V\u00edctor Campos and Brendan Jou and Xavier Gir\u00f3-i-Nieto and Jordi Torres and Shih-Fu Chang},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=HkwVAXyCW},\n}", "keywords": ["recurrent neural networks", "dynamic learning", "conditional computation"], "authors": ["V\u00edctor Campos", "Brendan Jou", "Xavier Gir\u00f3-i-Nieto", "Jordi Torres", "Shih-Fu Chang"], "authorids": ["victor.campos@bsc.es", "bjou@google.com", "xavier.giro@upc.edu", "jordi.torres@bsc.es", "shih.fu.chang@columbia.edu"]}, "nonreaders": [], "details": {"replyCount": 11, "writable": false, "overwriting": [], "revisions": true, "tags": [], "invitation": {"rdate": null, "duedate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "tmdate": 1506717071958, "id": "ICLR.cc/2018/Conference/-/Blind_Submission", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "invitees": ["ICLR.cc/2018/Conference"], "reply": {"forum": null, "replyto": null, "writers": {"values": ["ICLR.cc/2018/Conference"]}, "signatures": {"description": "How your identity will be displayed with the above content.", "values": ["ICLR.cc/2018/Conference"]}, "readers": {"description": "The users who will be allowed to read the above content.", "values": ["everyone"]}, "content": {"authors": {"required": false, "order": 1, "values-regex": ".*", "description": "Comma separated list of author names, as they appear in the paper."}, "authorids": {"required": false, "order": 2, "values-regex": ".*", "description": "Comma separated list of author email addresses, in the same order as above."}}}, "nonreaders": [], "noninvitees": [], "cdate": 1506717071958}}, "tauthor": "ICLR.cc/2018/Conference"}, {"tddate": null, "ddate": null, "original": null, "tmdate": 1517260098043, "tcdate": 1517249343317, "number": 131, "cdate": 1517249343295, "id": "H1vHQJTHG", "invitation": "ICLR.cc/2018/Conference/-/Acceptance_Decision", "forum": "HkwVAXyCW", "replyto": "HkwVAXyCW", "signatures": ["ICLR.cc/2018/Conference/Program_Chairs"], "readers": ["everyone"], "writers": ["ICLR.cc/2018/Conference/Program_Chairs"], "content": {"title": "ICLR 2018 Conference Acceptance Decision", "comment": "This paper explores what might be characterized as an adaptive form of ZoneOut.\nWith the improvements and clarifications added to the paper during the rebuttal the paper could be accepted.\n", "decision": "Accept (Poster)"}, "nonreaders": [], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Skip RNN: Learning to Skip State Updates in Recurrent Neural Networks", "abstract": "Recurrent Neural Networks (RNNs) continue to show outstanding performance in sequence modeling tasks. However, training RNNs on long sequences often face challenges like slow inference, vanishing gradients and difficulty in capturing long term dependencies. In backpropagation through time settings, these issues are tightly coupled with the large, sequential computational graph resulting from unfolding the RNN in time. We introduce the Skip RNN model which extends existing RNN models by learning to skip state updates and shortens the effective size of the computational graph. This model can also be encouraged to perform fewer state updates through a budget constraint. We evaluate the proposed model on various tasks and show how it can reduce the number of required RNN updates while preserving, and sometimes even improving, the performance of the baseline RNN models. Source code is publicly available at https://imatge-upc.github.io/skiprnn-2017-telecombcn/.", "pdf": "/pdf/919fe6caf1816ef3918ffc35e15fdd5da3449b44.pdf", "TL;DR": "A modification for existing RNN architectures which allows them to skip state updates while preserving the performance of the original architectures.", "paperhash": "campos|skip_rnn_learning_to_skip_state_updates_in_recurrent_neural_networks", "_bibtex": "@inproceedings{\ncampos2018skip,\ntitle={Skip {RNN}: Learning to Skip State Updates in Recurrent Neural Networks},\nauthor={V\u00edctor Campos and Brendan Jou and Xavier Gir\u00f3-i-Nieto and Jordi Torres and Shih-Fu Chang},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=HkwVAXyCW},\n}", "keywords": ["recurrent neural networks", "dynamic learning", "conditional computation"], "authors": ["V\u00edctor Campos", "Brendan Jou", "Xavier Gir\u00f3-i-Nieto", "Jordi Torres", "Shih-Fu Chang"], "authorids": ["victor.campos@bsc.es", "bjou@google.com", "xavier.giro@upc.edu", "jordi.torres@bsc.es", "shih.fu.chang@columbia.edu"]}, "tags": [], "invitation": {"id": "ICLR.cc/2018/Conference/-/Acceptance_Decision", "rdate": null, "ddate": null, "expdate": 1541175629000, "duedate": null, "tmdate": 1541177635767, "tddate": null, "super": null, "final": null, "reply": {"forum": null, "replyto": null, "invitation": "ICLR.cc/2018/Conference/-/Blind_Submission", "writers": {"values": ["ICLR.cc/2018/Conference/Program_Chairs"]}, "signatures": {"description": "How your identity will be displayed with the above content.", "values": ["ICLR.cc/2018/Conference/Program_Chairs"]}, "readers": {"description": "The users who will be allowed to read the above content.", "value-dropdown": ["ICLR.cc/2018/Conference/Program_Chairs", "everyone"]}, "content": {"title": {"required": true, "order": 1, "value": "ICLR 2018 Conference Acceptance Decision"}, "comment": {"required": false, "order": 3, "description": "(optional) Comment on this decision.", "value-regex": "[\\S\\s]{0,5000}"}, "decision": {"required": true, "order": 2, "value-dropdown": ["Accept (Oral)", "Accept (Poster)", "Reject", "Invite to Workshop Track"]}}}, "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "nonreaders": [], "invitees": [], "noninvitees": [], "writers": ["ICLR.cc/2018/Conference"], "multiReply": null, "taskCompletionCount": null, "transform": null, "cdate": 1541177635767}}}, {"tddate": null, "ddate": null, "original": null, "tmdate": 1516645623326, "tcdate": 1511667178652, "number": 1, "cdate": 1511667178652, "id": "HkmeI2vxM", "invitation": "ICLR.cc/2018/Conference/-/Paper121/Official_Review", "forum": "HkwVAXyCW", "replyto": "HkwVAXyCW", "signatures": ["ICLR.cc/2018/Conference/Paper121/AnonReviewer1"], "readers": ["everyone"], "content": {"title": "Interesting model, but lacking comparison to prior work", "rating": "6: Marginally above acceptance threshold", "review": "UPDATE: Following the author's response I've increased my score from 5 to 6. The revised paper includes many of the additional references that I suggested, and the author response clarified my confusion over the Charades experiments; their results are indeed close to state-of-the-art on Charades activity localization (slightly outperformed by [6]), which I had mistakenly confused with activity classification (from [5]).\n\nThe paper proposes the Skip RNN model which allows a recurrent network to selectively skip updating its hidden state for some inputs, leading to reduced computation at test-time. At each timestep the model emits an update probability; if this probability is over a threshold then the next input and state update will be skipped. The use of a straight-through estimator allows the model to be trained with standard backpropagation. The number of state updates that the model learns to use can be controlled with an auxiliary loss function. Experiments are performed on a variety of tasks, demonstrating that the Skip-RNN compares as well or better than baselines even when skipping nearly half its state updates.\n\nPros:\n- Task of reducing computation by skipping inputs is interesting\n- Model is novel and interesting\n- Experiments on multiple tasks and datasets confirm the efficacy of the method\n- Skipping behavior can be controlled via an auxiliary loss term\n- Paper is clearly written\n\nCons:\n- Missing comparison to prior work on sequential MNIST\n- Low performance on Charades dataset, no comparison to prior work\n- No comparison to prior work on IMDB Sentiment Analysis or UCF-101 activity classification\n\nThe task of reducing computation by skipping RNN inputs is interesting, and the proposed method is novel, interesting, and clearly explained. Experimental results across a variety of tasks are convincing; in all tasks the Skip-RNNs achieve their goal of performing as well or better than equivalent non-skipping variants. The use of an auxiliary loss to control the number of state updates is interesting; since it sometimes improves performance it appears to have some regularizing effect on the model in addition to controlling the trade-off between speed and accuracy.\n\nHowever, where possible experiments should compare directly with prior published results on these tasks; none of the experiments from the main paper or supplementary material report any numbers from any other published work.\n\nOn permuted MNIST, Table 2 could include results from [1-4]. Of particular interest is [3], which reports 98.9% accuracy with a 100-unit LSTM initialized with orthogonal and identity weight matrices; this is significantly higher than all reported results for the sequential MNIST task.\n\nFor Charades, all reported results appear significantly lower than the baseline methods reported in [5] and [6] with no explanation. All methods work on \u201cfc7 features from the RGB stream of a two-stream CNN provided by the organizers of the [Charades] challenge\u201d, and the best-performing method (Skip GRU) achieves 9.02 mAP. This is significantly lower than the two-stream results from [5] (11.9 mAP and 14.3 mAP) and also lower than pretrained AlexNet features averaged over 30 frames and classified with a linear SVM, which [5] reports as achieving 11.3 mAP. I don\u2019t expect to see state-of-the-art performance on Charades; the point of the experiment is to demonstrate that Skip-RNNs perform as well or better than their non-skipping counterparts, which it does. However I am surprised at the low absolute performance of all reported results, and would appreciate if the authors could help to clarify whether this is due to differences in experimental setup or something else.\n\nIn a similar vein, from the supplementary material, sentiment analysis on IMDB and action classification on UCF-101 are well-studied problems, but the authors do not compare with any previously published results on these tasks.\n\nThough experiments may not show show state-of-the-art performance, I think that they still serve to demonstrate the utility of the Skip-RNN architecture when compared side-by-side with a similarly tuned non-skipping baseline. However I feel that the authors should include some discussion of other published results.\n\nOn the whole I believe that the task and method are interesting, and experiments convincingly demonstrate the utility of Skip-RNNs compared to the author\u2019s own baselines. I will happily upgrade my rating of the paper if the authors can address my concerns over prior work in the experiments.\n\n\nReferences\n\n[1] Le et al, \u201cA Simple Way to Initialize Recurrent Networks of Rectified Linear Units\u201d, arXiv 2015\n[2] Arjovsky et al, \u201cUnitary Evolution Recurrent Neural Networks\u201d, ICML 2016\n[3] Cooijmans et al, \u201cRecurrent Batch Normalization\u201d, ICLR 2017\n[4] Zhang et al, \u201cArchitectural Complexity Measures of Recurrent Neural Networks\u201d, NIPS 2016\n[5] Sigurdsson et al, \u201cHollywood in homes: Crowdsourcing data collection for activity understanding\u201d, ECCV 2016\n[6] Sigurdsson et al, \u201cAsynchronous temporal fields for action recognition\u201d, CVPR 2017", "confidence": "4: The reviewer is confident but not absolutely certain that the evaluation is correct"}, "writers": [], "nonreaders": [], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": true, "forumContent": {"title": "Skip RNN: Learning to Skip State Updates in Recurrent Neural Networks", "abstract": "Recurrent Neural Networks (RNNs) continue to show outstanding performance in sequence modeling tasks. However, training RNNs on long sequences often face challenges like slow inference, vanishing gradients and difficulty in capturing long term dependencies. In backpropagation through time settings, these issues are tightly coupled with the large, sequential computational graph resulting from unfolding the RNN in time. We introduce the Skip RNN model which extends existing RNN models by learning to skip state updates and shortens the effective size of the computational graph. This model can also be encouraged to perform fewer state updates through a budget constraint. We evaluate the proposed model on various tasks and show how it can reduce the number of required RNN updates while preserving, and sometimes even improving, the performance of the baseline RNN models. Source code is publicly available at https://imatge-upc.github.io/skiprnn-2017-telecombcn/.", "pdf": "/pdf/919fe6caf1816ef3918ffc35e15fdd5da3449b44.pdf", "TL;DR": "A modification for existing RNN architectures which allows them to skip state updates while preserving the performance of the original architectures.", "paperhash": "campos|skip_rnn_learning_to_skip_state_updates_in_recurrent_neural_networks", "_bibtex": "@inproceedings{\ncampos2018skip,\ntitle={Skip {RNN}: Learning to Skip State Updates in Recurrent Neural Networks},\nauthor={V\u00edctor Campos and Brendan Jou and Xavier Gir\u00f3-i-Nieto and Jordi Torres and Shih-Fu Chang},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=HkwVAXyCW},\n}", "keywords": ["recurrent neural networks", "dynamic learning", "conditional computation"], "authors": ["V\u00edctor Campos", "Brendan Jou", "Xavier Gir\u00f3-i-Nieto", "Jordi Torres", "Shih-Fu Chang"], "authorids": ["victor.campos@bsc.es", "bjou@google.com", "xavier.giro@upc.edu", "jordi.torres@bsc.es", "shih.fu.chang@columbia.edu"]}, "tags": [], "invitation": {"rdate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "duedate": 1511845199000, "tmdate": 1515642395524, "id": "ICLR.cc/2018/Conference/-/Paper121/Official_Review", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "invitees": ["ICLR.cc/2018/Conference/Paper121/Reviewers"], "noninvitees": ["ICLR.cc/2018/Conference/Paper121/AnonReviewer1", "ICLR.cc/2018/Conference/Paper121/AnonReviewer3", "ICLR.cc/2018/Conference/Paper121/AnonReviewer2"], "reply": {"forum": "HkwVAXyCW", "replyto": "HkwVAXyCW", "writers": {"values": []}, "signatures": {"values-regex": "ICLR.cc/2018/Conference/Paper121/AnonReviewer[0-9]+", "description": "How your identity will be displayed with the above content."}, "readers": {"description": "The users who will be allowed to read the above content.", "values": ["everyone"]}, "content": {"title": {"required": true, "order": 1, "description": "Brief summary of your review.", "value-regex": ".{0,500}"}, "review": {"required": true, "order": 2, "description": "Please provide an evaluation of the quality, clarity, originality and significance of this work, including a list of its pros and cons.", "value-regex": "[\\S\\s]{1,200000}"}, "rating": {"required": true, "order": 3, "value-dropdown": ["10: Top 5% of accepted papers, seminal paper", "9: Top 15% of accepted papers, strong accept", "8: Top 50% of accepted papers, clear accept", "7: Good paper, accept", "6: Marginally above acceptance threshold", "5: Marginally below acceptance threshold", "4: Ok but not good enough - rejection", "3: Clear rejection", "2: Strong rejection", "1: Trivial or wrong"]}, "confidence": {"required": true, "order": 4, "value-radio": ["5: The reviewer is absolutely certain that the evaluation is correct and very familiar with the relevant literature", "4: The reviewer is confident but not absolutely certain that the evaluation is correct", "3: The reviewer is fairly confident that the evaluation is correct", "2: The reviewer is willing to defend the evaluation, but it is quite likely that the reviewer did not understand central parts of the paper", "1: The reviewer's evaluation is an educated guess"]}}}, "nonreaders": [], "expdate": 1519621199000, "cdate": 1515642395524}}}, {"tddate": null, "ddate": null, "tmdate": 1516645409039, "tcdate": 1516645409039, "number": 8, "cdate": 1516645409039, "id": "rkKX3j7SM", "invitation": "ICLR.cc/2018/Conference/-/Paper121/Official_Comment", "forum": "HkwVAXyCW", "replyto": "BywMmCPzf", "signatures": ["ICLR.cc/2018/Conference/Paper121/AnonReviewer1"], "readers": ["everyone"], "writers": ["ICLR.cc/2018/Conference/Paper121/AnonReviewer1"], "content": {"title": "repy", "comment": "I appreciate the author's response and updates to the paper, and I apologize for my confusion over action classification vs action localization; this explanation makes the Charades experiments more convincing, and I've increased my score from 5 to 6 accordingly."}, "nonreaders": [], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Skip RNN: Learning to Skip State Updates in Recurrent Neural Networks", "abstract": "Recurrent Neural Networks (RNNs) continue to show outstanding performance in sequence modeling tasks. However, training RNNs on long sequences often face challenges like slow inference, vanishing gradients and difficulty in capturing long term dependencies. In backpropagation through time settings, these issues are tightly coupled with the large, sequential computational graph resulting from unfolding the RNN in time. We introduce the Skip RNN model which extends existing RNN models by learning to skip state updates and shortens the effective size of the computational graph. This model can also be encouraged to perform fewer state updates through a budget constraint. We evaluate the proposed model on various tasks and show how it can reduce the number of required RNN updates while preserving, and sometimes even improving, the performance of the baseline RNN models. Source code is publicly available at https://imatge-upc.github.io/skiprnn-2017-telecombcn/.", "pdf": "/pdf/919fe6caf1816ef3918ffc35e15fdd5da3449b44.pdf", "TL;DR": "A modification for existing RNN architectures which allows them to skip state updates while preserving the performance of the original architectures.", "paperhash": "campos|skip_rnn_learning_to_skip_state_updates_in_recurrent_neural_networks", "_bibtex": "@inproceedings{\ncampos2018skip,\ntitle={Skip {RNN}: Learning to Skip State Updates in Recurrent Neural Networks},\nauthor={V\u00edctor Campos and Brendan Jou and Xavier Gir\u00f3-i-Nieto and Jordi Torres and Shih-Fu Chang},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=HkwVAXyCW},\n}", "keywords": ["recurrent neural networks", "dynamic learning", "conditional computation"], "authors": ["V\u00edctor Campos", "Brendan Jou", "Xavier Gir\u00f3-i-Nieto", "Jordi Torres", "Shih-Fu Chang"], "authorids": ["victor.campos@bsc.es", "bjou@google.com", "xavier.giro@upc.edu", "jordi.torres@bsc.es", "shih.fu.chang@columbia.edu"]}, "tags": [], "invitation": {"rdate": null, "duedate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "tmdate": 1516825738931, "id": "ICLR.cc/2018/Conference/-/Paper121/Official_Comment", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "reply": {"replyto": null, "forum": "HkwVAXyCW", "writers": {"values-regex": "ICLR.cc/2018/Conference/Paper121/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper121/Authors|ICLR.cc/2018/Conference/Paper121/Area_Chair|ICLR.cc/2018/Conference/Program_Chairs"}, "signatures": {"values-regex": "ICLR.cc/2018/Conference/Paper121/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper121/Authors|ICLR.cc/2018/Conference/Paper121/Area_Chair|ICLR.cc/2018/Conference/Program_Chairs", "description": "How your identity will be displayed with the above content."}, "readers": {"description": "The users who will be allowed to read the above content.", "value-dropdown": ["everyone", "ICLR.cc/2018/Conference/Paper121/Authors_and_Higher", "ICLR.cc/2018/Conference/Paper121/Reviewers_and_Higher", "ICLR.cc/2018/Conference/Paper121/Area_Chairs_and_Higher", "ICLR.cc/2018/Conference/Program_Chairs"]}, "content": {"title": {"required": true, "order": 0, "description": "Brief summary of your comment.", "value-regex": ".{1,500}"}, "comment": {"required": true, "order": 1, "description": "Your comment or reply (max 5000 characters).", "value-regex": "[\\S\\s]{1,5000}"}}}, "nonreaders": [], "noninvitees": [], "invitees": ["ICLR.cc/2018/Conference/Paper121/Reviewers", "ICLR.cc/2018/Conference/Paper121/Authors", "ICLR.cc/2018/Conference/Paper121/Area_Chair", "ICLR.cc/2018/Conference/Program_Chairs"], "cdate": 1516825738931}}}, {"tddate": null, "ddate": null, "original": null, "tmdate": 1516580936297, "tcdate": 1511890750499, "number": 3, "cdate": 1511890750499, "id": "SyUH1Qjez", "invitation": "ICLR.cc/2018/Conference/-/Paper121/Official_Review", "forum": "HkwVAXyCW", "replyto": "HkwVAXyCW", "signatures": ["ICLR.cc/2018/Conference/Paper121/AnonReviewer2"], "readers": ["everyone"], "content": {"title": "Review", "rating": "6: Marginally above acceptance threshold", "review": "The authors proposed a novel RNN model where both the input and the state update of the recurrent cells are skipped adaptively for some time steps. The proposed models are learned by imposing a soft constraint on the computational budget to encourage skipping redundant input time steps. The experiments in the paper demonstrated skip RNNs outperformed regular LSTMs and GRUs o thee addition, pixel MNIST and video action recognition tasks.\n\n\n\nStrength:\n- The experimental results on the simple skip RNNs have shown a good improvement over the previous results.\n\nWeakness:\n- Although the paper shows that skip RNN worked well, I found the appropriate baseline is lacking here. Comparable baselines, I believe, are regular LSTM/GRU whose inputs are randomly dropped out during training.\n\n- Most of the experiments in the main paper are on toy tasks with small LSTMs. I thought the main selling point of the method is the computational gain. Would it make more sense to show that on large RNNs with thousands of hidden units? After going over the additional experiments in the appendix, and I find the three results shown in the main paper seem cherry-picked, and it will be good to include more NLP tasks.", "confidence": "4: The reviewer is confident but not absolutely certain that the evaluation is correct"}, "writers": [], "nonreaders": [], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": true, "forumContent": {"title": "Skip RNN: Learning to Skip State Updates in Recurrent Neural Networks", "abstract": "Recurrent Neural Networks (RNNs) continue to show outstanding performance in sequence modeling tasks. However, training RNNs on long sequences often face challenges like slow inference, vanishing gradients and difficulty in capturing long term dependencies. In backpropagation through time settings, these issues are tightly coupled with the large, sequential computational graph resulting from unfolding the RNN in time. We introduce the Skip RNN model which extends existing RNN models by learning to skip state updates and shortens the effective size of the computational graph. This model can also be encouraged to perform fewer state updates through a budget constraint. We evaluate the proposed model on various tasks and show how it can reduce the number of required RNN updates while preserving, and sometimes even improving, the performance of the baseline RNN models. Source code is publicly available at https://imatge-upc.github.io/skiprnn-2017-telecombcn/.", "pdf": "/pdf/919fe6caf1816ef3918ffc35e15fdd5da3449b44.pdf", "TL;DR": "A modification for existing RNN architectures which allows them to skip state updates while preserving the performance of the original architectures.", "paperhash": "campos|skip_rnn_learning_to_skip_state_updates_in_recurrent_neural_networks", "_bibtex": "@inproceedings{\ncampos2018skip,\ntitle={Skip {RNN}: Learning to Skip State Updates in Recurrent Neural Networks},\nauthor={V\u00edctor Campos and Brendan Jou and Xavier Gir\u00f3-i-Nieto and Jordi Torres and Shih-Fu Chang},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=HkwVAXyCW},\n}", "keywords": ["recurrent neural networks", "dynamic learning", "conditional computation"], "authors": ["V\u00edctor Campos", "Brendan Jou", "Xavier Gir\u00f3-i-Nieto", "Jordi Torres", "Shih-Fu Chang"], "authorids": ["victor.campos@bsc.es", "bjou@google.com", "xavier.giro@upc.edu", "jordi.torres@bsc.es", "shih.fu.chang@columbia.edu"]}, "tags": [], "invitation": {"rdate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "duedate": 1511845199000, "tmdate": 1515642395524, "id": "ICLR.cc/2018/Conference/-/Paper121/Official_Review", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "invitees": ["ICLR.cc/2018/Conference/Paper121/Reviewers"], "noninvitees": ["ICLR.cc/2018/Conference/Paper121/AnonReviewer1", "ICLR.cc/2018/Conference/Paper121/AnonReviewer3", "ICLR.cc/2018/Conference/Paper121/AnonReviewer2"], "reply": {"forum": "HkwVAXyCW", "replyto": "HkwVAXyCW", "writers": {"values": []}, "signatures": {"values-regex": "ICLR.cc/2018/Conference/Paper121/AnonReviewer[0-9]+", "description": "How your identity will be displayed with the above content."}, "readers": {"description": "The users who will be allowed to read the above content.", "values": ["everyone"]}, "content": {"title": {"required": true, "order": 1, "description": "Brief summary of your review.", "value-regex": ".{0,500}"}, "review": {"required": true, "order": 2, "description": "Please provide an evaluation of the quality, clarity, originality and significance of this work, including a list of its pros and cons.", "value-regex": "[\\S\\s]{1,200000}"}, "rating": {"required": true, "order": 3, "value-dropdown": ["10: Top 5% of accepted papers, seminal paper", "9: Top 15% of accepted papers, strong accept", "8: Top 50% of accepted papers, clear accept", "7: Good paper, accept", "6: Marginally above acceptance threshold", "5: Marginally below acceptance threshold", "4: Ok but not good enough - rejection", "3: Clear rejection", "2: Strong rejection", "1: Trivial or wrong"]}, "confidence": {"required": true, "order": 4, "value-radio": ["5: The reviewer is absolutely certain that the evaluation is correct and very familiar with the relevant literature", "4: The reviewer is confident but not absolutely certain that the evaluation is correct", "3: The reviewer is fairly confident that the evaluation is correct", "2: The reviewer is willing to defend the evaluation, but it is quite likely that the reviewer did not understand central parts of the paper", "1: The reviewer's evaluation is an educated guess"]}}}, "nonreaders": [], "expdate": 1519621199000, "cdate": 1515642395524}}}, {"tddate": null, "ddate": null, "tmdate": 1516580917377, "tcdate": 1516580917377, "number": 7, "cdate": 1516580917377, "id": "HJ6Ve2MHz", "invitation": "ICLR.cc/2018/Conference/-/Paper121/Official_Comment", "forum": "HkwVAXyCW", "replyto": "HJwcGAPMG", "signatures": ["ICLR.cc/2018/Conference/Paper121/AnonReviewer2"], "readers": ["everyone"], "writers": ["ICLR.cc/2018/Conference/Paper121/AnonReviewer2"], "content": {"title": "reply", "comment": "I would like to thank the authors for their reply. The new experiments with randomly dropout baseline look compiling. My only concern is the performance of the random baseline in Table 3 is as good as the best skip GRU regarding mAP. The latest revision has cleared some of my concerns in the initial review. I decided to increase the review score from 5 to 6."}, "nonreaders": [], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Skip RNN: Learning to Skip State Updates in Recurrent Neural Networks", "abstract": "Recurrent Neural Networks (RNNs) continue to show outstanding performance in sequence modeling tasks. However, training RNNs on long sequences often face challenges like slow inference, vanishing gradients and difficulty in capturing long term dependencies. In backpropagation through time settings, these issues are tightly coupled with the large, sequential computational graph resulting from unfolding the RNN in time. We introduce the Skip RNN model which extends existing RNN models by learning to skip state updates and shortens the effective size of the computational graph. This model can also be encouraged to perform fewer state updates through a budget constraint. We evaluate the proposed model on various tasks and show how it can reduce the number of required RNN updates while preserving, and sometimes even improving, the performance of the baseline RNN models. Source code is publicly available at https://imatge-upc.github.io/skiprnn-2017-telecombcn/.", "pdf": "/pdf/919fe6caf1816ef3918ffc35e15fdd5da3449b44.pdf", "TL;DR": "A modification for existing RNN architectures which allows them to skip state updates while preserving the performance of the original architectures.", "paperhash": "campos|skip_rnn_learning_to_skip_state_updates_in_recurrent_neural_networks", "_bibtex": "@inproceedings{\ncampos2018skip,\ntitle={Skip {RNN}: Learning to Skip State Updates in Recurrent Neural Networks},\nauthor={V\u00edctor Campos and Brendan Jou and Xavier Gir\u00f3-i-Nieto and Jordi Torres and Shih-Fu Chang},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=HkwVAXyCW},\n}", "keywords": ["recurrent neural networks", "dynamic learning", "conditional computation"], "authors": ["V\u00edctor Campos", "Brendan Jou", "Xavier Gir\u00f3-i-Nieto", "Jordi Torres", "Shih-Fu Chang"], "authorids": ["victor.campos@bsc.es", "bjou@google.com", "xavier.giro@upc.edu", "jordi.torres@bsc.es", "shih.fu.chang@columbia.edu"]}, "tags": [], "invitation": {"rdate": null, "duedate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "tmdate": 1516825738931, "id": "ICLR.cc/2018/Conference/-/Paper121/Official_Comment", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "reply": {"replyto": null, "forum": "HkwVAXyCW", "writers": {"values-regex": "ICLR.cc/2018/Conference/Paper121/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper121/Authors|ICLR.cc/2018/Conference/Paper121/Area_Chair|ICLR.cc/2018/Conference/Program_Chairs"}, "signatures": {"values-regex": "ICLR.cc/2018/Conference/Paper121/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper121/Authors|ICLR.cc/2018/Conference/Paper121/Area_Chair|ICLR.cc/2018/Conference/Program_Chairs", "description": "How your identity will be displayed with the above content."}, "readers": {"description": "The users who will be allowed to read the above content.", "value-dropdown": ["everyone", "ICLR.cc/2018/Conference/Paper121/Authors_and_Higher", "ICLR.cc/2018/Conference/Paper121/Reviewers_and_Higher", "ICLR.cc/2018/Conference/Paper121/Area_Chairs_and_Higher", "ICLR.cc/2018/Conference/Program_Chairs"]}, "content": {"title": {"required": true, "order": 0, "description": "Brief summary of your comment.", "value-regex": ".{1,500}"}, "comment": {"required": true, "order": 1, "description": "Your comment or reply (max 5000 characters).", "value-regex": "[\\S\\s]{1,5000}"}}}, "nonreaders": [], "noninvitees": [], "invitees": ["ICLR.cc/2018/Conference/Paper121/Reviewers", "ICLR.cc/2018/Conference/Paper121/Authors", "ICLR.cc/2018/Conference/Paper121/Area_Chair", "ICLR.cc/2018/Conference/Program_Chairs"], "cdate": 1516825738931}}}, {"tddate": null, "ddate": null, "original": null, "tmdate": 1515642395582, "tcdate": 1511753705761, "number": 2, "cdate": 1511753705761, "id": "BkfgO-FgG", "invitation": "ICLR.cc/2018/Conference/-/Paper121/Official_Review", "forum": "HkwVAXyCW", "replyto": "HkwVAXyCW", "signatures": ["ICLR.cc/2018/Conference/Paper121/AnonReviewer3"], "readers": ["everyone"], "content": {"title": "interesting idea. requires more experiment to be convincing.", "rating": "6: Marginally above acceptance threshold", "review": "This paper proposes an idea to do faster RNN inference via skip RNN state updates. \nI like the idea of the paper, in particular the design which enables calculating the number of steps to skip in advance. But the experiments are not convincing enough. First the tasks it was tested on are very simple -- 2 synthetic tasks plus 1 small-scaled task. I'd like to see the idea works on larger scale problems -- as that is where the computation/speed matters. Also besides the number of updates reported in table, I think the wall-clock time for inference should also be reported, to demonstrate what the paper is trying to claim.\n\nMinor -- \nCite Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computation by Yoshua Bengio, Nicholas Leonard and Aaron Courville for straight-through estimator.", "confidence": "4: The reviewer is confident but not absolutely certain that the evaluation is correct"}, "writers": [], "nonreaders": [], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Skip RNN: Learning to Skip State Updates in Recurrent Neural Networks", "abstract": "Recurrent Neural Networks (RNNs) continue to show outstanding performance in sequence modeling tasks. However, training RNNs on long sequences often face challenges like slow inference, vanishing gradients and difficulty in capturing long term dependencies. In backpropagation through time settings, these issues are tightly coupled with the large, sequential computational graph resulting from unfolding the RNN in time. We introduce the Skip RNN model which extends existing RNN models by learning to skip state updates and shortens the effective size of the computational graph. This model can also be encouraged to perform fewer state updates through a budget constraint. We evaluate the proposed model on various tasks and show how it can reduce the number of required RNN updates while preserving, and sometimes even improving, the performance of the baseline RNN models. Source code is publicly available at https://imatge-upc.github.io/skiprnn-2017-telecombcn/.", "pdf": "/pdf/919fe6caf1816ef3918ffc35e15fdd5da3449b44.pdf", "TL;DR": "A modification for existing RNN architectures which allows them to skip state updates while preserving the performance of the original architectures.", "paperhash": "campos|skip_rnn_learning_to_skip_state_updates_in_recurrent_neural_networks", "_bibtex": "@inproceedings{\ncampos2018skip,\ntitle={Skip {RNN}: Learning to Skip State Updates in Recurrent Neural Networks},\nauthor={V\u00edctor Campos and Brendan Jou and Xavier Gir\u00f3-i-Nieto and Jordi Torres and Shih-Fu Chang},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=HkwVAXyCW},\n}", "keywords": ["recurrent neural networks", "dynamic learning", "conditional computation"], "authors": ["V\u00edctor Campos", "Brendan Jou", "Xavier Gir\u00f3-i-Nieto", "Jordi Torres", "Shih-Fu Chang"], "authorids": ["victor.campos@bsc.es", "bjou@google.com", "xavier.giro@upc.edu", "jordi.torres@bsc.es", "shih.fu.chang@columbia.edu"]}, "tags": [], "invitation": {"rdate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "duedate": 1511845199000, "tmdate": 1515642395524, "id": "ICLR.cc/2018/Conference/-/Paper121/Official_Review", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "invitees": ["ICLR.cc/2018/Conference/Paper121/Reviewers"], "noninvitees": ["ICLR.cc/2018/Conference/Paper121/AnonReviewer1", "ICLR.cc/2018/Conference/Paper121/AnonReviewer3", "ICLR.cc/2018/Conference/Paper121/AnonReviewer2"], "reply": {"forum": "HkwVAXyCW", "replyto": "HkwVAXyCW", "writers": {"values": []}, "signatures": {"values-regex": "ICLR.cc/2018/Conference/Paper121/AnonReviewer[0-9]+", "description": "How your identity will be displayed with the above content."}, "readers": {"description": "The users who will be allowed to read the above content.", "values": ["everyone"]}, "content": {"title": {"required": true, "order": 1, "description": "Brief summary of your review.", "value-regex": ".{0,500}"}, "review": {"required": true, "order": 2, "description": "Please provide an evaluation of the quality, clarity, originality and significance of this work, including a list of its pros and cons.", "value-regex": "[\\S\\s]{1,200000}"}, "rating": {"required": true, "order": 3, "value-dropdown": ["10: Top 5% of accepted papers, seminal paper", "9: Top 15% of accepted papers, strong accept", "8: Top 50% of accepted papers, clear accept", "7: Good paper, accept", "6: Marginally above acceptance threshold", "5: Marginally below acceptance threshold", "4: Ok but not good enough - rejection", "3: Clear rejection", "2: Strong rejection", "1: Trivial or wrong"]}, "confidence": {"required": true, "order": 4, "value-radio": ["5: The reviewer is absolutely certain that the evaluation is correct and very familiar with the relevant literature", "4: The reviewer is confident but not absolutely certain that the evaluation is correct", "3: The reviewer is fairly confident that the evaluation is correct", "2: The reviewer is willing to defend the evaluation, but it is quite likely that the reviewer did not understand central parts of the paper", "1: The reviewer's evaluation is an educated guess"]}}}, "nonreaders": [], "expdate": 1519621199000, "cdate": 1515642395524}}}, {"tddate": null, "ddate": null, "tmdate": 1513864950847, "tcdate": 1513771790781, "number": 5, "cdate": 1513771790781, "id": "BywMmCPzf", "invitation": "ICLR.cc/2018/Conference/-/Paper121/Official_Comment", "forum": "HkwVAXyCW", "replyto": "HkmeI2vxM", "signatures": ["ICLR.cc/2018/Conference/Paper121/Authors"], "readers": ["everyone"], "writers": ["ICLR.cc/2018/Conference/Paper121/Authors"], "content": {"title": "Reply to AnonReviewer1", "comment": "Q: Include prior published results of the same tasks\n\nA: Following the suggestion from the reviewer, we added previously published results and their implementation context for all tasks mentioned by the reviewer: MNIST, Charades, UCF-101 and IMDB. They were added to the tables when possible, or to the discussion only otherwise (e.g. results from other works wouldn\u2019t match the table layout for IMDB). \n\n\nQ: low performance on Charades dataset\n\nA: Regarding the performance in temporal action localization task on Charades, we would like to highlight that we report results for the action localization task (i.e. a many-to-many task where an output is emitted for each input frame). However, the results reported in [5] belong to the action classification task (i.e. a many-to-one task where a single output is emitted for the whole video). To the best of our knowledge, the best result for a CNN+LSTM architecture like ours on the localization task is 9.60% (Table 2 in [6], results without post-processing). However, in [6] they use both streams from a Two-Stream CNN (RGB+Flow) whereas we use the RGB stream only. Although this yields a 0.58% mAP increase with respect to our best performing model, using both streams results in approximately a 2x increase in computation (# FLOPs) and memory footprint, plus an additional pre-processing step to compute the optical flow from the input frames. We are not aware of any other work using RGB only with CNN+LSTM on this dataset and task. It is also interesting to notice that our models learn which frames need to be attended without being given explicit motion information as input."}, "nonreaders": [], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Skip RNN: Learning to Skip State Updates in Recurrent Neural Networks", "abstract": "Recurrent Neural Networks (RNNs) continue to show outstanding performance in sequence modeling tasks. However, training RNNs on long sequences often face challenges like slow inference, vanishing gradients and difficulty in capturing long term dependencies. In backpropagation through time settings, these issues are tightly coupled with the large, sequential computational graph resulting from unfolding the RNN in time. We introduce the Skip RNN model which extends existing RNN models by learning to skip state updates and shortens the effective size of the computational graph. This model can also be encouraged to perform fewer state updates through a budget constraint. We evaluate the proposed model on various tasks and show how it can reduce the number of required RNN updates while preserving, and sometimes even improving, the performance of the baseline RNN models. Source code is publicly available at https://imatge-upc.github.io/skiprnn-2017-telecombcn/.", "pdf": "/pdf/919fe6caf1816ef3918ffc35e15fdd5da3449b44.pdf", "TL;DR": "A modification for existing RNN architectures which allows them to skip state updates while preserving the performance of the original architectures.", "paperhash": "campos|skip_rnn_learning_to_skip_state_updates_in_recurrent_neural_networks", "_bibtex": "@inproceedings{\ncampos2018skip,\ntitle={Skip {RNN}: Learning to Skip State Updates in Recurrent Neural Networks},\nauthor={V\u00edctor Campos and Brendan Jou and Xavier Gir\u00f3-i-Nieto and Jordi Torres and Shih-Fu Chang},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=HkwVAXyCW},\n}", "keywords": ["recurrent neural networks", "dynamic learning", "conditional computation"], "authors": ["V\u00edctor Campos", "Brendan Jou", "Xavier Gir\u00f3-i-Nieto", "Jordi Torres", "Shih-Fu Chang"], "authorids": ["victor.campos@bsc.es", "bjou@google.com", "xavier.giro@upc.edu", "jordi.torres@bsc.es", "shih.fu.chang@columbia.edu"]}, "tags": [], "invitation": {"rdate": null, "duedate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "tmdate": 1516825738931, "id": "ICLR.cc/2018/Conference/-/Paper121/Official_Comment", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "reply": {"replyto": null, "forum": "HkwVAXyCW", "writers": {"values-regex": "ICLR.cc/2018/Conference/Paper121/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper121/Authors|ICLR.cc/2018/Conference/Paper121/Area_Chair|ICLR.cc/2018/Conference/Program_Chairs"}, "signatures": {"values-regex": "ICLR.cc/2018/Conference/Paper121/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper121/Authors|ICLR.cc/2018/Conference/Paper121/Area_Chair|ICLR.cc/2018/Conference/Program_Chairs", "description": "How your identity will be displayed with the above content."}, "readers": {"description": "The users who will be allowed to read the above content.", "value-dropdown": ["everyone", "ICLR.cc/2018/Conference/Paper121/Authors_and_Higher", "ICLR.cc/2018/Conference/Paper121/Reviewers_and_Higher", "ICLR.cc/2018/Conference/Paper121/Area_Chairs_and_Higher", "ICLR.cc/2018/Conference/Program_Chairs"]}, "content": {"title": {"required": true, "order": 0, "description": "Brief summary of your comment.", "value-regex": ".{1,500}"}, "comment": {"required": true, "order": 1, "description": "Your comment or reply (max 5000 characters).", "value-regex": "[\\S\\s]{1,5000}"}}}, "nonreaders": [], "noninvitees": [], "invitees": ["ICLR.cc/2018/Conference/Paper121/Reviewers", "ICLR.cc/2018/Conference/Paper121/Authors", "ICLR.cc/2018/Conference/Paper121/Area_Chair", "ICLR.cc/2018/Conference/Program_Chairs"], "cdate": 1516825738931}}}, {"tddate": null, "ddate": null, "tmdate": 1513771700915, "tcdate": 1513771700915, "number": 4, "cdate": 1513771700915, "id": "SyThG0DMz", "invitation": "ICLR.cc/2018/Conference/-/Paper121/Official_Comment", "forum": "HkwVAXyCW", "replyto": "BkfgO-FgG", "signatures": ["ICLR.cc/2018/Conference/Paper121/Authors"], "readers": ["everyone"], "writers": ["ICLR.cc/2018/Conference/Paper121/Authors"], "content": {"title": "Reply to AnonReviewer3", "comment": "Q: Wall-clock time for inferencing should be reported.\n\nA: Wall-clock timing is highly dependent on factors such as hardware, framework and implementation, thus making it difficult to isolate the impact of the model. This is why we originally reported the number of sequential steps (i.e. state updates) performed by each model. As an alternative to wall-clock timing, we updated the manuscript to report the number of floating point operations (FLOPs) per sequence. This measure is also independent of external factors such as hardware/software while being representative of the computational load of each model. Although we believe that wall-clock time is not very informative, we are willing to report it if the reviewer still thinks that it will improve the quality of the paper.\n\n\n\nQ: Cite paper by Bengio et al.\n\nA: The paper by Bengio et al. is cited for the ST estimator in the updated version of the manuscript."}, "nonreaders": [], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Skip RNN: Learning to Skip State Updates in Recurrent Neural Networks", "abstract": "Recurrent Neural Networks (RNNs) continue to show outstanding performance in sequence modeling tasks. However, training RNNs on long sequences often face challenges like slow inference, vanishing gradients and difficulty in capturing long term dependencies. In backpropagation through time settings, these issues are tightly coupled with the large, sequential computational graph resulting from unfolding the RNN in time. We introduce the Skip RNN model which extends existing RNN models by learning to skip state updates and shortens the effective size of the computational graph. This model can also be encouraged to perform fewer state updates through a budget constraint. We evaluate the proposed model on various tasks and show how it can reduce the number of required RNN updates while preserving, and sometimes even improving, the performance of the baseline RNN models. Source code is publicly available at https://imatge-upc.github.io/skiprnn-2017-telecombcn/.", "pdf": "/pdf/919fe6caf1816ef3918ffc35e15fdd5da3449b44.pdf", "TL;DR": "A modification for existing RNN architectures which allows them to skip state updates while preserving the performance of the original architectures.", "paperhash": "campos|skip_rnn_learning_to_skip_state_updates_in_recurrent_neural_networks", "_bibtex": "@inproceedings{\ncampos2018skip,\ntitle={Skip {RNN}: Learning to Skip State Updates in Recurrent Neural Networks},\nauthor={V\u00edctor Campos and Brendan Jou and Xavier Gir\u00f3-i-Nieto and Jordi Torres and Shih-Fu Chang},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=HkwVAXyCW},\n}", "keywords": ["recurrent neural networks", "dynamic learning", "conditional computation"], "authors": ["V\u00edctor Campos", "Brendan Jou", "Xavier Gir\u00f3-i-Nieto", "Jordi Torres", "Shih-Fu Chang"], "authorids": ["victor.campos@bsc.es", "bjou@google.com", "xavier.giro@upc.edu", "jordi.torres@bsc.es", "shih.fu.chang@columbia.edu"]}, "tags": [], "invitation": {"rdate": null, "duedate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "tmdate": 1516825738931, "id": "ICLR.cc/2018/Conference/-/Paper121/Official_Comment", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "reply": {"replyto": null, "forum": "HkwVAXyCW", "writers": {"values-regex": "ICLR.cc/2018/Conference/Paper121/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper121/Authors|ICLR.cc/2018/Conference/Paper121/Area_Chair|ICLR.cc/2018/Conference/Program_Chairs"}, "signatures": {"values-regex": "ICLR.cc/2018/Conference/Paper121/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper121/Authors|ICLR.cc/2018/Conference/Paper121/Area_Chair|ICLR.cc/2018/Conference/Program_Chairs", "description": "How your identity will be displayed with the above content."}, "readers": {"description": "The users who will be allowed to read the above content.", "value-dropdown": ["everyone", "ICLR.cc/2018/Conference/Paper121/Authors_and_Higher", "ICLR.cc/2018/Conference/Paper121/Reviewers_and_Higher", "ICLR.cc/2018/Conference/Paper121/Area_Chairs_and_Higher", "ICLR.cc/2018/Conference/Program_Chairs"]}, "content": {"title": {"required": true, "order": 0, "description": "Brief summary of your comment.", "value-regex": ".{1,500}"}, "comment": {"required": true, "order": 1, "description": "Your comment or reply (max 5000 characters).", "value-regex": "[\\S\\s]{1,5000}"}}}, "nonreaders": [], "noninvitees": [], "invitees": ["ICLR.cc/2018/Conference/Paper121/Reviewers", "ICLR.cc/2018/Conference/Paper121/Authors", "ICLR.cc/2018/Conference/Paper121/Area_Chair", "ICLR.cc/2018/Conference/Program_Chairs"], "cdate": 1516825738931}}}, {"tddate": null, "ddate": null, "tmdate": 1513771663338, "tcdate": 1513771663338, "number": 3, "cdate": 1513771663338, "id": "HJwcGAPMG", "invitation": "ICLR.cc/2018/Conference/-/Paper121/Official_Comment", "forum": "HkwVAXyCW", "replyto": "SyUH1Qjez", "signatures": ["ICLR.cc/2018/Conference/Paper121/Authors"], "readers": ["everyone"], "writers": ["ICLR.cc/2018/Conference/Paper121/Authors"], "content": {"title": "Reply to AnonReviewer 2", "comment": "Q: Comparison with baselines randomly dropping inputs is missing.\n\nA: We actually have reported the random input dropping baseline for the MNIST task. In the revised version of the paper, we have added results of random dropping baseline for the adding task and Charades. In all cases, the proposed model learns the best ways to skip states (instead randomly) and demonstrated clear performance gains over the random dropping baseline. Note here we assume when random dropping is done, both the input and the state update operation are skipped. We do not consider the option that only input is dropped and the state is still updated since it does not achieve the objective of saving computation. \n\n\n\nQ: the three experiments included in the main paper seemed cherry-picked. \n\nA: We have included a large diverse set of experiments in the Appendix including signal frequency discrimination, sentiment analysis on IMDB movie reviews (text), and video action classification. Far from cherry-picking test results, our goal is to demonstrate the general applicability of the proposed model in various tasks involving data of different modalities (signal, text, and video). We will be happy to move any of the experiments from Appendix to the main paper.\n"}, "nonreaders": [], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Skip RNN: Learning to Skip State Updates in Recurrent Neural Networks", "abstract": "Recurrent Neural Networks (RNNs) continue to show outstanding performance in sequence modeling tasks. However, training RNNs on long sequences often face challenges like slow inference, vanishing gradients and difficulty in capturing long term dependencies. In backpropagation through time settings, these issues are tightly coupled with the large, sequential computational graph resulting from unfolding the RNN in time. We introduce the Skip RNN model which extends existing RNN models by learning to skip state updates and shortens the effective size of the computational graph. This model can also be encouraged to perform fewer state updates through a budget constraint. We evaluate the proposed model on various tasks and show how it can reduce the number of required RNN updates while preserving, and sometimes even improving, the performance of the baseline RNN models. Source code is publicly available at https://imatge-upc.github.io/skiprnn-2017-telecombcn/.", "pdf": "/pdf/919fe6caf1816ef3918ffc35e15fdd5da3449b44.pdf", "TL;DR": "A modification for existing RNN architectures which allows them to skip state updates while preserving the performance of the original architectures.", "paperhash": "campos|skip_rnn_learning_to_skip_state_updates_in_recurrent_neural_networks", "_bibtex": "@inproceedings{\ncampos2018skip,\ntitle={Skip {RNN}: Learning to Skip State Updates in Recurrent Neural Networks},\nauthor={V\u00edctor Campos and Brendan Jou and Xavier Gir\u00f3-i-Nieto and Jordi Torres and Shih-Fu Chang},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=HkwVAXyCW},\n}", "keywords": ["recurrent neural networks", "dynamic learning", "conditional computation"], "authors": ["V\u00edctor Campos", "Brendan Jou", "Xavier Gir\u00f3-i-Nieto", "Jordi Torres", "Shih-Fu Chang"], "authorids": ["victor.campos@bsc.es", "bjou@google.com", "xavier.giro@upc.edu", "jordi.torres@bsc.es", "shih.fu.chang@columbia.edu"]}, "tags": [], "invitation": {"rdate": null, "duedate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "tmdate": 1516825738931, "id": "ICLR.cc/2018/Conference/-/Paper121/Official_Comment", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "reply": {"replyto": null, "forum": "HkwVAXyCW", "writers": {"values-regex": "ICLR.cc/2018/Conference/Paper121/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper121/Authors|ICLR.cc/2018/Conference/Paper121/Area_Chair|ICLR.cc/2018/Conference/Program_Chairs"}, "signatures": {"values-regex": "ICLR.cc/2018/Conference/Paper121/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper121/Authors|ICLR.cc/2018/Conference/Paper121/Area_Chair|ICLR.cc/2018/Conference/Program_Chairs", "description": "How your identity will be displayed with the above content."}, "readers": {"description": "The users who will be allowed to read the above content.", "value-dropdown": ["everyone", "ICLR.cc/2018/Conference/Paper121/Authors_and_Higher", "ICLR.cc/2018/Conference/Paper121/Reviewers_and_Higher", "ICLR.cc/2018/Conference/Paper121/Area_Chairs_and_Higher", "ICLR.cc/2018/Conference/Program_Chairs"]}, "content": {"title": {"required": true, "order": 0, "description": "Brief summary of your comment.", "value-regex": ".{1,500}"}, "comment": {"required": true, "order": 1, "description": "Your comment or reply (max 5000 characters).", "value-regex": "[\\S\\s]{1,5000}"}}}, "nonreaders": [], "noninvitees": [], "invitees": ["ICLR.cc/2018/Conference/Paper121/Reviewers", "ICLR.cc/2018/Conference/Paper121/Authors", "ICLR.cc/2018/Conference/Paper121/Area_Chair", "ICLR.cc/2018/Conference/Program_Chairs"], "cdate": 1516825738931}}}, {"tddate": null, "ddate": null, "tmdate": 1513771570804, "tcdate": 1513771570804, "number": 2, "cdate": 1513771570804, "id": "HJoVzADMM", "invitation": "ICLR.cc/2018/Conference/-/Paper121/Official_Comment", "forum": "HkwVAXyCW", "replyto": "HkwVAXyCW", "signatures": ["ICLR.cc/2018/Conference/Paper121/Authors"], "readers": ["everyone"], "writers": ["ICLR.cc/2018/Conference/Paper121/Authors"], "content": {"title": "On the scale of the experiments & updates to the paper", "comment": "We thank reviewers for their valuable comments. We respond to the main concerns below and in individual replies to each reviewer. \n\nR2 and R3 \nQ: Task scale and model size too small. Should run experiments with a large number of hidden units.\n\nA:\n- SkipRNN has indeed a larger advantage over regular RNNs when the model is larger, since the computational savings of skipped states are larger. However, this does not necessarily require RNNs with thousands of hidden units, as the main bulk of computation may come from other associated components of the full architecture, e.g. the CNN encoder in video tasks. It\u2019s important to note when a RNN state update is skipped for a time step, all its preceding elements in the computation graph for that time step are also skipped. For example, in the case of CNN encoder in video tasks, the computational cost of these elements is typically very significant. The updated version of the manuscript reports the actual # of FLOPs/sequence and shows how SkipRNN models can result in large savings in computation-intensive tasks such as video action localization. We estimated the # of floating point operations based on the actual operations involved in the input encoder and the RNN model. \n\n- Please also note that the size of the studied RNNs in our paper is the same as or even larger than those reported in related methods, e.g. [1, 2, 3]. The largest model in these works is composed by 2 LSTM layers with 256 units each, while we have reported results for 2 layers with 512 units each in the appendix.\nWe believe that the size of the considered tasks is also comparable to those in [1, 2, 3]. Despite some of them using larger datasets in terms of number of examples, their inputs have low dimensionality (e.g. 300-d pre-trained word embeddings) compared to the ones in some of our experiments (e.g. up to 4096-d for video tasks). \n\n\n\nUpdates to the paper:\n\n- Add FLOPs to the tables\n- Moved the description of the random skipping baseline to the beginning of the experiments section\n- Add skipping baselines for the adding task (plus discussion)\n- Add skipping baselines for Charades (plus discussion)\n- Evaluate models on Charades sampling 100 frames/video instead of 25, which should be more accurate for studying models performing different number of state updates.\n- Add SOTA results for recurrent models on MNIST\n- Add comparison to Sigurdsson et al. (CVPR 2017) for Charades\n- Cite prior work and SOTA for IMDB\n- Add SOTA results on UCF-101 (Carreira & Zisserman, 2017)\n\n\n\n\n[1] Neil et al., Phased LSTM: Accelerating Recurrent Network Training for Long or Event-based Sequences, NIPS 2017\n[2] Yu et al., Learning to Skim Text, ACL 2017\n[3] Anonymous authors, Neural Speed Reading via Skim-RNN, ICLR 2018 submission\n"}, "nonreaders": [], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Skip RNN: Learning to Skip State Updates in Recurrent Neural Networks", "abstract": "Recurrent Neural Networks (RNNs) continue to show outstanding performance in sequence modeling tasks. However, training RNNs on long sequences often face challenges like slow inference, vanishing gradients and difficulty in capturing long term dependencies. In backpropagation through time settings, these issues are tightly coupled with the large, sequential computational graph resulting from unfolding the RNN in time. We introduce the Skip RNN model which extends existing RNN models by learning to skip state updates and shortens the effective size of the computational graph. This model can also be encouraged to perform fewer state updates through a budget constraint. We evaluate the proposed model on various tasks and show how it can reduce the number of required RNN updates while preserving, and sometimes even improving, the performance of the baseline RNN models. Source code is publicly available at https://imatge-upc.github.io/skiprnn-2017-telecombcn/.", "pdf": "/pdf/919fe6caf1816ef3918ffc35e15fdd5da3449b44.pdf", "TL;DR": "A modification for existing RNN architectures which allows them to skip state updates while preserving the performance of the original architectures.", "paperhash": "campos|skip_rnn_learning_to_skip_state_updates_in_recurrent_neural_networks", "_bibtex": "@inproceedings{\ncampos2018skip,\ntitle={Skip {RNN}: Learning to Skip State Updates in Recurrent Neural Networks},\nauthor={V\u00edctor Campos and Brendan Jou and Xavier Gir\u00f3-i-Nieto and Jordi Torres and Shih-Fu Chang},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=HkwVAXyCW},\n}", "keywords": ["recurrent neural networks", "dynamic learning", "conditional computation"], "authors": ["V\u00edctor Campos", "Brendan Jou", "Xavier Gir\u00f3-i-Nieto", "Jordi Torres", "Shih-Fu Chang"], "authorids": ["victor.campos@bsc.es", "bjou@google.com", "xavier.giro@upc.edu", "jordi.torres@bsc.es", "shih.fu.chang@columbia.edu"]}, "tags": [], "invitation": {"rdate": null, "duedate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "tmdate": 1516825738931, "id": "ICLR.cc/2018/Conference/-/Paper121/Official_Comment", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "reply": {"replyto": null, "forum": "HkwVAXyCW", "writers": {"values-regex": "ICLR.cc/2018/Conference/Paper121/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper121/Authors|ICLR.cc/2018/Conference/Paper121/Area_Chair|ICLR.cc/2018/Conference/Program_Chairs"}, "signatures": {"values-regex": "ICLR.cc/2018/Conference/Paper121/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper121/Authors|ICLR.cc/2018/Conference/Paper121/Area_Chair|ICLR.cc/2018/Conference/Program_Chairs", "description": "How your identity will be displayed with the above content."}, "readers": {"description": "The users who will be allowed to read the above content.", "value-dropdown": ["everyone", "ICLR.cc/2018/Conference/Paper121/Authors_and_Higher", "ICLR.cc/2018/Conference/Paper121/Reviewers_and_Higher", "ICLR.cc/2018/Conference/Paper121/Area_Chairs_and_Higher", "ICLR.cc/2018/Conference/Program_Chairs"]}, "content": {"title": {"required": true, "order": 0, "description": "Brief summary of your comment.", "value-regex": ".{1,500}"}, "comment": {"required": true, "order": 1, "description": "Your comment or reply (max 5000 characters).", "value-regex": "[\\S\\s]{1,5000}"}}}, "nonreaders": [], "noninvitees": [], "invitees": ["ICLR.cc/2018/Conference/Paper121/Reviewers", "ICLR.cc/2018/Conference/Paper121/Authors", "ICLR.cc/2018/Conference/Paper121/Area_Chair", "ICLR.cc/2018/Conference/Program_Chairs"], "cdate": 1516825738931}}}, {"tddate": null, "ddate": null, "tmdate": 1510921663759, "tcdate": 1510908834096, "number": 1, "cdate": 1510908834096, "id": "B15iQQ2kf", "invitation": "ICLR.cc/2018/Conference/-/Paper121/Official_Comment", "forum": "HkwVAXyCW", "replyto": "HkTO-f31G", "signatures": ["ICLR.cc/2018/Conference/Paper121/Authors"], "readers": ["everyone"], "writers": ["ICLR.cc/2018/Conference/Paper121/Authors"], "content": {"title": "reply to question about Equation 1", "comment": "Thanks for pointing this out. Throughout the description of the model we use a generic parametric state transition model, S. Please note that S is not the transition model for the vanilla RNN, but a \"placeholder\" to be filled with the transition model of the RNN architecture being used (LSTM or GRU for the experiments in the paper). Should you use the vanilla RNN, S would be exactly what you wrote -- including the non-linearity. This formulation is similar to the one in [1] and abstracts our proposal from the underlying RNN cell.\n\n[1] Alex Graves. Adaptive computation time for recurrent neural networks. arXiv preprint arXiv:1603.08983, 2016."}, "nonreaders": [], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Skip RNN: Learning to Skip State Updates in Recurrent Neural Networks", "abstract": "Recurrent Neural Networks (RNNs) continue to show outstanding performance in sequence modeling tasks. However, training RNNs on long sequences often face challenges like slow inference, vanishing gradients and difficulty in capturing long term dependencies. In backpropagation through time settings, these issues are tightly coupled with the large, sequential computational graph resulting from unfolding the RNN in time. We introduce the Skip RNN model which extends existing RNN models by learning to skip state updates and shortens the effective size of the computational graph. This model can also be encouraged to perform fewer state updates through a budget constraint. We evaluate the proposed model on various tasks and show how it can reduce the number of required RNN updates while preserving, and sometimes even improving, the performance of the baseline RNN models. Source code is publicly available at https://imatge-upc.github.io/skiprnn-2017-telecombcn/.", "pdf": "/pdf/919fe6caf1816ef3918ffc35e15fdd5da3449b44.pdf", "TL;DR": "A modification for existing RNN architectures which allows them to skip state updates while preserving the performance of the original architectures.", "paperhash": "campos|skip_rnn_learning_to_skip_state_updates_in_recurrent_neural_networks", "_bibtex": "@inproceedings{\ncampos2018skip,\ntitle={Skip {RNN}: Learning to Skip State Updates in Recurrent Neural Networks},\nauthor={V\u00edctor Campos and Brendan Jou and Xavier Gir\u00f3-i-Nieto and Jordi Torres and Shih-Fu Chang},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=HkwVAXyCW},\n}", "keywords": ["recurrent neural networks", "dynamic learning", "conditional computation"], "authors": ["V\u00edctor Campos", "Brendan Jou", "Xavier Gir\u00f3-i-Nieto", "Jordi Torres", "Shih-Fu Chang"], "authorids": ["victor.campos@bsc.es", "bjou@google.com", "xavier.giro@upc.edu", "jordi.torres@bsc.es", "shih.fu.chang@columbia.edu"]}, "tags": [], "invitation": {"rdate": null, "duedate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "tmdate": 1516825738931, "id": "ICLR.cc/2018/Conference/-/Paper121/Official_Comment", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "reply": {"replyto": null, "forum": "HkwVAXyCW", "writers": {"values-regex": "ICLR.cc/2018/Conference/Paper121/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper121/Authors|ICLR.cc/2018/Conference/Paper121/Area_Chair|ICLR.cc/2018/Conference/Program_Chairs"}, "signatures": {"values-regex": "ICLR.cc/2018/Conference/Paper121/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper121/Authors|ICLR.cc/2018/Conference/Paper121/Area_Chair|ICLR.cc/2018/Conference/Program_Chairs", "description": "How your identity will be displayed with the above content."}, "readers": {"description": "The users who will be allowed to read the above content.", "value-dropdown": ["everyone", "ICLR.cc/2018/Conference/Paper121/Authors_and_Higher", "ICLR.cc/2018/Conference/Paper121/Reviewers_and_Higher", "ICLR.cc/2018/Conference/Paper121/Area_Chairs_and_Higher", "ICLR.cc/2018/Conference/Program_Chairs"]}, "content": {"title": {"required": true, "order": 0, "description": "Brief summary of your comment.", "value-regex": ".{1,500}"}, "comment": {"required": true, "order": 1, "description": "Your comment or reply (max 5000 characters).", "value-regex": "[\\S\\s]{1,5000}"}}}, "nonreaders": [], "noninvitees": [], "invitees": ["ICLR.cc/2018/Conference/Paper121/Reviewers", "ICLR.cc/2018/Conference/Paper121/Authors", "ICLR.cc/2018/Conference/Paper121/Area_Chair", "ICLR.cc/2018/Conference/Program_Chairs"], "cdate": 1516825738931}}}], "count": 12}
["f71efb8e910cfd7f18b3d7178ea7dfc0c0eb4186"]
{"type":"FeatureCollection","features":[{"type":"Feature","geometry":{"type":"Point","coordinates":[2.3522219000019,48.856613999999]},"properties":{"address":"Paris, France","placename":"Paris, France","title":"Store 6"}},{"type":"Feature","geometry":{"type":"Point","coordinates":[12.494248600004,41.890519800003]},"properties":{"address":"Rom, Italy","placename":"Rome, Italy","title":"Store 5"}},{"type":"Feature","geometry":{"type":"Point","coordinates":[13.406091199998,52.519171000002]},"properties":{"address":"Berlin, Germany","placename":"Berlin, Germany","title":"Store 4"}},{"type":"Feature","geometry":{"type":"Point","coordinates":[-1.5536210000024,47.218370999998]},"properties":{"address":"Nante","placename":"Nantes, France","title":"Warehouse EU"}},{"type":"Feature","geometry":{"type":"Point","coordinates":[-2.9901160000016,53.411539999998]},"properties":{"address":"Liverpool, UK","placename":"Liverpool, Merseyside, UK","title":"Store 3"}},{"type":"Feature","geometry":{"type":"Point","coordinates":[-1.4700850000015,53.381128999999]},"properties":{"address":"Sheffield, UK","placename":"Sheffield, South Yorkshire, UK","title":"Store 2"}},{"type":"Feature","geometry":{"type":"Point","coordinates":[-0.12800500000006,51.508128899997]},"properties":{"address":"London, UK","placename":"London, UK","title":"Store 1"}},{"type":"Feature","geometry":{"type":"Point","coordinates":[-2.2479260000004,53.479250999999]},"properties":{"address":"Manchester, UK","placename":"Manchester, UK","title":"Retailer"}},{"type":"Feature","geometry":{"type":"Point","coordinates":[-3.4359729999961,55.378051000001]},"properties":{"address":"GB","placename":"United Kingdom","title":"Aid Agencies"}},{"type":"Feature","geometry":{"type":"Point","coordinates":[104.195397,35.861660000001]},"properties":{"address":"china","placename":"China","title":"Lid"}},{"type":"Feature","geometry":{"type":"Point","coordinates":[104.195397,35.861660000001]},"properties":{"address":"china","placename":"China","title":"Metal"}},{"type":"Feature","geometry":{"type":"Point","coordinates":[-1.4700850000015,53.381128999999]},"properties":{"address":"Sheffield, UK","placename":"Sheffield, South Yorkshire, UK","title":"Thermal Flask"}},{"type":"Feature","geometry":{"type":"LineString","coordinates":[[104.195397,35.861660000001],[-1.4700850000015,53.381128999999]]},"properties":[]},{"type":"Feature","geometry":{"type":"LineString","coordinates":[[104.195397,35.861660000001],[-1.4700850000015,53.381128999999]]},"properties":[]},{"type":"Feature","geometry":{"type":"LineString","coordinates":[[-1.4700850000015,53.381128999999],[-3.4359729999961,55.378051000001]]},"properties":[]},{"type":"Feature","geometry":{"type":"LineString","coordinates":[[-1.4700850000015,53.381128999999],[-2.2479260000004,53.479250999999]]},"properties":[]},{"type":"Feature","geometry":{"type":"LineString","coordinates":[[-2.2479260000004,53.479250999999],[-0.12800500000006,51.508128899997]]},"properties":[]},{"type":"Feature","geometry":{"type":"LineString","coordinates":[[-2.2479260000004,53.479250999999],[-1.4700850000015,53.381128999999]]},"properties":[]},{"type":"Feature","geometry":{"type":"LineString","coordinates":[[-2.2479260000004,53.479250999999],[-2.9901160000016,53.411539999998]]},"properties":[]},{"type":"Feature","geometry":{"type":"LineString","coordinates":[[-2.2479260000004,53.479250999999],[-1.5536210000024,47.218370999998]]},"properties":[]},{"type":"Feature","geometry":{"type":"LineString","coordinates":[[-1.5536210000024,47.218370999998],[13.406091199998,52.519171000002]]},"properties":[]},{"type":"Feature","geometry":{"type":"LineString","coordinates":[[-1.5536210000024,47.218370999998],[12.494248600004,41.890519800003]]},"properties":[]},{"type":"Feature","geometry":{"type":"LineString","coordinates":[[-1.5536210000024,47.218370999998],[2.3522219000019,48.856613999999]]},"properties":[]}],"properties":{"title":"Thermo Flask","description":"","tags":""}}
{ "idam": { "enableStub": "true" }, "featureFlags": { "postBulkScan": "true" } }
{ "name": "musee-mecanique", "content_type": "image/jpeg", "date_added": "2019-06-06-045902", "url_thumb": "//res.cloudinary.com/traveltripperweb/image/upload/c_fill,g_faces,h_140,w_140/v1559811542/frk6klxpjvdwizurkbaj.jpg", "url_xsmall": "//res.cloudinary.com/traveltripperweb/image/upload/c_fit,h_300,w_300/v1559811542/frk6klxpjvdwizurkbaj.jpg", "url_small": "//res.cloudinary.com/traveltripperweb/image/upload/c_fit,h_768,w_768/v1559811542/frk6klxpjvdwizurkbaj.jpg", "url_medium": "//res.cloudinary.com/traveltripperweb/image/upload/c_fit,h_992,w_992/v1559811542/frk6klxpjvdwizurkbaj.jpg", "url_large": "//res.cloudinary.com/traveltripperweb/image/upload/c_fit,h_1200,w_1200/v1559811542/frk6klxpjvdwizurkbaj.jpg", "url_xlarge": "//res.cloudinary.com/traveltripperweb/image/upload/c_limit,h_1920,w_1920/v1559811542/frk6klxpjvdwizurkbaj.jpg", "width": 408, "height": 585, "format": "jpg", "url": "//res.cloudinary.com/traveltripperweb/image/upload/v1559811542/frk6klxpjvdwizurkbaj.jpg", "resource_type": "image", "size": 117569 }
{"poster":"Lord1289","date":"2014-10-07T18:22:29.191+0000","title":"Feral Flare","subforum":"Általános beszélgetés","up_votes":1,"down_votes":0,"body":"Már régóta nézegetem hogy mire jó a Feral Flare ? Van valami passzívja hogy magába szívja a lelkeket és az ugye gyűlik de nem értem mire jó ez ? Pedig jó lenne meg tudnom mert sokat Udyrozok akinek mindig veszek azt is... Szóval mire jó ez a feral flare ?","replies":[{"poster":"Mogo","date":"2014-10-07T18:37:16.687+0000","up_votes":2,"down_votes":0,"body":"Az alaptámadásaid többet sebeznek és gyógyítanak, és, ha megölsz egy hőst, assistolsz benne vagy megölsz egy nagy szörnyet akkor a bónusz sebzés és élettöltés nő.","replies":[{"poster":"HUNDarkTemplar","date":"2014-10-08T18:24:49.017+0000","up_votes":1,"down_votes":0,"body":"Az élettöltés növekedést már rég kiszedték és egy egy nagy nerf is volt.","replies":[]}]},{"poster":"Neithed","date":"2014-10-07T18:49:27.753+0000","up_votes":2,"down_votes":1,"body":"Nem azért de elolvasod ? mondjuk mielőtt ilyet nyitsz amúgy meg dragonkiller ott leírta","replies":[]},{"poster":"Zooty","date":"2014-10-07T18:59:18.281+0000","up_votes":1,"down_votes":1,"body":"+12 sebzés\n+30% támadási sebesség\n\nEGYEDI passzív – Csonkítás: Az alaptámadások (25 + Vadon jelzők) bónusz varázssebzést okoznak (minionok és szörnyek ellen ennek 300%-át), és találatkor 10 életerőt töltenek vissza. A gyilkosságok, az asszisztok és a nagy szörnyek megölése Vadon jelzőt ad.\n\nEz a leírás, ha megmondod melyik része nem teljesen érthető, szívesen segítek értelmezni:)","replies":[]}]}
{"HISTORY":"<!-- --><br>ColdFusion 8: Added this tag.<br>","SYNTAX":"<!-- --><br><strong>populate<\/strong> \r\n&lt;cfpdfform \r\n <strong>required<\/strong> \r\n action = &quot;populate&quot; \r\n source = &quot;<i xmlns:fn=\"http:\/\/www.w3.org\/2005\/xpath-functions\" xmlns:fo=\"http:\/\/www.w3.org\/1999\/XSL\/Format\" xmlns:xs=\"http:\/\/www.w3.org\/2001\/XMLSchema\">PDF file pathname<\/i>|<i xmlns:fn=\"http:\/\/www.w3.org\/2005\/xpath-functions\" xmlns:fo=\"http:\/\/www.w3.org\/1999\/XSL\/Format\" xmlns:xs=\"http:\/\/www.w3.org\/2001\/XMLSchema\">byte array<\/i>&quot; \r\n <strong>optional<\/strong> \r\n XMLdata = &quot;<i xmlns:fn=\"http:\/\/www.w3.org\/2005\/xpath-functions\" xmlns:fo=\"http:\/\/www.w3.org\/1999\/XSL\/Format\" xmlns:xs=\"http:\/\/www.w3.org\/2001\/XMLSchema\">XML object|XML string|XML data filename|<\/i> \r\n <i xmlns:fn=\"http:\/\/www.w3.org\/2005\/xpath-functions\" xmlns:fo=\"http:\/\/www.w3.org\/1999\/XSL\/Format\" xmlns:xs=\"http:\/\/www.w3.org\/2001\/XMLSchema\">URL that returns XML data<\/i>&quot; \r\n destination = &quot;<i xmlns:fn=\"http:\/\/www.w3.org\/2005\/xpath-functions\" xmlns:fo=\"http:\/\/www.w3.org\/1999\/XSL\/Format\" xmlns:xs=\"http:\/\/www.w3.org\/2001\/XMLSchema\">output file pathname<\/i>&quot; \r\n overwrite = &quot;yes|no&quot;\/ \r\n <strong>fdf = &quot;true|false&gt;<\/strong> &lt;!---New attribute that populates data in FDF format instead of \r\n XML with subforms and params---&gt; \r\n <strong>fdfdata = &quot;file name to be imported&quot;<\/strong> &lt;!--- New attribute populates data in FDF format \r\n from the AcroForm---&gt; \r\n<strong>read<\/strong> \r\n&lt;cfpdfform \r\n <strong>required<\/strong> \r\n action = &quot;read&quot; \r\n source = &quot;<i xmlns:fn=\"http:\/\/www.w3.org\/2005\/xpath-functions\" xmlns:fo=\"http:\/\/www.w3.org\/1999\/XSL\/Format\" xmlns:xs=\"http:\/\/www.w3.org\/2001\/XMLSchema\">pathname|byte array&quot;<\/i> \r\n <i xmlns:fn=\"http:\/\/www.w3.org\/2005\/xpath-functions\" xmlns:fo=\"http:\/\/www.w3.org\/1999\/XSL\/Format\" xmlns:xs=\"http:\/\/www.w3.org\/2001\/XMLSchema\">at least one of the following:<\/i> \r\n XMLdata = &quot;<i xmlns:fn=\"http:\/\/www.w3.org\/2005\/xpath-functions\" xmlns:fo=\"http:\/\/www.w3.org\/1999\/XSL\/Format\" xmlns:xs=\"http:\/\/www.w3.org\/2001\/XMLSchema\">variable name for XML data<\/i>&quot; \r\n result = &quot;<i xmlns:fn=\"http:\/\/www.w3.org\/2005\/xpath-functions\" xmlns:fo=\"http:\/\/www.w3.org\/1999\/XSL\/Format\" xmlns:xs=\"http:\/\/www.w3.org\/2001\/XMLSchema\">structure containing form field values<\/i>&quot; \r\n <strong>optional<\/strong> \r\n overwrite = &quot;yes|no&quot;\/&gt; \r\n fdfdata = &quot;filename to be exported to&quot;<br><span class=\"notetitle\">Note: <\/span>You can specify this tag’s attributes in an \n<samp class=\"codeph\">attributeCollection<\/samp> attribute whose value is a structure. Specify the structure name in the \n<samp class=\"codeph\">attributeCollection<\/samp> attribute and use the tag’s attribute names as structure keys.<br>","CATEGORY":"Forms tags","PAGENAME":"cfpdfform","SEEALSO":"<!-- --><br><samp class=\"codeph\"><a href=\"WSc3ff6d0ea77859461172e0811cbec22c24-7c21.html\">cfdocument<\/a><\/samp>, <samp class=\"codeph\"><a href=\"WSc3ff6d0ea77859461172e0811cbec22c24-791a.html\">cfdocumentsection<\/a><\/samp>, <samp class=\"codeph\"><a href=\"WSc3ff6d0ea77859461172e0811cbec22c24-7fb7.html\">cfform<\/a><\/samp>, <samp class=\"codeph\"><a href=\"WSc3ff6d0ea77859461172e0811cbec22c24-7f51.html\">cfinput<\/a><\/samp>, <samp class=\"codeph\"><a href=\"WSc3ff6d0ea77859461172e0811cbec22c24-7995.html\">cfpdf<\/a><\/samp>, <samp class=\"codeph\"><a href=\"WSc3ff6d0ea77859461172e0811cbec22c24-76ea.html\">cfpdfformparam<\/a><\/samp>, <samp class=\"codeph\"><a href=\"WSc3ff6d0ea77859461172e0811cbec22c24-763e.html\">cfpdfparam<\/a><\/samp>, <samp class=\"codeph\"><a href=\"WSc3ff6d0ea77859461172e0811cbec22c24-76e8.html\">cfpdfsubform<\/a><\/samp><samp class=\"codeph\"><a href=\"WSc3ff6d0ea77859461172e0811cbec22c24-7996.html\">cfprint<\/a><\/samp>, <samp class=\"codeph\"><a href=\"WSc3ff6d0ea77859461172e0811cbec22c24-798a.html\">IsPDFFile<\/a><\/samp>, <samp class=\"codeph\"><a href=\"WSc3ff6d0ea77859461172e0811cbec22c24-7989.html\">IsPDFObject<\/a><\/samp>, <a href=\"http:\/\/help.adobe.com\/en_US\/ColdFusion\/9.0\/Developing\/WSc3ff6d0ea77859461172e0811cbec22c24-798c.html\" target=\"_self\">Manipulating PDF Forms in ColdFusion<\/a> in the <i xmlns:fn=\"http:\/\/www.w3.org\/2005\/xpath-functions\" xmlns:fo=\"http:\/\/www.w3.org\/1999\/XSL\/Format\" xmlns:xs=\"http:\/\/www.w3.org\/2001\/XMLSchema\">Developing ColdFusion Applications<\/i><br>","DESCRIPTION":"Manipulates existing forms created in Adobe® Acrobat® and Adobe® LiveCycle® Designer. The following list describes some of the tasks you can perform with the cfpdfform tag:","LICENCE":"http:\/\/help.adobe.com\/en_US\/ColdFusion\/10.0\/LegalNotices\/index.html","EXAMPLE":"<!-- --><br>The following example shows how to embed an interactive PDF form in a PDF document created with the <samp class=\"codeph\">cfdocument<\/samp> tag:<br>&lt;!--- The following code extracts data from the cfdocexamples database based \r\n on a username entered in a login form. ---&gt; \r\n&lt;cfquery name=&quot;getEmpInfo&quot; datasource=&quot;cfdocexamples&quot;&gt; \r\n SELECT * FROM EMPLOYEES \r\n WHERE EMAIL = &lt;cfqueryparam value=&quot;#form.username#&quot;&gt; \r\n&lt;\/cfquery&gt; \r\n \r\n&lt;!--- The following code creates a PDF document with headers \r\n and footers. ---&gt; \r\n&lt;cfdocument format=&quot;pdf&quot;&gt; \r\n &lt;cfdocumentitem type=&quot;header&quot;&gt; \r\n &lt;font size=&quot;-1&quot; align=&quot;center&quot;&gt;&lt;i&gt;Nondisclosure Agreement&lt;\/i&gt;&lt;\/font&gt; \r\n &lt;\/cfdocumentitem&gt; \r\n &lt;cfdocumentitem type=&quot;footer&quot;&gt; \r\n &lt;font size=&quot;-1&quot;&gt;&lt;i&gt;Page &lt;cfoutput&gt;#cfdocument.currentpagenumber# of \r\n #cfdocument.totalpagecount#&lt;\/cfoutput&gt;&lt;\/i&gt;&lt;\/font&gt; \r\n &lt;\/cfdocumentitem&gt; \r\n \r\n&lt;!--- The following code creates the first section in the PDF document. ---&gt; \r\n &lt;cfdocumentsection&gt; \r\n &lt;h3&gt;Employee Nondisclosure Agreement&lt;\/h3&gt; \r\n &lt;p&gt;Please verify the information in the enclosed form. Make any of the \r\n necessary changes in the online form and click the &lt;b&gt;Print&lt;\/b&gt; button. \r\n Sign and date the last page. Staple the pages together and return the \r\n completed form to your manager.&lt;\/p&gt; \r\n &lt;\/cfdocumentsection&gt; \r\n \r\n&lt;!--- The following code embeds an interactive PDF form within the PDF \r\n document with fields populated by the database query. The cfpdpfform tag \r\n automatically creates a section in the PDF document. Do not embed the \r\n cfpdfform within cfdocumentsection tags. ---&gt; \r\n \r\n <strong>&lt;cfpdfform action=&quot;populate&quot; source=&quot;c:\\forms\\embed.pdf&quot;&gt;<\/strong> \r\n <strong>&lt;cfpdfsubform name=&quot;form1&quot;&gt;<\/strong> \r\n <strong>&lt;cfpdfformparam name=&quot;txtEmpName&quot; value=&quot;#getEmpInfo.FIRSTNAME#<\/strong> \r\n <strong>#getEmpInfo.LASTNAME#&quot;&gt;<\/strong> \r\n <strong>&lt;cfpdfformparam name=&quot;txtDeptName&quot; value=&quot;#getEmpInfo.DEPARTMENT#&quot;&gt;<\/strong> \r\n <strong>&lt;cfpdfformparam name=&quot;txtEmail&quot; value=&quot;#getEmpInfo.IM_ID#&quot;&gt;<\/strong> \r\n <strong>&lt;cfpdfformparam name=&quot;txtPhoneNum&quot; value=&quot;#getEmpInfo.PHONE#&quot;&gt;<\/strong> \r\n <strong>&lt;cfpdfformparam name=&quot;txtManagerName&quot; value=&quot;Randy Nielsen&quot;&gt;<\/strong> \r\n <strong>&lt;\/cfpdfsubform&gt;<\/strong> \r\n <strong>&lt;\/cfpdfform&gt;<\/strong> \r\n \r\n&lt;!--- The following code creates the last document section. Page numbering \r\n resumes in this section. ---&gt; \r\n &lt;cfdocumentsection&gt; \r\n &lt;p&gt;I, &lt;cfoutput&gt;#getEmpInfo.FIRSTNAME# #getEmpInfo.LASTNAME#&lt;\/cfoutput&gt;, \r\n hereby attest that the information in this document is accurate and complete.&lt;\/p&gt; \r\n &lt;br\/&gt;&lt;br\/&gt; \r\n &lt;table border=&quot;0&quot; cellpadding=&quot;20&quot;&gt; \r\n &lt;tr&gt;&lt;td width=&quot;300&quot;&gt; \r\n &lt;hr \/&gt; \r\n &lt;p&gt;&lt;i&gt;Signature&lt;\/i&gt;&lt;\/p&gt;&lt;\/td&gt; \r\n &lt;td width=&quot;150&quot;&gt;&lt;hr \/&gt; \r\n &lt;p&gt;&lt;i&gt;Today's Date&lt;\/i&gt;&lt;\/p&gt;&lt;\/td&gt;&lt;\/tr&gt; \r\n &lt;\/cfdocumentsection&gt; \r\n&lt;\/cfdocument&gt;<br>","USAGE":"<!-- --><br>ColdFusion supports two types of interactive forms: forms created in Adobe Acrobat 6.0 or earlier, and forms created in Adobe LiveCycle. In Adobe Acrobat Professional and Standard 7.0, Adobe introduced Adobe&reg; LiveCycle&reg; Designer for creating PDF forms. ColdFusion supports forms created in LiveCycle Designer 7.0 and later.<br>Forms created in Acrobat have a flat structure: a list of fields at the same level. Forms created in LiveCycle Designer are hierarchical, often composed of nested subforms. To map the data to the form field, you use <samp class=\"codeph\">cfpdfsubform<\/samp> tags to recreate the structure of the form in ColdFusion. For examples, see the Usage section of the <samp class=\"codeph\"><a href=\"WSc3ff6d0ea77859461172e0811cbec22c24-76e8.html\">cfpdfsubform<\/a><\/samp> tag, and “ <a href=\"http:\/\/help.adobe.com\/en_US\/ColdFusion\/9.0\/Developing\/WSc3ff6d0ea77859461172e0811cbec22c24-798c.html\" target=\"_self\">Manipulating PDF Forms in ColdFusion<\/a> in the <i xmlns:fn=\"http:\/\/www.w3.org\/2005\/xpath-functions\" xmlns:fo=\"http:\/\/www.w3.org\/1999\/XSL\/Format\" xmlns:xs=\"http:\/\/www.w3.org\/2001\/XMLSchema\">Developing ColdFusion Applications<\/i>.<br><dt class=\"dlterm\">\n populate action\n<\/dt> \n<dd xmlns:fn=\"http:\/\/www.w3.org\/2005\/xpath-functions\" xmlns:fo=\"http:\/\/www.w3.org\/1999\/XSL\/Format\" xmlns:xs=\"http:\/\/www.w3.org\/2001\/XMLSchema\">\n Use the \n <samp class=\"codeph\">populate<\/samp> action to populate PDF form fields from the specified data file. You can specify a destination to write the output to a file or write the populated form directly to the browser. To display the interactive PDF form in the browser, do not specify a destination.\n <p>The following example shows how to populate a PDF form with an XML data file and display the completed form in a browser:<\/p> \n <pre>&lt;cfpdfform source=&quot;c:\\payslipTemplate.pdf&quot; action=&quot;populate&quot; XMLdata=&quot;c:\\formdata.xml&quot;\/&gt;<\/pre> \n <p>This example shows how to populate a PDF form with an XML data file and write the completed form to a new PDF file:<\/p> \n <pre>&lt;!--- Specify an XML file to populate a PDF form. ---&gt; \r\n&lt;cfpdfform source=&quot;c:\\payslipTemplate.pdf&quot; \r\n destination=&quot;c:\\employeeid123.pdf&quot; action=&quot;populate&quot; \r\n XMLdata=&quot;c:\\formdata.xml&quot;\/&gt;<\/pre> \n <p>Also, you can specify a URL that returns XML data. In the following example, <samp class=\"codeph\">&quot;http:\/\/test1.com\/xyz&quot;<\/samp> returns XML content:<\/p> \n <pre>&lt;cfpdfform source= &quot;#sourcefile#&quot; action=&quot;populate&quot; XMLdata= \r\n &quot;http:\/\/test1.com\/xyz&quot; destination=&quot;#resultfile#&quot; overwrite=&quot;true&quot;\/&gt;<\/pre> \n <p>For forms created in Acrobat, you can write the output to a PDF file only. For forms created in LiveCycle, you have the option to write the output to an XML Data Package (XDP) file. An XDP file is an XML representation of a PDF file.<\/p> \n <div class=\"note\">\n <span class=\"notetitle\">Note: <\/span>Supplied values in form fields created in Acrobat or LiveCycle Designer are case sensitive. For example, if a check box in a form requires a “Yes” value, the value “yes” does not populate that field.\n <\/div> \n <p>The file extension determines the file format: to save the output in XDP format, use an XDP extension in the destination filename:<\/p> \n <pre>&lt;!--- Specify a an XML file to populate a PDF form. ---&gt; \r\n&lt;cfpdfform source=&quot;c:\\payslipTemplate.pdf&quot; \r\n destination=&quot;c:\\employeeid123.xdp&quot; action=&quot;populate&quot; \r\n XMLdata=&quot;c:\\formdata.xml&quot;\/&gt;<\/pre> \n <p>You can use one or more <samp class=\"codeph\"><a href=\"WSc3ff6d0ea77859461172e0811cbec22c24-76ea.html\">cfpdfformparam<\/a><\/samp> tags within a <samp class=\"codeph\">cfpdfform<\/samp> tag to populate individual fields in a PDF form.<\/p> \n <p>The following example shows how to populate an existing form created in Acrobat (payslipTemplate.pdf) and create a PDF form (employeeid123.pdf) with the employeeID and salary fields filled in:<\/p> \n <pre>&lt;!--- This example shows how to populate two fields in a form created in Acrobat. ---&gt; \r\n&lt;cfpdfform source=&quot;c:\\payslipTemplate.pdf&quot; \r\n destination=&quot;c:\\employeeid123.pdf&quot; action=&quot;populate&quot;&gt; \r\n &lt;cfpdfformparam name=&quot;employeeId&quot; value=&quot;123&quot;&gt; \r\n &lt;cfpdfformparam name=&quot;salary&quot; value=&quot;$85,000&quot;&gt; \r\n&lt;\/cfpdfform&gt;<\/pre> \n <p>ColdFusion requires that you reproduce the exact structure of the source PDF form to populate fields. To verify the structure of a PDF form in ColdFusion, use the <samp class=\"codeph\">read<\/samp> action of <samp class=\"codeph\">cfpdfform<\/samp> tag, and then use the <samp class=\"codeph\">cfdump<\/samp> tag to display the result structure. Use a <samp class=\"codeph\"><a href=\"WSc3ff6d0ea77859461172e0811cbec22c24-76e8.html\">cfpdfsubform<\/a><\/samp> tag for each level within the structure. For more information, see <a href=\"http:\/\/help.adobe.com\/en_US\/ColdFusion\/9.0\/Developing\/WSc3ff6d0ea77859461172e0811cbec22c24-798c.html\" target=\"_self\">Manipulating PDF Forms in ColdFusion<\/a> in the <i>Developing ColdFusion Applications<\/i>.<\/p> \n <p>The following example shows how to populate a form created in LiveCycle. Many forms created from templates in LiveCycle contain a subform called form1. Use the <samp class=\"codeph\">cfpdfsubform<\/samp> tag to create a subform in ColdFusion.<\/p> \n <pre>&lt;!--- This example shows how to populate two fields in a LiveCycle form. \r\n ---&gt; \r\n&lt;cfpdfform source=&quot;c:\\payslipTemplate.pdf&quot; \r\n destination=&quot;c:\\employeeid123.pdf&quot; action=&quot;populate&quot;&gt; \r\n &lt;cfpdfsubform name=&quot;form1&quot;&gt; \r\n &lt;cfpdfformparam name=&quot;employeeId&quot; value=&quot;123&quot;&gt; \r\n &lt;cfpdfformparam name=&quot;salary&quot; value=&quot;$85,000&quot;&gt; \r\n &lt;\/cfpdfsubform&gt; \r\n&lt;\/cfpdfform&gt;<\/pre> \n <p>You can now import files in FDF format using the <samp class=\"codeph\">populate<\/samp> action. The following example shows how:<\/p> \n <pre>&lt;cfpdfform source= &quot;write_acrroform.pdf&quot; action=&quot;populate&quot; fdfdata=&quot;abc.fdf&quot; destination=&quot;hello.pdf&quot;&gt; \r\n&lt;\/cfpdfform&gt;<\/pre> \n <p>If the <samp class=\"codeph\">fdf<\/samp> attribute for the populate action is set to <samp class=\"codeph\">true<\/samp>, it allows you to populate data in FDF format with subforms and params instead of XML, as shown in the following example:<\/p> \n <pre>&lt;cfpdfform source=&quot;acroform2.pdf&quot; destination=&quot;source_result17.pdf&quot; action=&quot;populate&quot; overwrite=&quot;true&quot; fdf=&quot;true&quot;&gt; \r\n&lt;cfpdfsubform name=&quot;Text1&quot;&gt; \r\n &lt;cfpdfsubform name=&quot;0&quot;&gt; \r\n &lt;cfpdfformparam name=&quot;0&quot; value=&quot;Test1.0.0&quot;&gt; \r\n &lt;cfpdfformparam name=&quot;1&quot; value=&quot;Test1.0.1&quot;&gt; \r\n &lt;cfpdfformparam name=&quot;2&quot; value=&quot;Test1.0.2&quot;&gt; \r\n&lt;\/cfpdfsubform&gt; \r\n&lt;cfpdfsubform name=&quot;1&quot;&gt; \r\n &lt;cfpdfformparam name=&quot;0&quot; value=&quot;Test1.1.0&quot;&gt; \r\n &lt;cfpdfformparam name=&quot;1&quot; value=&quot;Test1.1.1&quot;&gt; \r\n &lt;cfpdfformparam name=&quot;2&quot; value=&quot;Test1.1.2&quot;&gt; \r\n &lt;\/cfpdfsubform&gt; \r\n&lt;\/cfpdfsubform&gt; \r\n \r\n&lt;cfpdfsubform name=&quot;Text2&quot;&gt; \r\n &lt;cfpdfformparam name=&quot;0&quot; value=&quot;Test2.0&quot;&gt; \r\n &lt;cfpdfformparam name=&quot;1&quot; value=&quot;Test2.1&quot;&gt; \r\n &lt;cfpdfformparam name=&quot;2&quot; value=&quot;Test2.2&quot;&gt; \r\n &lt;cfpdfformparam name=&quot;3&quot; value=&quot;Test2.3&quot;&gt; \r\n &lt;\/cfpdfsubform&gt; \r\n&lt;cfpdfformparam name=&quot;Text3&quot; value=&quot;Test3&quot;&gt; \r\n&lt;cfpdfformparam name=&quot;Text4&quot; value=&quot;Test4&quot;&gt; \r\n&lt;cfpdfformparam name=&quot;checkbox1&quot; value=&quot;Yes&quot;&gt; \r\n&lt;cfpdfformparam name=&quot;listbox1&quot; value=&quot;item4&quot;&gt; \r\n&lt;cfpdfformparam name=&quot;radiobutton1&quot; value=&quot;2&quot;&gt; \r\n&lt;\/cfpdfform&gt;<\/pre> \n<\/dd>\n<p class=\"dlseparator\"><\/p>\n<dt class=\"dlterm\">\n read action\n<\/dt> \n<dd xmlns:fn=\"http:\/\/www.w3.org\/2005\/xpath-functions\" xmlns:fo=\"http:\/\/www.w3.org\/1999\/XSL\/Format\" xmlns:xs=\"http:\/\/www.w3.org\/2001\/XMLSchema\">\n Use the \n <samp class=\"codeph\">read<\/samp> action to read the data from the source PDF form and generate a result structure that contains the form fields and their values. Also, you can use the read action to generate an XML data file from a PDF source file.\n <p>The following example shows how to read a PDF file and generate a result structure from the data:<\/p> \n <pre>&lt;!--- Use the read action to retrieve the values from the saved PDF. ---&gt; \r\n&lt;cfpdfform source=&quot;c:\\employeeid123.pdf&quot; result=&quot;resultStruct&quot; action=&quot;read&quot;\/&gt;<\/pre> \n <p>You can use the <samp class=\"codeph\">cfdump<\/samp> tag to display the result structure:<\/p> \n <pre>&lt;cfdump var=&quot;#resultStruct#&quot;&gt;<\/pre> \n <p>You can use the result fields in ColdFusion, for example, <samp class=\"codeph\">#resultStruct.employeeId#<\/samp> and <samp class=\"codeph\">#resultStruct.salary#<\/samp>.<\/p> \n <p>The following example shows how to read a PDF file and write the data to an XML file:<\/p> \n <pre>&lt;cfpdfform source=&quot;c:\\employeeid123.pdf&quot; result=&quot;c:\\employeeid123.xml&quot; overwrite=&quot;yes&quot; \r\n action=&quot;read&quot;\/&gt;<\/pre> \n <p>The following example shows how to read a PDF file into a variable that contains XML data:<\/p> \n <pre>&lt;cfpdfform source=&quot;c:\\employeeid123.pdf&quot; XMLdata=&quot;myXMLdata&quot; action=&quot;read&quot;\/&gt;<\/pre> \n <p>The following example shows how to read a PDF file into an XML data variable and generate a result structure. The <samp class=\"codeph\">cffile<\/samp> tag writes the data to an XML file:<\/p> \n <pre>&lt;cfset sourcefile = &quot;Grant Application Updated.pdf&quot;&gt; \r\n&lt;cfset resultfile = &quot;Expandpath('datafile_result1.xml')&quot;&gt; \r\n&lt;!--- Use the cfpdfform tag to read data extracted from a form into an XML data variable and \r\n generate a result structure. ---&gt; \r\n&lt;cfpdfform source= &quot;#sourcefile#&quot; action=&quot;read&quot; xmldata=&quot;xmldata&quot; result=&quot;resultstruct&quot;\/&gt; \r\n&lt;!--- Use the cffile tag to write the XML data to a file. ---&gt; \r\n&lt;cffile action=&quot;write&quot;file=&quot;#resultfile#&quot; output=&quot;#xmldata#&quot;&gt; \r\n&lt;!---- Use the cfdump tag to display the result structure. ---&gt; \r\n&lt;cfdump var=&quot;#resultstruct#&quot;&gt;<\/pre> \n<\/dd>\n<p class=\"dlseparator\"><\/p><br>","Attribute":[{"REQOROPT":"NA","DESCRIPTION":"","default":"Required","Attribute":"action"},{"REQOROPT":"populate","DESCRIPTION":"Write to browser","default":"Optional","Attribute":"destination"},{"REQOROPT":"populate read","DESCRIPTION":false,"default":"Optional","Attribute":"overwrite"},{"REQOROPT":"populate","DESCRIPTION":false,"default":"Optional","Attribute":"overwriteData"},{"REQOROPT":"read","DESCRIPTION":"","default":"Optional (see Description)","Attribute":"result"},{"REQOROPT":"populate read","DESCRIPTION":"","default":"Required","Attribute":"source"},{"REQOROPT":"populate read","DESCRIPTION":"","default":"Optional (see Description)","Attribute":"XMLdata"},{"REQOROPT":"populate","DESCRIPTION":false,"default":"Optional","Attribute":"fdf"},{"REQOROPT":"populate read","DESCRIPTION":" ","default":"Optional","Attribute":"fdfdata"}]}
{"response": {"status": "ok", "userTier": "developer", "total": 1, "content": {"id": "us-news/2017/jan/05/dan-coats-trump-national-intelligence-director", "type": "article", "sectionId": "us-news", "sectionName": "US news", "webPublicationDate": "2017-01-05T22:05:26Z", "webTitle": "Trump to name ex-senator Dan Coats as director of national intelligence", "webUrl": "https://www.theguardian.com/us-news/2017/jan/05/dan-coats-trump-national-intelligence-director", "apiUrl": "https://content.guardianapis.com/us-news/2017/jan/05/dan-coats-trump-national-intelligence-director", "fields": {"headline": "Trump to name ex-senator Dan Coats as director of national intelligence", "bodyText": "President-elect Donald Trump will appoint the former Indiana senator Dan Coats as director of national intelligence, it was reported on Thursday. The pick could be announced later this week, according to a person briefed on the decision who spoke to the Associated Press. The person was not authorized to speak publicly about the matter and spoke on condition of anonymity. The New York Times and Washington Post also reported the nomination, citing Trump transition officials speaking anonymously. Coats, a member of the Senate intelligence committee as an Indiana legislator from 2011 to 2017, has held several positions that put him out of step with the emerging Trump administration. Whereas Trump and Russian president Vladimir Putin have expressed mutual respect, leading many in the US and Russia to expect a diplomatic thaw, Russia banned Coats from entering the country in 2014, to retaliate against US sanctions. Coats proclaimed himself \u201chonored\u201d to be blacklisted. \u201cI\u2019m not a big fan of Putin,\u201d he said in a November 2015 Senate floor speech. \u201cI\u2019m not a big fan of Russia.\u201d Yet in the same speech, Coats expressed openness to partnering with Russia against Islamic State, a position Trump has expressed, despite the Russian military intervention in Syria focusing on bolstering dictator Bashar Assad, not fighting Isis. \u201cAs we\u2019ve learned in 1941, national emergencies can create strange bedfellows,\u201d Coats said. Such bedfellows, Coats said, would not include only the Russians, but also \u201cSunni nations \u2013 it has to include Islamists who believe that their faith and their culture is being perverted brutally by Isis\u201d. His stance is unlikely to be shared by Trump national security adviser Mike Flynn, who has called \u201cIslamic ideology sick\u201d. Coats has also vigorously endorsed CIA efforts to arm Syrian rebels, another position Trump has opposed. While Trump has described aerial bombing as a cornerstone of his military approach to Isis, Coats said in the same floor speech that \u201cmilitary history shows air action only cannot achieve the goal of defeating an enemy\u201d. The prospective nomination comes amid reports, denied by Trump spokesman Sean Spicer, that the president-elect is considering an overhaul to US intelligence that would diminish the role Coats is said to be tapped to fill. Previous directors of national intelligence, a position barely a decade old, have clashed with CIA directors over the limits of either\u2019s authority. The outgoing director of national intelligence, James Clapper, on Thursday pledged to produce next week a declassified intelligence report providing evidence of Russian interference in the US election, a claim rejected by Trump that has spurred a dramatic split with the intelligence apparatus Coats may soon helm. Trump has dismissed the assessment of Russian hacking as an attack on the validity of his election. Testifying alongside Clapper to a Senate committee, National Security Agency director Adm Michael Rogers warned that the split with Trump risked creating \u201ca situation where our workforce decides to walk\u201d. Trump will meet with directors of the FBI and CIA, as well as Clapper, on Friday, to be briefed on their findings. Coats is a conservative who spent 16 non-consecutive years in the Senate. He announced his retirement last year and did not seek re-election. Coats and Trump are more closely in line on the detention facility Guant\u00e1namo Bay, which both believe ought to remain open. In February 2016, Coats called Guant\u00e1namo \u201ca valuable tool in our counter-terrorism efforts\u201d; Trump has talked about \u201cload[ing] it up with some bad dudes.\u201d On Thursday, the Obama administration transferred four detainees to Saudi Arabia, dropping the population of the wartime prison to 55 men. Coats was also harshly critical of a landmark 2014 Senate intelligence committee investigation into CIA torture, something Trump has mused about restoring. Although the report, which relied on more than 6m pages of internal agency records, was one of the most thorough in the history of the Senate, Coats called it an \u201cunconstructive partisan account of the last decade\u2019s counterterrorism efforts\u201d. Additionally, Coats attacked Edward Snowden\u2019s NSA disclosures in a June 2013 Wall Street Journal op-ed, calling bulk NSA surveillance \u201clegal, constitutional and used only under the strict oversight of all three branches of the government\u201d. Multiple federal judges would later rule that the bulk collection of US phone records is illegal, but Coats voted against a 2015 bill, the USA Freedom Act, that constrained the mass surveillance. Mike Pompeo, Trump\u2019s nominee for CIA director, has also supported expansive surveillance."}, "isHosted": false, "pillarId": "pillar/news", "pillarName": "News"}}}
{"poster":"PiJellyPin","date":"2016-04-01T08:20:11.660+0000","title":"1 April Gamemode?","subforum":"Gameplay","up_votes":107,"down_votes":57,"body":"well i woke up happy as all hell for nothing, hoping for a Gamemode (urf, one for all, ect) today, but none just fu##ing skins so they can make more money\r\nso disipointed :(\r\n\r\nwhat do you think?","replies":[{"poster":"I poop rocks","date":"2016-04-01T08:30:56.033+0000","up_votes":45,"down_votes":16,"body":"I agree 100%. Riot is so dissapointing... So many people stayed up late waiting for Riot's new and creative way to celebrate April Fool's only to find this piece of crap Draven garbage. Sure it's funny, the whole \"April Fool's\" gig, but I'm sure that a large portion of the league community plays to see what Riot can do to keep the game more engaging and quite frankly, this is honestly seems like disrespect to their players.","replies":[{"poster":"Ligerzz","date":"2016-04-01T12:49:10.436+0000","up_votes":15,"down_votes":12,"body":"They aren't disrespecting players if they are working on something that the community has been asking for a long time ago, which is the Rotating queue. Sure URF has been asked for quite a lot, and left a superb impression on it's first release, but now they are creating something that has been requested WAAAY more than URF. That is far from disrespecting players.","replies":[{"poster":"gragaaaaaaas","date":"2016-04-01T13:11:47.554+0000","up_votes":9,"down_votes":10,"body":"> [{quoted}](name=Ligerzz,realm=OCE,application-id=3ErqAdtq,discussion-id=yEGANhAf,comment-id=00020000,timestamp=2016-04-01T12:49:10.436+0000)\n>\n> They aren't disrespecting players if they are working on something that the community has been asking for a long time ago, which is the Rotating queue. Sure URF has been asked for quite a lot, and left a superb impression on it's first release, but now they are creating something that has been requested WAAAY more than URF. That is far from disrespecting players.\n\nBut... URF is already built. You don't plan software development at the mast second. They have a timeline that goes months or even a year out. Thats why this Draven stuff seems fishy... they WOULD make more money with URF. Not this buggy Draven stuff...from a business perspective it would have been less work to do URF. Which is why I'm guessing/hoping this afternoon they will unlock URF.","replies":[{"poster":"Seekêr","date":"2016-04-01T13:59:39.735+0000","up_votes":2,"down_votes":1,"body":"more people playing doesnt equate to making more money though. Sure lots of people would be playing urf, but would we be buying the skins? or would we just be playing our favorite champions in the game mode?\n\nanywho, I think that urf will be here this year, they have urf kench and earlier in the year they speculated about how the new champions would be in urf.","replies":[{"poster":"My Waifu Vanilla","date":"2016-04-01T15:07:46.439+0000","up_votes":4,"down_votes":3,"body":"It's already confirmed to be this year with the rotating queues. But hey people want their URF fix now and then complain AGAIN in August when it wouldn't come back. It's either in April or it's in the rotating queue and people can't think long term enough to see that rotating queue is the better decision since both is not an option (if it were both then the April 1st one loses ALL significance since it would be back next month).","replies":[{"poster":"Seekêr","date":"2016-04-01T15:29:12.101+0000","up_votes":4,"down_votes":1,"body":"Is there any actual reason that there cant be both? they already have the game mode made. There isnt really an excuse to not just put the game mode onto live for a few days...","replies":[{"poster":"Stand Alone Wolf","date":"2016-04-01T18:37:28.777+0000","up_votes":1,"down_votes":2,"body":"That would delay the initial time for them to put the rotating game-modes out as they'd have to then re-calculate the amount of days that would properly be allotted to the other game-modes. Each game-mode in this rotation will be available at least twice throughout this year, and they are choosing to release it today as it properly gives all other modes a chance to be played twice this year. This would also mean they would have to either:\n\nMake URF (Ultra Rapid Fire) appear a total of three times this year whereas other game-modes would only have two chances at being played this year.\n\nor...\n\nBring Urf out now, and include that as the first, releasing it once more later in the year as the second time for it to come back.\n\nOrr...\n\nIf they did their numbers right, shorten the amount of time game-modes will be out to allow each game mode to make an appearance for a total of three times throughout the year.\n\nPersonally I'm fine with being patient. We will be getting our game-mode, and then some more game modes throughout the year rotating. I'm fine with that, and I hope you are as well. we may be the costumers, but with them trying to give us something better than just one urf mode for the year (thee end.)\nWe should be grateful they are even doing anything to begin with, and giving thanks.\n\nEDIT: I'm only pointing out the possible issues that could be preventing them from doing so as well as seeing possible solutions to how this could be done in my third thought on the issue of them not putting out a game-mode in the mean time.","replies":[{"poster":"dnsup","date":"2016-04-02T00:36:57.812+0000","up_votes":2,"down_votes":1,"body":"> [{quoted}](name=Stand Alone Wolf,realm=NA,application-id=3ErqAdtq,discussion-id=yEGANhAf,comment-id=0002000000000000000000000000,timestamp=2016-04-01T18:37:28.777+0000)\n>\n> We should be grateful they are even doing anything to begin with, and giving thanks.\n\nSMH I'll never understand Rito fanboys white knighting on the Boards.\n\n\"Giving thanks\" yeah no.\n\nSomeone else made a great analogy for people like Stand Alone Wolf. You're like someone standing in front of a Wal-Mart customer service desk telling people to go away and be happy with what they have (whatever that is).\n\nYou know Rito isn't paying you, right?","replies":[]},{"poster":"Seekêr","date":"2016-04-02T01:29:43.470+0000","up_votes":1,"down_votes":1,"body":"You are forgetting one very big thing. Urf is already created. How many staff members can it take off of the rotating game Que to put urf on live. I understand your desire to justify riots decision, but there is no feasible reason as to why urf can't come to live for a few days for April fools and then return later for the rotating game que.","replies":[{"poster":"Stand Alone Wolf","date":"2016-04-02T01:52:42.403+0000","up_votes":1,"down_votes":0,"body":"> [{quoted}](name=Umbral Terror,realm=NA,application-id=3ErqAdtq,discussion-id=yEGANhAf,comment-id=00020000000000000000000000000001,timestamp=2016-04-02T01:29:43.470+0000)\n>\n> You are forgetting one very big thing. Urf is already created. How many staff members can it take off of the rotating game Que to put urf on live.\n\nI'm not forgetting?\nI've been a player for a good five years now, and I'm well aware of Ultra Rapid Fire as I played it when it was first released.\n\n\n\nno no no, although my first few sentences sounded as if I was quite definitive on why it could not happen, I'm only presuming it would cause problems for the time-frames in which other game-modes are sitting in rotation based off the information I made sure to follow up with after said sentences.\n\n If URF Mode was put out, what would that mean for the other game modes given they have a set amount of days they will be out?\n\nThis is pretty much what I mean with thee smallest amount of detail I can possibly give. I then present possible issues that could rise from putting URF out with my third plausible issue holding a possible solution. That is all. I'm not attempting to defend Riot. Hell there could be no issues with putting URF out right now, but I'm only touching on the possible reasons it isn't out since it. . . . well, isn't out.\n\nIn a sense, I'm presenting possible issues, questioning them, and seeing if they could be fixed. If there are no issues, then I've no Idea why Riot hasn't released URF. They said they wouldn't release it today, but if we dismiss there being any possible problems as to why they chose not to bring it back, then I don't know why they made that decision. That is all.\n\nLastly, http://boards.na.leagueoflegends.com/en/c/riot-official/vjax6fIE-announcing-the-rotating-game-mode-queue\nClick: \"Read more\"\naround the end of the third paragraph. \n\nThey are doing what they can for this new game-mode, and I'm glad they put all of them into one big rotation. That I am happy about. I'm still not feeling too good about previous decisions made by Riot, but I can say this was a good move, and I've no prob waiting.","replies":[]}]}]}]}]}]}]},{"poster":"Ranked ARURF","date":"2016-04-01T23:03:02.710+0000","up_votes":2,"down_votes":1,"body":"they should put urf first in rotatiing queue. if not, what u say is irrelevent. Its not a competition between retating queue and urf, its all about urf. Nobody is that glad of retating queue, people are just pissed off because no urf.","replies":[]}]}]},{"poster":"Very Hard Engage","date":"2016-04-01T11:01:10.598+0000","up_votes":13,"down_votes":1,"body":"its almost like.... they're waiting for april 2nd just to troll us. \n\n\"april fools\" draven day. now heres urf.","replies":[{"poster":"Saianna","date":"2016-04-01T11:24:05.863+0000","up_votes":8,"down_votes":1,"body":"I damn hope it's true.","replies":[{"poster":"Shac Norris","date":"2016-04-02T00:01:43.303+0000","up_votes":3,"down_votes":0,"body":"It's not true.\n\nSad but true.","replies":[]}]}]},{"poster":"TehPandehWub","date":"2016-04-01T09:17:06.144+0000","up_votes":4,"down_votes":4,"body":"They didn't just release skins and if you don't like them don't buy them lol","replies":[{"poster":"TheRealBaz","date":"2016-04-01T10:16:31.950+0000","up_votes":10,"down_votes":1,"body":"> [{quoted}](name=TehPandehWub,realm=NA,application-id=3ErqAdtq,discussion-id=yEGANhAf,comment-id=0004,timestamp=2016-04-01T09:17:06.144+0000)\n>\n> They didn't just release skins and if you don't like them don't buy them lol\n\nsorry they spammed draven on their website too","replies":[]}]},{"poster":"Applesaucey","date":"2016-04-01T08:26:49.989+0000","up_votes":11,"down_votes":4,"body":"This is my biggest issue. Previously events have always been something new or special to play, with stuff to earn for participating. This one is 100% just pay money for skins or for icons with nothing added at all to give any sort of new or fresh gameplay experience","replies":[{"poster":"t0ad5","date":"2016-04-01T14:14:14.473+0000","up_votes":3,"down_votes":1,"body":"> [{quoted}](name=Applesaucey,realm=NA,application-id=3ErqAdtq,discussion-id=yEGANhAf,comment-id=0001,timestamp=2016-04-01T08:26:49.989+0000)\n>\n> This is my biggest issue. Previously events have always been something new or special to play, with stuff to earn for participating. This one is 100% just pay money for skins or for icons with nothing added at all to give any sort of new or fresh gameplay experience\n\nReminds me of halloween","replies":[{"poster":"Meanie40","date":"2016-04-02T06:22:57.439+0000","up_votes":2,"down_votes":0,"body":"Wait, I heard of a mystical event held every Halloween, called \"The Harrowing\" I think? Whatever happened to that anyway.\n\n/s","replies":[]}]}]},{"poster":"Mirage Seraph","date":"2016-04-01T10:29:10.475+0000","up_votes":8,"down_votes":4,"body":"They're working on the Rotating Game Mode guys, you'll have your URF and more than once a year. Let them get it working. They even said (quite awhile back) that URF won't be returning this April Fools.","replies":[{"poster":"BetweenSkill","date":"2016-04-01T11:19:21.668+0000","up_votes":8,"down_votes":2,"body":"Twice a year for less than a third of the total time it was up last year.","replies":[{"poster":"Bolwinkel","date":"2016-04-01T14:01:17.718+0000","up_votes":4,"down_votes":5,"body":"Ok, Each gamemode will be available for 3 days, the weekend, starting on Friday and ending on Sunday. Riot said that the time could also be extended so we may just have Urf for 7 days when it is available and another 7 days when it comes again. With simple math we see that that comes to 14 days total, the same as last years duration of Urf. Only difference is that it's not here on April 1st and people are crying about it even though Riot said it wouldn't be here.","replies":[{"poster":"BetweenSkill","date":"2016-04-01T15:51:10.745+0000","up_votes":5,"down_votes":0,"body":"The only thing we've been loosely promised is 2-4 days of URF (if you can play those days) twice, so 4-8 days at very specific times. That's not the same. Don't assume they're going to extend it a full week each time.","replies":[]}]},{"poster":"WolfBV","date":"2016-04-02T06:02:48.024+0000","up_votes":1,"down_votes":1,"body":"> [{quoted}](name=BetweenSkill,realm=NA,application-id=3ErqAdtq,discussion-id=yEGANhAf,comment-id=00070000,timestamp=2016-04-01T11:19:21.668+0000)\n>\n> Twice a year for less than a third of the total time it was up last year.\n\nWhere did you hear someone say twice a year? Every gamemode will repeat once every 1.5-2 months.~","replies":[]}]},{"poster":"gekyùme","date":"2016-04-02T02:20:33.152+0000","up_votes":2,"down_votes":1,"body":"Rotating Game Mode is a joke. There's no way it's going to happen.","replies":[]}]},{"poster":"IceyMilotic","date":"2016-04-01T18:33:43.470+0000","up_votes":2,"down_votes":4,"body":"As what a lot of people have said....Fuck you Riot. ALL of us have waited a year for URF you tell us fuck you we think you want a rotational thing. That was bullshit all we want is our 2 weeks of urf. Now I cant make my Urf yearly montage on youtube so fuck you for that. Now you don't even give us a game mode...FUCK YOU!","replies":[{"poster":"LemurKick","date":"2016-04-01T19:52:19.760+0000","up_votes":1,"down_votes":2,"body":"Get off your high-horse, Riot doesn't owe you shit, they already announced there'd be no URF today, but it will be back several times this year. You can make your shitty montage then.","replies":[{"poster":"dnsup","date":"2016-04-02T00:40:10.896+0000","up_votes":4,"down_votes":1,"body":"> [{quoted}](name=Janna NA Best,realm=NA,application-id=3ErqAdtq,discussion-id=yEGANhAf,comment-id=00110000,timestamp=2016-04-01T19:52:19.760+0000)\n>\n> Get off your high-horse, Riot doesn't owe you shit, they already announced there'd be no URF today, but it will be back several times this year. You can make your shitty montage then.\n\nGet off _**your**_ high horse, and get your nose out of Rito's ass. They're not paying you to put people down for expressing dissatisfaction, and you don't have any authority here.","replies":[]}]}]},{"poster":"Blue Moon Wolf","date":"2016-04-01T09:24:43.391+0000","up_votes":7,"down_votes":5,"body":"This is why I'm worried about this new rotation mode. Since all the modes will be available throughout the year, Riot will just turn every lore and holiday event into a glorified skin/champ sale. Part of what made the events so fun is that they got special modes to tie into them. As for April 1st goes, it's supposed to be the day for **URF**, not draven. Urf was the original April fools joke for League and the only sign of him this year is a 750 RP skin for {{champion:223}}.\nI'll enjoy \"draven day\" for what it's worth, but this better not be a trend. And I full well expect the Harrowing this year too (not another \"zombie slayer\" thing).","replies":[{"poster":"Xonra","date":"2016-04-01T19:58:05.894+0000","up_votes":2,"down_votes":0,"body":"> [{quoted}](name=Blue Moon Wolf,realm=NA,application-id=3ErqAdtq,discussion-id=yEGANhAf,comment-id=0005,timestamp=2016-04-01T09:24:43.391+0000)\n>\n> Riot will just turn every lore and holiday event into a glorified skin/champ sale.\n\nSadly they already did this starting with Halloween last year. So no need to be disappointed, because they are already there. \n\nTencent doesn't care about the Western Holidays (no really, I'm not just saying that, it is the reason why) so they don't really care to put lots of resources into them like we have come to know in years past.","replies":[]}]},{"poster":"ChocoSaltyBalls","date":"2016-04-01T18:27:57.272+0000","up_votes":2,"down_votes":0,"body":"money money money money money money money money give me that money - RIot lol","replies":[]},{"poster":"love god","date":"2016-04-01T11:53:22.284+0000","up_votes":4,"down_votes":3,"body":"They literally said that urf would not be coming April first like a month ago, ill see if I can find the post","replies":[{"poster":"Laughing Fish","date":"2016-04-01T12:30:36.824+0000","up_votes":6,"down_votes":4,"body":"Yeah, but last year they also announced that Urf would not be released, and it turned out that was an April Fools day joke, and Urf came at the last second. Many people (myself included) assumed that they were doing a similar joke this year.","replies":[{"poster":"Hellioning","date":"2016-04-01T16:53:38.668+0000","up_votes":3,"down_votes":1,"body":"There's a difference between announcing a really bad, dumb game mode on the front page of the website and saying 'urf will not show up april 1st, sorry' in a red comment on the boards.","replies":[]}]}]},{"poster":"THE ROOSTER KING","date":"2016-04-01T08:58:14.951+0000","up_votes":4,"down_votes":3,"body":"time to look for entertainment somewhere else then {{sticker:zombie-brand-clap}}","replies":[{"poster":"P0P0 CLUB 69","date":"2016-04-01T19:24:30.439+0000","up_votes":1,"down_votes":0,"body":"lets go play dota 2","replies":[]}]},{"poster":"aheadjust","date":"2017-04-01T05:14:07.396+0000","up_votes":1,"down_votes":0,"body":"It's annoying I'm trying to play real people ;-;","replies":[]},{"poster":"Dr Birdie","date":"2016-04-02T16:28:07.053+0000","up_votes":1,"down_votes":0,"body":"You do know that this game is free, right? Riot is a big company with a lot of employees that it has to pay. They are allowed to make skins that provide people other than yourself with enjoyment so that they can make their money.","replies":[]},{"poster":"Meanie40","date":"2016-04-02T06:21:31.537+0000","up_votes":1,"down_votes":0,"body":"The rotating game modes will come out just before Pure Solo Queue.","replies":[]},{"poster":"Member","date":"2016-04-02T00:45:11.136+0000","up_votes":1,"down_votes":0,"body":"Whats even more rediculous is that the draven skin is **500 rp**. 500 Fucking RP FOR A FUCKING HEAD ARE YOU SERIOUS?","replies":[]},{"poster":"PhoenixSlayer13","date":"2016-04-01T19:33:04.181+0000","up_votes":1,"down_votes":2,"body":"We do have a game mode.\n\nIt's Draven Mode.","replies":[{"poster":"Shac Norris","date":"2016-04-02T00:03:07.071+0000","up_votes":1,"down_votes":0,"body":"Would rather hang myself than play another game with Draven's head on top of champions.","replies":[{"poster":"the Anarchit3cht","date":"2016-04-02T00:41:16.937+0000","up_votes":1,"down_votes":0,"body":"draft mode.","replies":[]}]}]},{"poster":"NoPaxt","date":"2016-04-01T10:20:48.788+0000","up_votes":7,"down_votes":8,"body":"They're a business whose goal is to make money...\nThat money then develops the game.\nNo money, no game....","replies":[{"poster":"Aknoo","date":"2016-04-01T15:58:50.954+0000","up_votes":1,"down_votes":0,"body":"> [{quoted}](name=Stark of Wrath,realm=NA,application-id=3ErqAdtq,discussion-id=yEGANhAf,comment-id=0006,timestamp=2016-04-01T10:20:48.788+0000)\n>\n> They're a business whose goal is to make money...\n> That money then develops the game.\n> No money, no game....\n\nThey made $1 billion USD each year for the last two years. They don't need more money.","replies":[{"poster":"NoPaxt","date":"2016-04-01T17:59:35.883+0000","up_votes":1,"down_votes":0,"body":"Never count another person's bank account, it's shallow and displays jealousy...","replies":[{"poster":"Shac Norris","date":"2016-04-02T00:04:42.622+0000","up_votes":1,"down_votes":0,"body":"He showed that they have well enough money to help develop the game without shoving shitty half-shit content down our throats","replies":[]}]}]},{"poster":"PDE5 Inhib","date":"2016-04-01T10:22:56.880+0000","up_votes":3,"down_votes":2,"body":"I liked season 3 better than season 6. Less development pls rito.","replies":[]}]},{"poster":"luzz","date":"2016-04-01T22:13:30.479+0000","up_votes":1,"down_votes":0,"body":"the problem here is april 1st in on a friday, where some of us have to work the weekends, when patched were let out tuesday night on a bi weekly basis. allowing for the mode to be played going into the weekend. last year april 1st fell on wednesday year before that tuesday, but with leap year in place the Friday puts it far in the weekend thus some of us may not play to the beginning of next week. if the rotating quese stick to weekend only unless people demand more of it, that leaves out a chunk of people whom would miss out. sadly....Riot is tired of working extra on keeping the servers happy...also does the chicago servers have anything to do with it....its a conspiracy i tell you.","replies":[]},{"poster":"MasterIsle","date":"2016-04-01T21:29:06.186+0000","up_votes":1,"down_votes":0,"body":"I can't login after my comment and the comment was deleted, was I right? Cuz I don't like the punishment that comes with it","replies":[]}]}
{ "id": 907567493, "type": "Feature", "properties": { "addr:full":"81 Fern Hill Road, Cowley Oxford Oxfordshire OX4 2JW", "addr:housenumber":"81", "addr:postcode":"ox4 2jw", "addr:street":"Fern Hill Road", "edtf:cessation":"uuuu", "edtf:inception":"uuuu", "geom:area":0.0, "geom:area_square_m":0.0, "geom:bbox":"-1.2035809755,51.7343635559,-1.2035809755,51.7343635559", "geom:latitude":51.734364, "geom:longitude":-1.203581, "iso:country":"GB", "mz:hierarchy_label":1, "mz:is_current":-1, "sg:address":"81 Fern Hill Road, Cowley", "sg:city":"Oxford", "sg:classifiers":[ { "category":"Education", "subcategory":"Dance Studio", "type":"Public Place" } ], "sg:owner":"simplegeo", "sg:phone":"+44 1865 747144", "sg:postcode":"OX4 2JW", "sg:province":"Oxfordshire", "sg:tags":[ "school", "dancing" ], "src:geom":"simplegeo", "wof:belongsto":[ 85786815, "102191581", 404443795, "85633159", 404227469, 101750439, 85683867 ], "wof:breaches":[], "wof:concordances":{ "sg:id":"SG_6JN0hLqLGJFMcI9ObwLL2j_51.734364_-1.203581@1300740405" }, "wof:country":"GB", "wof:created":1471907533, "wof:geomhash":"51bd6afe4bbe5c686a2cdfa76f1d2215", "wof:hierarchy":[ { "continent_id":"102191581", "country_id":"85633159", "localadmin_id":404443795, "locality_id":101750439, "macroregion_id":404227469, "neighbourhood_id":85786815, "region_id":85683867, "venue_id":907567493 } ], "wof:id":907567493, "wof:lastmodified":1496973261, "wof:name":"School Cooper of Dance", "wof:parent_id":85786815, "wof:placetype":"venue", "wof:repo":"whosonfirst-data-venue-gb", "wof:superseded_by":[], "wof:supersedes":[], "wof:tags":[ "school", "dancing" ] }, "bbox": [ -1.2035809755, 51.7343635559, -1.2035809755, 51.7343635559 ], "geometry": {"coordinates":[-1.2035809755,51.7343635559],"type":"Point"} }
{"id":114779,"date":"2020-06-18 12:56:33","description":null,"for":322,"against":310,"abstention":65,"plenary":3448302,"name":"Stéphanie Yon-Courtin - Am 28","ref":"A9-0022/2020","created_by":null,"updated_by":null}
{ "id": 286934329, "type": "Feature", "properties": { "addr:full":"Stevens & Stephens, First Floor 187 High Street Tonbridge Kent TN9 1BX", "addr:housenumber":"first floor 187", "addr:postcode":"tn9 1bx", "addr:street":"High Street", "edtf:cessation":"uuuu", "edtf:inception":"uuuu", "geom:area":0.0, "geom:area_square_m":0.0, "geom:bbox":"0.276085,51.198673,0.276085,51.198673", "geom:latitude":51.198673, "geom:longitude":0.276085, "iso:country":"GB", "mz:hierarchy_label":1, "mz:is_current":-1, "sg:address":"Stevens & Stephens, First Floor 187 High Street", "sg:city":"Tonbridge", "sg:classifiers":[ { "category":"Real Estate", "subcategory":"Developer", "type":"Services" } ], "sg:owner":"simplegeo", "sg:postcode":"TN9 1BX", "sg:province":"Kent", "sg:tags":[ "property" ], "src:geom":"simplegeo", "wof:belongsto":[ 85633159, 101854625, 85684363 ], "wof:breaches":[], "wof:concordances":{ "sg:id":"SG_2p7YP4TmVcAUs6ojVEVbi0_51.198673_0.276085@1300740283" }, "wof:country":"GB", "wof:geomhash":"57f9a95ce1ccbb1f7184a897ff486246", "wof:hierarchy":[ { "continent_id":-1, "country_id":85633159, "locality_id":101854625, "neighbourhood_id":-1, "region_id":85684363, "venue_id":286934329 } ], "wof:id":286934329, "wof:lastmodified":1496940452, "wof:name":"Hadlow Bakery Limited (The)", "wof:parent_id":-1, "wof:placetype":"venue", "wof:repo":"whosonfirst-data-venue-gb", "wof:superseded_by":[], "wof:supersedes":[], "wof:tags":[ "property" ] }, "bbox": [ 0.276085, 51.198673, 0.276085, 51.198673 ], "geometry": {"coordinates":[0.276085,51.198673],"type":"Point"} }
{ "id": 907767413, "type": "Feature", "properties": { "addr:full":"10 Testwood Lane, Totton Southampton Hampshire SO40 3AQ", "addr:housenumber":"10", "addr:postcode":"so40 3aq", "addr:street":"Testwood Lane", "edtf:cessation":"uuuu", "edtf:inception":"uuuu", "geom:area":0.0, "geom:area_square_m":0.0, "geom:bbox":"-1.4873349667,50.9195556641,-1.4873349667,50.9195556641", "geom:latitude":50.919556, "geom:longitude":-1.487335, "iso:country":"GB", "mz:hierarchy_label":1, "mz:is_current":-1, "sg:address":"10 Testwood Lane, Totton", "sg:city":"Southampton", "sg:classifiers":[ { "category":"Shopping", "subcategory":"Computers & Home Electronics", "type":"Retail Goods" } ], "sg:owner":"simplegeo", "sg:phone":"+44 23 8036 1760", "sg:postcode":"SO40 3AQ", "sg:province":"Hampshire", "sg:tags":[ "equipment", "video", "cctv" ], "src:geom":"simplegeo", "wof:belongsto":[ 85633159, 85792825, 85684375 ], "wof:breaches":[], "wof:concordances":{ "sg:id":"SG_1tcGY08lys5wvsUcpnkDgz_50.919556_-1.487335@1300740449" }, "wof:country":"GB", "wof:created":1471916476, "wof:geomhash":"952f31ba0926746ba8bf782f1d5640f4", "wof:hierarchy":[ { "country_id":85633159, "neighbourhood_id":85792825, "region_id":85684375, "venue_id":907767413 } ], "wof:id":907767413, "wof:lastmodified":1496971311, "wof:name":"P & P Systems", "wof:parent_id":85792825, "wof:placetype":"venue", "wof:repo":"whosonfirst-data-venue-gb", "wof:superseded_by":[], "wof:supersedes":[], "wof:tags":[ "equipment", "video", "cctv" ] }, "bbox": [ -1.4873349667, 50.9195556641, -1.4873349667, 50.9195556641 ], "geometry": {"coordinates":[-1.4873349667,50.9195556641],"type":"Point"} }
{"title":"Stingray - Sucker Born Every Day 2016 320ak","uid":15332699,"size":90164593,"categoryP":"audio","categoryS":"music","magnet":"?xt=urn:btih:d983a68def0cfac8df9b67a3f3d69780d05bfa72&amp;dn=Stingray+-+Sucker+Born+Every+Day+2016+320ak&amp;tr=udp%3A%2F%2Ftracker.leechers-paradise.org%3A6969&amp;tr=udp%3A%2F%2Fzer0day.ch%3A1337&amp;tr=udp%3A%2F%2Fopen.demonii.com%3A1337&amp;tr=udp%3A%2F%2Ftracker.coppersurfer.tk%3A6969&amp;tr=udp%3A%2F%2Fexodus.desync.com%3A6969","seeders":1,"leechers":0,"uploader":"analogkid6103","files":11,"time":1468752992,"description":"Stingray - Sucker Born Every Day 2016 320ak\r\n \r\n \r\nALBUM : Sucker Born Every Day\r\n \r\nYEAR: 2016\r\n\r\n \r\nCOUNTRY: Norway\r\n \r\nSTYLE: Hard Rock\r\n \r\nDURATION: 0:36:09\r\n \r\nFILE FORMAT: MP3\r\n \r\nQUALITY: 320 kbps\r\n\r\n\r\nDescription\r\n\r\n01. Firstclass Asshole\r\n02. Rock'n'roll\r\n03. Sucker Born Every Day\r\n04. Nest\r\n05. Raise Your Hands\r\n06. License For Love\r\n07. Speedtrip\r\n08. I'll Be Waiting\r\n09. Shooting Blanks\r\n10. Go Away","torrent":{"xt":"urn:btih:d983a68def0cfac8df9b67a3f3d69780d05bfa72","amp;dn":"Stingray+-+Sucker+Born+Every+Day+2016+320ak","amp;tr":["udp%3A%2F%2Ftracker.leechers-paradise.org%3A6969","udp%3A%2F%2Fzer0day.ch%3A1337","udp%3A%2F%2Fopen.demonii.com%3A1337","udp%3A%2F%2Ftracker.coppersurfer.tk%3A6969","udp%3A%2F%2Fexodus.desync.com%3A6969"],"infoHash":"d983a68def0cfac8df9b67a3f3d69780d05bfa72","infoHashBuffer":{"type":"Buffer","data":[217,131,166,141,239,12,250,200,223,155,103,163,243,214,151,128,208,91,250,114]},"announce":[],"urlList":[]}}
{ "Ar36": { "error": 0.0034625324968965508, "error_type": "SEM", "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 2 }, "fit": "Linear", "value": 0.9572638553819361 }, "Ar37": { "error": 0.016123053484407485, "error_type": "SEM", "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 2 }, "fit": "linear", "value": 0.10241467513983851 }, "Ar38": { "error": 0.01638433755516392, "error_type": "SEM", "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 2 }, "fit": "linear", "value": 0.7178382252396875 }, "Ar39": { "error": 0.03356800052108422, "error_type": "SEM", "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 2 }, "fit": "Linear", "value": 41.72470620463172 }, "Ar40": { "error": 0.05239252200518874, "error_type": "SEM", "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 2 }, "fit": "Linear", "value": 325.417218649137 }, "Ar41": { "error": 0.007210910350621559, "error_type": "SEM", "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 2 }, "fit": "Average", "value": 0.023491014633793467 } }
["55f9b5c11e2593d5697810a8ec8bcb10b0cc5df2","c32c588b4c71e1a20db7d9fea227c89a6de54120"]
{"id":27593,"name":"Freyja Forest Necklace","description":"LV3 Flora Necklace of the Mythic Spirit.\nCombine it with a Solar Fragment to\nrefresh its additional attributes.\nCombine it with 3 Solar Fragments\nand a LV3 Mythic Scroll to upgrade it to LV 4!"}
{"poster":"Preveam","date":"2016-12-28T01:09:19.551+0000","title":"advanced Desktop Hintergrund","subforum":"Allgemeiner Chat","up_votes":2,"down_votes":0,"body":"Hi!\r\n\r\nWisst ihr, ob und wie man einen League of Legends Anmelde-Bildschirm als Desktop-Hintergrund verwenden kann. Zum Beispiel den Ultimate-Lux-Loginscreen (mit Animation).\r\n\r\nLg Preveam","replies":[{"poster":"Homunculi","date":"2017-01-02T14:02:53.506+0000","up_votes":1,"down_votes":0,"body":"Ja geht, mit einem kleinen knuffigen Programm. http://store.steampowered.com/app/431960/\n\nKostet zwar 4 Euro, dass ist es aber wert.\n\nDann musst du nur noch nach einer Seite suchen, die dir z.B. Youtube Videos herunterläd, aufpassen wirklich Video nicht nur die Musik, obwohl die eine die ich gefunden hab beides konnte :).","replies":[]},{"poster":"Rioyter","date":"2016-12-30T17:10:20.915+0000","up_votes":1,"down_votes":0,"body":"Geht bestimmt nur ka wie aber hier hast du schonmal das video etc\nhttp://euw.leagueoflegends.com/de/news/riot-games/editorial/ihrem-element-der-ultimative-lux-anmeldebildschirm","replies":[]}]}
{"code":"1220032037","province_code":"12","regency_code":"1220","district_code":"122003","name":"SABA"}
{"entities":{"P7800":{"pageid":81371239,"ns":120,"title":"Property:P7800","lastrevid":1098935958,"modified":"2020-01-15T21:17:54Z","type":"property","datatype":"external-id","id":"P7800","labels":{"fr":{"language":"fr","value":"bauhaus.community"},"en":{"language":"en","value":"bauhaus.community ID"},"nl":{"language":"nl","value":"bauhaus.community-identificatiecode"},"ca":{"language":"ca","value":"identificador bauhaus.community"}},"descriptions":{"fr":{"language":"fr","value":"identifiant dans la base de donn\u00e9es https://bauhaus.community/"},"en":{"language":"en","value":"identifier in the database https://bauhaus.community/"}},"aliases":{},"claims":{"P3254":[{"mainsnak":{"snaktype":"value","property":"P3254","datavalue":{"value":"https://www.wikidata.org/wiki/Wikidata:Property_proposal/bauhaus.community","type":"string"},"datatype":"url"},"type":"statement","id":"P7800$2B226372-6679-4ED6-8995-0E4E8F7E9062","rank":"normal","references":[{"hash":"b638583a22be9a212483a85d7d2adcac0fe40b5f","snaks":{"P4656":[{"snaktype":"value","property":"P4656","datavalue":{"value":"https://www.wikidata.org/w/index.php?title=Wikidata:Property_proposal/bauhaus.community&oldid=1093302834","type":"string"},"datatype":"url"}]},"snaks-order":["P4656"]}]}],"P2429":[{"mainsnak":{"snaktype":"value","property":"P2429","datavalue":{"value":{"entity-type":"item","numeric-id":21873974,"id":"Q21873974"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"P7800$8D96910A-E7A3-4DFE-8A6D-FDB422D68A05","rank":"normal","references":[{"hash":"b638583a22be9a212483a85d7d2adcac0fe40b5f","snaks":{"P4656":[{"snaktype":"value","property":"P4656","datavalue":{"value":"https://www.wikidata.org/w/index.php?title=Wikidata:Property_proposal/bauhaus.community&oldid=1093302834","type":"string"},"datatype":"url"}]},"snaks-order":["P4656"]}]}],"P1630":[{"mainsnak":{"snaktype":"value","property":"P1630","datavalue":{"value":"https://bauhaus.community/person/$1","type":"string"},"datatype":"string"},"type":"statement","id":"P7800$E2F1E0CA-C4AB-4681-8B46-B15FEFFA9E12","rank":"normal","references":[{"hash":"b638583a22be9a212483a85d7d2adcac0fe40b5f","snaks":{"P4656":[{"snaktype":"value","property":"P4656","datavalue":{"value":"https://www.wikidata.org/w/index.php?title=Wikidata:Property_proposal/bauhaus.community&oldid=1093302834","type":"string"},"datatype":"url"}]},"snaks-order":["P4656"]}]}],"P2302":[{"mainsnak":{"snaktype":"value","property":"P2302","datavalue":{"value":{"entity-type":"item","numeric-id":19474404,"id":"Q19474404"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"P7800$67111910-5A23-44FB-A83F-CFA9BEB9E3DB","rank":"normal","references":[{"hash":"b638583a22be9a212483a85d7d2adcac0fe40b5f","snaks":{"P4656":[{"snaktype":"value","property":"P4656","datavalue":{"value":"https://www.wikidata.org/w/index.php?title=Wikidata:Property_proposal/bauhaus.community&oldid=1093302834","type":"string"},"datatype":"url"}]},"snaks-order":["P4656"]}]},{"mainsnak":{"snaktype":"value","property":"P2302","datavalue":{"value":{"entity-type":"item","numeric-id":21502410,"id":"Q21502410"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"P7800$35C0D0F1-4CB3-4A4A-926C-C1E286A15AFE","rank":"normal","references":[{"hash":"b638583a22be9a212483a85d7d2adcac0fe40b5f","snaks":{"P4656":[{"snaktype":"value","property":"P4656","datavalue":{"value":"https://www.wikidata.org/w/index.php?title=Wikidata:Property_proposal/bauhaus.community&oldid=1093302834","type":"string"},"datatype":"url"}]},"snaks-order":["P4656"]}]}],"P31":[{"mainsnak":{"snaktype":"value","property":"P31","datavalue":{"value":{"entity-type":"item","numeric-id":19847637,"id":"Q19847637"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"P7800$48CCBCE9-F1EC-4E8D-956A-EDC88D19AA49","rank":"normal","references":[{"hash":"b638583a22be9a212483a85d7d2adcac0fe40b5f","snaks":{"P4656":[{"snaktype":"value","property":"P4656","datavalue":{"value":"https://www.wikidata.org/w/index.php?title=Wikidata:Property_proposal/bauhaus.community&oldid=1093302834","type":"string"},"datatype":"url"}]},"snaks-order":["P4656"]}]}],"P1855":[{"mainsnak":{"snaktype":"value","property":"P1855","datavalue":{"value":{"entity-type":"item","numeric-id":456521,"id":"Q456521"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P7800":[{"snaktype":"value","property":"P7800","hash":"a60a6dbb704f86edbdccd6ae63d3b494b7f04f03","datavalue":{"value":"121","type":"string"},"datatype":"external-id"}]},"qualifiers-order":["P7800"],"id":"P7800$51FEA658-4240-429B-9EB4-D67184963A76","rank":"normal","references":[{"hash":"b638583a22be9a212483a85d7d2adcac0fe40b5f","snaks":{"P4656":[{"snaktype":"value","property":"P4656","datavalue":{"value":"https://www.wikidata.org/w/index.php?title=Wikidata:Property_proposal/bauhaus.community&oldid=1093302834","type":"string"},"datatype":"url"}]},"snaks-order":["P4656"]}]},{"mainsnak":{"snaktype":"value","property":"P1855","datavalue":{"value":{"entity-type":"item","numeric-id":160448,"id":"Q160448"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P7800":[{"snaktype":"value","property":"P7800","hash":"497661408ac8cf86a6dcc5ee9350ad4d8aab2347","datavalue":{"value":"1377","type":"string"},"datatype":"external-id"}]},"qualifiers-order":["P7800"],"id":"P7800$757C7FF8-7DC5-4FC3-8A95-0E3FEF6BD2C3","rank":"normal","references":[{"hash":"b638583a22be9a212483a85d7d2adcac0fe40b5f","snaks":{"P4656":[{"snaktype":"value","property":"P4656","datavalue":{"value":"https://www.wikidata.org/w/index.php?title=Wikidata:Property_proposal/bauhaus.community&oldid=1093302834","type":"string"},"datatype":"url"}]},"snaks-order":["P4656"]}]},{"mainsnak":{"snaktype":"value","property":"P1855","datavalue":{"value":{"entity-type":"item","numeric-id":86078,"id":"Q86078"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P7800":[{"snaktype":"value","property":"P7800","hash":"f6ef20267a2043e75f6873ecb2db270535d2542c","datavalue":{"value":"9","type":"string"},"datatype":"external-id"}]},"qualifiers-order":["P7800"],"id":"P7800$F158EFD8-EBBD-44DB-8502-A300B6F7ABF9","rank":"normal","references":[{"hash":"b638583a22be9a212483a85d7d2adcac0fe40b5f","snaks":{"P4656":[{"snaktype":"value","property":"P4656","datavalue":{"value":"https://www.wikidata.org/w/index.php?title=Wikidata:Property_proposal/bauhaus.community&oldid=1093302834","type":"string"},"datatype":"url"}]},"snaks-order":["P4656"]}]}]}}}}
{ "id": 136204829, "type": "Feature", "properties": { "addr:full":"108 Pinstone Street Sheffield South Yorkshire S1 2HQ", "addr:housenumber":"108", "addr:postcode":"s1 2hq", "addr:street":"Pinstone Street", "edtf:cessation":"uuuu", "edtf:inception":"uuuu", "geom:area":0.0, "geom:area_square_m":0.0, "geom:bbox":"-1.471775,53.378216,-1.471775,53.378216", "geom:latitude":53.378216, "geom:longitude":-1.471775, "iso:country":"GB", "mz:hierarchy_label":1, "mz:is_current":-1, "sg:address":"108 Pinstone Street", "sg:city":"Sheffield", "sg:classifiers":[ { "category":"Banks & Credit Unions", "subcategory":"Financial Services", "type":"Services" } ], "sg:owner":"simplegeo", "sg:phone":"+44 114 275 3737", "sg:postcode":"S1 2HQ", "sg:province":"South Yorkshire", "sg:tags":[ "building", "society" ], "src:geom":"simplegeo", "wof:belongsto":[ 85793113, "102191581", 404430843, "85633159", 404227469, 101750529, 85684537 ], "wof:breaches":[], "wof:concordances":{ "sg:id":"SG_6uNOlYO32mPPYRLUIHmsD7_53.378216_-1.471775@1300740244" }, "wof:country":"GB", "wof:geomhash":"0d937fc7276ffd8845d28812f4269554", "wof:hierarchy":[ { "continent_id":"102191581", "country_id":"85633159", "localadmin_id":404430843, "locality_id":101750529, "macroregion_id":404227469, "neighbourhood_id":85793113, "region_id":85684537, "venue_id":136204829 } ], "wof:id":136204829, "wof:lastmodified":1496963725, "wof:name":"The Nottingham Building Society", "wof:parent_id":85793113, "wof:placetype":"venue", "wof:repo":"whosonfirst-data-venue-gb", "wof:superseded_by":[], "wof:supersedes":[], "wof:tags":[] }, "bbox": [ -1.471775, 53.378216, -1.471775, 53.378216 ], "geometry": {"coordinates":[-1.471775,53.378216],"type":"Point"} }
{"time": ["21:05", "22:27", "00:15", "01:26", "02:32", "04:38", "07:18", null, null, null, null, null, null, null, null, null], "name": "Mads R Rasmussen", "speed_total": 4.9, "time_total": "", "speed": [0, 5.1, 4.6, 5.6, 4.0, 5.1, 4.5, 5.0, 4.2, 0, 0, 0, 0, 0, 0, 0], "position": 8153, "time_graph": ["2015-08-14T21:05:00", "2015-08-14T22:27:00", "2015-08-15T00:15:00", "2015-08-15T01:26:00", "2015-08-15T02:32:00", "2015-08-15T04:38:00", "2015-08-15T07:18:00", null, null, null, null, null, null, null, null, null]}
{"ygPerms":{"resourceCapabilityList":[{"resourceType":"GROUP","capabilities":[{"name":"READ"},{"name":"WELCOME_MSG"}]},{"resourceType":"PHOTO","capabilities":[{"name":"READ"},{"name":"UPLOAD"},{"name":"UPLOADTEMP"}]},{"resourceType":"FILE","capabilities":[{"name":"READ"}]},{"resourceType":"MEMBER","capabilities":[{"name":"READ"}]},{"resourceType":"LINK","capabilities":[{"name":"CREATE"},{"name":"READ"}]},{"resourceType":"CALENDAR","capabilities":[{"name":"READ"}]},{"resourceType":"DATABASE","capabilities":[{"name":"READ"},{"name":"READ_DATA"}]},{"resourceType":"POLL","capabilities":[]},{"resourceType":"MESSAGE","capabilities":[{"name":"CREATE"},{"name":"READ"}]},{"resourceType":"PENDING_MESSAGE","capabilities":[]},{"resourceType":"ATTACHMENTS","capabilities":[]},{"resourceType":"PHOTOMATIC_ALBUMS","capabilities":[{"name":"UPLOAD"}]},{"resourceType":"MEMBERSHIP_TYPE","capabilities":[{"name":"READ"}]},{"resourceType":"POST","capabilities":[{"name":"READ"},{"name":"CREATE"}]},{"resourceType":"PIN","capabilities":[{"name":"READ"},{"name":"DELETE"},{"name":"UPDATE"},{"name":"CREATE"}]}],"subStatus":"NORMAL","groupUrl":"groups.yahoo.com","intlCode":"us"},"comscore":"pageview_candidate","ygData":{"totalMsgInTopic":1,"messages":[{"userId":9958714,"authorName":"Thomas F. Kuykendall","from":"&quot;Thomas F. Kuykendall&quot; &lt;mr_t4of5@...&gt;","profile":"mr_t4of5","replyTo":"LIST","spamInfo":{"isSpam":false,"reason":"0"},"subject":"Re: [A yucky bit from the NYT","postDate":"1044397608","msgId":12203,"canDelete":false,"contentTrasformed":false,"systemMessage":false,"headers":{"messageIdInHeader":"PDIwMDMwMjA0MjIyNjQ4Ljk3MzkxLnFtYWlsQHdlYjQxMTA0Lm1haWwueWFob28uY29tPg==","inReplyToHeader":"PDEwNDQzMTg0NzcuMTg0OC45MDEyNi5tM0B5YWhvb2dyb3Vwcy5jb20+"},"prevInTopic":0,"nextInTopic":0,"prevInTime":12202,"nextInTime":12204,"topicId":12203,"numMessagesInTopic":0,"msgSnippet":"My favorite part of this: And because her own children are sometimes less than enthusiastic about school, she understands how some parents have trouble making","messageBody":"<div id=\"ygrps-yiv-2013718920\">My favorite part of this:<br/>\n<br/>\n&quot;And because her own children are sometimes less than enthusiastic about<br/>\nschool, she understands how some parents have trouble making sure theirs<br/>\ngo to class.&quot;<br/>\n<br/>\nAs in, &quot;I don&#39;t care if you don&#39;t like school, you will go to school and<br/>\nlike it!&quot; I wounder if this lady considers later in life how her children<br/>\nwill act towards her. &quot;I don&#39;t care if you don&#39;t like this retirement<br/>\nhome, you will live here and like it!&quot; I guess talking to her children to<br/>\nfind out why they don&#39;t want to go never crossed her mind.<br/>\n<br/>\nTom K.<br/>\n<br/>\n<br/>\nMessage: 9<br/>\n Date: Mon, 3 Feb 2003 11:41:22 -0700<br/>\n From: Deborah Lewis &lt;<a rel=\"nofollow\" target=\"_blank\" href=\"mailto:ddzimlew@...\">ddzimlew@...</a>&gt;<br/>\nSubject: A yucky bit from the NYT<br/>\n<br/>\nI was just at Yahoo groups and it says there are 324 members on this<br/>\nlist. As Dylan would say, &quot;Holy Buckets!&quot;<br/>\nBut anyway...<br/>\nJanuary 30, 2003<br/>\nPhiladelphia Recruits and Trains Parents as Truant Officers<br/>\nBy THE ASSOCIATED PRESS<br/>\n<br/>\n<br/>\nHILADELPHIA, Jan. 29 � In an effort to corral thousands of <br/>\nclass-cutting<br/>\nstudents, the Philadelphia school district hired 250 truant officers <br/>\nlate<br/>\nlast year.<br/>\nAmong its hiring criteria for the job, one element loomed most <br/>\nimportant:<br/>\nthe district specifically recruited parents.<br/>\n&quot;Parents know the terrain, know the environment, understand the culture<br/>\nand may even know some of the individual parents and kids,&quot; said Paul<br/>\nVallas, chief executive of the 200,000-student school system.<br/>\nTruancy is a big concern in Philadelphia. On any given day, more than<br/>\n12,000 Philadelphia students, or 6.4 percent, are absent without an<br/>\nexcuse.<br/>\nThe problem worries school officials because truants are more likely to<br/>\nuse drugs, join gangs, commit crimes or drop out.<br/>\n&quot;Truancy is our first best flag that a kid will enter the juvenile<br/>\njustice system,&quot; said Ken Seeley, who is studying the effectiveness of<br/>\nseven truancy reduction programs for the Justice Department.<br/>\nMr. Vallas hired 600 parents for a similar program in Chicago, where he<br/>\nheaded the school system for six years. He said the program cut truancy<br/>\nto 3.9 percent from 5.7 percent.<br/>\nPhiladelphia contracted with 12 community and religious organizations <br/>\nto<br/>\nhire and train parent-truant officers. The training began last month; <br/>\nso<br/>\nfar, 166 parents have gone through the program and started visiting the<br/>\nhomes of truants. The officers are paid $9 an hour for at least 10 <br/>\nhours<br/>\na week.<br/>\n&quot;The primary role is to inform parents that their child has been <br/>\ntruant,<br/>\nthat resources are available, that we are ready to help,&quot; said Vern<br/>\nTrent, who heads the program.<br/>\nWhile it is too soon to tell whether the $1.2 million program is <br/>\nworking,<br/>\nthe officers had more than 1,600 contacts with parents through Dec. 31.<br/>\nSome parents are unaware that their children are cutting class. Others<br/>\ncannot afford clothes or bus tokens. Others are on drugs or alcohol.<br/>\nHastings Coach, who heads the parent-truant officer program for the<br/>\nWomen&#39;s Association for Women&#39;s Alternatives, a social services agency,<br/>\nsaid officers were told to be supportive and understanding, not<br/>\nthreatening.<br/>\n&quot;Any time you&#39;re in someone&#39;s home, you&#39;re a guest and you have to<br/>\nconduct yourself accordingly. You&#39;re not some authority with a stiff<br/>\nhand. You want to be invited back,&quot; Mr. Coach said.<br/>\nBut officers also explain that chronic absenteeism could land both<br/>\nstudents and their parents in the truancy court, with the possibility <br/>\nof<br/>\nfines, community service and even jail for the adults and transfer to <br/>\nan<br/>\nalternative school for the pupils.<br/>\nThat is smart, Mr. Seeley said, because any successful <br/>\ntruancy-reduction<br/>\nprogram needs to have both carrots and sticks. In Jacksonville, Fla., <br/>\none<br/>\nof the programs he is studying, more than 100 parents have been <br/>\narrested<br/>\nfor failing to send their children to school.<br/>\nJennifer Jones, 42, whose children are 6, 16 and 19, said <br/>\nPhiladelphia&#39;s<br/>\ntruancy program was a natural fit for her. Her house is a magnet for<br/>\nneighborhood children; she has been known to break up fistfights; even<br/>\nbefore she became a truant officer, she confronted truants and ordered<br/>\nthem to go back to school.<br/>\nAnd because her own children are sometimes less than enthusiastic about<br/>\nschool, she understands how some parents have trouble making sure <br/>\ntheirs<br/>\ngo to class.<br/>\n&quot;I think people feel more comfortable dealing with another parent,&quot; Ms.<br/>\nJones said. &quot;Parents know what kids are capable of, how their minds<br/>\nwork.&quot;<br/>\n<br/>\n[Non-text portions of this message have been removed]<br/>\n<br/>\n<br/>\n__________________________________________________<br/>\nDo you Yahoo!?<br/>\nYahoo! Mail Plus - Powerful. Affordable. Sign up now.<br/>\n<a rel=\"nofollow\" target=\"_blank\" href=\"http://mailplus.yahoo.com\">http://mailplus.yahoo.com</a></div>","specialLinks":[]}],"prevTopicId":12194,"nextTopicId":12212}}
{"geometry":{"type":"Polygon","coordinates":[[[139.465942,35.527756],[139.460449,35.527756],[139.460449,35.527756],[139.456918,35.532095],[139.457239,35.532489],[139.464087,35.536696],[139.465942,35.536696],[139.467334,35.536126],[139.467654,35.535732],[139.466356,35.527756],[139.465942,35.527756]]]},"id":85935079,"type":"Feature","properties":{"geom:longitude":139.463045,"misc:woe_lau":28415083,"misc:localhoods":21,"misc:name_local":"\u753a\u7530\u5e02","gn:id":"","src:geom_alt":[],"wof:hierarchy":[{"locality_id":102031565,"country_id":85632429,"region_id":85672817,"neighbourhood_id":85935079}],"misc:placetype":"Suburb","iso:country":"JP","misc:photo_sum":9,"wof:geomhash":"75bfae91b17cbbe385c21024cdfb82cf","misc:woe_ver":"7.10.0","wof:name":"\uff08\u4e01\u76ee\u306a\u3057\uff09","name:jpn_p":["\uff08\u4e01\u76ee\u306a\u3057\uff09"],"wof:supersedes":[],"src:geom":"quattroshapes","misc:name":"\uff08\u4e01\u76ee\u306a\u3057\uff09","wof:id":85935079,"misc:quad_count":1,"wof:placetype":"neighbourhood","wof:breaches":[],"misc:name_lau":"\u91d1\u68ee","misc:gn_id":0,"geom:area":0.000067,"geom:latitude":35.531963,"misc:woe_adm2":0,"misc:name_adm0":"\u65e5\u672c","misc:name_adm1":"\u6771\u4eac\u90fd","misc:woe_local":1111475,"wof:superseded_by":[],"misc:photo_max":9,"wof:belongsto":[102031565,85632429,85672817],"misc:local_max":1601,"misc:woe_adm1":2345889,"misc:woe_adm0":23424856,"wof:lastmodified":1439487125,"misc:gn_local":0,"misc:local_sum":3692,"wof:concordances":{"gp:id":90009947,"qs:id":1055444},"wof:parent_id":102031565},"bbox":[139.456918,35.527756,139.467654,35.536696]}
{ "matches": [ { "away": "fulham", "home": "arsenal", "pageUrl": "/livescores/3411659/matchfacts/arsenal-vs-fulham" }, { "away": "manchester city", "home": "aston villa", "pageUrl": "/livescores/3411660/matchfacts/aston-villa-vs-manchester-city" }, { "away": "brighton & hove albion", "home": "chelsea", "pageUrl": "/livescores/3411661/matchfacts/chelsea-vs-brighton-&-hove-albion" }, { "away": "tottenham hotspur", "home": "everton", "pageUrl": "/livescores/3411662/matchfacts/everton-vs-tottenham-hotspur" }, { "away": "liverpool", "home": "leeds united", "pageUrl": "/livescores/3411663/matchfacts/leeds-united-vs-liverpool" }, { "away": "west bromwich albion", "home": "leicester city", "pageUrl": "/livescores/3411664/matchfacts/leicester-city-vs-west-bromwich-albion" }, { "away": "burnley", "home": "manchester united", "pageUrl": "/livescores/3411665/matchfacts/manchester-united-vs-burnley" }, { "away": "west ham united", "home": "newcastle united", "pageUrl": "/livescores/3411666/matchfacts/newcastle-united-vs-west-ham-united" }, { "away": "crystal palace", "home": "southampton", "pageUrl": "/livescores/3411667/matchfacts/southampton-vs-crystal-palace" }, { "away": "sheffield united", "home": "wolverhampton wanderers", "pageUrl": "/livescores/3411668/matchfacts/wolverhampton-wanderers-vs-sheffield-united" } ] }
{ "directions": [ "Preheat an oven to 350 degrees F (175 degrees C).", "Cut 1/2 cup butter into 1 cup flour with a knife or pastry blender in a bowl until the mixture resembles coarse crumbs. Stir in 1/4 teaspoon butter extract. Add the water a tablespoon at a time, tossing with a fork, until the flour mixture is moistened. Press mixture onto the bottom of a 10x13-inch baking sheet.", "Bring 1 cup water, 1/2 cup butter, and 1/2 teaspoon butter extract to a boil in a saucepan over medium-high heat. Remove from heat, then beat in 1 cup flour. Beat in eggs one at a time until blended. Stir in 1 teaspoon almond extract, and pour over crust.", "Bake in the preheated oven until golden brown, about 55 minutes.", "Meanwhile, mix the confectioners' sugar, 1/2 teaspoon almond extract, 1/4 teaspoon butter extract, and 1 tablespoon milk in a bowl until smooth. Spread mixture over the hot pastry." ], "image": "https://imagesvc.meredithcorp.io/v3/mm/image?q=85&c=sc&poi=face&w=4048&h=2119&url=https%3A%2F%2Fimages.media-allrecipes.com%2Fuserphotos%2F4754555.jpg", "ingredients": [ "\u00bd cup butter", "1 cup all-purpose flour", "\u00bc teaspoon butter flavored extract", "2 tablespoons water", "1 cup water", "\u00bd cup butter", "\u00bc teaspoon butter flavored extract", "1 cup all-purpose flour", "3 eggs", "1 teaspoon almond extract", "1 cup confectioners' sugar", "\u00bd teaspoon almond extract", "\u00bc teaspoon butter flavored extract", "1 tablespoon milk" ], "language": "en-US", "source": "allrecipes.com", "tags": [], "title": "Swedish Pastry", "url": "http://allrecipes.com/recipe/218535/swedish-pastry/" }
{"id":7044,"kabid":511,"name":"Selemkai","hash":"95dc1f54d2d210bd3f5dcec5f77ccd9e"}
{ "id": 923925525, "type": "Feature", "properties": { "addr:full":"239 Lord Street Southport Lancashire PR8 1NZ", "addr:housenumber":"239", "addr:postcode":"pr8 1nz", "addr:street":"Lord Street", "edtf:cessation":"uuuu", "edtf:inception":"uuuu", "geom:area":0.0, "geom:area_square_m":0.0, "geom:bbox":"-3.0064969063,53.647895813,-3.0064969063,53.647895813", "geom:latitude":53.647896, "geom:longitude":-3.006497, "iso:country":"GB", "mz:hierarchy_label":1, "mz:is_current":-1, "sg:address":"239 Lord Street", "sg:city":"Southport", "sg:classifiers":[ { "category":"Travel", "subcategory":"Hotels & Motels", "type":"Entertainment" }, { "category":"Restaurant", "subcategory":"", "type":"Food & Drink" } ], "sg:owner":"simplegeo", "sg:phone":"+44 1704 543000", "sg:postcode":"PR8 1NZ", "sg:province":"Lancashire", "sg:website":"http://www.scarisbrickhotel.com", "src:geom":"simplegeo", "wof:belongsto":[ 85785733, "102191581", 404434509, "85633159", 404227469, 101750595, 85684335 ], "wof:breaches":[], "wof:concordances":{ "sg:id":"SG_34ziLSzNebGZicVXwGgAss_53.647896_-3.006497@1300740687" }, "wof:country":"GB", "wof:created":1471936725, "wof:geomhash":"ee1a1f434fe3935d8663a04de0555b82", "wof:hierarchy":[ { "continent_id":"102191581", "country_id":"85633159", "localadmin_id":404434509, "locality_id":101750595, "macroregion_id":404227469, "neighbourhood_id":85785733, "region_id":85684335, "venue_id":923925525 } ], "wof:id":923925525, "wof:lastmodified":1496969884, "wof:name":"Scarisbrick Hotel Ltd.", "wof:parent_id":85785733, "wof:placetype":"venue", "wof:repo":"whosonfirst-data-venue-gb", "wof:superseded_by":[], "wof:supersedes":[], "wof:tags":[] }, "bbox": [ -3.0064969063, 53.647895813, -3.0064969063, 53.647895813 ], "geometry": {"coordinates":[-3.0064969063,53.647895813],"type":"Point"} }
[ { "model": "bus.MasterRoutes", "fields": { "id": 1, "user_id": "1", "route_name": "川之内線" } }, { "model": "bus.MasterRoutes", "fields": { "id": 2, "user_id": "1", "route_name": "音地線" } }, { "model": "bus.MasterRoutes", "fields": { "id": 3, "user_id": "1", "route_name": "大藤線" } }, { "model": "bus.MasterRoutes", "fields": { "id": 4, "user_id": "1", "route_name": "増田線" } }, { "model": "bus.MasterRoutes", "fields": { "id": 5, "user_id": "1", "route_name": "川之内線（三間小学校便）" } }, { "model": "bus.MasterRoutes", "fields": { "id": 6, "user_id": "1", "route_name": "音地線（二名小学校便）" } } ]
{ "project_info": { "project_number": "317062236916", "firebase_url": "https://suburb-runner.firebaseio.com", "project_id": "suburb-runner", "storage_bucket": "suburb-runner.appspot.com" }, "client": [ { "client_info": { "mobilesdk_app_id": "1:317062236916:android:a0abb42f0aea454c08eca1", "android_client_info": { "package_name": "com.napier.mad" } }, "oauth_client": [ { "client_id": "317062236916-0bn0fmo6befeaumrvgakscef1cvbnfio.apps.googleusercontent.com", "client_type": 1, "android_info": { "package_name": "com.napier.mad", "certificate_hash": "9a556c32227fa17bcb02d889bb964f05c578e68b" } }, { "client_id": "317062236916-01e6ssggg32ncb91abb0r1um1328nb8l.apps.googleusercontent.com", "client_type": 3 } ], "api_key": [ { "current_key": "AIzaSyBBpj6XrWPFShMPz0mcodY43qqe3doYXK8" } ], "services": { "appinvite_service": { "other_platform_oauth_client": [ { "client_id": "317062236916-01e6ssggg32ncb91abb0r1um1328nb8l.apps.googleusercontent.com", "client_type": 3 } ] } } } ], "configuration_version": "1" }
{"uuid":"f12d8f5c-5a34-4b20-b27b-f2f6cd771f17","name":"Default test","children":["9cf733b7-c75b-44b1-8b84-aae3d3013f5f"],"befores":[],"afters":[],"links":[],"start":1576150189731,"stop":1576150225654}
["16ba362d035f956d1e11ab69065481bfeaa2af99"]
{"across": {"1": {"clue": "Acronym for a clause in a union contract", "answer": "COLA", "row": 0, "col": 0}, "5": {"clue": "Cow and field followers", "answer": "PEAS", "row": 0, "col": 5}, "9": {"clue": "Overweight", "answer": "OBESE", "row": 0, "col": 10}, "14": {"clue": "Sherman Hemsley vehicle on TV", "answer": "AMEN", "row": 1, "col": 0}, "15": {"clue": "Kilmer's rhyme for \"rain\"", "answer": "LAIN", "row": 1, "col": 5}, "16": {"clue": "Gordon and Roman", "answer": "RUTHS", "row": 1, "col": 10}, "17": {"clue": "Diagonal", "answer": "BIAS", "row": 2, "col": 0}, "18": {"clue": "Woody's son", "answer": "ARLO", "row": 2, "col": 5}, "19": {"clue": "Barber's need", "answer": "STROP", "row": 2, "col": 10}, "20": {"clue": "Leroy Anderson opus", "answer": "THETYPEWRITER", "row": 3, "col": 1}, "23": {"clue": "Asian tongue", "answer": "LAO", "row": 4, "col": 3}, "24": {"clue": "Hindu god of bad luck", "answer": "SANI", "row": 4, "col": 8}, "25": {"clue": "Fabrics' meas.", "answer": "YDS", "row": 5, "col": 0}, "28": {"clue": "___ the finish", "answer": "INAT", "row": 5, "col": 4}, "31": {"clue": "Sgt., e.g.", "answer": "NONCOM", "row": 5, "col": 9}, "35": {"clue": "___ a limb", "answer": "OUTON", "row": 6, "col": 0}, "37": {"clue": "British servicewoman", "answer": "WAAC", "row": 6, "col": 6}, "39": {"clue": "Unit of loudness", "answer": "SONE", "row": 6, "col": 11}, "40": {"clue": "Epithet for Pope John Paul II", "answer": "KEEPEROFTHEKEYS", "row": 7, "col": 0}, "43": {"clue": "Unicorn fish", "answer": "UNIE", "row": 8, "col": 0}, "44": {"clue": "___ Peak, in the Sierra Nevada", "answer": "ALTA", "row": 8, "col": 5}, "45": {"clue": "Parachute material", "answer": "NYLON", "row": 8, "col": 10}, "46": {"clue": "Kind of opus", "answer": "MAGNUM", "row": 9, "col": 0}, "48": {"clue": "Battle site: 1944", "answer": "STLO", "row": 9, "col": 7}, "50": {"clue": "\"A Boy Named ___\"", "answer": "SUE", "row": 9, "col": 12}, "51": {"clue": "Writer Bagnold", "answer": "ENID", "row": 10, "col": 3}, "53": {"clue": "Island off Jutland", "answer": "ALS", "row": 10, "col": 9}, "55": {"clue": "Borge needs", "answer": "CONCERTGRANDS", "row": 11, "col": 1}, "61": {"clue": "One of the Gabors", "answer": "MAGDA", "row": 12, "col": 0}, "62": {"clue": "Flag", "answer": "IRIS", "row": 12, "col": 6}, "63": {"clue": "Art Deco name", "answer": "ERTE", "row": 12, "col": 11}, "65": {"clue": "Chandler's \"The Big ___\"", "answer": "SLEEP", "row": 13, "col": 0}, "66": {"clue": "Transportation for Tarzan", "answer": "VINE", "row": 13, "col": 6}, "67": {"clue": "Haven of a sort", "answer": "LAIR", "row": 13, "col": 11}, "68": {"clue": "Coasters", "answer": "SLEDS", "row": 14, "col": 0}, "69": {"clue": "Painter Schiele", "answer": "EGON", "row": 14, "col": 6}, "70": {"clue": "Vega's constellation", "answer": "LYRA", "row": 14, "col": 11}}, "down": {"1": {"clue": "Semi compartment", "answer": "CAB", "row": 0, "col": 0}, "2": {"clue": "Exclude", "answer": "OMIT", "row": 0, "col": 1}, "3": {"clue": "Jacob's first wife", "answer": "LEAH", "row": 0, "col": 2}, "4": {"clue": "Photographer Adams", "answer": "ANSEL", "row": 0, "col": 3}, "5": {"clue": "___ words (pun)", "answer": "PLAYON", "row": 0, "col": 5}, "6": {"clue": "Wild West name", "answer": "EARP", "row": 0, "col": 6}, "7": {"clue": "Ange appendage", "answer": "AILE", "row": 0, "col": 7}, "8": {"clue": "Causes of wonderlands?", "answer": "SNOWS", "row": 0, "col": 8}, "9": {"clue": "Duke in \"Twelfth Night\"", "answer": "ORSINO", "row": 0, "col": 10}, "10": {"clue": "Kibitzer", "answer": "BUTTINSKY", "row": 0, "col": 11}, "11": {"clue": "Raison d'___", "answer": "ETRE", "row": 0, "col": 12}, "12": {"clue": "Memorable restaurateur", "answer": "SHOR", "row": 0, "col": 13}, "13": {"clue": "Test type at Duke U.", "answer": "ESP", "row": 0, "col": 14}, "21": {"clue": "Hippolyte, the philosopher-critic", "answer": "TAINE", "row": 3, "col": 4}, "22": {"clue": "Southfork, e.g.", "answer": "RANCH", "row": 3, "col": 9}, "25": {"clue": "Comics name", "answer": "YOKUM", "row": 5, "col": 0}, "26": {"clue": "Spanish landlady", "answer": "DUENA", "row": 5, "col": 1}, "27": {"clue": "Cartoonist William", "answer": "STEIG", "row": 5, "col": 2}, "29": {"clue": "M.P.'s quarry", "answer": "AWOL", "row": 5, "col": 6}, "30": {"clue": "Noted Ohio family", "answer": "TAFTS", "row": 5, "col": 7}, "32": {"clue": "Oriental cuckoos: Var.", "answer": "COELS", "row": 5, "col": 12}, "33": {"clue": "\"The joke's ___!\"", "answer": "ONYOU", "row": 5, "col": 13}, "34": {"clue": "Feudal lord", "answer": "MESNE", "row": 5, "col": 14}, "36": {"clue": "Like some debates", "answer": "OPENENDED", "row": 6, "col": 3}, "38": {"clue": "Rat tail", "answer": "ATAT", "row": 6, "col": 8}, "41": {"clue": "Textile fiber", "answer": "RAMIE", "row": 7, "col": 5}, "42": {"clue": "___ Gay, Col. Tibbets's plane", "answer": "ENOLA", "row": 7, "col": 10}, "47": {"clue": "Opens a bottle", "answer": "UNCAPS", "row": 9, "col": 4}, "49": {"clue": "Jack London's Wolf ___", "answer": "LARSEN", "row": 9, "col": 9}, "52": {"clue": "Get-up-and-go", "answer": "DRIVE", "row": 10, "col": 6}, "54": {"clue": "Fishhook attachment", "answer": "SNELL", "row": 10, "col": 11}, "55": {"clue": "Visit", "answer": "CALL", "row": 11, "col": 1}, "56": {"clue": "Pointed arch", "answer": "OGEE", "row": 11, "col": 2}, "57": {"clue": "Kin of alg.", "answer": "TRIG", "row": 11, "col": 7}, "58": {"clue": "Football Hall of Famer Marchetti", "answer": "GINO", "row": 11, "col": 8}, "59": {"clue": "Squirrel's nest", "answer": "DRAY", "row": 11, "col": 12}, "60": {"clue": "Brouhaha", "answer": "STIR", "row": 11, "col": 13}, "61": {"clue": "Eds.' concerns", "answer": "MSS", "row": 12, "col": 0}, "64": {"clue": "An interest of NOW", "answer": "ERA", "row": 12, "col": 14}}}
[ { "@disambiguation": "", "@mbid": "163030bc-0a85-477e-a117-6cba2a5170be", "@name": "Lakim", "@sortName": "Lakim", "url": "http://www.setlist.fm/setlists/lakim-33db34c5.html" } ]
{"frames": { "tr_downStand": { "frame": {"x":13,"y":148,"w":43,"h":66}, "spriteSourceSize": {"x":0,"y":0,"w":43,"h":66}, "sourceSize": {"w":43,"h":66} }, "tr_leftStand": { "frame": {"x":249,"y":149,"w":59,"h":64}, "spriteSourceSize": {"x":0,"y":0,"w":59,"h":64}, "sourceSize": {"w":59,"h":64} }, "tr_upStand": { "frame": {"x":500,"y":148,"w":44,"h":66}, "spriteSourceSize": {"x":0,"y":0,"w":44,"h":66}, "sourceSize": {"w":44,"h":66} }, "tr_rightStand": { "frame": {"x":735,"y":149,"w":62,"h":65}, "spriteSourceSize": {"x":0,"y":0,"w":62,"h":65}, "sourceSize": {"w":62,"h":65} }, "tr_downPrepare": { "frame": {"x":9,"y":292,"w":51,"h":66}, "spriteSourceSize": {"x":0,"y":0,"w":51,"h":66}, "sourceSize": {"w":51,"h":66} }, "tr_leftPrepare": { "frame": {"x":250,"y":292,"w":57,"h":66}, "spriteSourceSize": {"x":0,"y":0,"w":57,"h":66}, "sourceSize": {"w":57,"h":66} }, "tr_upPrepare": { "frame": {"x":496,"y":292,"w":52,"h":68}, "spriteSourceSize": {"x":0,"y":0,"w":52,"h":68}, "sourceSize": {"w":52,"h":68} }, "tr_rightPrepare": { "frame": {"x":733,"y":293,"w":62,"h":68}, "spriteSourceSize": {"x":0,"y":0,"w":62,"h":68}, "sourceSize": {"w":62,"h":68} }, "tr_downAttack": { "frame": {"x":11,"y":438,"w":50,"h":62}, "spriteSourceSize": {"x":0,"y":0,"w":50,"h":62}, "sourceSize": {"w":50,"h":62} }, "tr_leftAttack": { "frame": {"x":239,"y":440,"w":66,"h":61}, "spriteSourceSize": {"x":0,"y":0,"w":66,"h":61}, "sourceSize": {"w":66,"h":61} }, "tr_upAttack": { "frame": {"x":490,"y":441,"w":52,"h":59}, "spriteSourceSize": {"x":0,"y":0,"w":52,"h":59}, "sourceSize": {"w":52,"h":59} }, "tr_rightAttack": { "frame": {"x":726,"y":440,"w":68,"h":61}, "spriteSourceSize": {"x":0,"y":0,"w":68,"h":61}, "sourceSize": {"w":68,"h":61} }}, "meta": { "app": "http://www.texturepacker.com", "version": "1.0", "image": "traductus.png", "format": "RGBA8888", "size": {"w":256,"h":512}, "scale": "1", "smartupdate": "$TexturePacker:SmartUpdate:9e3e5afd01ea8e418afabfbdcd724485$" } }
{"poster":"Freeehz meeee","date":"2020-02-18T21:06:21.059+0000","title":"Question about just how imminent a perma ban is","subforum":"Player Behavior","up_votes":1,"down_votes":0,"body":"So I just received a 14 day ban for chat. I am going to try playing on other accounts with my chat off and discipline myself to not wanna turn it on(even though it feels weird to play without communication in a team based game, but whatever). So lets say i come back from my ban and have chat turned off for months, then 1 day(lets say 4 months later) i decide \"maybe i should turn chat back on\" and i just lose my shit on a guy who is trolling. Am i pretty much just getting the permaban? Or does the system take in that I haven't been mean in chat for a while and acts accordingly?\r\n\r\nI guess basically, is my account going to get permaban the next time i get punished no matter what or how long its been?","replies":[{"poster":"Hotarµ","date":"2020-02-18T21:20:51.499+0000","up_votes":3,"down_votes":0,"body":"Until your punishment level drops, any breach of the rules will warrant a permanent suspension.\n\n _In general_, it can take anywhere from 1-3+ months for your account health to begin restoring. If you want to play on another account to practice neutral/good behavior, that's a good idea, but just be aware that your punishment level will not decrease while your account is inactive. You have to be playing on the punished account for progress to be made.","replies":[]},{"poster":"rujitra","date":"2020-02-18T21:59:10.797+0000","up_votes":2,"down_votes":0,"body":"Your account can return to good standing but it takes time, good behavior, and games.\n\nTwo of the three won't do it - playing 100 games per week doesn't mean after a week or two you'll be back in good standing. On the other hand, going 4 months and only playing 100 games over the whole 4 months likely wouldn't cut it either. There is no set criteria - it is fluid and based on your behavior in those games over that time.","replies":[]},{"poster":"Totalwanabe","date":"2020-02-18T21:28:03.454+0000","up_votes":2,"down_votes":0,"body":"if you're asking for yourself good chance it's already underway","replies":[]},{"poster":"MagicFlyingLlama","date":"2020-02-18T21:09:25.160+0000","up_votes":2,"down_votes":0,"body":"Any further infraction of any kind is an immediate permban, after a 14-day. It even says that when you log in.","replies":[]},{"poster":"Kei143","date":"2020-02-18T21:40:23.810+0000","up_votes":3,"down_votes":1,"body":"Your account will drop punishment tiers based on games played. For a player with average play time, it will take 3 months of play to drop a punishment tier.\n\nIf you play alot of games, it will take less games, if you don't touch that account, then the punishment tier won't change.","replies":[]},{"poster":"MyAccountStolen1","date":"2020-02-18T23:32:12.551+0000","up_votes":1,"down_votes":2,"body":"Basically you need to get back to level 2 honor, without getting anymore punishments. That is no guarantee, but I've had friends make it this far from 14 day bans, then get a 10 game chat restrict. So its very difficult to do, that account is probably gonna get banned at some point when you slip up next. So just get over that fact and realize its already gone. Then it doesnt really matter when it happens.\n\n My advice is make a new account, and stop spending money on ALL accounts. That way when the bans inevitably happen, you wont really care. This is how I deal with disgusting automated system and RIOTs lack of interest in changing the system. Its not gonna change, cant change myself, and I don't really want to anyway. People Im toxic to in this game actually deserve it. :)","replies":[{"poster":"Silent Gravity","date":"2020-02-18T23:51:49.758+0000","up_votes":2,"down_votes":0,"body":"Honor restores much faster than punishment levels reset. Aim for at least honor 2 and 2/3.","replies":[]}]},{"poster":"Pombagira","date":"2020-02-19T09:08:41.647+0000","up_votes":1,"down_votes":0,"body":"I want to add a suggestion so you can keep your account and not lose your absolute shit:\neither keep chat muted for at least 8 months minimum (if you get angry easily)\nor be extremely careful with what you say and I mean CAREFUL. Even asking for reports or calling out someone who is trolling/toxic/inting/etc is punishable. \n\nI wish you the best of luck!","replies":[]},{"poster":"Scurvy Bunghole","date":"2020-02-18T21:18:21.620+0000","up_votes":1,"down_votes":8,"body":"You can be mean one time and get away with it, but that's it.","replies":[{"poster":"Hotarµ","date":"2020-02-18T21:22:16.461+0000","up_votes":2,"down_votes":0,"body":"That's obviously not true and I would appreciate it if you didn't spread blatant misinformation.","replies":[{"poster":"Scurvy Bunghole","date":"2020-02-18T21:31:49.692+0000","up_votes":1,"down_votes":6,"body":"Okay okay. You can be mean twice","replies":[]}]}]}]}
"{\"count\":199865,\"results\":[{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"danieljamesscott com_music version 0.2\",\"name\":\"cpe:\\/a:danieljamesscott:com_music:0.2\",\"_id\":75242752},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"oscss oscss version 1.0.1 beta\",\"name\":\"cpe:\\/a:oscss:oscss:1.0.1:beta\",\"_id\":75243008},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"danieljamesscott com_music version 0.9\",\"name\":\"cpe:\\/a:danieljamesscott:com_music:0.9\",\"_id\":75243264},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.30.6\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.30.6\",\"_id\":75243520},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"oscss oscss version 1.2.2 rc\",\"name\":\"cpe:\\/a:oscss:oscss:1.2.2:rc\",\"_id\":75243776},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"danieljamesscott com_music version 0.8\",\"name\":\"cpe:\\/a:danieljamesscott:com_music:0.8\",\"_id\":75244032},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.47.00\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.47.00\",\"_id\":75244288},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"danieljamesscott com_music version 0.7\",\"name\":\"cpe:\\/a:danieljamesscott:com_music:0.7\",\"_id\":75244544},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"oscss oscss version 1.2.2 rca\",\"name\":\"cpe:\\/a:oscss:oscss:1.2.2:rca\",\"_id\":75244800},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.32.0\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.32.0\",\"_id\":75245056},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"danieljamesscott com_music version 0.1 -\",\"name\":\"cpe:\\/a:danieljamesscott:com_music:0.1:-\",\"_id\":75245312},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.30.2\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.30.2\",\"_id\":75245568},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"danieljamesscott com_music version 0.6\",\"name\":\"cpe:\\/a:danieljamesscott:com_music:0.6\",\"_id\":75245824},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.31.0\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.31.0\",\"_id\":75246080},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"danieljamesscott com_music version 0.10\",\"name\":\"cpe:\\/a:danieljamesscott:com_music:0.10\",\"_id\":75246336},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"danieljamesscott com_music version 0.12\",\"name\":\"cpe:\\/a:danieljamesscott:com_music:0.12\",\"_id\":75246592},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.47.03\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.47.03\",\"_id\":75246848},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"danieljamesscott com_music version 0.11\",\"name\":\"cpe:\\/a:danieljamesscott:com_music:0.11\",\"_id\":75247104},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.39.0\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.39.0\",\"_id\":75247360},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.38.03\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.38.03\",\"_id\":75247616},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.38.04\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.38.04\",\"_id\":75247872},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.38.02\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.38.02\",\"_id\":75248128},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.44.00\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.44.00\",\"_id\":75248384},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.42.01\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.42.01\",\"_id\":75248640},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.36.00\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.36.00\",\"_id\":75248896},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.0.1\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.0.1\",\"_id\":75249152},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.40.01\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.40.01\",\"_id\":75249408},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.34.01\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.34.01\",\"_id\":75249664},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.42.0\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.42.0\",\"_id\":75250176},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.38\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.38\",\"_id\":75250432},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.13\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.13\",\"_id\":75250688},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.34\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.34\",\"_id\":75250944},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.37.02\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.37.02\",\"_id\":75251200},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.37.00\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.37.00\",\"_id\":75251456},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.37.01\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.37.01\",\"_id\":75251712},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.35.00\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.35.00\",\"_id\":75251968},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.33.01\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.33.01\",\"_id\":75252224},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.41.02\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.41.02\",\"_id\":75252480},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.30\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.30\",\"_id\":75252736},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"boesch-it simpnews version 2.41.0\",\"name\":\"cpe:\\/a:boesch-it:simpnews:2.41.0\",\"_id\":75252992},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"emc celerra_network_attached_storage\",\"name\":\"cpe:\\/h:emc:celerra_network_attached_storage\",\"_id\":75253504},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"adobe coldfusion version 9.0.1\",\"name\":\"cpe:\\/a:adobe:coldfusion:9.0.1\",\"_id\":75253760},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"adobe acrobat version 9.3.3\",\"name\":\"cpe:\\/a:adobe:acrobat:9.3.3\",\"_id\":75254272},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"adobe acrobat_reader version 9.3.3\",\"name\":\"cpe:\\/a:adobe:acrobat_reader:9.3.3\",\"_id\":75254528},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"adobe acrobat version 9.3.4\",\"name\":\"cpe:\\/a:adobe:acrobat:9.3.4\",\"_id\":75259904},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"adobe acrobat_reader version 9.3.4\",\"name\":\"cpe:\\/a:adobe:acrobat_reader:9.3.4\",\"_id\":75260160},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"adobe flash_player version 10.1.82.76\",\"name\":\"cpe:\\/a:adobe:flash_player:10.1.82.76\",\"_id\":75260672},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"adobe flash_player version 10.1.92.10\",\"name\":\"cpe:\\/a:adobe:flash_player:10.1.92.10\",\"_id\":75260928},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"adobe robohelp version 8\",\"name\":\"cpe:\\/a:adobe:robohelp:8\",\"_id\":75261440},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"tu-braunschweig libsmi version 0.4.8\",\"name\":\"cpe:\\/a:tu-braunschweig:libsmi:0.4.8\",\"_id\":75263232},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"landesk management_gateway version 4.2\",\"name\":\"cpe:\\/h:landesk:management_gateway:4.2\",\"_id\":75263744},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"landesk management_gateway version 4.0\",\"name\":\"cpe:\\/h:landesk:management_gateway:4.0\",\"_id\":75264000},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"landesk management_gateway version 4.2-1.8\",\"name\":\"cpe:\\/h:landesk:management_gateway:4.2-1.8\",\"_id\":75264256},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"landesk management_gateway version 4.0-1.48\",\"name\":\"cpe:\\/h:landesk:management_gateway:4.0-1.48\",\"_id\":75264512},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"ibm filenet_content_manager version 4.0.0\",\"name\":\"cpe:\\/a:ibm:filenet_content_manager:4.0.0\",\"_id\":75265024},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"ibm filenet_content_manager version 4.5.1\",\"name\":\"cpe:\\/a:ibm:filenet_content_manager:4.5.1\",\"_id\":75265280},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"ibm filenet_content_manager version 4.5.0\",\"name\":\"cpe:\\/a:ibm:filenet_content_manager:4.5.0\",\"_id\":75265536},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"sap system_landscape_directory version 7.02\",\"name\":\"cpe:\\/a:sap:system_landscape_directory:7.02\",\"_id\":75267840},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"sap netweaver version 6.4\",\"name\":\"cpe:\\/a:sap:netweaver:6.4\",\"_id\":75268096},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"sap system_landscape_directory version 7.0\",\"name\":\"cpe:\\/a:sap:system_landscape_directory:7.0\",\"_id\":75268352},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"sap system_landscape_directory version 6.4\",\"name\":\"cpe:\\/a:sap:system_landscape_directory:6.4\",\"_id\":75268608},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"brotherscripts scripts_directory\",\"name\":\"cpe:\\/a:brotherscripts:scripts_directory\",\"_id\":75269120},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"scriptsfeed scripts_directory\",\"name\":\"cpe:\\/a:scriptsfeed:scripts_directory\",\"_id\":75269376},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"huruhelpdesk com_huruhelpdesk version 0.86\",\"name\":\"cpe:\\/a:huruhelpdesk:com_huruhelpdesk:0.86\",\"_id\":75270144},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"huruhelpdesk com_huruhelpdesk version 0.85\",\"name\":\"cpe:\\/a:huruhelpdesk:com_huruhelpdesk:0.85\",\"_id\":75270400},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"huruhelpdesk com_huruhelpdesk version 0.87\",\"name\":\"cpe:\\/a:huruhelpdesk:com_huruhelpdesk:0.87\",\"_id\":75270656},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"huruhelpdesk com_huruhelpdesk version 0.88 c\",\"name\":\"cpe:\\/a:huruhelpdesk:com_huruhelpdesk:0.88:c\",\"_id\":75270912},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"huruhelpdesk com_huruhelpdesk version 0.88 b\",\"name\":\"cpe:\\/a:huruhelpdesk:com_huruhelpdesk:0.88:b\",\"_id\":75271168},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"huruhelpdesk com_huruhelpdesk version 0.88 a\",\"name\":\"cpe:\\/a:huruhelpdesk:com_huruhelpdesk:0.88:a\",\"_id\":75271424},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"joomdle com_joomdle version 0.24\",\"name\":\"cpe:\\/a:joomdle:com_joomdle:0.24\",\"_id\":75272192},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"joomdle com_joomdle version 0.23 a\",\"name\":\"cpe:\\/a:joomdle:com_joomdle:0.23:a\",\"_id\":75272448},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"joomdle com_joomdle version 0.2\",\"name\":\"cpe:\\/a:joomdle:com_joomdle:0.2\",\"_id\":75272704},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"toughtomato com_ttvideo version 1.0\",\"name\":\"cpe:\\/a:toughtomato:com_ttvideo:1.0\",\"_id\":75272960},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"joomdle com_joomdle version 0.21\",\"name\":\"cpe:\\/a:joomdle:com_joomdle:0.21\",\"_id\":75273216},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"joomdle com_joomdle version 0.23\",\"name\":\"cpe:\\/a:joomdle:com_joomdle:0.23\",\"_id\":75273472},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"joomdle com_joomdle version 0.22\",\"name\":\"cpe:\\/a:joomdle:com_joomdle:0.22\",\"_id\":75273984},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"alexred com_oziogallery\",\"name\":\"cpe:\\/a:alexred:com_oziogallery\",\"_id\":75274240},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"kayako esupport version 3.70.02\",\"name\":\"cpe:\\/a:kayako:esupport:3.70.02\",\"_id\":75274752},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"citibank citi_mobile version 2.0.2\",\"name\":\"cpe:\\/a:citibank:citi_mobile:2.0.2\",\"_id\":75275520},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"nessus web_server_plugin version 1.2.4\",\"name\":\"cpe:\\/a:nessus:web_server_plugin:1.2.4\",\"_id\":75276288},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"ajsquare aj_hyip version prime\",\"name\":\"cpe:\\/a:ajsquare:aj_hyip:prime\",\"_id\":75276544},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"ajsquare aj_hyip version meridian\",\"name\":\"cpe:\\/a:ajsquare:aj_hyip:meridian\",\"_id\":75277312},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"ajsquare aj_article version 3.0\",\"name\":\"cpe:\\/a:ajsquare:aj_article:3.0\",\"_id\":75277568},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"visocrea com_joomla_visites version 1.1 rc2\",\"name\":\"cpe:\\/a:visocrea:com_joomla_visites:1.1:rc2\",\"_id\":75278336},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"joomlaxt com_staticxt\",\"name\":\"cpe:\\/a:joomlaxt:com_staticxt\",\"_id\":75278592},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"foobla com_foobla_suggestions version 1.5.1.2\",\"name\":\"cpe:\\/a:foobla:com_foobla_suggestions:1.5.1.2\",\"_id\":75279360},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"photoindochina com_golfcourseguide version 0.9.6.0 beta\",\"name\":\"cpe:\\/a:photoindochina:com_golfcourseguide:0.9.6.0:beta\",\"_id\":75279616},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"photoindochina com_golfcourseguide version 0.9.6.0 1beta\",\"name\":\"cpe:\\/a:photoindochina:com_golfcourseguide:0.9.6.0:1beta\",\"_id\":75279872},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"ali_kenan aky_blog\",\"name\":\"cpe:\\/a:ali_kenan:aky_blog\",\"_id\":75280384},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"prasanna com_youtube version 1.5\",\"name\":\"cpe:\\/a:prasanna:com_youtube:1.5\",\"_id\":75281152},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"silvercover mylinksdump_plugin version 1.2\",\"name\":\"cpe:\\/a:silvercover:mylinksdump_plugin:1.2\",\"_id\":75281408},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"openfreeway freeway version 1.4.3.210\",\"name\":\"cpe:\\/a:openfreeway:freeway:1.4.3.210\",\"_id\":75282176},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"solucija snews version 1.7\",\"name\":\"cpe:\\/a:solucija:snews:1.7\",\"_id\":75282432},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"vmware vcenter_server version 4.1\",\"name\":\"cpe:\\/a:vmware:vcenter_server:4.1\",\"_id\":75283200},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"topazsystems sigplus_pro_activex_control version 3.74\",\"name\":\"cpe:\\/a:topazsystems:sigplus_pro_activex_control:3.74\",\"_id\":75284224},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"avscripts av_arcade version 3\",\"name\":\"cpe:\\/a:avscripts:av_arcade:3\",\"_id\":75284992},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"barcodewiz barcode_activex_control version 3.29\",\"name\":\"cpe:\\/a:barcodewiz:barcode_activex_control:3.29\",\"_id\":75285248},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"openoffice openoffice.org version 3.2.1\",\"name\":\"cpe:\\/a:openoffice:openoffice.org:3.2.1\",\"_id\":75286272},{\"vertexType\":\"software\",\"_type\":\"vertex\",\"source\":[\"NVD\"],\"description\":\"videolan vlc_media_player version 1.1.2\",\"name\":\"cpe:\\/a:videolan:vlc_media_player:1.1.2\",\"_id\":75286784}],\"success\":true,\"version\":\"2.5.0\",\"queryTime\":1926.402143}"
["179c4e92778991584948ff43083fc16dd01201d6","84643f44544c72fadd64480ca957fbbc454d3816","72c22a07177f1cc73fdf9b0cd42c2dc0f7cc5f84","e52f743152a1ed7eba15a2fb2c56442c96f6ce61","1bfe9454fe1cc1b92cfee7d6f933e1aa4a436e11","f90f1791a80db8715087cd19525b4b5756ed9a59","5b6909439b1cd52b2dc54c001c531e8d80788c0f","3a92fa0789ee62dfbc2a7306dc38f5fdac00b946"]
{"title":"EPL - Arsenal v Manchester City - 08 Apr 2012","uid":7169708,"size":899967470,"categoryP":"video","categoryS":"tv_shows","magnet":"?xt=urn:btih:17eed9a4f85d8e696c7705a5273dffce7098c6f9&amp;dn=EPL+-+Arsenal+v+Manchester+City+-+08+Apr+2012&amp;tr=udp%3A%2F%2Ftracker.openbittorrent.com%3A80&amp;tr=udp%3A%2F%2Fopen.demonii.com%3A1337&amp;tr=udp%3A%2F%2Ftracker.coppersurfer.tk%3A6969&amp;tr=udp%3A%2F%2Fexodus.desync.com%3A6969","seeders":0,"leechers":1,"uploader":"footy","files":2,"time":1333920955,"description":"Channel: Skysports\nCodec : XviD Format: AVI\nVideo: 640x368; 1000 kbps\nAudio: MP3 128 Kbps\nDisplay aspect ratio: 16:9\nLanguage: English","torrent":{"xt":"urn:btih:17eed9a4f85d8e696c7705a5273dffce7098c6f9","amp;dn":"EPL+-+Arsenal+v+Manchester+City+-+08+Apr+2012","amp;tr":["udp%3A%2F%2Ftracker.openbittorrent.com%3A80","udp%3A%2F%2Fopen.demonii.com%3A1337","udp%3A%2F%2Ftracker.coppersurfer.tk%3A6969","udp%3A%2F%2Fexodus.desync.com%3A6969"],"infoHash":"17eed9a4f85d8e696c7705a5273dffce7098c6f9","infoHashBuffer":{"type":"Buffer","data":[23,238,217,164,248,93,142,105,108,119,5,165,39,61,255,206,112,152,198,249]},"announce":[],"urlList":[]}}
{ "loader": "dymm:default", "conditions": [ { "type": "dymm:configuration_option", "configuration": "quark", "category": "targets", "name": "vanilla" }, { "type": "quark:module_feature_enabled", "module": "tweaks", "feature": "minecart_interaction" } ], "targets": [ { "type": "minecraft:item", "registry_name": "minecraft:minecart" }, { "type": "minecraft:item", "registry_name": "minecraft:chest_minecart" }, { "type": "minecraft:item", "registry_name": "minecraft:furnace_minecart" }, { "type": "minecraft:item", "registry_name": "minecraft:tnt_minecart" }, { "type": "minecraft:item", "registry_name": "minecraft:hopper_minecart" }, { "type": "minecraft:item", "registry_name": "minecraft:command_block_minecart" } ], "data": [ { "type": "jei:information", "data": [ "dymm.doc.quark.vanilla.tweaks.minecart_block_placement.minecart_conversion" ] } ] }
{ "name": "draft-ietf-oauth-native-apps", "title": "OAuth 2.0 for Native Apps", "last_revised_date": "2017-06-09", "status": "RFC 8252 (Best Current Practice)", "group": "oauth", "ad": "Kathleen Moriarty", "last_changed_date": "2020-07-29", "rfc": "8252" }
{"Plot": "N/A", "Rated": "N/A", "Response": "True", "Language": "English", "Title": "The Strangers Part 2: Breathless", "Country": "USA", "Writer": "Jason Zumwalt", "Metascore": "N/A", "imdbRating": "N/A", "Director": "Jason Zumwalt", "Released": "24 Oct 2013", "Actors": "Jennifer Bond, Lauren Bond, Kevin Dowell, Eric Keitel", "Year": "2013", "Genre": "Short, Comedy", "Awards": "N/A", "Runtime": "N/A", "Type": "movie", "Poster": "N/A", "imdbVotes": "N/A", "imdbID": "tt3503832"}
{ "atlas-relation-slicing": { "taggableFilter": "type->multipolygon,boundary" }, "atlas-relation-slicing-consolidate": { "taggableFilter": "type->boundary" } }
{"code":"3603152006","province_code":"36","regency_code":"3603","district_code":"360315","name":"BUARAN BAMBU"}
{ "id": 924684091, "type": "Feature", "properties": { "addr:full":"11 Shrivenham Rd, Highworth Swindon Gloucestershire SN6 7BZ", "addr:housenumber":"11", "addr:postcode":"sn6 7bz", "addr:street":"Shrivenham Rd", "edtf:cessation":"uuuu", "edtf:inception":"uuuu", "geom:area":0.0, "geom:area_square_m":0.0, "geom:bbox":"-1.7106100321,51.627571106,-1.7106100321,51.627571106", "geom:latitude":51.627571, "geom:longitude":-1.71061, "iso:country":"GB", "mz:hierarchy_label":1, "mz:is_current":-1, "sg:address":"11 Shrivenham Rd, Highworth", "sg:city":"Swindon", "sg:classifiers":[ { "category":"Professional", "subcategory":"Art Services", "type":"Services" } ], "sg:owner":"simplegeo", "sg:phone":"+44 1793 861757", "sg:postcode":"SN6 7BZ", "sg:province":"Gloucestershire", "sg:tags":[ "consultant", "design" ], "src:geom":"simplegeo", "wof:belongsto":[], "wof:breaches":[], "wof:concordances":{ "sg:id":"SG_2IWwy0c1IyuOdtucq9lhCm_51.627571_-1.710610@1300740853" }, "wof:country":"GB", "wof:created":1471974377, "wof:geomhash":"056670f423ccf59cc94d267e7ae8732f", "wof:hierarchy":[], "wof:id":924684091, "wof:lastmodified":1496951320, "wof:name":"Austin Exhibitions Ltd", "wof:parent_id":-1, "wof:placetype":"venue", "wof:repo":"whosonfirst-data-venue-gb", "wof:superseded_by":[], "wof:supersedes":[], "wof:tags":[ "consultant", "design" ] }, "bbox": [ -1.7106100321, 51.627571106, -1.7106100321, 51.627571106 ], "geometry": {"coordinates":[-1.7106100321,51.627571106],"type":"Point"} }
{"poster":"Klemmrorr","date":"2018-07-26T20:36:24.842+0000","title":"LF DuoQ Platin","subforum":"Clans & Teams","embed":{"description":"Klemmrorr / Platinum 3 11LP / 103W 60L Win Ratio 63% / Katarina - 61W 28L Win Ratio 69%, Talon - 7W 3L Win Ratio 70%, Shaco - 3W 1L Win Ratio 75%, Lux - 3W 1L Win Ratio 75%, Heimerdinger - 3W 0L Win Ratio 100%","url":"http://euw.op.gg/summoner/userName=Klemmrorr","image":"http://opgg-static.akamaized.net/images/logo/2015/reverse.rectangle.png"},"up_votes":1,"down_votes":0,"body":"Wie der Titel schon sagt suche ich jemanden der Lust auf DuoQ hat in Platin. \r\nTS/Discord ist vorhanden. \r\n\r\nKurz zu mir, ich spiele erst seit S6 und bin 17 Jahre alt. Ich bin ein OTP aber versuche mich auch auf anderen Champs. \r\n\r\n**\r\nEinfach Klemmrorr adden f&uuml;r DuoQ.**","replies":[]}
{"code":"1707062004","province_code":"17","regency_code":"1707","district_code":"170706","name":"AJAI SIANG"}
{ "name": "User Test", "email": "testing@testing.com", "password": "secret" }
{"id":7650,"name":"Rat Card","description":"Transform Card\nRight-click to use.\nMax Transformations: 5\nMonster Family: Beastkin\nVigor Cost: 10\nCombat Unavailable"}
{ "navigation.section.search": "Etsi", "navigation.section.home": "Koti", "navigation.section.gallery": "Galleria", "navigation.section.about": "Meistä", "navigation.section.sign": "Kirjautuminen", "navigation.section.admin": "Ylläpitäjä", "navigation.section.logout": "Kirjaudu ulos", "navigation.section.languages": "Kielet", "navigation.section.languages.english": "English", "navigation.section.languages.finnish": "Suomi", "footer.section.times": "Tavoiteltavissa sähköpostitse:", "footer.section.hours": "ASIAKASPALVELU", "footer.section.hours.service": "Asiakaspalvelu avoinna:", "footer.section.hours.open": "", "footer.section.hours.mon": "Ma - To 6:00 - 21:00", "footer.section.hours.fri": "Perjantai 6:00 - 20:00", "footer.section.hours.sat": "La - Su 10:00 - 20:00", "sign.section.sign": "Kirjaudu Sisään", "sign.section.admin": "Kirjaudu Sisään Ylläpitäjänä", "sign.section.email": "Sähköposti", "sign.section.password": "Salasana", "sign.section.create": "Luo Tili", "sign.section.first": "Etunimi", "sign.section.last": "Sukunimi", "sign.section.validation.email": "Syötä validi sähköposti", "sign.section.validation.email.miss": "Sähköposti puuttuu", "sign.section.validation.password": "Salasana puuttuu", "sign.section.validation.password.parameters": "Salasanan tulee pitää sisällään vähintään yksi numero, yksi iso kirjain sekä 6 aakkosta", "sign.section.validation.success": "Kirjautumuinen onnistui", "sign.section.validation.invalid": "Sähköposti tai salasana ei ole validi", "sign.section.validation.first.miss": "Etunimi puuttuu", "sign.section.validation.last.miss": "Sukunimi puuttuu", "sign.section.validation.alphabet": "Syötä vain aakkosia", "about.section.jere": "Olen 25 vuotias ohjelmistotuotannon opiskelia Metropoliasta. Minulla on suuri kiinnostus Javaa, sekä Backend-ohjelmointia kohtaan", "about.section.walter": "Olen 24 vuotias ohjelmistotuotannon opiskelia Metropoliasta. Minun kiinnostuksen kohteeni ovat kielet, sekä Java-ohjelmointikieli", "about.section.abdullah": "Olen 31 vuotias ohjelmistotuotannon opiskelia Metropoliasta. Minulla on suuri kiinnostus Java-ohjelmointikieltä ja Backend-kehitystä kohtaan", "about.section.benjamin": "Olen 23 vuotias ohjelmistotuotannon opiskelia Metropoliasta. Minulla on suuri kiinnostus React.JS:n sekä Frontend-ohjelmointiin", "movie.section.add": "Lisää Elokuva", "movie.section.title": "Nimi", "movie.section.genre": "Tyylilaji", "movie.section.image": "Kuva", "movie.section.add.button": "Lisää", "seats.section.movie": "Istuimet elokuvaan ", "seats.section.reservation": "Varaa", "seats.section.cancel": "Sulje", "seats.sign.section": "Kirjaudu sisään varaaksesi istuimet elokuvaan ", "seats.section.alert": "Tämä tuoli ei ole saatavilla. Valitse toinen", "seats.sign.create": "Kirjaudu sisään tai luo tili", "seats.section.picked": "Valitsit istuimen ", "seats.section.unavailable1": "Istuin ", "seats.section.unavailable2": " ei ole saatavilla", "seatreservedformovie.section.number":"varattu elokuvaan", "seat.section.reserve1": "Istuin numero ", "seat.section.reserve2": "ei ole saatavilla ", "seatnumber.section.reserve ": "Vapaa istuin numero ", "seat.section.number": "Istuin numero", "ConfirmationModal.title": "Varaus onnistui" }
{ "directions": [ "Heat 2 tablespoons oil in large skillet over medium-high heat. Add onions and saut\u00e9 until soft, about 5 minutes. Add peppers and saut\u00e9 until lightly browned, about 6 minutes. Sprinkle mixture with sugar and paprika and saut\u00e9 1 minute. Using slotted spoon, transfer mixture to plate; leave drippings in skillet.", "Add remaining 1 tablespoon oil to drippings in skillet. Add sausage and cook over medium heat until browned and heated through, turning occasionally, about 5 minutes. Transfer sausage to plate with pepper mixture.", "Add wine to skillet; boil until reduced by half, scraping up browned bits, about 3 minutes. Return sausage and pepper mixture to skillet; stir in olives. Cook until heated through, about 2 minutes.", "Place baguette quarters on each of 4 plates; fill with sausage mixture, spooning juices over each, and serve." ], "ingredients": [ "3 tablespoons olive oil, divided", "2 medium onions, thinly sliced", "3 bell peppers (1 orange, 1 red, 1 green), thinly sliced into strips", "1 teaspoon sugar", "1/2 teaspoon sweet paprika", "1 pound fully cooked sausage, such as lingui\u00e7a or kielbasa, cut in half lengthwise and crosswise into 6-inch-long pieces", "1 cup dry red wine", "2/3 cup Kalamata olives, pitted", "1 baguette, halved lengthwise, cut crosswise into quarters" ], "language": "en-US", "source": "www.epicurious.com", "tags": [ "Sandwich", "Olive", "Onion", "Saut\u00e9", "Quick & Easy", "Lunch", "Sausage", "Bell Pepper", "Red Wine", "Dairy Free", "Peanut Free", "Tree Nut Free", "Soy Free" ], "title": "Portuguese Sausage Sandwiches with Peppers, Onions, and Olives", "url": "http://www.epicurious.com/recipes/food/views/portuguese-sausage-sandwiches-with-peppers-onions-and-olives-109389" }
{ "Description": { "message": "Change your background at YouTube!", "description": "" }, "Background": { "message": "Background URL:", "description": "" }, "Position": { "message": "Position:", "description": "" }, "Style": { "message": "Style:", "description": "" }, "plain": { "message": "Plain", "description": "" }, "tile": { "message": "Tile", "description": "" }, "touch_inside": { "message": "Touch inside", "description": "" }, "touch_outside": { "message": "Touch outside", "description": "" }, "Save": { "message": "Save", "description": "" }, "UseIn": { "message": "Use in:", "description": "" }, "Youtube": { "message": "YouTube", "description": "" }, "GoogleSearch": { "message": "Google Search", "description": "" } }
{ "an8.87:0.1": "<article id='an8.87'><header><ul><li class='division'>{}</li>", "an8.87:0.2": "<li>{}</li></ul>", "an8.87:0.3": "<h1 class='sutta-title'>{}</h1></header>", "an8.87:1.1": "<p>{}", "an8.87:1.2": "{}", "an8.87:1.3": "{}", "an8.87:1.4": "{}</p>", "an8.87:2.1": "<p>{}", "an8.87:2.2": "{}", "an8.87:2.3": "{}", "an8.87:2.4": "{}</p>", "an8.87:2.5": "<p class='endsutta'>{}</p></article>" }
{"type": "Feature", "id": 2120664, "geometry": {"type": "MultiPolygon", "coordinates": [[[[39.850842, 55.30706], [39.850842, 55.32386], [39.808029, 55.32386], [39.808029, 55.30706], [39.850842, 55.30706]]]]}, "properties": {"woe:id": 2120664, "woe:parent_id": 12598779, "woe:name": "Dmitrovskiy Pogost", "woe:placetype": 7, "woe:placetype_name": "Town", "woe:lang": "ENG", "iso:country": "RU", "meta:provider": ["geoplanet:7.6.0", "geoplanet:7.8.1", "geoplanet:7.9.0", "geoplanet:7.10.0", "geoplanet:8.0.0", "woeplanet:8.0.0"], "meta:indexed": "2020-08-21T08:03:48.400394", "woe:alias_ENG_V": ["Dmitrovskij Pogost"], "meta:updated": "2020-10-14T10:58:25.703697", "woe:adjacent": [2098341, 2120546, 2001061, 2123342, 1983899, 2040342, 2073101, 2019228, 2065997, 2013727, 2076137, 2045905, 2010607, 2004923, 2026010, 1987967, 2065113, 55874122, 2113573, 2071789, 2046792, 2032190, 2028239, 55874955, 2043353, 2113134, 2017559, 2003246, 2005355, 2046857, 2017679, 2062850, 2056463, 2049420, 2102564, 1993983, 2065261, 56451086], "woe:alias_UNK_V": ["\u0414\u043c\u0438\u0442\u0440\u043e\u0432\u0441\u043a\u0438\u0439 \u041f\u043e\u0433\u043e\u0441\u0442"], "woe:alias_UNK_Q": ["\u0414\u043c\u0438\u0442\u0440\u043e\u0432\u0441\u043a\u0438\u0438 \u041f\u043e\u0433\u043e\u0441\u0442"], "woe:hierarchy": {"continent": 24865671, "country": 23424936, "town": 0, "planet": 1, "county": 12598779, "suburb": 0, "state": 2346911, "region": 0, "localadmin": 0}, "woe:timezone_id": 56043614, "woe:concordances": {"gn:id": 565911, "qs:id": 194491}, "woe:hash": "ucu6dq87pr5u", "geom:min_latitude": 55.30706, "woe:centroid": [39.826099, 55.319462], "geom:latitude": 55.319462, "woe:max_longitude": 39.850842, "geom:max_longitude": 39.850842, "geom:centroid": [39.826099, 55.319462], "geom:max_latitude": 55.32386, "woe:bbox": [39.808029, 55.30706, 39.850842, 55.32386], "geom:bbox": [39.808029, 55.30706, 39.850842, 55.32386], "woe:min_latitude": 55.30706, "woe:min_longitude": 39.808029, "geom:longitude": 39.826099, "geom:hash": "ucu6dq87pr5u", "woe:latitude": 55.319462, "geom:min_longitude": 39.808029, "woe:longitude": 39.826099, "woe:max_latitude": 55.32386, "woe:repo": "woeplanet-town-ru", "geom:area": 5084018.938289642, "woe:scale": 16}}
["a4f5ba8844c361381447118ff1a6f019885cc1c8"]
{ "uploadPath": "test/psoridex/" }
{ "id": 136011225, "type": "Feature", "properties": { "addr:full":"6 Regent Street Blyth Northumberland NE24 1LP", "addr:housenumber":"6", "addr:postcode":"ne24 1lp", "addr:street":"Regent Street;Northumberland", "edtf:cessation":"uuuu", "edtf:inception":"uuuu", "geom:area":0.0, "geom:area_square_m":0.0, "geom:bbox":"-1.509495,55.127598,-1.509495,55.127598", "geom:latitude":55.127598, "geom:longitude":-1.509495, "iso:country":"GB", "mz:hierarchy_label":1, "mz:is_current":-1, "sg:address":"6 Regent Street", "sg:city":"Blyth", "sg:classifiers":[ { "category":"Retail", "subcategory":"Photofinishing", "type":"Services" }, { "category":"Communications", "subcategory":"Newspaper", "type":"Services" } ], "sg:owner":"simplegeo", "sg:phone":"+44 1670 352233", "sg:postcode":"NE24 1LP", "sg:province":"Northumberland", "sg:tags":[ "magazine", "photographic", "processor" ], "src:geom":"simplegeo", "wof:belongsto":[ 101873451, 85633159, 85683821 ], "wof:breaches":[], "wof:concordances":{ "sg:id":"SG_0Gn18pr1Jg34RgksG1Pu59_55.127598_-1.509495@1300740221" }, "wof:country":"GB", "wof:geomhash":"d5361b6a6a3aa9c5e9f54baf6df5f3ea", "wof:hierarchy":[ { "country_id":85633159, "locality_id":101873451, "region_id":85683821, "venue_id":136011225 } ], "wof:id":136011225, "wof:lastmodified":1496963822, "wof:name":"The Foto Lab", "wof:parent_id":101873451, "wof:placetype":"venue", "wof:repo":"whosonfirst-data-venue-gb", "wof:superseded_by":[], "wof:supersedes":[], "wof:tags":[] }, "bbox": [ -1.509495, 55.127598, -1.509495, 55.127598 ], "geometry": {"coordinates":[-1.509495,55.127598],"type":"Point"} }
{"poster":"Xardìus","date":"2017-11-08T21:11:28.674+0000","title":"Wie wähle ich gezielt ad und ap ?","subforum":"Champions & Gameplay","up_votes":1,"down_votes":0,"body":"Moin moin\r\nkann sein, dass ich einfach zu dumm bin aber gibt es noch eine M&ouml;glichkeit wie ich als AD champ (ezreal) auch ap bekommen kann ?\r\nIch hab das gef&uuml;hl dass die runen einen quasi vorschreiben ob man einen Champ ad oder ap spielen darf....","replies":[{"poster":"Azradan","date":"2017-11-08T21:49:19.889+0000","up_votes":2,"down_votes":0,"body":"Es richtet sich nicht nachden Scalings, es richtet sich einfach nach dem höheren Bonuswert, heißt wenn du 100 Bonus-AD und 101 AP hast erhälst du durch die Runen zusätzliche Ap bzw machst Magicdmg bzw haben AP-Scalings.\n\nUnd woher ich das weiß: Habe es auf dem PBE mit Illaoi ausprobiert, habe die soviele Adaptive Runen wie möglich genommen, bin in Trainingsmodus gegangen, habe dann einmal Full-AP und einmal Full-AD gekauft und dada, die Runen passten sich daran an.\n\nUnd hier ein [Video](https://www.youtube.com/watch?v=Q-SEHXl1XwM) von Youmuss wo er das mit Rengar macht","replies":[{"poster":"Ghionova","date":"2017-11-08T22:10:03.983+0000","up_votes":1,"down_votes":0,"body":"Riot könnte dann dementsprechend auch im Early eine Funktion einfügen wo man sich AD, AP und mehr aussuchen darf, je nach dem wo es Möglichkeiten gibt.","replies":[{"poster":"Azradan","date":"2017-11-08T22:27:04.092+0000","up_votes":1,"down_votes":0,"body":"Versteh ich jetzt nicht ganz wie du das meinst xD, denn es ist auch so, wenn ich mich recht erinner (ist ein paar Tage her das ich das gemacht habe xD) reicht es bereits ein Doran´s Item zu Kaufen um damit den Adaptiven Wert festzulegen, außer es ist das Schild das habe ich nie probiert","replies":[{"poster":"Ghionova","date":"2017-11-08T22:34:41.578+0000","up_votes":1,"down_votes":0,"body":"Damit meinte ich z.B. wie beim Hockskillen einer Fähigkeit, dass man dann daneben die Möglichkeit hat sich für den AD oder AP Wert zu entscheiden. Das macht schon einen Unterschied für Hybriden aus.","replies":[{"poster":"Azradan","date":"2017-11-08T22:39:48.663+0000","up_votes":1,"down_votes":0,"body":"Achso war das gemeint, ja für manche Champs wäre das tatsächlich Interessant, für den Großteil aber nicht, deswegen bezweifel ich sowas eher","replies":[{"poster":"Ghionova","date":"2017-11-08T22:42:04.478+0000","up_votes":1,"down_votes":0,"body":"Ich leider auch","replies":[]}]}]}]}]}]},{"poster":"JustDecibel","date":"2017-11-10T12:07:29.213+0000","up_votes":1,"down_votes":0,"body":"Entscheidet es sich einmalig oder switch es je nach ad/AP? Wenn ich zb als kennen mit dorans blade anfange und dann auf AP gehe bekomme ich erst den ad Bonus dann aber AP?\nSo wäre es auch am sinnvollsten. Wenn man so überlegt kann man dann auch mit einem champ anfangs auf AP gehen und im Latein switchen wenn das Gold reicht. Zb AP Shaco und wenn er abfällt auf ad wechseln","replies":[]},{"poster":"Ghionova","date":"2017-11-08T21:20:43.268+0000","up_votes":1,"down_votes":0,"body":"Das mag gut sein, würde ich echt scheiße finden. Ich habe noch nicht ausprobiert ob sich die AD auf AP ändern wenn du AP Items holst. Probier es doch gerne mal im Übungsmodus aus. :D","replies":[{"poster":"Xardìus","date":"2017-11-08T21:27:21.717+0000","up_votes":1,"down_votes":0,"body":"tatsache da wechselt die rune von ad auf ap ist aber dennoch schlecht wenn man zu anfang nicht direkt nen ad oder ap item kaufen mag ...\n\nzumal angenommen ich spiele ein ap tank und kaufe mir guardians wechselt er dann von ap auf ad ? alles sehr schwierig und muss man ausgiebig testen","replies":[{"poster":"Ghionova","date":"2017-11-08T21:43:57.389+0000","up_votes":1,"down_votes":0,"body":"Das orientiert sich glaube ich auch nach dem Scaling der Fähigkeiten.Da Ezreal mit seinen Fähigkeiten Q und E und R gemischten Schaden verusacht, ist das bei ihm schwer einzuschätzen. Wird das denn nicht gleich am Anfang verändert wenn du dir mit Ezreal Dorans Ring holst? Finde ich persönlich auch blöd mit dem \"adaptiv\". Bei Galio bezweifle ich stark, dass man einen AD Bonus erhält.","replies":[]}]}]}]}
{ "Logging": { "LogLevel": { "Default": "Information", "Microsoft": "Warning", "Microsoft.Hosting.Lifetime": "Information" } }, "AllowedHosts": "*", "Authentication": { "CookieAuthenticationScheme": "Cookies", "CookieName": "Rongbo.Cookies", "CookieDomain": "" }, "ConnectionStrings": { "MySqlServer": "Server=192.168.0.40;Database=demo;UId=sa;Pwd=sa3210;" } }
{"poster":"WanchopeAbila09","date":"2020-02-25T18:22:55.166+0000","title":"¿Es normal?","subforum":"Charlas Generales","up_votes":2,"down_votes":0,"body":"Jugué una partida con Caitlyn, la ganamos, salí 19/0/8, 103 de farm y el juego me dio una A+, ¿a que se debe eso?\r\nya me ha pasado de hacer partidas similares con lux y el juego me da una A","replies":[{"poster":"No One Like Me","date":"2020-02-26T00:26:29.340+0000","up_votes":2,"down_votes":0,"body":"Probablemente en el área de combate obtuviste una S, pero, para sacar la calificación final se basa en distintas cosas que pueden resumirse en combate, ingresos y control de mapa a grandes rasgos.\n Según vi tus estadísticas tuviste mucho daño y participación en kills (71%), pero, tu farm es muy bajo para la duración de la partida, por otra parte tu puntuación de visión es pesima , ya que, solamente pusiste 2 centinelas y ningun centinela de control por ende todo eso te baja tu calificación, y finalmente tuviste poca participación en objetivos globales. Por lo que tu calificación promedio no alcanzó la S por esos factores y probablemente otros que no mencioné.","replies":[{"poster":"VenganceZ","date":"2020-02-26T01:45:53.452+0000","up_votes":1,"down_votes":0,"body":"Básicamente eso","replies":[]}]},{"poster":"WanchopeAbila09","date":"2020-02-25T19:01:35.476+0000","up_votes":1,"down_votes":0,"body":"Gracias a todos por la ayuda","replies":[]},{"poster":"JACKY FANBOY","date":"2020-02-25T18:57:25.402+0000","up_votes":1,"down_votes":0,"body":"103 de farm es muy poco para una partida que dura minimo 20 minutos, eso pudo influir en esa partida","replies":[]},{"poster":"Bxh7","date":"2020-02-25T18:37:40.642+0000","up_votes":1,"down_votes":0,"body":"La calificación depende de otros factores, no solo del farm y las kills. En primer lugar, se te compara con otros jugadores que han utilizado a Cait, por lo que el desempeño con cada campeón es independiente. Además, todas las estadísticas deben analizarse en el contexto de la partida (% de kills totales, farmeo por minuto, daño a objetivos, puntuación de visión total, entre otros).","replies":[{"poster":"WanchopeAbila09","date":"2020-02-25T18:42:38.449+0000","up_votes":1,"down_votes":0,"body":"Es que fui el mejor en todo, menos en curaciones y daño magico obviamente, pero siginifica que tengo que jugar mucho mejor para sacar S?","replies":[]}]},{"poster":"Yanx99","date":"2020-02-25T18:34:34.478+0000","up_votes":1,"down_votes":0,"body":"También depende de el tiempo que duró la partida, si sacaste todo eso en una partida de 40 minutos por ejemplo es obvio que no te van a dar la S porque el farm es muy poco para lo que duró la partida.","replies":[{"poster":"WanchopeAbila09","date":"2020-02-25T18:36:01.147+0000","up_votes":1,"down_votes":0,"body":"La partida duró 23 minutos","replies":[]}]},{"poster":"Cynthia Senek","date":"2020-02-25T18:44:49.518+0000","up_votes":1,"down_votes":1,"body":"> [{quoted}](name=WanchopeAbila09,realm=LAS,application-id=v7qsfXsE,discussion-id=XlsvNyrV,comment-id=,timestamp=2020-02-25T18:22:55.166+0000)\n>\n> Jugué una partida con Caitlyn, la ganamos, salí 19/0/8, 103 de farm y el juego me dio una A+, ¿a que se debe eso?\n> ya me ha pasado de hacer partidas similares con lux y el juego me da una A\n\nEn los gráficos podés ver todos los puntos que influyen en la calificación.\n\nPasa que simplemente no llegas a los mínimos requeridos.","replies":[]}]}
{ "name": "underscore.deferred", "filename": "underscore.deferred.min.js", "version": "0.2.0", "description": "This is a port of jQuery.Deferred as an Underscore mixin, but it can be used without any depencencies. It currently matches the Deferred specifications and implementation from jQuery 1.8.0, with all the associated helpers.", "homepage": "https://github.com/wookiehangover/underscore.deferred", "keywords": [ "utility", "promises", "deferred", "underscore" ], "repositories": [ { "type": "git", "url": "git://github.com/wookiehangover/underscore.deferred.git" } ] }
{ "name": "Planetarium", "jest": { "globals": { "__DEV__": true }, "verbose": true, "notify": true, "coverageDirectory": "coverage", "coveragePathIgnorePatterns": ["/node_modules/"], "coverageThreshold": { "global": { "branches": 50, "functions": 50, "lines": 50, "statements": 50 }, "./src/components/": { "branches": 40, "statements": 40 } } }
{"artist": "YNW Melly", "songs": [{"image": "https://images.genius.com/3988bf8de1076945126f70c67a9e7861.640x640x1.jpg", "year": null, "album": null, "lyrics": "[Intro]\nMhmm God, save me (I'm Melvin, haha)\nMhmm, save me, mind of Melvin (Hahahaha, never)\nMuhahahaha (Mind of)\nHe said he'd take control of me\nThe devil got a hold of me\nThe demons are inside of me (Mind of)\nIt's clear that you don't ride for me (Alright) (Mega, you played that boy)\nIt's clear that you don't ride for me (Yeah, yeah)\nThey told me, do ungodly things (Yeah, yeah)\nI killed your seed, I'm sorry please (Yeah, yeah)\nI killed your son, I'm sorry please (Fuck them niggas, yeah)\n\n[Refrain]\nMelvin, oh\nMind of Melvin, oh, welcome to the mind of a maniac\nMind of Melvin, oh, welcome to the mind of a maniac\nMind of Melvin, welcome to the mind of a maniac\nWelcome to the mind of a maniac (Yeah, yeah, welcome baby)\nWelcome to the mind of a maniac (Alright, this shit the mind of a maniac)\nWelcome to the mind of a maniac (Let's go)\nUh, uh welcome to the mind of a maniac (This is only the beginning, tuh boy)\n\n[Verse 1]\nBitch, I am Melvin, and I am a killer (A killer)\nDon't play with the crew, if you do I'mma kill ya (I'll kill ya)\nI load up the carbon, and bust at them niggas (Them niggas)\nWho the fuck is that, that boy look familiar\nI keep a 50, I keep a 20\nI keep a 17 shot Glock (No cap)\nYeah, I be ridin' 'round with 3 Glocks\nJust for myself, lil' boy only got 2 (Slatt)\nGlock on the shelf, Glock in the dresser\nMAC in the key, MAC in the pipe\nShoot that lil' pussy, these niggas be active\nLoad up the carbon, I load up the ratchet\nThese niggas talkin', gon' be makin' niggas active\nI know that you ain't kill them boys\nI know who, I know who\n\n[Pre-Chorus]\nAnd if she told me that we would be forever (Forever, yeah)\nThought that we would always be together\nBut I know, that it is the night time (Ooh)\nThe demons always come out at the night time (Alright)\n\n[Chorus]\nGod, can you please send me the right sign (Yeah, yeah)\nMy soul is on fire when I go (To sleep, yeah)\nSleep, I don't even fuckin' recognize (Alright)\nWho I am, where I lie\nOn the side of the mirror\nI'm like \"Who are you, are you steppin', steppin'?\" (Who are you?)\nHe said \"Hell yeah, I'm Melvin, Melvin\" (Mind of Melvin)\nI ran into this dude in my dreams (Alright, alright, alright)\nAnd he said everything is not what it seems (Not what it seems)\nHe told me that his name was Melvin, Melvin (Name was Melvin)\nI told him that my name was Melly, Melly (I'm Melly)\nHe looked at me and told me bro-o, ooh-ooh\nI really like your album, I am you-ou\nHe said that he would take control of me\nThe devil got a hold of me\nThe demons are inside of me\nAnd it'd kill, if you don't ride for me\nAnd I killed your son, mama please\nGive me your apologizes\nI can't give you my apologizes\nCause' I hadn't did ungodly things\n\n[Pre-Chorus]\nShe told me that we would be forever (Forever, yeah)\nThought that we would always be together\nBut I know, that it is the night time\nThe demons always come out at the night time (Yeah, yeah)\n\n[Chorus]\nGod, can you please send me the right sign (Yeah, yeah)\nMy soul is on fire when I go (When I go to sleep)\nSleep, I don't even fuckin' recognize (Recognize)\nWho I am, where I lie\nOn the side of the mirror\nI'm like, \"Who are you, are you steppin', steppin'?\"\nHe said \"Hell yeah, I'm Melvin, Melvin\"\nI ran into this dude in my dreams (My dreams)\nAnd he said everything is not what it seems\nHe told me that his name was Melvin, Melvin\nI told him that my name was Melly, Melly\nHe looked at me and told me bro-o, ooh-ooh\nI really like your album, I am you-ou\nHe said that he would take control of me\n\n[Outro]\nThe devil got a hold of me\nThe demons are inside of me\nAnd it'd kill, if you don't lie for me", "title": "Mind Of Melvin*"}]}
{ "versions": [ { "git-tree": "3a811ec51d55cce1d5eaf4a430a8e274f1916bb9", "version-semver": "1.18.2", "port-version": 0 }, { "git-tree": "4fcc1df0a11567c74dccb3fafe922a1f2686eff3", "version-string": "1.18.0", "port-version": 0 } ] }
{"geometry":{"type":"Polygon","coordinates":[[[10.537037,50.628898],[10.537006,50.626201],[10.535593,50.626208],[10.535583,50.625309],[10.534169,50.625315],[10.534149,50.623517],[10.532736,50.623524],[10.532705,50.620827],[10.536944,50.620807],[10.536934,50.619908],[10.538347,50.619902],[10.538326,50.618104],[10.531262,50.618137],[10.531252,50.617238],[10.529839,50.617244],[10.529829,50.616345],[10.528416,50.616352],[10.528396,50.614554],[10.526983,50.614560],[10.526953,50.611863],[10.525540,50.611870],[10.525510,50.609173],[10.524097,50.609179],[10.524077,50.607381],[10.521252,50.607394],[10.521282,50.610091],[10.522695,50.610085],[10.522735,50.613681],[10.524147,50.613674],[10.524207,50.619068],[10.525620,50.619061],[10.525641,50.620859],[10.527053,50.620853],[10.527064,50.621752],[10.528477,50.621745],[10.528487,50.622644],[10.529900,50.622638],[10.529930,50.625335],[10.532756,50.625322],[10.532777,50.627120],[10.534190,50.627113],[10.534200,50.628012],[10.535613,50.628006],[10.535624,50.628904],[10.537037,50.628898]]]},"properties":{"qs:a1r":"0","qs:la":"Schwarza","geom:longitude":10.529280,"qs:la_lc":"*DE16006602065","lbl:latitude":50.619250,"qs:loc_alt":"Schwarza","iso:country":"DE","src:geom_alt":[],"wof:geomhash":"88e18ba85b5eeee88721548fad9e0014","qs:level":"locality","wof:name":"Schwarza","src:geom":"quattroshapes","qs:adm0":"Bundesrepublik Deutschland","wof:breaches":[],"wof:hierarchy":[{"locality_id":101824681,"country_id":85633111,"region_id":85682541,"county_id":102063673}],"qs:type":"rural point-in-poly","qs:loc":"Schwarza","wof:id":101824681,"qs:pop":0,"lbl:longitude":10.529710,"wof:supersedes":[],"geom:area":0.000107,"geom:latitude":50.618371,"qs:source":"UCustom EuroGlobalMap + UMZ Urban Polygons + Geonames + GeoPlanet","src:centroid_lbl":"geonames","wof:belongsto":[85633111,85682541,102063673],"wof:placetype":"locality","qs:a0":"Bundesrepublik Deutschland","qs:a1":"*Th\u00fcringen","qs:a2":"Schmalkalden-Meiningen","wof:lastmodified":1439924537,"wof:superseded_by":[],"wof:concordances":{"gn:id":2835195,"qs:id":5},"wof:parent_id":102063673},"type":"Feature","bbox":[10.521252,50.607381,10.538347,50.628904],"id":101824681}
{ "name" : "L - Road Construction", "testType" : "SINGLE", "input" : { "type" : "STANDARD", "fileName" : "input.txt" }, "output" : { "type" : "STANDARD", "fileName" : "output.txt" }, "tests" : [ { "input" : "4 5\n2 2 1 2\n3 2 2 3\n4 2 3 4\n2 2 4 5\n1 2 3 4 5\n", "index" : 0, "active" : true }, { "input" : "4 5\n2 2 10 20\n3 2 2 3\n4 2 3 4\n2 2 4 5\n1 2 3 4 5\n", "output" : "-1\n", "index" : 1, "active" : true }, { "input" : "5 4\n2 1 1\n3 1 1\n4 1 1\n5 1 1\n1 1 1\n\n1 1 1 3", "output" : "-1", "index" : 2, "active" : true }, { "input" : "5 4\n2 1 2\n3 1 1\n4 1 1\n5 1 1\n1 1 1\n\n1 1 1 1", "index" : 3, "active" : true }, { "input" : "5 4\n2 1 2\n3 1 100000000\n4 1 100000000\n5 1 100000000\n1 1 100000000\n\n100000000 100000000 100000000 100000000", "index" : 4, "active" : true } ], "location" : "src/main/java/contest", "vmArgs" : "-Xmx256M", "mainClass" : "Main", "taskClass" : "contest.TaskL", "checkerClass" : "net.egork.chelper.checkers.TokenChecker", "checkerParameters" : "", "testClasses" : [ ], "date" : "2019.11.27", "contestName" : "2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred)", "truncate" : true, "inputClass" : "template.io.FastInput", "outputClass" : "template.io.FastOutput", "includeLocale" : false, "failOnOverflow" : false, "interactive" : false, "interactor" : "net.egork.chelper.tester.Interactor", "newThread" : true }
{"code":"3526072006","province_code":"35","regency_code":"3526","district_code":"352607","name":"MOARAH"}
{ "Ar36": { "error": 0.0026194210867388056, "error_type": "SEM", "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 3, "use_iqr_filtering": false, "use_standard_deviation_filtering": false }, "fit": "Parabolic", "fn": 338, "include_baseline_error": false, "n": 340, "outlier_excluded": [ 336, 156 ], "reviewed": true, "user_excluded": [], "value": 0.9630063140397968 }, "Ar37": { "error": 0.01574403162262804, "error_type": "SEM", "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 3, "use_iqr_filtering": false, "use_standard_deviation_filtering": false }, "fit": "Linear", "fn": 340, "include_baseline_error": false, "n": 340, "outlier_excluded": [], "reviewed": true, "user_excluded": [], "value": 0.9043782887317275 }, "Ar38": { "error": 0.00602562953534788, "error_type": "SEM", "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 3, "use_iqr_filtering": false, "use_standard_deviation_filtering": false }, "fit": "Linear", "fn": 339, "include_baseline_error": false, "n": 340, "outlier_excluded": [ 320 ], "reviewed": true, "user_excluded": [], "value": 0.3903983227137422 }, "Ar39": { "error": 0.014762498365020365, "error_type": "SEM", "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 3, "use_iqr_filtering": false, "use_standard_deviation_filtering": false }, "fit": "Parabolic", "fn": 339, "include_baseline_error": false, "n": 340, "outlier_excluded": [ 331 ], "reviewed": true, "user_excluded": [], "value": 3.8738790881410883 }, "Ar40": { "error": 0.05166974322412167, "error_type": "SEM", "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 3, "use_iqr_filtering": false, "use_standard_deviation_filtering": false }, "fit": "Parabolic", "fn": 340, "include_baseline_error": false, "n": 340, "outlier_excluded": [], "reviewed": true, "user_excluded": [], "value": 285.22457411567996 } }
{ "Ar36": { "error": 0.00047163662758799914, "error_type": "SEM", "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 2 }, "fit": "Linear", "value": 0.03522223078302926 }, "Ar37": { "error": 0.009950448054510043, "error_type": "SEM", "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 2 }, "fit": "linear", "value": 0.08797513826837139 }, "Ar38": { "error": 0.00598822318821947, "error_type": "SEM", "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 2 }, "fit": "linear", "value": 0.3429152121950852 }, "Ar39": { "error": 0.013810046349076574, "error_type": "SEM", "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 2 }, "fit": "Linear", "value": 26.34368703949493 }, "Ar40": { "error": 0.056519477830132336, "error_type": "SEM", "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 2 }, "fit": "Linear", "value": 1145.6032153729357 }, "Ar41": { "error": 0.0019508854271384803, "error_type": "SEM", "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 2 }, "fit": "Average", "value": 0.006820047044270905 } }
{"songs": [{"title": "No L\u2019s", "album": "The Grustle", "year": null, "image": "https://images.genius.com/f9e9cae088594bb3cf8db8c428c1189d.640x640x1.jpg", "lyrics": "Chorus:\nThey got me ride with no L's, ride with no L's\nThey got me ride with no L's, ride with no L's\nI'll be so high, so high, so high\nWith the thing on my side, my side, my side\nThey got me ride with no L's, ride with no L's\nThey got me ride with no L's, ride with no L's\nI ride, I ride, I ride\nI'm out of my mind, my mind, my mind\nBitch, I'm often dangerous\nNigga better know you... a bus\nCan't a nigga thinking about rolling up?\nOr can't a nigga think about riding us?\nPut them hands on the wheel, we're... off\nDollars, we hush 'em off\nI'm too fat, I may keep 'em up\nThey keep 'em up, but we're talking up\nWhen it cold outside better...\nNigga my package stay bundle up\nHey, you better go get your money up\nBaby, can't get yours, I don't give a fuck!\nSo I'm riding dirty, on probation\nWith a nine, twelve behind\nSo girl no, I don't... my mind\n..I do it by one hundred cause I face the time\nAin't no real stopping me\nI got a flow, no mocking me\n..with a chop of beer\nAnd then I bet the mother fucker won't follow me\nThey say that I'm a felon, I'll be like so what?\nI stay strap when I ride, bitch, I don't give a damn\n\nChorus:\nThey got me ride with no L's, ride with no L's\nThey got me ride with no L's, ride with no L's\nI'll be so high, so high, so high\nWith the thing on my side, my side, my side\nThey got me ride with no L's, ride with no L's\nThey got me ride with no L's, ride with no L's\nI ride, I ride, I ride\nI'm out of my mind, my mind, my mind\nStill got the ... up in the back\nIn a trunk reckless to the max\nAnd they gotta try right next to that\nAnd a bullet convincing that's bad\nIf the.. put me.. it's a...\nAnd I'm all going back down the...\nAnd I'm all going get my nigga down\nShit, I don't know, I run them out!\nMiami, Atlanta, DC, Alabama\nShut time and Carolina, the white girl is...\nSweet... that gets paid\nNew York, you gonna show\nLA and Vegas, I still get to them papers\nThey sent me a subpoena said I had to come and see 'em\nI just got me a warrant, so you know I couldn't see them\nIf they say it's crap, you're famous\nI'm like so what?\n..show up in court, bitch I don't give a fuck!\n\nChorus:\nThey got me ride with no L's, ride with no L's\nThey got me ride with no L's, ride with no L's\nI'll be so high, so high, so high\nWith the thing on my side, my side, my side\nThey got me ride with no L's, ride with no L's\nThey got me ride with no L's, ride with no L's\nI ride, I ride, I ride\nI'm out of my mind, my mind, my mind\nRide with no L's yeah, ride with no L's\nRide with no L's yeah, ride with no L's\nI said I ride with no L's, ride with no L's\nI said I ride with no L's, ride with no L's\nI said I ride with no L's, ride with no L's\nGo, go, go, go!\nGo, go, go, go!\n\nChorus:\nThey got me ride with no L's, ride with no L's\nThey got me ride with no L's, ride with no L's\nI'll be so high, so high, so high\nWith the thing on my side, my side, my side\nThey got me ride with no L's, ride with no L's\nThey got me ride with no L's, ride with no L's\nI ride, I ride, I ride\nI'm out of my mind, my mind, my mind"}], "artist": "Lil Scrappy"}
{"code":"3512082005","province_code":"35","regency_code":"3512","district_code":"351208","name":"JUGLANGAN"}
{"title":"MilfHunter.-.Valerie","uid":5643567,"size":442868020,"categoryP":"porn","categoryS":"movies","magnet":"?xt=urn:btih:9668bc48651f9e2734df9cb4c42a946fc9f8b244&amp;dn=MilfHunter.-.Valerie&amp;tr=udp%3A%2F%2Ftracker.openbittorrent.com%3A80&amp;tr=udp%3A%2F%2Fopen.demonii.com%3A1337&amp;tr=udp%3A%2F%2Ftracker.coppersurfer.tk%3A6969&amp;tr=udp%3A%2F%2Fexodus.desync.com%3A6969","seeders":0,"leechers":1,"uploader":"exmnova","files":1,"time":1277166896,"description":"[MilfHunter.com / RealityKings.com] Valerie (Juice Her)\n\n &lt;a href=&quot; http://www.picswan.com/img/share.php?id=6D19_4C208E7C&quot; rel=&quot;nofollow&quot; target=&quot;_NEW&quot;&gt; http://www.picswan.com/img/share.php?id=6D19_4C208E7C&lt;/a&gt;\n\n\nMore Info:\n\n &lt;a href=&quot;\nhttp://www.69bits.com/torrent/MILF/19107/MilfHunter.-.Valerie.html&quot; rel=&quot;nofollow&quot; target=&quot;_NEW&quot;&gt;\nhttp://www.69bits.com/torrent/MILF/19107/MilfHunter.-.Valerie.html&lt;/a&gt;","torrent":{"xt":"urn:btih:9668bc48651f9e2734df9cb4c42a946fc9f8b244","amp;dn":"MilfHunter.-.Valerie","amp;tr":["udp%3A%2F%2Ftracker.openbittorrent.com%3A80","udp%3A%2F%2Fopen.demonii.com%3A1337","udp%3A%2F%2Ftracker.coppersurfer.tk%3A6969","udp%3A%2F%2Fexodus.desync.com%3A6969"],"infoHash":"9668bc48651f9e2734df9cb4c42a946fc9f8b244","infoHashBuffer":{"type":"Buffer","data":[150,104,188,72,101,31,158,39,52,223,156,180,196,42,148,111,201,248,178,68]},"announce":[],"urlList":[]}}
{ "id": 924211123, "type": "Feature", "properties": { "addr:full":"33 Northampton Lane North Northampton Northamptonshire NN3 7QY", "addr:housenumber":"33", "addr:postcode":"nn3 7qy", "addr:street":"Northampton Lane North", "edtf:cessation":"uuuu", "edtf:inception":"uuuu", "geom:area":0.0, "geom:area_square_m":0.0, "geom:bbox":"-0.8589569926,52.2779960632,-0.8589569926,52.2779960632", "geom:latitude":52.277996, "geom:longitude":-0.858957, "iso:country":"GB", "mz:hierarchy_label":1, "mz:is_current":-1, "sg:address":"33 Northampton Lane North", "sg:city":"Northampton", "sg:classifiers":[ { "category":"Shopping", "subcategory":"Computers & Home Electronics", "type":"Retail Goods" } ], "sg:owner":"simplegeo", "sg:postcode":"NN3 7QY", "sg:province":"Northamptonshire", "sg:tags":[ "aerial", "television", "radio" ], "src:geom":"simplegeo", "wof:belongsto":[ 85633159, 85789219, 85684325 ], "wof:breaches":[], "wof:concordances":{ "sg:id":"SG_5T00y6Ehs7g5ZQhbG3oeVX_52.277996_-0.858957@1300740750" }, "wof:country":"GB", "wof:created":1471950712, "wof:geomhash":"0891d72cf400fd2cecaf567b28e2c846", "wof:hierarchy":[ { "country_id":85633159, "neighbourhood_id":85789219, "region_id":85684325, "venue_id":924211123 } ], "wof:id":924211123, "wof:lastmodified":1496943592, "wof:name":"Aerials & Electronics", "wof:parent_id":85789219, "wof:placetype":"venue", "wof:repo":"whosonfirst-data-venue-gb", "wof:superseded_by":[], "wof:supersedes":[], "wof:tags":[ "aerial", "television", "radio" ] }, "bbox": [ -0.8589569926, 52.2779960632, -0.8589569926, 52.2779960632 ], "geometry": {"coordinates":[-0.8589569926,52.2779960632],"type":"Point"} }
[{"lineNumber": 24, "col_offset": 3, "nodeName": "__name__", "type": "str"}, {"lineNumber": 27, "col_offset": 4, "nodeName": "data", "type": "Any"}, {"lineNumber": 28, "col_offset": 4, "nodeName": "X", "type": "Any"}, {"lineNumber": 28, "col_offset": 8, "nodeName": "data", "type": "Any"}, {"lineNumber": 29, "col_offset": 4, "nodeName": "y", "type": "Any"}, {"lineNumber": 29, "col_offset": 8, "nodeName": "target", "type": "Any"}, {"lineNumber": 32, "col_offset": 4, "nodeName": "RF", "type": "Any"}, {"lineNumber": 39, "col_offset": 4, "nodeName": "pool_classifiers", "type": "Any"}, {"lineNumber": 43, "col_offset": 4, "nodeName": "knorau", "type": "deslib.des.knora_u.KNORAU"}, {"lineNumber": 44, "col_offset": 4, "nodeName": "kne", "type": "deslib.des.knora_e.KNORAE"}, {"lineNumber": 45, "col_offset": 4, "nodeName": "desp", "type": "deslib.des.des_p.DESP"}, {"lineNumber": 46, "col_offset": 4, "nodeName": "ola", "type": "deslib.dcs.ola.OLA"}, {"lineNumber": 47, "col_offset": 4, "nodeName": "mcb", "type": "deslib.dcs.mcb.MCB"}, {"lineNumber": 48, "col_offset": 4, "nodeName": "meta", "type": "deslib.des.meta_des.METADES"}, {"lineNumber": 27, "col_offset": 11, "nodeName": "load_breast_cancer", "type": "Any"}, {"lineNumber": 28, "col_offset": 8, "nodeName": "data", "type": "Any"}, {"lineNumber": 29, "col_offset": 8, "nodeName": "data", "type": "Any"}, {"lineNumber": 31, "col_offset": 4, "nodeName": "X_train", "type": "Any"}, {"lineNumber": 31, "col_offset": 13, "nodeName": "X_test", "type": "Any"}, {"lineNumber": 31, "col_offset": 21, "nodeName": "y_train", "type": "Any"}, {"lineNumber": 31, "col_offset": 30, "nodeName": "y_test", "type": "Any"}, {"lineNumber": 31, "col_offset": 39, "nodeName": "train_test_split", "type": "Any"}, {"lineNumber": 31, "col_offset": 56, "nodeName": "X", "type": "Any"}, {"lineNumber": 31, "col_offset": 59, "nodeName": "y", "type": "Any"}, {"lineNumber": 32, "col_offset": 9, "nodeName": "RandomForestClassifier", "type": "Any"}, {"lineNumber": 33, "col_offset": 4, "nodeName": "fit", "type": "Any"}, {"lineNumber": 33, "col_offset": 11, "nodeName": "X_train", "type": "Any"}, {"lineNumber": 33, "col_offset": 20, "nodeName": "y_train", "type": "Any"}, {"lineNumber": 35, "col_offset": 4, "nodeName": "X_train", "type": "Any"}, {"lineNumber": 35, "col_offset": 13, "nodeName": "X_dsel", "type": "Any"}, {"lineNumber": 35, "col_offset": 21, "nodeName": "y_train", "type": "Any"}, {"lineNumber": 35, "col_offset": 30, "nodeName": "y_dsel", "type": "Any"}, {"lineNumber": 35, "col_offset": 39, "nodeName": "train_test_split", "type": "Any"}, {"lineNumber": 35, "col_offset": 56, "nodeName": "X", "type": "Any"}, {"lineNumber": 35, "col_offset": 59, "nodeName": "y", "type": "Any"}, {"lineNumber": 39, "col_offset": 23, "nodeName": "RandomForestClassifier", "type": "Any"}, {"lineNumber": 40, "col_offset": 4, "nodeName": "fit", "type": "Any"}, {"lineNumber": 40, "col_offset": 25, "nodeName": "X_train", "type": "Any"}, {"lineNumber": 40, "col_offset": 34, "nodeName": "y_train", "type": "Any"}, {"lineNumber": 43, "col_offset": 13, "nodeName": "KNORAU", "type": "Type[deslib.des.knora_u.KNORAU]"}, {"lineNumber": 43, "col_offset": 20, "nodeName": "pool_classifiers", "type": "Any"}, {"lineNumber": 44, "col_offset": 10, "nodeName": "KNORAE", "type": "Type[deslib.des.knora_e.KNORAE]"}, {"lineNumber": 44, "col_offset": 17, "nodeName": "pool_classifiers", "type": "Any"}, {"lineNumber": 45, "col_offset": 11, "nodeName": "DESP", "type": "Type[deslib.des.des_p.DESP]"}, {"lineNumber": 45, "col_offset": 16, "nodeName": "pool_classifiers", "type": "Any"}, {"lineNumber": 46, "col_offset": 10, "nodeName": "OLA", "type": "Type[deslib.dcs.ola.OLA]"}, {"lineNumber": 46, "col_offset": 14, "nodeName": "pool_classifiers", "type": "Any"}, {"lineNumber": 47, "col_offset": 10, "nodeName": "MCB", "type": "Type[deslib.dcs.mcb.MCB]"}, {"lineNumber": 47, "col_offset": 14, "nodeName": "pool_classifiers", "type": "Any"}, {"lineNumber": 48, "col_offset": 11, "nodeName": "METADES", "type": "Type[deslib.des.meta_des.METADES]"}, {"lineNumber": 48, "col_offset": 19, "nodeName": "pool_classifiers", "type": "Any"}, {"lineNumber": 51, "col_offset": 4, "nodeName": "fit", "type": "Callable"}, {"lineNumber": 51, "col_offset": 15, "nodeName": "X_dsel", "type": "Any"}, {"lineNumber": 51, "col_offset": 23, "nodeName": "y_dsel", "type": "Any"}, {"lineNumber": 52, "col_offset": 4, "nodeName": "fit", "type": "Callable"}, {"lineNumber": 52, "col_offset": 12, "nodeName": "X_dsel", "type": "Any"}, {"lineNumber": 52, "col_offset": 20, "nodeName": "y_dsel", "type": "Any"}, {"lineNumber": 53, "col_offset": 4, "nodeName": "fit", "type": "Callable"}, {"lineNumber": 53, "col_offset": 13, "nodeName": "X_dsel", "type": "Any"}, {"lineNumber": 53, "col_offset": 21, "nodeName": "y_dsel", "type": "Any"}, {"lineNumber": 54, "col_offset": 4, "nodeName": "fit", "type": "Callable[[Any, Any], None]"}, {"lineNumber": 54, "col_offset": 13, "nodeName": "X_dsel", "type": "Any"}, {"lineNumber": 54, "col_offset": 21, "nodeName": "y_dsel", "type": "Any"}, {"lineNumber": 55, "col_offset": 4, "nodeName": "fit", "type": "Callable"}, {"lineNumber": 55, "col_offset": 12, "nodeName": "X_dsel", "type": "Any"}, {"lineNumber": 55, "col_offset": 20, "nodeName": "y_dsel", "type": "Any"}, {"lineNumber": 56, "col_offset": 4, "nodeName": "fit", "type": "Callable"}, {"lineNumber": 56, "col_offset": 12, "nodeName": "X_dsel", "type": "Any"}, {"lineNumber": 56, "col_offset": 20, "nodeName": "y_dsel", "type": "Any"}, {"lineNumber": 59, "col_offset": 4, "nodeName": "print", "type": "Callable[..., None]"}, {"lineNumber": 60, "col_offset": 4, "nodeName": "print", "type": "Callable[..., None]"}, {"lineNumber": 61, "col_offset": 4, "nodeName": "print", "type": "Callable[..., None]"}, {"lineNumber": 62, "col_offset": 4, "nodeName": "print", "type": "Callable[..., None]"}, {"lineNumber": 63, "col_offset": 4, "nodeName": "print", "type": "Callable[..., None]"}, {"lineNumber": 64, "col_offset": 4, "nodeName": "print", "type": "Callable[..., None]"}, {"lineNumber": 65, "col_offset": 4, "nodeName": "print", "type": "Callable[..., None]"}, {"lineNumber": 66, "col_offset": 4, "nodeName": "print", "type": "Callable[..., None]"}, {"lineNumber": 33, "col_offset": 4, "nodeName": "RF", "type": "Any"}, {"lineNumber": 40, "col_offset": 4, "nodeName": "pool_classifiers", "type": "Any"}, {"lineNumber": 51, "col_offset": 4, "nodeName": "knorau", "type": "deslib.des.knora_u.KNORAU"}, {"lineNumber": 52, "col_offset": 4, "nodeName": "kne", "type": "deslib.des.knora_e.KNORAE"}, {"lineNumber": 53, "col_offset": 4, "nodeName": "desp", "type": "deslib.des.des_p.DESP"}, {"lineNumber": 54, "col_offset": 4, "nodeName": "meta", "type": "deslib.des.meta_des.METADES"}, {"lineNumber": 55, "col_offset": 4, "nodeName": "ola", "type": "deslib.dcs.ola.OLA"}, {"lineNumber": 56, "col_offset": 4, "nodeName": "mcb", "type": "deslib.dcs.mcb.MCB"}, {"lineNumber": 59, "col_offset": 42, "nodeName": "score", "type": "Any"}, {"lineNumber": 59, "col_offset": 51, "nodeName": "X_test", "type": "Any"}, {"lineNumber": 59, "col_offset": 59, "nodeName": "y_test", "type": "Any"}, {"lineNumber": 61, "col_offset": 46, "nodeName": "score", "type": "Any"}, {"lineNumber": 61, "col_offset": 59, "nodeName": "X_test", "type": "Any"}, {"lineNumber": 61, "col_offset": 67, "nodeName": "y_test", "type": "Any"}, {"lineNumber": 62, "col_offset": 55, "nodeName": "score", "type": "Any"}, {"lineNumber": 62, "col_offset": 65, "nodeName": "X_test", "type": "Any"}, {"lineNumber": 62, "col_offset": 73, "nodeName": "y_test", "type": "Any"}, {"lineNumber": 63, "col_offset": 44, "nodeName": "score", "type": "Any"}, {"lineNumber": 63, "col_offset": 55, "nodeName": "X_test", "type": "Any"}, {"lineNumber": 63, "col_offset": 63, "nodeName": "y_test", "type": "Any"}, {"lineNumber": 64, "col_offset": 43, "nodeName": "score", "type": "Any"}, {"lineNumber": 64, "col_offset": 53, "nodeName": "X_test", "type": "Any"}, {"lineNumber": 64, "col_offset": 61, "nodeName": "y_test", "type": "Any"}, {"lineNumber": 65, "col_offset": 43, "nodeName": "score", "type": "Any"}, {"lineNumber": 65, "col_offset": 53, "nodeName": "X_test", "type": "Any"}, {"lineNumber": 65, "col_offset": 61, "nodeName": "y_test", "type": "Any"}, {"lineNumber": 66, "col_offset": 48, "nodeName": "score", "type": "Any"}, {"lineNumber": 66, "col_offset": 59, "nodeName": "X_test", "type": "Any"}, {"lineNumber": 66, "col_offset": 67, "nodeName": "y_test", "type": "Any"}, {"lineNumber": 59, "col_offset": 42, "nodeName": "RF", "type": "Any"}, {"lineNumber": 61, "col_offset": 46, "nodeName": "knorau", "type": "deslib.des.knora_u.KNORAU"}, {"lineNumber": 62, "col_offset": 55, "nodeName": "kne", "type": "deslib.des.knora_e.KNORAE"}, {"lineNumber": 63, "col_offset": 44, "nodeName": "desp", "type": "deslib.des.des_p.DESP"}, {"lineNumber": 64, "col_offset": 43, "nodeName": "ola", "type": "deslib.dcs.ola.OLA"}, {"lineNumber": 65, "col_offset": 43, "nodeName": "mcb", "type": "deslib.dcs.mcb.MCB"}, {"lineNumber": 66, "col_offset": 48, "nodeName": "meta", "type": "deslib.des.meta_des.METADES"}]
{"title":"Jeff Rense 2010-05-27 Thu 32k-CF gedude","uid":5597076,"size":29885769,"categoryP":"audio","categoryS":"other","magnet":"?xt=urn:btih:41968d9339fa025698bdd5eee30eab86b5a8e4b9&amp;dn=Jeff+Rense+2010-05-27+Thu+32k-CF+gedude&amp;tr=udp%3A%2F%2Ftracker.openbittorrent.com%3A80&amp;tr=udp%3A%2F%2Fopen.demonii.com%3A1337&amp;tr=udp%3A%2F%2Ftracker.coppersurfer.tk%3A6969&amp;tr=udp%3A%2F%2Fexodus.desync.com%3A6969","seeders":0,"leechers":0,"uploader":"ge_dude","files":-1,"time":1275071105,"description":"Jeff Rense\n\n2010-05-27 (Thu)\n----------------\n\nHour 1 - Devvy Kidd (America On The Brink)\n\nHour 2 - Jordan Maxwell (Back From Europe)\n\nHour 3 - Jim Marrs (The View From Marrs)","torrent":{"xt":"urn:btih:41968d9339fa025698bdd5eee30eab86b5a8e4b9","amp;dn":"Jeff+Rense+2010-05-27+Thu+32k-CF+gedude","amp;tr":["udp%3A%2F%2Ftracker.openbittorrent.com%3A80","udp%3A%2F%2Fopen.demonii.com%3A1337","udp%3A%2F%2Ftracker.coppersurfer.tk%3A6969","udp%3A%2F%2Fexodus.desync.com%3A6969"],"infoHash":"41968d9339fa025698bdd5eee30eab86b5a8e4b9","infoHashBuffer":{"type":"Buffer","data":[65,150,141,147,57,250,2,86,152,189,213,238,227,14,171,134,181,168,228,185]},"announce":[],"urlList":[]}}
{"champ":13,"item":3742,"kills":"9","deaths":"13","assists":"19","gold":"18541","cs":"252","total":"1","wins":"0","losses":"1"}
{ "ಪರ್ಯಾಯ ದ್ವೀಪ": "Halbinsel", "ಫ್ರಾನ್ಸ್": "Frankreich", "ಪ್ರಾಗ್": "Prag", "ಪಶ್ಚಿಮ ಏಷ್ಯಾ": "Vorderasien", "ಮ್ಯಾಸೆಡೊನಿಯ ಗಣರಾಜ್ಯ": "Mazedonien", "ಯುಕ್ರೇನ್": "Ukraine", "ವಿಯೆನ್ನ": "Wien", "ಭೂಗೋಳ ಶಾಸ್ತ್ರ": "Geographie", "ಪೋರ್ಚುಗಲ್": "Portugal", "ಸ್ವೀಡನ್": "Schweden", "ಡಬ್ಲಿನ್": "Dublin", "ವಾರ್ಸಾ": "Warschau", "ಅಥೆನ್ಸ್": "Athen", "ಬರ್ಲಿನ್": "Berlin", "ಮೊನಾಕೊ": "Monaco", "ಡೆನ್ಮಾರ್ಕ್‌": "Dänemark", "ಸ್ಪೇನ್": "Spanien", "ಅಲ್ಬೇನಿಯ": "Albanien", "ಸ್ವಿಟ್ಜರ್ಲ್ಯಾಂಡ್": "Schweiz", "ಮಾಲ್ಟ": "Malta", "ಪ್ಯಾರಿಸ್": "Paris", "ನೆದರ್‍ಲ್ಯಾಂಡ್ಸ್": "Niederlande", "ದಕ್ಷಿಣ ಯುರೋಪ್": "Südeuropa", "ರಷ್ಯಾ": "Russland", "ಬಲ್ಗೇರಿಯ": "Bulgarien", "ಪಶ್ಚಿಮ ಯುರೋಪ್": "Westeuropa", "ಜೆಕ್ ಗಣರಾಜ್ಯ": "Tschechien", "ಲಂಡನ್": "London", "ಏಷ್ಯಾ": "Asien", "ಬಾಕು": "Baku", "ಗ್ರೀಸ್": "Griechenland", "ಸಂಯುಕ್ತ ರಾಷ್ಟ್ರಗಳ ಭೂವಿಂಗಡನೆ": "Liste der geographischen Regionen nach den Vereinten Nationen", "ಜರ್ಸಿ": "Jersey", "ಕ್ರೊಯೆಶಿಯ": "Kroatien", "ಐಸ್‍ಲ್ಯಾಂಡ್": "Island", "ಪೂರ್ವ ಯುರೋಪ್": "Osteuropa", "ಐರ್ಲೆಂಡ್": "Irland (Insel)", "ಅಜೆರ್ಬೈಜಾನ್": "Aserbaidschan", "ಯುರೋಪಿನ ಒಕ್ಕೂಟ": "Europäische Union", "ವ್ಯಾಟಿಕನ್ ನಗರ": "Vatikanstadt", "ಬ್ಯೂಖರೆಸ್ಟ್": "Bukarest", "ಮಿನ್ಸ್ಕ್": "Minsk", "ಜರ್ಮನಿ": "Deutschland", "ಫಿನ್‍ಲ್ಯಾಂಡ್": "Finnland", "ಬೆಲಾರುಸ್": "Weißrussland", "ಉತ್ತರ ಯುರೋಪ್": "Nordeuropa", "ಟರ್ಕಿ": "Türkei", "ನಾರ್ವೇ": "Norwegen", "ಸ್ಲೊವಾಕಿಯ": "Slowakei", "ಬೊಸ್ನಿಯ ಮತ್ತು ಹೆರ್ಜೆಗೊವಿನ": "Bosnien und Herzegowina", "ಅಂಕಾರಾ": "Ankara", "ಹೆಲ್ಸಿಂಕಿ": "Helsinki", "ಖಂಡ": "Kontinent", "ಬುಡಾಪೆಸ್ಟ್": "Budapest", "ಜಾರ್ಜಿಯ": "Georgien", "ಕೀವ್": "Kiew", "ಲಿಥುವೇನಿಯ": "Litauen", "ಕೋಪನ್ ಹ್ಯಾಗನ್": "Kopenhagen", "ಪೋಲೆಂಡ್": "Polen", "ಬ್ರಸೆಲ್ಸ್": "Region Brüssel-Hauptstadt", "ಕಜಾಕಸ್ಥಾನ್": "Kasachstan", "ಎಸ್ಟೊನಿಯ": "Estland", "ರೊಮಾನಿಯ": "Rumänien", "ರೋಮ್": "Rom", "ಆಸ್ಟ್ರಿಯ": "Österreich", "ಮಾಲ್ಡೋವ": "Moldawien", "ಮಾಂಟೆನೆಗ್ರೊ": "Montenegro", "ಮಾಸ್ಕೋ": "Moskau", "ಯುನೈಟೆಡ್ ಕಿಂಗ್‌ಡಂ": "Vereinigtes Königreich", "ಅಂಡೋರ": "Andorra", "ಇಟಲಿ": "Italien" }
{"geometry":{"type":"Polygon","coordinates":[[[-79.998194,32.756120],[-79.998090,32.756206],[-79.998295,32.756778],[-79.998259,32.756777],[-79.998154,32.756780],[-79.998119,32.756782],[-79.998077,32.756692],[-79.997951,32.756422],[-79.997909,32.756333],[-79.997893,32.756299],[-79.997846,32.756200],[-79.997831,32.756167],[-79.997822,32.756148],[-79.997795,32.756090],[-79.997787,32.756073],[-79.998466,32.755667],[-79.998773,32.755494],[-79.999139,32.755322],[-79.999760,32.755049],[-79.999788,32.755037],[-80.000841,32.754611],[-80.001393,32.754387],[-80.002200,32.754063],[-80.002507,32.753954],[-80.002753,32.753875],[-80.003013,32.753798],[-80.003457,32.753685],[-80.003873,32.753596],[-80.004168,32.753545],[-80.004579,32.753487],[-80.005095,32.753435],[-80.006287,32.753337],[-80.006290,32.753337],[-80.007132,32.753264],[-80.008418,32.753158],[-80.008536,32.753148],[-80.008569,32.753186],[-80.008614,32.753356],[-80.008595,32.753582],[-80.008555,32.753862],[-80.008477,32.754148],[-80.008475,32.754178],[-80.008457,32.754473],[-80.008444,32.754791],[-80.008405,32.755028],[-80.008294,32.755451],[-80.008203,32.755726],[-80.008072,32.756039],[-80.007897,32.756386],[-80.007779,32.756644],[-80.007714,32.756815],[-80.007558,32.757112],[-80.007515,32.757176],[-80.007427,32.757309],[-80.007265,32.757463],[-80.007030,32.757667],[-80.006719,32.757865],[-80.005542,32.757915],[-80.004675,32.757952],[-80.000476,32.758132],[-80.000256,32.757922],[-80.000245,32.757799],[-79.999725,32.757788],[-79.999604,32.756808],[-79.999583,32.756637],[-79.999139,32.755913],[-79.998194,32.756120]]]},"properties":{"name:eng_p":["Green Acres"],"zs:housing10":0,"geom:longitude":-80.003993,"zs:pop10":0,"misc:gn_nam_loc":"Charleston, Charleston, South Carolina, US","misc:woe_lau":0,"misc:localhoods":23,"misc:name_local":"Charleston","src:geom_alt":["quattroshapes"],"wof:hierarchy":[{"locality_id":101720747,"neighbourhood_id":85822777,"country_id":85633793,"region_id":85688683,"county_id":102085591}],"misc:gn_namadm1":"SC","misc:placetype":"Suburb","iso:country":"US","lbl:latitude":32.752960,"wof:geomhash":"55dbca941e2fae54faa5133332df14b9","misc:woe_ver":"7.10.0","zs:blockids":[450190019011031],"wof:name":"Green Acres","src:geom":"zetashapes","misc:gn_adm0_cc":"US","wof:supersedes":[],"misc:name":"Green Acres","wof:id":85822777,"misc:quad_count":3,"wof:placetype":"neighbourhood","wof:breaches":[],"lbl:longitude":-79.997040,"misc:local_sum":14885,"geom:area":0.000036,"misc:gn_name":"Green Acres","geom:latitude":32.755774,"misc:woe_adm2":12589809,"misc:name_adm0":"United States","misc:name_adm1":"South Carolina","misc:name_adm2":"Charleston","misc:gn_fcode":"PPLX","misc:woe_local":2378319,"misc:photo_sum":65,"misc:gn_local":4574324,"misc:photo_max":50,"src:centroid_lbl":"geonames","wof:belongsto":[101720747,85633793,85688683,102085591],"misc:local_max":3845,"misc:woe_adm1":2347599,"misc:woe_adm0":23424977,"wof:lastmodified":1439924192,"gn:elevation":3,"wof:superseded_by":[],"wof:concordances":{"gn:id":4580390,"gp:id":2413728,"qs:id":233161},"wof:parent_id":101720747},"type":"Feature","bbox":[-80.049520,32.710288,-80.007935,32.762633],"id":85822777}
[{"lineNumber": 12, "col_offset": 0, "nodeName": "collect_variables", "type": "Callable[[Any], Any]"}, {"lineNumber": 34, "col_offset": 0, "nodeName": "is_graphviz_available", "type": "Callable[[], Any]"}, {"lineNumber": 38, "col_offset": 0, "nodeName": "draw_computational_graph", "type": "Callable[[Any, Any], Any]"}, {"lineNumber": 20, "col_offset": 4, "nodeName": "variables", "type": "List[nothing]"}, {"lineNumber": 49, "col_offset": 4, "nodeName": "variables", "type": "Optional[List[Any]]"}, {"lineNumber": 50, "col_offset": 4, "nodeName": "g", "type": "Any"}, {"lineNumber": 51, "col_offset": 4, "nodeName": "gv_filepath", "type": "Any"}, {"lineNumber": 21, "col_offset": 7, "nodeName": "isinstance", "type": "Callable[[Any, Union[Type[Any], Tuple[Union[Type[Any], Tuple[Type[Any], ...]], ...]]], bool]"}, {"lineNumber": 21, "col_offset": 18, "nodeName": "obj", "type": "Any"}, {"lineNumber": 21, "col_offset": 23, "nodeName": "Variable", "type": "Any"}, {"lineNumber": 35, "col_offset": 11, "nodeName": "is_return_code_zero", "type": "Callable[[Any], bool]"}, {"lineNumber": 49, "col_offset": 16, "nodeName": "collect_variables", "type": "Callable[[Any], Any]"}, {"lineNumber": 49, "col_offset": 34, "nodeName": "outputs", "type": "Any"}, {"lineNumber": 50, "col_offset": 8, "nodeName": "build_computational_graph", "type": "Any"}, {"lineNumber": 50, "col_offset": 62, "nodeName": "variables", "type": "Any"}, {"lineNumber": 51, "col_offset": 18, "nodeName": "filepath", "type": "Any"}, {"lineNumber": 52, "col_offset": 35, "nodeName": "f", "type": "file"}, {"lineNumber": 54, "col_offset": 7, "nodeName": "is_graphviz_available", "type": "Callable[[], Any]"}, {"lineNumber": 55, "col_offset": 8, "nodeName": "png_filepath", "type": "Any"}, {"lineNumber": 21, "col_offset": 23, "nodeName": "chainer", "type": "Any"}, {"lineNumber": 22, "col_offset": 16, "nodeName": "obj", "type": "Any"}, {"lineNumber": 23, "col_offset": 9, "nodeName": "isinstance", "type": "Callable[[Any, Union[Type[Any], Tuple[Union[Type[Any], Tuple[Type[Any], ...]], ...]]], bool]"}, {"lineNumber": 23, "col_offset": 20, "nodeName": "obj", "type": "Any"}, {"lineNumber": 23, "col_offset": 25, "nodeName": "ActionValue", "type": "Any"}, {"lineNumber": 35, "col_offset": 11, "nodeName": "misc", "type": "module"}, {"lineNumber": 50, "col_offset": 8, "nodeName": "computational_graph", "type": "Any"}, {"lineNumber": 52, "col_offset": 9, "nodeName": "open", "type": "Callable[..., file]"}, {"lineNumber": 52, "col_offset": 14, "nodeName": "gv_filepath", "type": "Any"}, {"lineNumber": 53, "col_offset": 8, "nodeName": "write", "type": "Callable[[Union[bytearray, str, unicode]], None]"}, {"lineNumber": 55, "col_offset": 23, "nodeName": "filepath", "type": "Any"}, {"lineNumber": 56, "col_offset": 8, "nodeName": "check_call", "type": "Callable[..., int]"}, {"lineNumber": 23, "col_offset": 25, "nodeName": "action_value", "type": "module"}, {"lineNumber": 24, "col_offset": 15, "nodeName": "list", "type": "Type[List[Any]]"}, {"lineNumber": 24, "col_offset": 20, "nodeName": "params", "type": "Any"}, {"lineNumber": 25, "col_offset": 9, "nodeName": "isinstance", "type": "Callable[[Any, Union[Type[Any], Tuple[Union[Type[Any], Tuple[Type[Any], ...]], ...]]], bool]"}, {"lineNumber": 25, "col_offset": 20, "nodeName": "obj", "type": "Any"}, {"lineNumber": 25, "col_offset": 25, "nodeName": "Distribution", "type": "Any"}, {"lineNumber": 35, "col_offset": 11, "nodeName": "chainerrl", "type": "module"}, {"lineNumber": 50, "col_offset": 8, "nodeName": "chainer", "type": "Any"}, {"lineNumber": 53, "col_offset": 8, "nodeName": "f", "type": "file"}, {"lineNumber": 53, "col_offset": 16, "nodeName": "dump", "type": "Any"}, {"lineNumber": 56, "col_offset": 8, "nodeName": "subprocess", "type": "module"}, {"lineNumber": 57, "col_offset": 29, "nodeName": "gv_filepath", "type": "Any"}, {"lineNumber": 57, "col_offset": 48, "nodeName": "png_filepath", "type": "Any"}, {"lineNumber": 23, "col_offset": 25, "nodeName": "chainerrl", "type": "module"}, {"lineNumber": 24, "col_offset": 20, "nodeName": "obj", "type": "Any"}, {"lineNumber": 25, "col_offset": 25, "nodeName": "distribution", "type": "module"}, {"lineNumber": 26, "col_offset": 15, "nodeName": "list", "type": "Type[List[Any]]"}, {"lineNumber": 26, "col_offset": 20, "nodeName": "params", "type": "Any"}, {"lineNumber": 27, "col_offset": 9, "nodeName": "isinstance", "type": "Callable[[Any, Union[Type[Any], Tuple[Union[Type[Any], Tuple[Type[Any], ...]], ...]]], bool]"}, {"lineNumber": 27, "col_offset": 20, "nodeName": "obj", "type": "Any"}, {"lineNumber": 28, "col_offset": 8, "nodeName": "variables", "type": "List[Any]"}, {"lineNumber": 29, "col_offset": 12, "nodeName": "child", "type": "Any"}, {"lineNumber": 29, "col_offset": 21, "nodeName": "obj", "type": "Any"}, {"lineNumber": 31, "col_offset": 15, "nodeName": "variables", "type": "List[Any]"}, {"lineNumber": 53, "col_offset": 16, "nodeName": "g", "type": "Any"}, {"lineNumber": 25, "col_offset": 25, "nodeName": "chainerrl", "type": "module"}, {"lineNumber": 26, "col_offset": 20, "nodeName": "obj", "type": "Any"}, {"lineNumber": 27, "col_offset": 26, "nodeName": "list", "type": "Type[List[Any]]"}, {"lineNumber": 27, "col_offset": 32, "nodeName": "tuple", "type": "Type[Tuple[Any, ...]]"}, {"lineNumber": 30, "col_offset": 12, "nodeName": "extend", "type": "Callable"}, {"lineNumber": 30, "col_offset": 12, "nodeName": "variables", "type": "List[Any]"}, {"lineNumber": 30, "col_offset": 29, "nodeName": "collect_variables", "type": "Callable[[Any], Any]"}, {"lineNumber": 30, "col_offset": 47, "nodeName": "child", "type": "Any"}]
[{"lineNumber": 3, "col_offset": 27, "nodeName": "object", "type": "Type[object]"}, {"lineNumber": 12, "col_offset": 8, "nodeName": "feature_dict", "type": "Any"}, {"lineNumber": 15, "col_offset": 8, "nodeName": "feature_list", "type": "List[List[Any]]"}, {"lineNumber": 17, "col_offset": 8, "nodeName": "add_features", "type": "bool"}, {"lineNumber": 18, "col_offset": 8, "nodeName": "dataset", "type": "Any"}, {"lineNumber": 18, "col_offset": 23, "nodeName": "dataset", "type": "Any"}, {"lineNumber": 21, "col_offset": 8, "nodeName": "node_feature_cache", "type": "Dict[nothing, nothing]"}, {"lineNumber": 22, "col_offset": 8, "nodeName": "initial_state_feature_cache", "type": "Dict[nothing, nothing]"}, {"lineNumber": 23, "col_offset": 8, "nodeName": "final_state_feature_cache", "type": "Dict[nothing, nothing]"}, {"lineNumber": 24, "col_offset": 8, "nodeName": "edge_feature_cache", "type": "Dict[nothing, nothing]"}, {"lineNumber": 49, "col_offset": 8, "nodeName": "add_features", "type": "bool"}, {"lineNumber": 50, "col_offset": 12, "nodeName": "seq", "type": "Any"}, {"lineNumber": 50, "col_offset": 19, "nodeName": "seq_list", "type": "Any"}, {"lineNumber": 54, "col_offset": 8, "nodeName": "add_features", "type": "bool"}, {"lineNumber": 60, "col_offset": 14, "nodeName": "NotImplementedError", "type": "Type[NotImplementedError]"}, {"lineNumber": 72, "col_offset": 14, "nodeName": "NotImplementedError", "type": "Type[NotImplementedError]"}, {"lineNumber": 75, "col_offset": 14, "nodeName": "NotImplementedError", "type": "Type[NotImplementedError]"}, {"lineNumber": 78, "col_offset": 14, "nodeName": "NotImplementedError", "type": "Type[NotImplementedError]"}, {"lineNumber": 84, "col_offset": 14, "nodeName": "NotImplementedError", "type": "Type[NotImplementedError]"}, {"lineNumber": 88, "col_offset": 8, "nodeName": "fn", "type": "TextIO"}, {"lineNumber": 98, "col_offset": 8, "nodeName": "fn", "type": "TextIO"}, {"lineNumber": 99, "col_offset": 8, "nodeName": "feature_names", "type": "List[str]"}, {"lineNumber": 100, "col_offset": 8, "nodeName": "feature_dic", "type": "Dict[str, int]"}, {"lineNumber": 101, "col_offset": 12, "nodeName": "line", "type": "str"}, {"lineNumber": 101, "col_offset": 20, "nodeName": "fn", "type": "TextIO"}, {"lineNumber": 105, "col_offset": 8, "nodeName": "feature_list", "type": "List[nothing]"}, {"lineNumber": 106, "col_offset": 8, "nodeName": "nr_feats", "type": "int"}, {"lineNumber": 107, "col_offset": 8, "nodeName": "add_features", "type": "bool"}, {"lineNumber": 108, "col_offset": 8, "nodeName": "dataset", "type": "Any"}, {"lineNumber": 108, "col_offset": 23, "nodeName": "dataset", "type": "Any"}, {"lineNumber": 111, "col_offset": 8, "nodeName": "node_feature_cache", "type": "Dict[nothing, nothing]"}, {"lineNumber": 112, "col_offset": 8, "nodeName": "initial_state_feature_cache", "type": "Dict[nothing, nothing]"}, {"lineNumber": 113, "col_offset": 8, "nodeName": "edge_feature_cache", "type": "Dict[nothing, nothing]"}, {"lineNumber": 114, "col_offset": 8, "nodeName": "final_edge_feature_cache", "type": "Dict[nothing, nothing]"}, {"lineNumber": 12, "col_offset": 8, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 12, "col_offset": 28, "nodeName": "LabelDictionary", "type": "Any"}, {"lineNumber": 15, "col_offset": 8, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 17, "col_offset": 8, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 18, "col_offset": 8, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 21, "col_offset": 8, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 22, "col_offset": 8, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 23, "col_offset": 8, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 24, "col_offset": 8, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 41, "col_offset": 15, "nodeName": "len", "type": "Callable[[Sized], int]"}, {"lineNumber": 41, "col_offset": 19, "nodeName": "feature_dict", "type": "Any"}, {"lineNumber": 49, "col_offset": 8, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 50, "col_offset": 19, "nodeName": "dataset", "type": "Any"}, {"lineNumber": 54, "col_offset": 8, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 88, "col_offset": 13, "nodeName": "open", "type": "Callable"}, {"lineNumber": 88, "col_offset": 18, "nodeName": "file", "type": "Any"}, {"lineNumber": 89, "col_offset": 12, "nodeName": "feat_nr", "type": "int"}, {"lineNumber": 89, "col_offset": 20, "nodeName": "feat", "type": "str"}, {"lineNumber": 89, "col_offset": 28, "nodeName": "enumerate", "type": "Type[enumerate[Any]]"}, {"lineNumber": 89, "col_offset": 38, "nodeName": "feature_names", "type": "List[str]"}, {"lineNumber": 91, "col_offset": 8, "nodeName": "close", "type": "Callable[[], None]"}, {"lineNumber": 98, "col_offset": 13, "nodeName": "open", "type": "Callable"}, {"lineNumber": 98, "col_offset": 18, "nodeName": "file", "type": "Any"}, {"lineNumber": 99, "col_offset": 8, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 100, "col_offset": 8, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 105, "col_offset": 8, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 106, "col_offset": 8, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 106, "col_offset": 24, "nodeName": "len", "type": "Callable[[Sized], int]"}, {"lineNumber": 106, "col_offset": 28, "nodeName": "feature_names", "type": "List[str]"}, {"lineNumber": 107, "col_offset": 8, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 108, "col_offset": 8, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 109, "col_offset": 8, "nodeName": "close", "type": "Callable[[], None]"}, {"lineNumber": 111, "col_offset": 8, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 112, "col_offset": 8, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 113, "col_offset": 8, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 114, "col_offset": 8, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 41, "col_offset": 19, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 50, "col_offset": 19, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 51, "col_offset": 11, "nodeName": "seq_node_features", "type": "Any"}, {"lineNumber": 51, "col_offset": 29, "nodeName": "seq_edge_features", "type": "Any"}, {"lineNumber": 51, "col_offset": 49, "nodeName": "get_seq_features", "type": "Any"}, {"lineNumber": 51, "col_offset": 71, "nodeName": "seq", "type": "Any"}, {"lineNumber": 52, "col_offset": 11, "nodeName": "append", "type": "Callable"}, {"lineNumber": 89, "col_offset": 38, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 90, "col_offset": 12, "nodeName": "write", "type": "Callable"}, {"lineNumber": 91, "col_offset": 8, "nodeName": "fn", "type": "TextIO"}, {"lineNumber": 102, "col_offset": 12, "nodeName": "feat_nr", "type": "str"}, {"lineNumber": 102, "col_offset": 20, "nodeName": "feat", "type": "str"}, {"lineNumber": 102, "col_offset": 27, "nodeName": "split", "type": "Callable[..., List[str]]"}, {"lineNumber": 103, "col_offset": 12, "nodeName": "append", "type": "Callable"}, {"lineNumber": 103, "col_offset": 38, "nodeName": "feat", "type": "str"}, {"lineNumber": 104, "col_offset": 12, "nodeName": "feature_dic", "type": "Dict[str, int]"}, {"lineNumber": 104, "col_offset": 37, "nodeName": "int", "type": "Type[int]"}, {"lineNumber": 104, "col_offset": 41, "nodeName": "feat_nr", "type": "str"}, {"lineNumber": 106, "col_offset": 28, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 109, "col_offset": 8, "nodeName": "fn", "type": "TextIO"}, {"lineNumber": 51, "col_offset": 49, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 52, "col_offset": 11, "nodeName": "feature_list", "type": "List[List[Any]]"}, {"lineNumber": 52, "col_offset": 37, "nodeName": "seq_node_features", "type": "Any"}, {"lineNumber": 52, "col_offset": 55, "nodeName": "seq_edge_features", "type": "Any"}, {"lineNumber": 90, "col_offset": 12, "nodeName": "fn", "type": "TextIO"}, {"lineNumber": 103, "col_offset": 12, "nodeName": "feature_names", "type": "List[str]"}, {"lineNumber": 104, "col_offset": 12, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 104, "col_offset": 29, "nodeName": "feat", "type": "str"}, {"lineNumber": 52, "col_offset": 11, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 90, "col_offset": 33, "nodeName": "feat_nr", "type": "int"}, {"lineNumber": 90, "col_offset": 41, "nodeName": "feat", "type": "str"}, {"lineNumber": 102, "col_offset": 27, "nodeName": "strip", "type": "Callable[..., str]"}, {"lineNumber": 103, "col_offset": 12, "nodeName": "self", "type": "AbstractFeatureClass"}, {"lineNumber": 102, "col_offset": 27, "nodeName": "line", "type": "str"}]
{ "intelligence": 88, "strength": 10, "speed": 8, "durability": 10, "power": 14, "combat": 10 }
{ "layout": "collection", "permalink": "/collections/{{ page.fileSlug }}/", "tags": ["collection"], "changefreq": "monthly", "priority": "0.2" }
{"streams":[{"title":"DTV SPORTS + ⁽ᴹ⁾","url":"http://tv.iptv5latino.cl:8000/live/premium2/mauri1234554321/15881.m3u8"}]}