Datasets:
averoo
/
sc_JSON

Dataset card Data Studio Files
xet
 Community
1
text
stringlengths
6
2.91M
{ "name": "vuejs-event-calendar", "description": "A simple calendar to mark events for Vue2", "version": "0.0.1", "author": "chantouch <chantouchsek.cs83@gmail.com>", "scripts": { "dev": "cross-env NODE_ENV=development webpack-dev-server --open --inline --hot", "build": "cross-env NODE_ENV=production webpack --progress --hide-modules" }, "repository": { "type": "git", "url": "git+https://github.com/chantouchsek/vuejs-event-calendar.git" }, "main": "dist/index.js", "dependencies": { "vue": "^2.5.21" }, "devDependencies": { "babel-core": "^6.26.3", "babel-loader": "^7.0.0", "babel-preset-es2015": "^6.24.1", "cross-env": "^5.2.0", "css-loader": "^2.0.0", "extract-text-webpack-plugin": "^3.0.2", "file-loader": "^2.0.0", "less": "^3.9.0", "less-loader": "^4.1.0", "style-loader": "^0.23.1", "vue-loader": "^15.4.2", "vue-template-compiler": "^2.5.21", "webpack": "^2.2.1", "webpack-dev-server": "^2.3.0" }, "keywords": [ "vue", "vuejs", "event", "calendar", "vuejs-event-calendar" ], "bugs": { "url": "https://github.com/chantouchsek/vuejs-event-calendar/issues" }, "homepage": "https://bookingkh.com/vuejs-event-calendar", "license": "ISC" }
{"poster":"rsjac","date":"2015-03-03T01:07:25.242+0000","title":"'Summoner School' in game chat room - find help, teachers, or people to play with!","subforum":"Miscellaneous","embed":{"description":"As a lot of you on NA and EUW probably know, the in game 'Summoner School' chat room can be a great place for people to get together, answer...","url":"http://www.reddit.com/r/summonerschool/comments/2xqddn/summoner_school_in_game_chat_channel_join_it/","image":"http://www.redditstatic.com/icon.png"},"up_votes":9,"down_votes":1,"body":"Hey OCE,\r\n\r\nIf you haven't heard of the subreddit /r/SummonerSchool, its a pretty big community dedicated to helping people learn everything there is to know about LoL. Lots of great guides are posted their regularly, lots of people offering in game help and lots of people getting better at league.\r\n\r\nWith the introduction of the Team Rewards program (http://oce.leagueoflegends.com/en/news/game-updates/features/team-and-earn-party-rewards) I thought it would be a good time to try and grow the in game Summoner School chat room. For NA and EUW, it has served as a great place for people to find others to team up with. Once enough people get in the chat room there is usually pretty constant discussion about all kinds of things. I think the community could really benefit from having an active, friendly chat room on OCE. We just need people in there to start growing it. \r\n\r\nIf you don't know how to join the chat or haven't joined a chatroom in LoL before:\r\n\r\n1) Click the double chat box icon (on the right of friends list icon)\r\n\r\n2) Click \"Create or Join a Chat Room\"\r\n\r\n3) Search \"Summoner School\"\r\n\r\n4) Optional: Once you have the chat room open, there are 3 icons on the upper right of the chat box. Far left side is a gear icon with 2 checkboxes. \"Autojoin on Startup\" will open the chat automatically every time you log in.\r\n\r\nSee you in there!\r\nrsjac","replies":[{"poster":"Suffocator","date":"2015-07-14T14:17:54.856+0000","up_votes":1,"down_votes":0,"body":"This needs many, many more bumps. \nEveryone join me in Summoner school!","replies":[{"poster":"Exhausted","date":"2015-07-14T14:36:55.436+0000","up_votes":2,"down_votes":0,"body":"Agreed i'll bump this daily","replies":[{"poster":"Suffocator","date":"2015-07-15T06:21:55.964+0000","up_votes":1,"down_votes":0,"body":"I'll keep an {{item:2044}} on it too :D","replies":[]}]}]},{"poster":"Zero Infinity","date":"2015-03-03T01:34:27.442+0000","up_votes":2,"down_votes":0,"body":"I've played LOL since s1 and only heard about this a week or two ago; great idea to post it. Thanks!","replies":[]}]}
{"keys": ["291194", "", "291250", "27297", "291196", "291251", "291197", "291252", "291198", "291253", "291199", "291254", "291200", "291255", "291201", "291256", "291202", "291257", "291258", "291203", "291204", "291259", "291205", "291260", "291206", "291261", "291207", "291262", "291208", "291263", "291209", "291264", "291265", "291210", "291267", "291211", "291268", "291213", "291269", "291272", "291273", "291215", "291274", "291216", "291275", "291217", "291276", "291218", "291277", "291220", "291278", "291221", "291279", "291222", "291280", "291223", "291224", "291281", "291225", "291282", "291226", "291283", "291227", "291284", "291228", "291285", "291229", "291286", "291230", "291287", "291231", "291288", "291232"], "data": {"291288": {"propaddres": 19944, "proaddress": "19944 LICHFIELD", "parcelnumb": "02005599.", "fid": 291288, "ownername1": "FEDERAL HOME LOAN MORTGAGE"}, "291263": {"propaddres": 20142, "proaddress": "20142 LICHFIELD", "parcelnumb": "02005622.", "fid": 291263, "ownername1": "GROBE, DALOS W"}, "291220": {"propaddres": 20035, "proaddress": "20035 LICHFIELD", "parcelnumb": "02005675.", "fid": 291220, "ownername1": "RICE, CINNAMON"}, "291280": {"propaddres": 20008, "proaddress": "20008 LICHFIELD", "parcelnumb": "02005607-8", "fid": 291280, "ownername1": "YEARBY, AYANNA"}, "291281": {"propaddres": 20004, "proaddress": "20004 LICHFIELD", "parcelnumb": "02005606.", "fid": 291281, "ownername1": "YEARBY, AYANNA W"}, "291282": {"propaddres": 20000, "proaddress": "20000 LICHFIELD", "parcelnumb": "02005605.", "fid": 291282, "ownername1": "WOODS, ANDREW C JR"}, "291221": {"propaddres": 20027, "proaddress": "20027 LICHFIELD", "parcelnumb": "02005676.", "fid": 291221, "ownername1": "FLEISCHAKER, BARBARA R"}, "291284": {"propaddres": 19976, "proaddress": "19976 LICHFIELD", "parcelnumb": "02005603.", "fid": 291284, "ownername1": "DRYER, EDWARD"}, "291285": {"propaddres": 19968, "proaddress": "19968 LICHFIELD", "parcelnumb": "02005602.", "fid": 291285, "ownername1": "DRYER, EDWARD"}, "291286": {"propaddres": 19960, "proaddress": "19960 LICHFIELD", "parcelnumb": "02005601.", "fid": 291286, "ownername1": "MAYS, JEWEL"}, "291287": {"propaddres": 19952, "proaddress": "19952 LICHFIELD", "parcelnumb": "02005600.", "fid": 291287, "ownername1": "BARBOUR, AVA"}, "291200": {"propaddres": 20209, "proaddress": "20209 LICHFIELD", "parcelnumb": "02005657.", "fid": 291200, "ownername1": "MOBLEY, TAMIKA"}, "291201": {"propaddres": 20203, "proaddress": "20203 LICHFIELD", "parcelnumb": "02005658.", "fid": 291201, "ownername1": "BRADLEY, LETTIE P"}, "291202": {"propaddres": 20195, "proaddress": "20195 LICHFIELD", "parcelnumb": "02005659.", "fid": 291202, "ownername1": "RHOADES, PETER & AMY"}, "291203": {"propaddres": 20185, "proaddress": "20185 LICHFIELD", "parcelnumb": "02005660.", "fid": 291203, "ownername1": "THOMPSON, TIMOTHY A SR & AUDREY"}, "291204": {"propaddres": 20175, "proaddress": "20175 LICHFIELD", "parcelnumb": "02005661.", "fid": 291204, "ownername1": "COOK, MARJORIE"}, "291205": {"propaddres": 20171, "proaddress": "20171 LICHFIELD", "parcelnumb": "02005662.", "fid": 291205, "ownername1": "CRAWFORD, MALCOLM & MITIE"}, "291206": {"propaddres": 20161, "proaddress": "20161 LICHFIELD", "parcelnumb": "02005663.", "fid": 291206, "ownername1": "REGAN, MICHAEL T"}, "291207": {"propaddres": 20155, "proaddress": "20155 LICHFIELD", "parcelnumb": "02005664.", "fid": 291207, "ownername1": "GATES, FRANK W SR & JANICE M"}, "291208": {"propaddres": 20145, "proaddress": "20145 LICHFIELD", "parcelnumb": "02005665.", "fid": 291208, "ownername1": "KEAS, KEVIN E"}, "291209": {"propaddres": 20137, "proaddress": "20137 LICHFIELD", "parcelnumb": "02005666-7", "fid": 291209, "ownername1": "FOSTER, PATRICIA A"}, "291260": {"propaddres": 20170, "proaddress": "20170 LICHFIELD", "parcelnumb": "02005625.", "fid": 291260, "ownername1": "GUZMAN, R & S"}, "291261": {"propaddres": 20160, "proaddress": "20160 LICHFIELD", "parcelnumb": "02005624.", "fid": 291261, "ownername1": "TROUT, LORI KEROS"}, "291198": {"propaddres": 20225, "proaddress": "20225 LICHFIELD", "parcelnumb": "02005655.", "fid": 291198, "ownername1": "WALTON, ERIC T & KRISTINE A"}, "291199": {"propaddres": 20217, "proaddress": "20217 LICHFIELD", "parcelnumb": "02005656.", "fid": 291199, "ownername1": "VASILOVOIK, M B"}, "291228": {"propaddres": 19971, "proaddress": "19971 LICHFIELD", "parcelnumb": "02005683.", "fid": 291228, "ownername1": "MOORE, DON"}, "291229": {"propaddres": 19963, "proaddress": "19963 LICHFIELD", "parcelnumb": "02005684.", "fid": 291229, "ownername1": "FINLEY SEAN P"}, "291232": {"propaddres": 19939, "proaddress": "19939 LICHFIELD", "parcelnumb": "02005688.", "fid": 291232, "ownername1": "JACKSON, FRANKLIN GEORGE"}, "291273": {"propaddres": 20070, "proaddress": "20070 LICHFIELD", "parcelnumb": "02005615.", "fid": 291273, "ownername1": "RICHARDSON, MORRIS E II"}, "291275": {"propaddres": 20054, "proaddress": "20054 LICHFIELD", "parcelnumb": "02005613.", "fid": 291275, "ownername1": "KIRKSEY, DWIGHT R"}, "291267": {"propaddres": 20120, "proaddress": "20120 LICHFIELD", "parcelnumb": "02005619.", "fid": 291267, "ownername1": "GREEN, BEVERLY R"}, "291276": {"propaddres": 20048, "proaddress": "20048 LICHFIELD", "parcelnumb": "02005612.", "fid": 291276, "ownername1": "KIRKSEY, D"}, "291264": {"propaddres": 20134, "proaddress": "20134 LICHFIELD", "parcelnumb": "02005621.", "fid": 291264, "ownername1": "HARRIS, FELECIA J"}, "291265": {"propaddres": 20128, "proaddress": "20128 LICHFIELD", "parcelnumb": "02005620.", "fid": 291265, "ownername1": "DYSON, LINDA B"}, "291277": {"propaddres": 20040, "proaddress": "20040 LICHFIELD", "parcelnumb": "02005611.", "fid": 291277, "ownername1": "MCCURTIS, WILLIE A & THERESA A"}, "291226": {"propaddres": 19987, "proaddress": "19987 LICHFIELD", "parcelnumb": "02005681.", "fid": 291226, "ownername1": "BROWN, WELTON E & SYLVIA D"}, "291253": {"propaddres": 20224, "proaddress": "20224 LICHFIELD", "parcelnumb": "02005632.", "fid": 291253, "ownername1": "DOROAN, KATHLEEN & ERIC J"}, "291252": {"propaddres": 20232, "proaddress": "20232 LICHFIELD", "parcelnumb": "02005633.", "fid": 291252, "ownername1": "LEDDY, FELICITY ANN"}, "291251": {"propaddres": 20240, "proaddress": "20240 LICHFIELD", "parcelnumb": "02005634.", "fid": 291251, "ownername1": "LEDDY, FELICITY ANN"}, "291250": {"propaddres": 20248, "proaddress": "20248 LICHFIELD", "parcelnumb": "02005635.", "fid": 291250, "ownername1": "WASHINGTON, GEORGE & SCHEFF, EILEEN"}, "291257": {"propaddres": 20188, "proaddress": "20188 LICHFIELD", "parcelnumb": "02005628.", "fid": 291257, "ownername1": "HARRIS, STEPHEN D"}, "291256": {"propaddres": 20200, "proaddress": "20200 LICHFIELD", "parcelnumb": "02005629.", "fid": 291256, "ownername1": "WHITLOCK, ANTHONY"}, "291255": {"propaddres": 20208, "proaddress": "20208 LICHFIELD", "parcelnumb": "02005630.", "fid": 291255, "ownername1": "MCKEE, ROBERT W"}, "291254": {"propaddres": 20216, "proaddress": "20216 LICHFIELD", "parcelnumb": "02005631.", "fid": 291254, "ownername1": "WATKINS, DONNA"}, "291259": {"propaddres": 20176, "proaddress": "20176 LICHFIELD", "parcelnumb": "02005626.", "fid": 291259, "ownername1": "GUZMAN, R & S"}, "291258": {"propaddres": 20182, "proaddress": "20182 LICHFIELD", "parcelnumb": "02005627.", "fid": 291258, "ownername1": "PRESBEY, GAIL M"}, "291283": {"propaddres": 19984, "proaddress": "19984 LICHFIELD", "parcelnumb": "02005604.", "fid": 291283, "ownername1": "PAGNANI, STEPHEN E"}, "291279": {"propaddres": 20024, "proaddress": "20024 LICHFIELD", "parcelnumb": "02005609.", "fid": 291279, "ownername1": "BROWN, PAMELA D"}, "291278": {"propaddres": 20030, "proaddress": "20030 LICHFIELD", "parcelnumb": "02005610.", "fid": 291278, "ownername1": "FRACASSA, JAMES AND MOIRA"}, "291225": {"propaddres": 19997, "proaddress": "19997 LICHFIELD", "parcelnumb": "02005680.", "fid": 291225, "ownername1": "JOLLEY, NOEL W"}, "291231": {"propaddres": 19947, "proaddress": "19947 LICHFIELD", "parcelnumb": "02005686-7", "fid": 291231, "ownername1": "MORTGAGE ELECTRONIC REGISTRATION SY"}, "291230": {"propaddres": 19955, "proaddress": "19955 LICHFIELD", "parcelnumb": "02005685.", "fid": 291230, "ownername1": "ROBINSON, ANN & PHIL"}, "291218": {"propaddres": 20043, "proaddress": "20043 LICHFIELD", "parcelnumb": "02005674.", "fid": 291218, "ownername1": "HEINZ, RUBY L"}, "291217": {"propaddres": 20051, "proaddress": "20051 LICHFIELD", "parcelnumb": "02005673.", "fid": 291217, "ownername1": "FLORENO, F & M"}, "291216": {"propaddres": 20059, "proaddress": "20059 LICHFIELD", "parcelnumb": "02005672.", "fid": 291216, "ownername1": "MAVEAL, TREVOR"}, "291215": {"propaddres": 20069, "proaddress": "20069 LICHFIELD", "parcelnumb": "02005671.", "fid": 291215, "ownername1": "LESLIE, H CRAIG"}, "291272": {"propaddres": 20072, "proaddress": "20072 LICHFIELD", "parcelnumb": "02005616.", "fid": 291272, "ownername1": "RICHARDSON, MORRIS E II"}, "291213": {"propaddres": 20103, "proaddress": "20103 LICHFIELD", "parcelnumb": "02005670.", "fid": 291213, "ownername1": "ENGLISH, MARK"}, "291274": {"propaddres": 20060, "proaddress": "20060 LICHFIELD", "parcelnumb": "02005614.", "fid": 291274, "ownername1": "LUCAS, ISMAEL"}, "291211": {"propaddres": 20115, "proaddress": "20115 LICHFIELD", "parcelnumb": "02005669.", "fid": 291211, "ownername1": "NELSON, MICHELE N"}, "291210": {"propaddres": 20121, "proaddress": "20121 LICHFIELD", "parcelnumb": "02005668.", "fid": 291210, "ownername1": "ALEXANDER, KEITH M & ANITA C"}, "291269": {"propaddres": 20102, "proaddress": "20102 LICHFIELD", "parcelnumb": "02005617.", "fid": 291269, "ownername1": "KRIEGER, JOHN W"}, "291194": {"propaddres": 20251, "proaddress": "20251 LICHFIELD", "parcelnumb": "02005652.", "fid": 291194, "ownername1": "HOPE, MARY"}, "291227": {"propaddres": 19981, "proaddress": "19981 LICHFIELD", "parcelnumb": "02005682.", "fid": 291227, "ownername1": "JONES, KIMBERLY"}, "291268": {"propaddres": 20110, "proaddress": "20110 LICHFIELD", "parcelnumb": "02005618.", "fid": 291268, "ownername1": "PAUL EGGEBRECHT & AMY KURAS"}, "27297": {"propaddres": 19975, "proaddress": "19975 WOODWARD AVENUE", "parcelnumb": "02002643.", "fid": 27297, "ownername1": "MIDWEST MEMORIAL GROUP, LLC"}, "291196": {"propaddres": 20243, "proaddress": "20243 LICHFIELD", "parcelnumb": "02005653.", "fid": 291196, "ownername1": "MANNING, STEPHEN D"}, "291197": {"propaddres": 20233, "proaddress": "20233 LICHFIELD", "parcelnumb": "02005654.", "fid": 291197, "ownername1": "KING, ALEAN E"}, "291262": {"propaddres": 20150, "proaddress": "20150 LICHFIELD", "parcelnumb": "02005623.", "fid": 291262, "ownername1": "FAIR, KAREN L"}, "291222": {"propaddres": 20019, "proaddress": "20019 LICHFIELD", "parcelnumb": "02005677.", "fid": 291222, "ownername1": "MITCHELL, DANIEL E"}, "291224": {"propaddres": 20003, "proaddress": "20003 LICHFIELD", "parcelnumb": "02005679.", "fid": 291224, "ownername1": "HENDERSON, PAULA JORDAN"}, "291223": {"propaddres": 20011, "proaddress": "20011 LICHFIELD", "parcelnumb": "02005678.", "fid": 291223, "ownername1": "MITCHELL, DANIEL E"}}, "grid": [" !!######$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "%%%%!!##&&&&$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "%%%%!!&&&&&&$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "''''!!(((((($$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "''''!!(((((($$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "))))!!******$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "))))!!******$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "++++!!,,,,,,$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "----!!,.....$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "----!!......$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "////!!!00000$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "////!!!00000$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "1111!!!222222$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "1111!!!222223$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "4444!!!333333$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "5555!!!666666$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "5555!!!666666$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "7777!!!888888$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "77777!!888888$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "99999!!::::::$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "9999;!!:::<<<$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", ";;;;;!!<<<<<<$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "=====!!>>>>>>$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "=====!!>>>>>>$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "?????!!@@@@@@$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "?????!!@@@@@@$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "?????!!AAAAAA$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "BBBBB!!AACCCC$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "BBBBB!!CCCCCC$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "DDDDD!!EEEEEE$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "DDDDD!!EEEEEE$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "FFFFF!!GGGGGG$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "FFFFF!!GGGGGG$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "FFFFF!!HHHHHH$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "!!!!!!!IIIIII$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "JJJJJ!!IIIIII$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "JJJJJ!!KKKKKK$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "LLLLL!!KKKKKK$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "LLLLL!!MMMMMM$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "NNNNN!!MMMMMO$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "NNNNP!!OOOOOO$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "PPPPP!!OQQQQQ$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "RRRRR!!QQQQQQ$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "RRRRR!!SSSSSS$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "TTTTT!!SSSSSS$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "TTTTT!!!UUUUU$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "VVVVV!!!UUUWWWW$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "VVVVX!!!!WWWWWW$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "XXXXX!!!!WWWWWW$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "YYYYY!!!!WWWWWW$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "YYYYY!!!!ZZZZZZ$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "[[[[[!!!!ZZZZZZ$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "[[[[[!!!]]]]]]$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "^^^^^!!!]_____$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "^^````!!______$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "``````!!aaaaaa$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "bbbbbb!!aaaaaa$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "bbbbbb!!cccccc$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "dddddd!!cccccc$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "dddddd!!eeeeee$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "ffffff!!gggggg$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "hhhhhh!!gggggg$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "hhhhhh!!iiiiii$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$", "jjjjjj!!iiiiii$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$"]}
{ "id": 908027741, "type": "Feature", "properties": { "addr:full":"2 Merton Road, Ponteland Newcastle-upon-tyne Northumberland NE20 9PY", "addr:housenumber":"2", "addr:postcode":"ne20 9py", "addr:street":"Merton Road", "edtf:cessation":"uuuu", "edtf:inception":"uuuu", "geom:area":0.0, "geom:area_square_m":0.0, "geom:bbox":"-1.7445499897,55.0507125854,-1.7445499897,55.0507125854", "geom:latitude":55.050713, "geom:longitude":-1.74455, "iso:country":"GB", "mz:hierarchy_label":1, "mz:is_current":-1, "sg:address":"2 Merton Road, Ponteland", "sg:city":"Newcastle-upon-tyne", "sg:classifiers":[ { "category":"Food & Beverages", "subcategory":"Bakery", "type":"Retail Goods" } ], "sg:owner":"simplegeo", "sg:phone":"+44 1661 822271", "sg:postcode":"NE20 9PY", "sg:province":"Northumberland", "sg:tags":[ "baker" ], "src:geom":"simplegeo", "wof:belongsto":[], "wof:breaches":[], "wof:concordances":{ "sg:id":"SG_2R7OxOdUVnuMoERQ6moBNq_55.050713_-1.744550@1300740506" }, "wof:country":"GB", "wof:created":1471929029, "wof:geomhash":"cc855261b89d45e206d3a28ca98d6580", "wof:hierarchy":[], "wof:id":908027741, "wof:lastmodified":1496942590, "wof:name":"Milligans Bakery Ltd.", "wof:parent_id":-1, "wof:placetype":"venue", "wof:repo":"whosonfirst-data-venue-gb", "wof:superseded_by":[], "wof:supersedes":[], "wof:tags":[ "baker" ] }, "bbox": [ -1.7445499897, 55.0507125854, -1.7445499897, 55.0507125854 ], "geometry": {"coordinates":[-1.7445499897,55.0507125854],"type":"Point"} }
[{"title":"js性能优化","date":"2021-09-22T03:27:14.000Z","path":"2021/09/22/js性能优化/","tags":[{"name":"前端优化","slug":"前端优化","permalink":"http://yunxii.cn/tags/前端优化/"}]},{"title":"DP-最长递增子序列","date":"2021-09-22T02:23:12.000Z","path":"2021/09/22/动态规划设计之最长递增子序列/","tags":[{"name":"算法","slug":"算法","permalink":"http://yunxii.cn/tags/算法/"}]},{"title":"移动端键盘弹起页面上移","date":"2021-08-03T02:05:54.000Z","path":"2021/08/03/移动端键盘弹起页面上移/","tags":[{"name":"业务问题","slug":"业务问题","permalink":"http://yunxii.cn/tags/业务问题/"}]},{"title":"vue 悬浮条","date":"2021-07-23T08:44:22.000Z","path":"2021/07/23/vue-悬浮条/","tags":[{"name":"业务问题","slug":"业务问题","permalink":"http://yunxii.cn/tags/业务问题/"}]},{"title":"gitlab和github共存","date":"2021-03-25T02:49:13.000Z","path":"2021/03/25/gitlab和github共存/","tags":[{"name":"git","slug":"git","permalink":"http://yunxii.cn/tags/git/"}]},{"title":"react vs vue","date":"2021-02-01T03:01:53.000Z","path":"2021/02/01/react-vs-vue/","tags":[{"name":"前端框架","slug":"前端框架","permalink":"http://yunxii.cn/tags/前端框架/"}]},{"title":"alipayjsbridge 的选择图片坑点","date":"2020-12-18T01:48:38.000Z","path":"2020/12/18/alipayjsbridge-的选择图片坑点/","tags":[]},{"title":"排序算法总结","date":"2020-10-19T07:17:55.000Z","path":"2020/10/19/排序算法总结/","tags":[{"name":"算法","slug":"算法","permalink":"http://yunxii.cn/tags/算法/"}]},{"title":"二叉树多种遍历","date":"2020-10-10T07:50:18.000Z","path":"2020/10/10/二叉树多种遍历/","tags":[{"name":"算法","slug":"算法","permalink":"http://yunxii.cn/tags/算法/"}]},{"title":"alfred 查看IP工具","date":"2020-09-28T07:26:02.000Z","path":"2020/09/28/alfred-查看IP工具/","tags":[{"name":"alfred","slug":"alfred","permalink":"http://yunxii.cn/tags/alfred/"}]},{"title":"leetcode vscode插件登录不上","date":"2020-09-21T02:23:44.000Z","path":"2020/09/21/leetcode-vscode插件登录不上/","tags":[{"name":"日常问题","slug":"日常问题","permalink":"http://yunxii.cn/tags/日常问题/"}]},{"title":"antd form的自定义校验","date":"2020-09-03T02:05:38.000Z","path":"2020/09/03/antd-form的自定义校验/","tags":[{"name":"日常问题","slug":"日常问题","permalink":"http://yunxii.cn/tags/日常问题/"}]},{"title":"使用iview动态表单校验问题","date":"2020-08-21T05:48:37.000Z","path":"2020/08/21/使用iview动态表单校验问题/","tags":[{"name":"日常问题","slug":"日常问题","permalink":"http://yunxii.cn/tags/日常问题/"}]},{"title":"react html2canvas生成pdf空白","date":"2020-08-12T06:15:21.000Z","path":"2020/08/12/react-html2canvas生成pdf空白/","tags":[{"name":"日常问题","slug":"日常问题","permalink":"http://yunxii.cn/tags/日常问题/"}]},{"title":"自用vscode插件","date":"2020-07-28T02:43:12.000Z","path":"2020/07/28/自用vscode插件/","tags":[{"name":"vscode","slug":"vscode","permalink":"http://yunxii.cn/tags/vscode/"}]},{"title":"重读VUE2.x官方文档","date":"2020-06-18T06:13:11.000Z","path":"2020/06/18/重读VUE2-x官方文档/","tags":[{"name":"前端框架","slug":"前端框架","permalink":"http://yunxii.cn/tags/前端框架/"},{"name":"vue","slug":"vue","permalink":"http://yunxii.cn/tags/vue/"}]},{"title":"使用stylelint校验vue css代码","date":"2020-04-29T09:46:59.000Z","path":"2020/04/29/使用stylelint校验vue-css代码/","tags":[{"name":"其他","slug":"其他","permalink":"http://yunxii.cn/tags/其他/"},{"name":"日常问题记录","slug":"日常问题记录","permalink":"http://yunxii.cn/tags/日常问题记录/"}]},{"title":"vue获取页面元素","date":"2020-04-22T09:51:12.000Z","path":"2020/04/22/vue获取页面元素/","tags":[{"name":"日常问题","slug":"日常问题","permalink":"http://yunxii.cn/tags/日常问题/"}]},{"title":"h5页面a链接下载图片","date":"2020-04-20T03:30:35.000Z","path":"2020/04/20/h5页面a链接下载图片/","tags":[{"name":"日常问题记录","slug":"日常问题记录","permalink":"http://yunxii.cn/tags/日常问题记录/"}]},{"title":"亲测常用vscode命令（mac）","date":"2020-04-19T02:25:04.000Z","path":"2020/04/19/亲测常用vscode命令/","tags":[{"name":"vscode","slug":"vscode","permalink":"http://yunxii.cn/tags/vscode/"}]},{"title":"很多could not freeze","date":"2020-04-16T02:18:15.000Z","path":"2020/04/16/很多could-not-freeze/","tags":[{"name":"日常问题记录","slug":"日常问题记录","permalink":"http://yunxii.cn/tags/日常问题记录/"}]},{"title":"重温数据结构与算法","date":"2019-12-26T02:32:17.000Z","path":"2019/12/26/重温数据结构/","tags":[{"name":"算法","slug":"算法","permalink":"http://yunxii.cn/tags/算法/"},{"name":"数据结构","slug":"数据结构","permalink":"http://yunxii.cn/tags/数据结构/"}]},{"title":"keynote代码高亮(亲测可用)","date":"2019-10-29T02:32:17.000Z","path":"2019/10/29/keynote代码高亮/","tags":[{"name":"其他","slug":"其他","permalink":"http://yunxii.cn/tags/其他/"},{"name":"keynote","slug":"keynote","permalink":"http://yunxii.cn/tags/keynote/"}]},{"title":"git常用命令总结","date":"2019-10-15T02:32:17.000Z","path":"2019/10/15/git常用命令/","tags":[{"name":"git","slug":"git","permalink":"http://yunxii.cn/tags/git/"}]},{"title":"plum静电容键盘66键说明书","date":"2019-08-12T02:32:17.000Z","path":"2019/08/12/plum静电容键盘66键说明书/","tags":[{"name":"其他","slug":"其他","permalink":"http://yunxii.cn/tags/其他/"}]},{"title":"Hello World","date":"2019-08-09T03:12:52.096Z","path":"2019/08/09/hello-world/","tags":[]}]
{"poster":"Thoorlak","date":"2015-12-30T02:09:26.785+0000","title":"Se busca Soporte Para Ranked Team","subforum":"Reclutamiento","up_votes":3,"down_votes":2,"body":"Busco soporte para ranked team\r\n\r\nRequerimientos\r\n\r\n-Liga : Platino V +\r\n-Ser Arg\r\n-Tener horarios desde 22:00 hs En adelante\r\n-Estar dispuesto a practicar todos los d&iacute;as\r\n\r\nInteresados Agreguen &quot;Thoorlak&quot;","replies":[{"poster":"Moe Szyslak","date":"2015-12-30T10:40:33.723+0000","up_votes":1,"down_votes":0,"body":"Si seguís buscando support, agregame: C4RP DangerouS\n\nEntre hoy o mañana voy a llegar a Platino V. Actualmente soy Oro I y juego absolutamente todos los soportes y cumplo todos los requisitos que pedís.","replies":[]},{"poster":"Łørúlk","date":"2015-12-30T03:40:35.087+0000","up_votes":1,"down_votes":0,"body":"soy oro 5, tengo mas de 1000 partidas con thresh y juego casi siempre support, mi nick es Lordhulk por si les interesa...Saludos","replies":[{"poster":"ArmoredBullet","date":"2015-12-30T05:35:30.853+0000","up_votes":1,"down_votes":0,"body":"hola hermano estoy en un team con oro 4 y oro 3 te quieres unir bro","replies":[]},{"poster":"zelda1","date":"2015-12-30T04:47:31.159+0000","up_votes":1,"down_votes":0,"body":"LOLLLLLL 1000 con thresh wtf oro v lelllllllllllllll x cierto soy diamante v main suport ;v","replies":[]}]}]}
[{"web_url": "https://www.nytimes.com/reuters/2017/03/03/business/03reuters-brazil-power-auction-analysis.html", "source": "Reuters", "_id": "58b9aa5e95d0e024902fd66e", "pub_date": "2017-03-03T17:39:28+0000", "lead_paragraph": "With electricity demand in Brazil slashed by the harshest recession in a century, the government is evaluating an innovative kind of power auction - to allow companies to bid for the right to cancel licenses to build plants.", "section_name": "Business Day", "type_of_material": "News", "snippet": "With electricity demand in Brazil slashed by the harshest recession in a century, the government is evaluating an innovative kind of power auction - to allow companies to bid for the right to cancel licenses to build plants....", "document_type": "article", "headline": {"main": "Dying Author Pens Essay With Dating Profile of Husband", "print_headline": "Dying Author Pens Essay With Dating Profile of Husband"}}]
{ "forum_title": "Almennt um vélbúnað", "id": "53625", "title": "Vesen með nýtt skjákort. [Nýjar uppl.]", "url": "https://spjall.vaktin.is/viewtopic.php?f=20&t=53625", "posts": [ { "user_name": "addi32", "text": "NÝtt: Uppfærði bios í 1.8 sem er það nýjasta og ekkert virkaði. Fór með kortið að lokum í tölvutek og þeir settu það í Intal Setup og allt virkaði fínt. \nSamkv. google þá notaði gamla kortið u.þ.b 100w en nýja 45w svo aflgjafinn ætti ekki að vera málið. Er einhver stilling í BIOS sem ég get skoðað út af uppfærslu úr nvidea í ati radeon skjákort? \nEr alveg að verða bilaður á þessu, milljón stig fyrir einhverjar hugmyndir.\nVar með gamalt GeForce 8800 GTS skjákort í vélinni minn sem gaf upp öndina fyrir nokkrum dögum. Fór áðan og keypti mér Gigabyte HD7750OC skjákort.\nSetti kortið í og tengdi allt. Kveikti á vélinni, allar viftur í gang (skjákortinu líka) en ekkert kom á skjáinn (ekki bios).\nSamkvæmt skjákort debug kóðanum (97) er þetta \"Console Output devices connect\". Svo vélin er ekki að finna nýja kortið mitt.\nÞað sem mig grunaði að aflgjafinn væri ekki að höndla þetta. Tók alla HHD úr sambandi en ekkert gekk. Samkvæmt google þá ætti gamla kortið mitt að nota meira afl en það nýja.\nEr með \nAsRock 870 Extreem 3\nBulldozer fx 4100 \n8gb minni\n1x ssd\n2x hhd (sem ég tók úr sambandi á meðan).\n450W aflgjafi.\nEr kortið mitt ekki bara gallað frekar en aflgjafinn? Öll hjálp vel þegin!\nAndrés", "date": "2013-02-26 21:29:00", "post_id": "497513", "reply_to_id": false }, { "user_name": "mercury", "text": "fáðu að prufa það í annari vél.", "date": "2013-02-26 21:39:00", "post_id": "497514", "reply_to_id": "497513" }, { "user_name": "mundivalur", "text": "Ertu búinn að uppfæra bios-inn á móðurborðinu ?", "date": "2013-02-26 21:52:00", "post_id": "497516", "reply_to_id": "497514" }, { "user_name": "KermitTheFrog", "text": "Man ekki nákvæmlega hvernig þessi kort eru, en er nokkuð 6pin power tengi á kortinu sem þú ert að gleyma að tengja?", "date": "2013-02-26 22:00:00", "post_id": "497517", "reply_to_id": "497516" }, { "user_name": "addi32", "text": "Nei, þau BIOS update á vefsíðunni þeirra eru frá 2011 og ég keypti þetta nýtt fyrir ári kannski. Eina sem ég prufaði var að fjarlægja batterí-ið og setja það aftur í.\nEr ekkert 6-pin tengi á þessu korti.", "date": "2013-02-26 22:11:00", "post_id": "497519", "reply_to_id": "497517" }, { "user_name": "mercury", "text": "skiptir ekki hvenær þú keyptir það myndi athuga hvaða bios þú ert með því líklega er nýrri bios til.", "date": "2013-02-26 22:14:00", "post_id": "497521", "reply_to_id": "497519" }, { "user_name": "addi32", "text": "Ok, takk fyrir ábendinguna. Prufa að uppfæra hann á morgun.", "date": "2013-02-26 22:22:00", "post_id": "497523", "reply_to_id": "497521" }, { "user_name": "addi32", "text": "Búinn að prufa að uppfæra BIOS, ekkert gekk. Sjá info efst.\nAllar hugmyndir vel þegnar!! er að verða bilaður.", "date": "2013-03-01 20:14:00", "post_id": "497981", "reply_to_id": "497523" }, { "user_name": "mundivalur", "text": "Þá er bara að prufa annan aflgjafa ! hvað er þessi psu gamall ?", "date": "2013-03-01 20:23:00", "post_id": "497983", "reply_to_id": "497981" }, { "user_name": "addi32", "text": "Gæti verið kringum 4 ára. 450w könig.\nEr bara með 1ssd disk, 2 minni, skjákortið og örgjörvann á þessum aflgjafa. Búinn að taka allar viftur og auka diska úr sambandi.", "date": "2013-03-01 21:22:00", "post_id": "497999", "reply_to_id": "497983" }, { "user_name": "mundivalur", "text": "Það lýst mér ekki á bæði búinn að missa kraft og König \n \nReyndu að prufa annan eða fjárfesta í betri græju !", "date": "2013-03-01 22:57:00", "post_id": "498011", "reply_to_id": "497999" }, { "user_name": "Maniax", "text": "Getur prufað ef þú kemst inní bios á öðru korti að fikta í \"Pci lane speed\" Auto í Gen 1, Gen 2, Gen3, eða stilla á PCI Rom í legacy. hef séð 7970 og 7850 kort með sama vandamál", "date": "2013-03-02 00:33:00", "post_id": "498034", "reply_to_id": "498011" } ], "date": "2013-02-26 21:29:00" }
{"index.js":"function getIndexToIns(arr, num) {\n // Find my place in this sorted array.\n arr.push(num);\n arr = arr.sort(function arrSort(first, second) {\n return first - second;\n });\n return arr.indexOf(num);\n};\n\ngetIndexToIns([40, 60], 50);"}
{"poster":"TuNegrioPerron","date":"2019-02-18T04:43:58.816+0000","title":"Me gosthea sin motivo","subforum":"Comportamiento del jugador","up_votes":3,"down_votes":6,"body":"Me habla desde la selecci&oacute;n el y su premade diciendo que hago streamings y que me ven todos los d&iacute;as , yo no tengo ning&uacute;n canal ni uso de redes c&oacute;mo est&aacute;s , luego en el team enemigo me toco en contra de ellos , ellos mismos me dec&iacute;an que me estaban gostheando y me ve&iacute;an en mi blue cuando en verdad estaba en el , ?sera alg&uacute;n tipo de broma o en verdad me ver&aacute; a travez de la pantalla?","replies":[{"poster":"IIIIIIIIIIIIIIII","date":"2019-02-18T05:00:37.887+0000","up_votes":3,"down_votes":0,"body":"No puede ser que simplemente estaba wardeado por ellos tu blue? Podrias sacarte la duda bajando la replay","replies":[{"poster":"TuNegrioPerron","date":"2019-02-18T05:03:23.512+0000","up_votes":1,"down_votes":0,"body":"Lo tendré en cuenta ,quizás es así","replies":[]}]}]}
{"poster":"D357R0Y3R","date":"2018-12-15T21:09:33.486+0000","title":"Why are people no longer permabanning Zoe","subforum":"Gameplay","up_votes":13,"down_votes":15,"body":"https://i.gyazo.com/64052bb25fbdc5a20f628a503abaea40.png\r\n\r\nI thought that she was anti-fun at all cost and the boards would always permaban her even if she had 30% win rate\r\n\r\nthat&#039;s what people told me though","replies":[{"poster":"Eedat","date":"2018-12-15T21:13:11.183+0000","up_votes":48,"down_votes":0,"body":"Because they then released the Akali rework","replies":[{"poster":"Rexxiee","date":"2018-12-15T22:13:26.527+0000","up_votes":7,"down_votes":0,"body":"> [{quoted}](name=Eedat,realm=NA,application-id=3ErqAdtq,discussion-id=dbU1ExKu,comment-id=0000,timestamp=2018-12-15T21:13:11.183+0000)\n>\n> Because they then released the Akali rework\n\nAnd irelia, also pyke.","replies":[{"poster":"FancyKiwi","date":"2018-12-16T00:56:17.634+0000","up_votes":3,"down_votes":0,"body":"And Neeko","replies":[]}]},{"poster":"D357R0Y3R","date":"2018-12-15T21:23:43.778+0000","up_votes":7,"down_votes":3,"body":"I see I forgot that we only had 1 ban per game","replies":[]}]},{"poster":"AFilthyCaitMain","date":"2018-12-15T22:30:27.425+0000","up_votes":19,"down_votes":0,"body":"{{champion:84}} {{champion:39}} {{champion:236}} {{champion:518}} {{champion:555}} {{champion:7}} {{champion:266}} This is pretty much it","replies":[{"poster":"DarkTree1","date":"2018-12-15T22:40:01.400+0000","up_votes":9,"down_votes":1,"body":"> [{quoted}](name=AFilthyCaitMain,realm=NA,application-id=3ErqAdtq,discussion-id=dbU1ExKu,comment-id=0007,timestamp=2018-12-15T22:30:27.425+0000)\n>\n> {{champion:84}} {{champion:39}} {{champion:236}} {{champion:518}} {{champion:555}} {{champion:7}} {{champion:266}} This is pretty much it\n\n^ essentially. even if zoe's toxic asf to play against, it's not AS bad as this shit, you're just choosing the lesser evil","replies":[{"poster":"charge attack","date":"2018-12-16T00:37:36.077+0000","up_votes":6,"down_votes":0,"body":"No. It’s because people ban mostly on popularity of a champion (plus how good/frustrating they are). Banning Lucian will get you much more value than banning Zoe because it’s MUCH MUCH more likely that you face Lucian, even if you dislike Zoe more.\n\nHell, the champs I hate the most like Zilean I will never ban because I will never see them. Instead I will ban something like Yasuo just cause he’s frustrating AND popular.","replies":[]}]},{"poster":"Tomoe Gozen","date":"2018-12-16T00:46:57.795+0000","up_votes":4,"down_votes":2,"body":">{{champion:518}} \n\n\nOh my god, you are literally going to find anything to complain about...","replies":[{"poster":"H1de on blue","date":"2018-12-16T03:03:46.178+0000","up_votes":1,"down_votes":0,"body":"> [{quoted}](name=Tomoe Gozen,realm=EUNE,application-id=3ErqAdtq,discussion-id=dbU1ExKu,comment-id=00070002,timestamp=2018-12-16T00:46:57.795+0000)\n>\n> Oh my god, you idiots are literally going to find anything to complain about...\n\nShe doesn't have a 77% ban rate in KR master tier because she is \"unfun\"\n\nChamp broken.","replies":[]},{"poster":"AFilthyCaitMain","date":"2018-12-16T01:49:25.739+0000","up_votes":1,"down_votes":0,"body":"> [{quoted}](name=Tomoe Gozen,realm=EUNE,application-id=3ErqAdtq,discussion-id=dbU1ExKu,comment-id=00070002,timestamp=2018-12-16T00:46:57.795+0000)\n>\n> Oh my god, you idiots are literally going to find anything to complain about...\n\nIm not personally complaining. but she IS the most banned champion at this moment is what im stating. so those people arent banning zoe","replies":[]}]}]},{"poster":"Linna Excel","date":"2018-12-15T21:57:32.880+0000","up_votes":18,"down_votes":1,"body":"Yasuo still exists and irelia and akali got reworked.","replies":[]},{"poster":"H1de on blue","date":"2018-12-15T22:05:41.067+0000","up_votes":13,"down_votes":0,"body":"Because people don't pick her. Better to use your perma on Akali, Neeko or Irelia who will get picked if left open\n\nIf she hit 20% or so pick rate again that ban rate would quickly jump back up to 50%+","replies":[]},{"poster":"KFCeytron","date":"2018-12-15T21:47:18.954+0000","up_votes":9,"down_votes":0,"body":"I'd guess that the nerfs reduced her pick rate, so it's no longer as hazardous as it was to leave her open.","replies":[]},{"poster":"420 grams","date":"2018-12-15T21:43:00.670+0000","up_votes":8,"down_votes":0,"body":"They nerfed her a lot","replies":[]},{"poster":"saltran","date":"2018-12-15T21:14:37.111+0000","up_votes":5,"down_votes":1,"body":"49.1% winrate and 7.5% pickrate ? \n\nI thought she was way worse.","replies":[{"poster":"D357R0Y3R","date":"2018-12-15T21:23:20.715+0000","up_votes":1,"down_votes":0,"body":"win rate or ban rate wise?","replies":[{"poster":"saltran","date":"2018-12-15T21:29:05.009+0000","up_votes":1,"down_votes":0,"body":"Winrate.","replies":[{"poster":"PhantomSpirit101","date":"2018-12-15T21:54:45.358+0000","up_votes":5,"down_votes":0,"body":"She got buffed directly and indirectly with a Q + E buff and Dark Harvest so her win rate rose","replies":[]}]}]}]},{"poster":"Woodakoodashooda","date":"2018-12-15T22:54:06.849+0000","up_votes":4,"down_votes":0,"body":"https://i.ibb.co/qm073Qk/baneeko.png","replies":[]},{"poster":"BoilTheOil","date":"2018-12-16T00:20:45.638+0000","up_votes":1,"down_votes":5,"body":"Why do people ban yasuo hes fun to play against","replies":[{"poster":"saltran","date":"2018-12-16T00:28:17.460+0000","up_votes":5,"down_votes":0,"body":"No he's not","replies":[]}]},{"poster":"Baby Ghoul","date":"2018-12-16T01:43:11.215+0000","up_votes":3,"down_votes":0,"body":"Broken kits: {{champion:84}} {{champion:39}} {{champion:555}} \n\nMajor problems of 8.24: {{champion:236}} {{champion:69}} {{champion:24}} {{champion:63}} {{champion:238}} {{champion:266}} {{champion:7}} \n\nThen there's the OG champions nobody ever wants to play against: {{champion:157}} \n\nOntop of that {{champion:518}} just came out, and anytime a new champion releases they get banned.\n\nThere's just simply too much to ban right now, but of course, there's always that person that picks the none option.","replies":[]},{"poster":"Fear the Harvest","date":"2018-12-16T01:02:39.637+0000","up_votes":3,"down_votes":0,"body":"Pretty sure that if we actually had 10 bans available that'd be the case. Unfortunately we're currently stuck with 2 or sometimes even more people banning the same tumor every single match.","replies":[]},{"poster":"hhaavviikk","date":"2018-12-16T00:19:16.497+0000","up_votes":3,"down_votes":0,"body":"because I already gotta keep yasuo permbanned lest his windwall tilts me off the face of the fuckin earth","replies":[]},{"poster":"TheSymbolÔfPeace","date":"2018-12-15T23:18:06.130+0000","up_votes":3,"down_votes":0,"body":"You haven't been around here since then, have you {{champion:84}} {{champion:39}} {{champion:7}} {{champion:555}}","replies":[]},{"poster":"D4M2X0","date":"2018-12-15T23:05:27.023+0000","up_votes":3,"down_votes":0,"body":"cause she doesnt kill you in 3 seconds with 2 longswords (ban all the champs that abuse longswords)\n\nand because{{champion:157}} {{champion:84}} will forever be a wasted ban slot due to design.\n\nand then we'd ban{{champion:7}} ","replies":[{"poster":"Tomoe Gozen","date":"2018-12-16T00:50:45.029+0000","up_votes":2,"down_votes":0,"body":">{{champion:7}} \n\nGo AP Ezreal mid against her and shit on her time and time again. W into homing E + DH is the ultimate LeBlanc killer. How do people not know this?\n\nOh yea, because instead of FINDING COUNTERPLAY, they permaban and call it \"broken\". This is just beyond sad, that the community goes with the path of least resistance time and time again and pretend like they are perfectly skilled to take anyone down but not the \"BROKEN\" champs.","replies":[]}]},{"poster":"DamSonWhUFndThis","date":"2018-12-15T22:50:43.607+0000","up_votes":4,"down_votes":1,"body":"\nthere are stronger champs than zoe that are more worth banning {{champion:84}} {{champion:39}} {{champion:157}} {{champion:238}} {{champion:202}} {{champion:236}} {{champion:518}} {{champion:145}}","replies":[{"poster":"Tomoe Gozen","date":"2018-12-16T00:56:56.534+0000","up_votes":2,"down_votes":1,"body":"And then Zoe fucks you up, you come back here to complain how Riot didn't behead her because you couldn't find a way to deal with her in one of your games... That's how it usually works.\n\nBecause people would like to deal damage to others but not RECEIVE DAMAGE in return. And anything that even has a remote chance of seriously harming them or outright killing them in a perfectly executed combo is deemed \"broken\" and \"unfun\" to play against. And yet, if the kit doesn't have damage built in, they refuse to play it and call it \"weak\".\n\nThe community might want to evaluate their own choices on that matter because what they want is actually contradictory in nature.","replies":[]}]},{"poster":"BlackEyesBlue","date":"2018-12-15T21:37:34.681+0000","up_votes":9,"down_votes":6,"body":"Mostly because a large chunk of the \"DELETE ZOE!!!\" crowd stopped crying there's no way to play against her and, well, learned to play against her. \n\nCombined with some reasonable nerfs. Also Akali and Neeko now exist.","replies":[{"poster":"MankeyMadness","date":"2018-12-15T22:52:35.012+0000","up_votes":1,"down_votes":0,"body":"This.\nAlso after Zoe got destroyed by nerfs, and conqueror came out, my permanent shifted to Jax. \nI dont know why he has lower than 54% banrate. \nHe's everything wrong with Yasuo but way harder to shut down and can dash over walls or even into his own minions.","replies":[{"poster":"3TWarrior","date":"2018-12-16T02:43:06.591+0000","up_votes":1,"down_votes":0,"body":"not hyper mobile, not incredibly defensive even though he can buff his defenses, his E only protects against auto attacks and their effects instead of greater than half of all ranged things in the game, he is able to be kited, he is a lot more item reliant than yasuo, his kit does not automatically protect him just by existing\n\nI think i'm leaving out a few things, but Riot has gone overboard with what is \"acceptable\" now and just seems to say, \"fight toxic with toxic\" as he was a perfectly healthy champion, then suddenly runes came around and he's top tier? makes no sense","replies":[]}]},{"poster":"3TWarrior","date":"2018-12-16T02:39:15.122+0000","up_votes":1,"down_votes":0,"body":"or riot decided, \"let's counter toxic with toxic\" and started making everything unhealthy. Look at the vayne buffs...she'll literally become an unkillable assassin that can murder your entire team if you're not under a tower...","replies":[]}]},{"poster":"Śhunpo","date":"2018-12-16T01:57:34.801+0000","up_votes":2,"down_votes":0,"body":"{{champion:84}} {{champion:266}} {{champion:555}} {{champion:104}} {{champion:518}} {{champion:157}} {{champion:39}} {{champion:238}} {{champion:236}} {{champion:164}} {{champion:122}} {{champion:112}} {{champion:6}} {{champion:8}} {{champion:7}} {{champion:145}} {{champion:497}} \n\nwHy nO zOE bAn????? This would be why, there are far too many other champs you don't want to let through either because they're broken, unfun to play against in general, they dumpster matchups to the point where it's nye-unwinnable (e.g. Darius vs most melee tanks) or they are just irritating or all the above. Or in the case of Neeko you don't want a teammate to go 0/20 because they're first timing and claim that they're a \"Neeko prodigy\", standard practice of banning new champs so that your teammates can't hard feed on them and actually have to take the time to learn them if they want to play them.\n\nZoe is the least of our worries when we have a 53% win rate Lucian allowed through pick/ban phase running around 2-3 hitting kids while perma-kiting and being semi-tanky due to Black Cleaver, or Akali who just invalidates any means of interactivity in lane or Pyke who just wins the moment he gets ahead due to his general slipperiness and above average damage and consistency.","replies":[{"poster":"ChuShoe","date":"2018-12-16T03:09:40.809+0000","up_votes":1,"down_votes":0,"body":"> [{quoted}](name=ShunposCastTime,realm=OCE,application-id=3ErqAdtq,discussion-id=dbU1ExKu,comment-id=001e,timestamp=2018-12-16T01:57:34.801+0000)\n>\n> {{champion:84}} {{champion:266}} {{champion:555}} {{champion:104}} {{champion:518}} {{champion:157}} {{champion:39}} {{champion:238}} {{champion:236}} {{champion:164}} {{champion:122}} {{champion:112}} {{champion:6}} {{champion:8}} {{champion:7}} {{champion:145}} {{champion:497}} \n> \n> wHy nO zOE bAn????? This would be why, there are far too many other champs you don&#x27;t want to let through either because they&#x27;re broken, unfun to play against in general, they dumpster matchups to the point where it&#x27;s nye-unwinnable (e.g. Darius vs most melee tanks) or they are just irritating or all the above. Or in the case of Neeko you don&#x27;t want a teammate to go 0/20 because they&#x27;re first timing and claim that they&#x27;re a &quot;Neeko prodigy&quot;, standard practice of banning new champs so that your teammates can&#x27;t hard feed on them and actually have to take the time to learn them if they want to play them.\n> \n> Zoe is the least of our worries when we have a 53% win rate Lucian allowed through pick/ban phase running around 2-3 hitting kids while perma-kiting and being semi-tanky due to Black Cleaver, or Akali who just invalidates any means of interactivity in lane or Pyke who just wins the moment he gets ahead due to his general slipperiness and above average damage and consistency.\n\nIsn't it strange how 9 out of the 17 champs posted here are relatively new?","replies":[{"poster":"Śhunpo","date":"2018-12-16T03:55:52.495+0000","up_votes":2,"down_votes":0,"body":"Nah that's just the Riot special.","replies":[{"poster":"ChuShoe","date":"2018-12-16T06:02:10.050+0000","up_votes":1,"down_votes":0,"body":"> [{quoted}](name=ShunposCastTime,realm=OCE,application-id=3ErqAdtq,discussion-id=dbU1ExKu,comment-id=001e00000000,timestamp=2018-12-16T03:55:52.495+0000)\n>\n> Nah that&#x27;s just the Riot special.\n\nI'm just saying, maybe in an attempt to keep new champions unique, they remove the idea that the champions kit needs to be fun, or fair.","replies":[{"poster":"Śhunpo","date":"2018-12-16T06:42:05.654+0000","up_votes":2,"down_votes":0,"body":"Most definitely. They try to make these newer champs/reworks unique in an attempt to make it seem like they care about them, and about the community as a whole. But in the case of reworks this has more than divided each champ's mains significantly, especially with the Aatrox rework.\n\nI agree though, fun and fairness aren't the first thing on their minds.....unless we're talking about the assassin update, which is a story for another day.","replies":[]}]}]}]}]},{"poster":"FemalesAreLesser","date":"2018-12-16T01:03:58.010+0000","up_votes":2,"down_votes":0,"body":"{{champion:164}}","replies":[]},{"poster":"Infernape","date":"2018-12-16T00:49:00.747+0000","up_votes":2,"down_votes":0,"body":"I personally think people aren't banning her because shit like Akali is still going around","replies":[]},{"poster":"Netorare","date":"2018-12-15T23:11:22.328+0000","up_votes":2,"down_votes":0,"body":"She is really easy to deal with if they are not trolling...\nBut yea some people dont want to dodge linear skill shots for some reason and they forget that her Q scales with distance...","replies":[]},{"poster":"DuskDaUmbreon","date":"2018-12-15T23:13:45.900+0000","up_votes":3,"down_votes":2,"body":"Because the boards found some new \"OH EM GEEE OPIEEEE!!!!!!11\" thing to scream and whine about.","replies":[{"poster":"3TWarrior","date":"2018-12-16T02:45:18.304+0000","up_votes":1,"down_votes":0,"body":"or riot made such? they seem to be going for \"fight toxic with toxic\" now instead of even thinking about counterplay\n\nthere are already montages of vayne going ham and killing entire teams on the PBE and their reason that it's okay is \"no one will not build her critical\" wait, that's not even their word on it because they won't post on the forums so the moderators have made their best attempt...","replies":[]}]},{"poster":"Hügö","date":"2018-12-16T10:01:17.291+0000","up_votes":2,"down_votes":1,"body":"Because there are only 10 bans available?","replies":[]},{"poster":"hoganftw","date":"2018-12-16T19:27:54.625+0000","up_votes":1,"down_votes":0,"body":"Irelia still exists","replies":[]},{"poster":"sit kid","date":"2018-12-16T19:27:09.188+0000","up_votes":1,"down_votes":0,"body":"Shes still my permaban if im last pick","replies":[]},{"poster":"Packun Flower","date":"2018-12-15T23:24:47.492+0000","up_votes":4,"down_votes":4,"body":"Because I'm cute and people want me around. ❤","replies":[{"poster":"Śhunpo","date":"2018-12-16T06:42:54.642+0000","up_votes":1,"down_votes":0,"body":"I'll sell you to Satan for 5c.","replies":[]},{"poster":"Rathar Dashing","date":"2018-12-16T06:26:08.750+0000","up_votes":1,"down_votes":0,"body":"I like taking a nap every now and then on the rift. ❤","replies":[]}]},{"poster":"Ozzie Storm","date":"2018-12-16T03:25:42.221+0000","up_votes":1,"down_votes":0,"body":"because everyone 1shots these days, it's no longer a zoe only issue.\nWhat is deserving of a ban is no longer \"the one who 1 shots\" but \"the one out of many that one shots with the most obnoxious kit\".","replies":[]}]}
{"token":"NDk4NTI3ODI5OTk1MDI4NTAw.DpvEFQ.Sn3HegdTjPoWvM2G63Fg1S-97WQ","client":"498527829995028500","tag":"luki!","case":"true","separator":"\\s+","ownerId":"5143"}
{ "es2015": "dist/btn/fesm2015/bit-austinhenderson19.mobile-components.btn.js", "esm5": "dist/btn/esm5/bit-austinhenderson19.mobile-components.btn.js", "esm2015": "dist/btn/esm2015/bit-austinhenderson19.mobile-components.btn.js", "fesm5": "dist/btn/fesm5/bit-austinhenderson19.mobile-components.btn.js", "fesm2015": "dist/btn/fesm2015/bit-austinhenderson19.mobile-components.btn.js", "module": "dist/btn/fesm5/bit-austinhenderson19.mobile-components.btn.js", "typings": "dist/btn/bit-austinhenderson19.mobile-components.btn.d.ts", "metadata": "dist/bit-austinhenderson19.mobile-components.btn.metadata.json" }
{"itemid": "001-100433", "applicability": "", "application": "MS WORD", "appno": "412/03;35677/04", "article": "41;46;46-2", "conclusion": "Pecuniary damage - claim dismissed;Non-pecuniary damage - award;Respondent State to take measures of a general character", "decisiondate": "", "docname": "CASE OF HOLY SYNOD OF THE BULGARIAN ORTHODOX CHURCH (METROPOLITAN INOKENTIY) AND OTHERS v. BULGARIA", "doctype": "HEJUD", "doctypebranch": "CHAMBER", "documentcollectionid": "CASELAW;JUDGMENTS;CHAMBER;ENG", "documentcollectionid2": "CASELAW;JUDGMENTS;CHAMBER;ENG", "ecli": "ECLI:CE:ECHR:2010:0916JUD000041203", "externalsources": "", "extractedappno": "412/03;35677/04;40047/04;25729/09;35382/97;39023/97;45701/99;952/03;27417/95;798/05;30985/96;38178/97;39748/98;75951/01", "importance": "3", "introductiondate": "", "isplaceholder": "False", "issue": "Labour Code ; Religious Denominations Act 2002", "judges": "Karel Jungwiert;Mark Villiger;Mirjana Lazarova Trajkovska;Peer Lorenzen;Rait Maruste;Renate Jaeger;Zdravka Kalaydjieva", "judgementdate": "16/09/2010 00:00:00", "kpdate": "9/16/2010 12:00:00 AM", "kpdateAsText": "16/09/2010 00:00:00", "kpthesaurus": "216;577;283;305;26;126;243", "languageisocode": "ENG", "meetingnumber": "", "nonviolation": "", "originatingbody": "23", "publishedby": "", "Rank": "0", "referencedate": "", "reportdate": "", "representedby": "POPOV L.", "resolutiondate": "", "resolutionnumber": "", "respondent": "BGR", "respondentOrderEng": "8", "rulesofcourt": "", "scl": "Biserica Adevarat Ortodoxa din Moldova and Others v. Moldova, no. 952/03, 27 February 2007;Cha\u2019are Shalom Ve Tsedek v. France [GC], no. 27417/95, ECHR 2000-VII;Comingersoll S.A. v. Portugal [GC], no. 35382/97, ECHR 2000-IV;Hasan and Chaush v. Bulgaria [GC], no. 30985/96, ECHR 2000-XI;Maestri v. Italy [GC], no. 39748/98, ECHR 2004-I;Metropolitan Church of Bessarabia and Others v. Moldova, no. 45701/99, ECHR 2001-XII;Mirolubovs and Others v. Latvia, no. 798/05, 15 September 2009;Serif v. Greece, no. 38178/97, ECHR 1999-IX;Supreme Holy Council of the Muslim Community v. Bulgaria, no. 39023/97, 16 December 2004;Viasu v. Romania, no. 75951/01, 9 December 2008", "separateopinion": "TRUE", "sharepointid": "420348", "typedescription": "12", "violation": ""}
{ "forum_title": "Vara og aukahlutir", "id": "17708", "title": "Fini Loftpressa\"SELD\"", "url": "http://www.jeppaspjall.is/viewtopic.php?f=31&t=17708", "posts": [ { "user_name": "tampon", "text": "Er með góða finiloftpressu til sölu. hentar vel í bílskúrinn\nFræðilegt / flæði (lt / mín): 185\nÁrangursrík getu (lt / mín): 115\nTankur (LT): 50\nÞrýstingur max. (Bar): 8\n(KW / hö): 1.5 / 2\nSupply (Volt / Ph): 230/1\nPump Gerð: SF 2500\nFjöldi strokka / gráðum: 1/1\nDæla hraði (r.p.m.): 2850\nMál (cm): 89x36x74\nÞyngd (kg): 35\nverð 25þúsund\ns.8436606", "date": "2013-04-24 20:11:00", "post_id": "98457", "reply_to_id": false }, { "user_name": "thorjon", "text": "hvað er pressan gömul ? áttu einhverjar myndir af dýrinu ?? :) ef svo er gætirðu sent á \nthorjon@gmail.com", "date": "2013-05-09 20:58:00", "post_id": "100180", "reply_to_id": "98457" } ], "date": "2013-04-24 20:11:00" }
{"pmid":32491919,"title":"Prevalence of Asymptomatic SARS-CoV-2 Infection: A Narrative Review.","text":["Prevalence of Asymptomatic SARS-CoV-2 Infection: A Narrative Review.","Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) has spread rapidly throughout the world since the first cases of coronavirus disease 2019 (COVID-19) were observed in December 2019 in Wuhan, China. It has been suspected that infected persons who remain asymptomatic play a significant role in the ongoing pandemic, but their relative number and effect have been uncertain. The authors sought to review and synthesize the available evidence on asymptomatic SARS-CoV-2 infection. Asymptomatic persons seem to account for approximately 40% to 45% of SARS-CoV-2 infections, and they can transmit the virus to others for an extended period, perhaps longer than 14 days. Asymptomatic infection may be associated with subclinical lung abnormalities, as detected by computed tomography. Because of the high risk for silent spread by asymptomatic persons, it is imperative that testing programs include those without symptoms. To supplement conventional diagnostic testing, which is constrained by capacity, cost, and its one-off nature, innovative tactics for public health surveillance, such as crowdsourcing digital wearable data and monitoring sewage sludge, might be helpful.","Ann Intern Med","Oran, Daniel P","Topol, Eric J","32491919"],"abstract":["Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) has spread rapidly throughout the world since the first cases of coronavirus disease 2019 (COVID-19) were observed in December 2019 in Wuhan, China. It has been suspected that infected persons who remain asymptomatic play a significant role in the ongoing pandemic, but their relative number and effect have been uncertain. The authors sought to review and synthesize the available evidence on asymptomatic SARS-CoV-2 infection. Asymptomatic persons seem to account for approximately 40% to 45% of SARS-CoV-2 infections, and they can transmit the virus to others for an extended period, perhaps longer than 14 days. Asymptomatic infection may be associated with subclinical lung abnormalities, as detected by computed tomography. Because of the high risk for silent spread by asymptomatic persons, it is imperative that testing programs include those without symptoms. To supplement conventional diagnostic testing, which is constrained by capacity, cost, and its one-off nature, innovative tactics for public health surveillance, such as crowdsourcing digital wearable data and monitoring sewage sludge, might be helpful."],"journal":"Ann Intern Med","authors":["Oran, Daniel P","Topol, Eric J"],"date":"2020-06-04T11:00:00Z","year":2020,"_id":"32491919","source":"PubMed","week":"202023|Jun 01 - Jun 07","doi":"10.7326/M20-3012","locations":["Wuhan","China"],"countries":["China"],"countries_codes":["CHN|China"],"topics":["Diagnosis"],"weight":1,"_version_":1668892169442689024,"score":9.490897,"similar":[{"pmid":32146694,"pmcid":"PMC7088568","title":"Clinical characteristics of 24 asymptomatic infections with COVID-19 screened among close contacts in Nanjing, China.","text":["Clinical characteristics of 24 asymptomatic infections with COVID-19 screened among close contacts in Nanjing, China.","Previous studies have showed clinical characteristics of patients with the 2019 novel coronavirus disease (COVID-19) and the evidence of person-to-person transmission. Limited data are available for asymptomatic infections. This study aims to present the clinical characteristics of 24 cases with asymptomatic infection screened from close contacts and to show the transmission potential of asymptomatic COVID-19 virus carriers. Epidemiological investigations were conducted among all close contacts of COVID-19 patients (or suspected patients) in Nanjing, Jiangsu Province, China, from Jan 28 to Feb 9, 2020, both in clinic and in community. Asymptomatic carriers were laboratory-confirmed positive for the COVID-19 virus by testing the nucleic acid of the pharyngeal swab samples. Their clinical records, laboratory assessments, and chest CT scans were reviewed. As a result, none of the 24 asymptomatic cases presented any obvious symptoms while nucleic acid screening. Five cases (20.8%) developed symptoms (fever, cough, fatigue, etc.) during hospitalization. Twelve (50.0%) cases showed typical CT images of ground-glass chest and 5 (20.8%) presented stripe shadowing in the lungs. The remaining 7 (29.2%) cases showed normal CT image and had no symptoms during hospitalization. These 7 cases were younger (median age: 14.0 years; P=0.012) than the rest. None of the 24 cases developed severe COVID-19 pneumonia or died. The median communicable period, defined as the interval from the first day of positive nucleic acid tests to the first day of continuous negative tests, was 9.5 days (up to 21 days among the 24 asymptomatic cases). Through epidemiological investigation, we observed a typical asymptomatic transmission to the cohabiting family members, which even caused severe COVID-19 pneumonia. Overall, the asymptomatic carriers identified from close contacts were prone to be mildly ill during hospitalization. However, the communicable period could be up to three weeks and the communicated patients could develop severe illness. These results highlighted the importance of close contact tracing and longitudinally surveillance via virus nucleic acid tests. Further isolation recommendation and continuous nucleic acid tests may also be recommended to the patients discharged.","Sci China Life Sci","Hu, Zhiliang","Song, Ci","Xu, Chuanjun","Jin, Guangfu","Chen, Yaling","Xu, Xin","Ma, Hongxia","Chen, Wei","Lin, Yuan","Zheng, Yishan","Wang, Jianming","Hu, Zhibin","Yi, Yongxiang","Shen, Hongbing","32146694"],"abstract":["Previous studies have showed clinical characteristics of patients with the 2019 novel coronavirus disease (COVID-19) and the evidence of person-to-person transmission. Limited data are available for asymptomatic infections. This study aims to present the clinical characteristics of 24 cases with asymptomatic infection screened from close contacts and to show the transmission potential of asymptomatic COVID-19 virus carriers. Epidemiological investigations were conducted among all close contacts of COVID-19 patients (or suspected patients) in Nanjing, Jiangsu Province, China, from Jan 28 to Feb 9, 2020, both in clinic and in community. Asymptomatic carriers were laboratory-confirmed positive for the COVID-19 virus by testing the nucleic acid of the pharyngeal swab samples. Their clinical records, laboratory assessments, and chest CT scans were reviewed. As a result, none of the 24 asymptomatic cases presented any obvious symptoms while nucleic acid screening. Five cases (20.8%) developed symptoms (fever, cough, fatigue, etc.) during hospitalization. Twelve (50.0%) cases showed typical CT images of ground-glass chest and 5 (20.8%) presented stripe shadowing in the lungs. The remaining 7 (29.2%) cases showed normal CT image and had no symptoms during hospitalization. These 7 cases were younger (median age: 14.0 years; P=0.012) than the rest. None of the 24 cases developed severe COVID-19 pneumonia or died. The median communicable period, defined as the interval from the first day of positive nucleic acid tests to the first day of continuous negative tests, was 9.5 days (up to 21 days among the 24 asymptomatic cases). Through epidemiological investigation, we observed a typical asymptomatic transmission to the cohabiting family members, which even caused severe COVID-19 pneumonia. Overall, the asymptomatic carriers identified from close contacts were prone to be mildly ill during hospitalization. However, the communicable period could be up to three weeks and the communicated patients could develop severe illness. These results highlighted the importance of close contact tracing and longitudinally surveillance via virus nucleic acid tests. Further isolation recommendation and continuous nucleic acid tests may also be recommended to the patients discharged."],"journal":"Sci China Life Sci","authors":["Hu, Zhiliang","Song, Ci","Xu, Chuanjun","Jin, Guangfu","Chen, Yaling","Xu, Xin","Ma, Hongxia","Chen, Wei","Lin, Yuan","Zheng, Yishan","Wang, Jianming","Hu, Zhibin","Yi, Yongxiang","Shen, Hongbing"],"date":"2020-03-09T11:00:00Z","year":2020,"_id":"32146694","source":"PubMed","week":"202011|Mar 09 - Mar 15","doi":"10.1007/s11427-020-1661-4","keywords":["covid-19","china","asymptomatic infections","close contact"],"locations":["Nanjing","Jiangsu","China","Nanjing","China"],"countries":["China"],"countries_codes":["CHN|China"],"topics":["Mechanism","Diagnosis","Transmission"],"weight":1,"_version_":1666138490677493762,"score":204.62022},{"pmid":32321904,"title":"Asymptomatic carriers of COVID-19 as a concern for disease prevention and control: more testing, more follow-up.","text":["Asymptomatic carriers of COVID-19 as a concern for disease prevention and control: more testing, more follow-up.","Following a containment phase of two months, China has transitioned to the mitigation phase. However, China still faces the risk of COVID-19 spreading due to not only to sporadic new cases and imported cases but also asymptomatic carriers. According to daily reports from the National Health Commission of the People's Republic of China from March 31, 2020 to April 7, 2020, the number of new asymptomatic cases reported daily greatly exceeded that of new imported cases. As of 24:00 on April 7, there were a total of 1,095 asymptomatic cases with COVID-19 under medical observation on the Chinese mainland, including 358 imported cases. A growing number of studies have indicated that asymptomatic carriers are infectious to an extent and can potentially transmit COVID-19. At present, China's measures for managing asymptomatic carriers are 14 days of centralized quarantine and observation; in principle, people with two consecutive negative nucleic acid tests (at an interval of at least 24 hours) can be released from quarantine. However, asymptomatic carriers will not be included in confirmed cases unless they develop clinical manifestations while in quarantine. As \"silent spreaders\", asymptomatic carriers warrant attention as part of disease prevention and control. The testing and follow-up of asymptomatic carriers should be expanded to include people in close contact with patients with confirmed COVID-19 and asymptomatic cases, clusters of outbreaks, and key areas and populations with a high risk of infection.","Biosci Trends","Zhang, Jiao","Wu, Shoucai","Xu, Lingzhong","32321904"],"abstract":["Following a containment phase of two months, China has transitioned to the mitigation phase. However, China still faces the risk of COVID-19 spreading due to not only to sporadic new cases and imported cases but also asymptomatic carriers. According to daily reports from the National Health Commission of the People's Republic of China from March 31, 2020 to April 7, 2020, the number of new asymptomatic cases reported daily greatly exceeded that of new imported cases. As of 24:00 on April 7, there were a total of 1,095 asymptomatic cases with COVID-19 under medical observation on the Chinese mainland, including 358 imported cases. A growing number of studies have indicated that asymptomatic carriers are infectious to an extent and can potentially transmit COVID-19. At present, China's measures for managing asymptomatic carriers are 14 days of centralized quarantine and observation; in principle, people with two consecutive negative nucleic acid tests (at an interval of at least 24 hours) can be released from quarantine. However, asymptomatic carriers will not be included in confirmed cases unless they develop clinical manifestations while in quarantine. As \"silent spreaders\", asymptomatic carriers warrant attention as part of disease prevention and control. The testing and follow-up of asymptomatic carriers should be expanded to include people in close contact with patients with confirmed COVID-19 and asymptomatic cases, clusters of outbreaks, and key areas and populations with a high risk of infection."],"journal":"Biosci Trends","authors":["Zhang, Jiao","Wu, Shoucai","Xu, Lingzhong"],"date":"2020-04-24T11:00:00Z","year":2020,"_id":"32321904","source":"PubMed","week":"202017|Apr 20 - Apr 26","doi":"10.5582/bst.2020.03069","keywords":["china","asymptomatic infections","coronavirus disease 2019 (covid-19)"],"locations":["China","China","Chinese","China"],"countries":["China"],"countries_codes":["CHN|China"],"topics":["Diagnosis","Prevention","Transmission"],"weight":1,"_version_":1666138493838950400,"score":202.08961},{"pmid":32387682,"title":"Characteristics of asymptomatic patients with SARS-CoV-2 infection in Jinan, China.","text":["Characteristics of asymptomatic patients with SARS-CoV-2 infection in Jinan, China.","Coronavirus Disease 2019 (COVID-19) caused by severe acute respiratory syndrome coronavirus 2(SARS-CoV-2) is continuously and rapidly circulating at present. Asymptomatic patients have been proven to be contagious and thus pose a significant infection control challenge. Here we describe the characteristics of asymptomatic patients with SARS-CoV-2 infection in Jinan, Shandong province, China. A total of 47 patients with confirmed COVID-19 were recruited. Among them, 11 patients were categorized as asymptomatic cases. We found that the asymptomatic patients in Jinan were relatively young and were mainly clustered cases. The laboratory indicators and lung lesion on chest CT were mild. No special factors were found accounting for the presence or absence of symptoms. The presence of asymptomatic patients increased the difficulty of screening. It is necessary to strengthen the identification of such patients in the future.","Microbes Infect","Ma, Yan","Xu, Qing-Nan","Wang, Feng-Li","Ma, Xiao-Man","Wang, Xiao-Yan","Zhang, Xiao-Guo","Zhang, Zhong-Fa","32387682"],"abstract":["Coronavirus Disease 2019 (COVID-19) caused by severe acute respiratory syndrome coronavirus 2(SARS-CoV-2) is continuously and rapidly circulating at present. Asymptomatic patients have been proven to be contagious and thus pose a significant infection control challenge. Here we describe the characteristics of asymptomatic patients with SARS-CoV-2 infection in Jinan, Shandong province, China. A total of 47 patients with confirmed COVID-19 were recruited. Among them, 11 patients were categorized as asymptomatic cases. We found that the asymptomatic patients in Jinan were relatively young and were mainly clustered cases. The laboratory indicators and lung lesion on chest CT were mild. No special factors were found accounting for the presence or absence of symptoms. The presence of asymptomatic patients increased the difficulty of screening. It is necessary to strengthen the identification of such patients in the future."],"journal":"Microbes Infect","authors":["Ma, Yan","Xu, Qing-Nan","Wang, Feng-Li","Ma, Xiao-Man","Wang, Xiao-Yan","Zhang, Xiao-Guo","Zhang, Zhong-Fa"],"date":"2020-05-11T11:00:00Z","year":2020,"_id":"32387682","source":"PubMed","week":"202020|May 11 - May 17","doi":"10.1016/j.micinf.2020.04.011","keywords":["covid-19","sars-cov-2","asymptomatic","characteristics"],"locations":["Jinan","Shandong","China","Jinan","Jinan","China"],"countries":["China"],"countries_codes":["CHN|China"],"topics":["Diagnosis"],"weight":1,"_version_":1666428892252995584,"score":200.20644},{"pmid":32282894,"pmcid":"PMC7170415","title":"Diagnostic Testing for Severe Acute Respiratory Syndrome-Related Coronavirus-2: A Narrative Review.","text":["Diagnostic Testing for Severe Acute Respiratory Syndrome-Related Coronavirus-2: A Narrative Review.","Diagnostic testing to identify persons infected with severe acute respiratory syndrome-related coronavirus-2 (SARS-CoV-2) infection is central to control the global pandemic of COVID-19 that began in late 2019. In a few countries, the use of diagnostic testing on a massive scale has been a cornerstone of successful containment strategies. In contrast, the United States, hampered by limited testing capacity, has prioritized testing for specific groups of persons. Real-time reverse transcriptase polymerase chain reaction-based assays performed in a laboratory on respiratory specimens are the reference standard for COVID-19 diagnostics. However, point-of-care technologies and serologic immunoassays are rapidly emerging. Although excellent tools exist for the diagnosis of symptomatic patients in well-equipped laboratories, important gaps remain in screening asymptomatic persons in the incubation phase, as well as in the accurate determination of live viral shedding during convalescence to inform decisions to end isolation. Many affluent countries have encountered challenges in test delivery and specimen collection that have inhibited rapid increases in testing capacity. These challenges may be even greater in low-resource settings. Urgent clinical and public health needs currently drive an unprecedented global effort to increase testing capacity for SARS-CoV-2 infection. Here, the authors review the current array of tests for SARS-CoV-2, highlight gaps in current diagnostic capacity, and propose potential solutions.","Ann Intern Med","Cheng, Matthew P","Papenburg, Jesse","Desjardins, Michael","Kanjilal, Sanjat","Quach, Caroline","Libman, Michael","Dittrich, Sabine","Yansouni, Cedric P","32282894"],"abstract":["Diagnostic testing to identify persons infected with severe acute respiratory syndrome-related coronavirus-2 (SARS-CoV-2) infection is central to control the global pandemic of COVID-19 that began in late 2019. In a few countries, the use of diagnostic testing on a massive scale has been a cornerstone of successful containment strategies. In contrast, the United States, hampered by limited testing capacity, has prioritized testing for specific groups of persons. Real-time reverse transcriptase polymerase chain reaction-based assays performed in a laboratory on respiratory specimens are the reference standard for COVID-19 diagnostics. However, point-of-care technologies and serologic immunoassays are rapidly emerging. Although excellent tools exist for the diagnosis of symptomatic patients in well-equipped laboratories, important gaps remain in screening asymptomatic persons in the incubation phase, as well as in the accurate determination of live viral shedding during convalescence to inform decisions to end isolation. Many affluent countries have encountered challenges in test delivery and specimen collection that have inhibited rapid increases in testing capacity. These challenges may be even greater in low-resource settings. Urgent clinical and public health needs currently drive an unprecedented global effort to increase testing capacity for SARS-CoV-2 infection. Here, the authors review the current array of tests for SARS-CoV-2, highlight gaps in current diagnostic capacity, and propose potential solutions."],"journal":"Ann Intern Med","authors":["Cheng, Matthew P","Papenburg, Jesse","Desjardins, Michael","Kanjilal, Sanjat","Quach, Caroline","Libman, Michael","Dittrich, Sabine","Yansouni, Cedric P"],"date":"2020-04-14T11:00:00Z","year":2020,"_id":"32282894","source":"PubMed","week":"202016|Apr 13 - Apr 19","doi":"10.7326/M20-1301","locations":["United States"],"countries":["United States"],"countries_codes":["USA|United States"],"topics":["Diagnosis"],"weight":1,"_version_":1666138491459731457,"score":193.68279},{"pmid":32383171,"title":"Asymptomatic Cases with SARS-CoV-2 Infection.","text":["Asymptomatic Cases with SARS-CoV-2 Infection.","On March 31, 2020, Chinese Health Authorization announced that numbers of asymptomatic cases with SARS-CoV-2 infection will be made to public daily. This was a very important step since different counties have different capacity for detection of SARS-CoV-2 infection and control strategy for COVID-19 outbreak. We summarized the characteristics of asymptomatic SARS-CoV-2 infections and the transmission potential of asymptomatic cases. Then we provided guidelines fo_r the management of asymptomatic cases through quarantine and nucleic acid/serology tests. This article is protected by copyright. All rights reserved.","J Med Virol","Wang, Yishan","Kang, Hanyujie","Liu, Xuefeng","Tong, Zhaohui","32383171"],"abstract":["On March 31, 2020, Chinese Health Authorization announced that numbers of asymptomatic cases with SARS-CoV-2 infection will be made to public daily. This was a very important step since different counties have different capacity for detection of SARS-CoV-2 infection and control strategy for COVID-19 outbreak. We summarized the characteristics of asymptomatic SARS-CoV-2 infections and the transmission potential of asymptomatic cases. Then we provided guidelines fo_r the management of asymptomatic cases through quarantine and nucleic acid/serology tests. This article is protected by copyright. All rights reserved."],"journal":"J Med Virol","authors":["Wang, Yishan","Kang, Hanyujie","Liu, Xuefeng","Tong, Zhaohui"],"date":"2020-05-09T11:00:00Z","year":2020,"_id":"32383171","source":"PubMed","week":"202019|May 04 - May 10","doi":"10.1002/jmv.25990","keywords":["coronavirus < virus classification","horizontal transmission < epidemiology","respiratory tract < pathogenesis","sars coronavirus < virus classification"],"topics":["Transmission","Diagnosis","Treatment","Prevention"],"weight":1,"_version_":1666267276738822144,"score":192.75978}]}
{ "server": "ia800709.us.archive.org", "dir": "/32/items/LeisureSuitLarry5PassionatePattiDoesALittleUndercoverWorkDemo", "metadata": { "mediatype": [ "software" ], "collection": [ "classicpcgames" ], "title": [ "Leisure Suit Larry 5: Passionate Patti Does a Little Undercover Work! Demo" ], "description": [ "\"SEX, THUGS AND ROCK 'N ROLL. They're back in their silliest, sexiest adventure ever. Larry teams up with Passionate Patti for a rollicking gender-bending romp through the sleazy underside of the underworld.\n\nSWITCH SEXES ON THE FLY. Yes, every time you take a plane ride, you'll switch back and forth between Larry and Patti. Double the trouble, double the fun!\n\nIT'S LARRY & PATTI vs. A GALLERY OF GOONS. Passionate Patti is a fledgling spy for the FBI, sent o ferret out corruption in the music industry. Larry, cult-hero of the computer age and certified fashion disaster, is auditioning hostesses for the TV's syndicated steam-fest, America's Sexiest Home Videos. But watch out! The Mob wants to get pornography off the air and back into their balance sheet. Help Larry and Patti take on organized crime, the FBI, and the Citizens Against Nearly Everything in their spiciest computer caper yet. \"" ], "subject": [ "DOS games; Vintage computer games; Adventure games" ], "creator": [ "Sierra On-Line" ], "identifier": [ "LeisureSuitLarry5PassionatePattiDoesALittleUndercoverWorkDemo" ], "addeddate": [ "2012-07-05 09:40:18" ], "date": [ "1991" ], "year": [ "1991" ], "publisher": [ "Sierra On-Line" ], "publicdate": [ "2012-07-05 09:40:46" ], "curation": [ "[curator]jscott@archive.org[\/curator][date]20140308004704[\/date][state]un-dark[\/state][comment]Darked by Mistake[\/comment]" ], "notes": [ "1\/10\/16 - Tested online play. Does not load program" ], "backup_location": [ "ia903806_12" ], "emulator_start": [ "SIERRA.EXE" ], "emulator_ext": [ "zip" ], "emulator": [ "dosbox" ] }, "files": { "\/LeisureSuitLarry5PassionatePattiDoesALittleUndercoverWorkDemo_archive.torrent": { "source": "original", "btih": "5005748ec644548017e6ca6e7bcfe09ab6845a66", "mtime": "1476677396", "size": "2236", "md5": "19b38586f85388d62c113fbc48960ca0", "crc32": "b11bd97d", "sha1": "56e230e30582ab344579894a64c7eb74c77f52df", "format": "Archive BitTorrent" }, "\/LeisureSuitLarry5PassionatePattiDoesALittleUndercoverWorkDemo_files.xml": { "source": "original", "format": "Metadata", "md5": "02b698cb54c62ad4fbcc02884c204fc6" }, "\/LeisureSuitLarry5PassionatePattiDoesALittleUndercoverWorkDemo_meta.xml": { "source": "original", "format": "Metadata", "mtime": "1476677396", "size": "1950", "md5": "0104f7d59ce731ca3444f6340d3188b2", "crc32": "634b98cd", "sha1": "99d983fab108913fc00582070b0ddd6ace0333ef" }, "\/lsl5demo.zip": { "source": "original", "format": "ZIP", "mtime": "1476676446", "size": "639151", "md5": "e6885ba0cfe8b6639920164472baedbb", "crc32": "86288725", "sha1": "0373dbdec466d7735f59b7b6b839e01012266eb5" }, "\/resource_item_201.jpg": { "source": "original", "format": "JPEG", "mtime": "1341481191", "size": "13759", "md5": "9becf84da36fc3b459d348fd5d9637c3", "crc32": "b3d74130", "sha1": "60144a4595499c346f02dfc0f8c3c59415d1d9fc", "rotation": "0" }, "\/resource_item_201_thumb.jpg": { "source": "derivative", "format": "JPEG Thumb", "original": "resource_item_201.jpg", "mtime": "1341481228", "size": "4555", "md5": "708ee737be220c6d3bc316c9de67e3d4", "crc32": "fbeb940e", "sha1": "21fa986dc705cd51d32a15e2293b5a798e9061be" } }, "misc": { "image": "https:\/\/ia600709.us.archive.org\/32\/items\/LeisureSuitLarry5PassionatePattiDoesALittleUndercoverWorkDemo\/resource_item_201_thumb.jpg", "collection-title": "Classic PC Games" }, "item": { "downloads": 1755, "week": 10, "month": 18 } }
[ "spbpython", "Saturday-Breakfast-Talks-About-Tech-Startups-And-More", "VentureFusion", "Elixir-Lang-St-Petersburg" ]
{ "require": { "bayfrontmedia/php-http-request": "^1.0" } }
{"response": {"status": "ok", "userTier": "developer", "total": 1, "content": {"id": "film/2020/feb/05/harvey-weinstein-trial--witness-lauren-young", "type": "article", "sectionId": "world", "sectionName": "World news", "webPublicationDate": "2020-02-05T22:51:43Z", "webTitle": "Harvey Weinstein trial: attorney shows dress witness wore during alleged attack", "webUrl": "https://www.theguardian.com/film/2020/feb/05/harvey-weinstein-trial--witness-lauren-young", "apiUrl": "https://content.guardianapis.com/film/2020/feb/05/harvey-weinstein-trial--witness-lauren-young", "fields": {"headline": "Harvey Weinstein trial: attorney shows dress witness wore during alleged attack", "bodyText": "The sixth and final woman to accuse Harvey Weinstein of sexually attacking them took the witness stand at his rape trial on Wednesday, describing in harrowing detail how he allegedly groped her in a Los Angeles hotel bathroom in 2013. The jury in the New York supreme court were once again subjected to a graphic and distressing account of an alleged forced sex act imposed on an aspiring young actor by the once-powerful movie producer. Lauren Young, 30, a model from Pennsylvania, recounted how she had been invited by a female acquaintance to the Montage hotel in Beverly Hills on 19 February 2013. She went in the hope of showing Weinstein a film script she was writing based on her life. The film producer appeared in the lobby of the hotel and they began talking about the reality TV show America\u2019s Next Top Model which he suggested Young might be able to join. They continued talking about the show as Weinstein asked Young and the other woman up to his hotel room, she told the jury. She was led into the suite \u2013 Weinstein in front of her, the acquaintance behind her \u2013 following the defendant through the living room, down a corridor and into the bathroom. Suddenly, Young said, the encounter turned coercive. As she entered the bathroom she saw through a mirror that her acquaintance had closed the door behind her, shutting her and Weinstein in. The movie producer, the witness alleged, went to the shower, turned it on and immediately started undressing. \u201cI stood there in shock. He was already naked at that point. He stepped in front of me when I went to approach the door with his naked body right in front of me. I felt so trapped.\u201d Young went on to claim that Weinstein pushed her back against the bathroom sink, unzipped and pulled down the white lace dress she was wearing, and began groping her breast as he masturbated. \u201cI said \u2018no, no, no\u2019, the whole time; that I had a boyfriend; that I wasn\u2019t interested. He\u2019s carrying on with conversation, \u2018This is what all actresses do, to make it\u2019.\u201d The defendant continued to masturbate, Young said, until he ejaculated on a towel. Young was asked by prosecutors to describe any memorable features of Weinstein\u2019s anatomy. She said that his genitals were peculiar. \u201cIt looked like it had been cut and sewn back on, not a normal-looking scar from circumcision. Something looked wrong. I didn\u2019t really see balls in a sack.\u201d The film producer\u2019s body parts have emerged as an evidentiary factor in the trial. One of the two main accusers in the case, who alleges she was raped by Weinstein in a New York hotel in 2013, told the jury that he appeared to be \u201cintersex\u201d. \u201cHe does not have testicles and it appears he has a vagina,\u201d the accuser said in testimony earlier this week. On Tuesday prosecutors showed the jury official photographs of the movie mogul\u2019s body. The images were handed to jurors to inspect without being visible to the public in the courtroom. Young is one of three witnesses who have been included in the trial even though their allegations are not actively being prosecuted. They have been called to provide evidence of \u201cprior bad acts\u201d, a type of supporting testimony known as Molineux witnesses under New York law. Weinstein, 67, has pleaded not guilty to five counts and faces a possible sentence of life imprisonment. Two of the counts are rape, relating to the woman who alleges she was violated in 2013, and one count is that he forced oral sex on the former production assistant Miriam Haley in 2006. The two other counts are for predatory sexual assault \u2013 the idea that Weinstein displayed a pattern of behavior, or modus operandi, going back several years. These are the counts that carry the potential life sentence. As a further complicating factor, Young is one of two women accusing the film producer of sex crimes in a case being prosecuted by the Los Angeles district attorney\u2019s offices. Charges in that separate case, for which Weinstein faces up to 28 years in prison if convicted, were announced on 6 January \u2013 the same day as the New York trial began. After Young gave her testimony, she was cross-examined by one of Weinstein\u2019s defense lawyers, Damon Cheronis. In a dramatic move, he produced the white lace dress that the witness alleged she had been wearing at the time of the 2013 incident and had never worn since. Cheronis pressed Young over how she had come to discover the dress only three days ago, she said in a box of clothes she had left behind in LA after a house move. The court heard in earlier legal argument that LA prosecutors intend to test the garment for DNA that may or may not tie it to Weinstein."}, "isHosted": false, "pillarId": "pillar/news", "pillarName": "News"}}}
{ "name": "mz32.dev", "private": true, "description": "", "version": "0.1.0", "author": "mizunomi32 <info@mz32.dev>", "dependencies": { "@types/react-helmet": "^6.1.0", "autoprefixer": "^9", "date-utils": "^1.2.21", "gatsby": "^2.24.26", "gatsby-image": "^2.4.14", "gatsby-plugin-manifest": "^2.4.21", "gatsby-plugin-next-seo": "^1.6.1", "gatsby-plugin-offline": "^3.2.21", "gatsby-plugin-postcss": "3.0.0", "gatsby-plugin-react-helmet": "^3.3.10", "gatsby-plugin-sass": "^2.3.12", "gatsby-plugin-sharp": "^2.6.24", "gatsby-plugin-sitemap": "^2.4.11", "gatsby-remark-code-titles": "^1.1.0", "gatsby-remark-prismjs": "^3.5.10", "gatsby-source-filesystem": "^2.3.24", "gatsby-source-microcms": "^0.2.0", "gatsby-transformer-remark": "^2.8.28", "gatsby-transformer-sharp": "^2.5.12", "node-sass": "^4.14.1", "postcss": "^7", "prismjs": "^1.21.0", "prop-types": "^15.7.2", "react": "^16.12.0", "react-dom": "^16.12.0", "react-helmet": "^6.1.0", "react-share": "^4.3.1", "tailwindcss": "npm:@tailwindcss/postcss7-compat", "typescript": "^3.9.7" }, "devDependencies": { "eslint-import-resolver-typescript": "^2.2.0", "prettier": "2.0.5" }, "license": "mit", "scripts": { "build": "gatsby build", "develop": "gatsby develop", "format": "prettier --write \"**/*.{js,jsx,ts,tsx,json,md}\"", "start": "npm run develop", "serve": "gatsby serve", "clean": "gatsby clean", "test": "echo \"Write tests! -> https://gatsby.dev/unit-testing\" " } }
{"id":135284,"date":"2021-09-15T13:22:30.000Z","description":null,"for":490,"against":102,"abstention":102,"plenary":null,"name":"Lucia Ďuriš Nicholsonová - Considérant 5 - Am 2/1","ref":"A9-0262/2021","green_remark":null,"created_by":null,"updated_by":null,"title":"Guidelines for the employment policies of the Member States","url":"https://oeil.secure.europarl.europa.eu/oeil//popups/ficheprocedure.do?reference=2021/0137(NLE)&amp;l=en"}
{ "26006303": { "担当教授": "ギルバート　Ｊ．Ｅ．（GILBERT JOAN ELIZABETH） ", "曜時": "火曜４時限／Tuesday 4", "科目": "【100】英語I（コミュニケーション）　３／English I (Communication)", "管理部署": "商学部／School of Business Administration" }, "26007306": { "担当教授": "渡辺　拓人（WATANABE TAKUTO） ", "曜時": "火曜４時限／Tuesday 4", "科目": "【200】英語III（リーディング）　６／English III (Reading)", "管理部署": "商学部／School of Business Administration" }, "26007314": { "担当教授": "正木　みき（MASAKI MIKI） ", "曜時": "火曜４時限／Tuesday 4", "科目": "【200】英語III（リーディング）　１４／English III (Reading)", "管理部署": "商学部／School of Business Administration" }, "26018505": { "担当教授": "松山　博文（MATSUYAMA HIROFUMI） ", "曜時": "火曜４時限／Tuesday 4", "科目": "【100】フランス語I（表現）　５／French Communication I", "管理部署": "商学部／School of Business Administration" }, "26022502": { "担当教授": "荏原　いずみ（EBARA IZUMI） ", "曜時": "火曜４時限／Tuesday 4", "科目": "【200】フランス語III（表現）　２／French Communication III", "管理部署": "商学部／School of Business Administration" }, "26025502": { "担当教授": "小川　敦（OGAWA ATSUSHI） ", "曜時": "火曜４時限／Tuesday 4", "科目": "【100】ドイツ語I　２／German I", "管理部署": "商学部／School of Business Administration" }, "26025503": { "担当教授": "納谷　昌宏（NAYA MASAHIRO） ", "曜時": "月曜２時限／Monday 2", "科目": "【100】ドイツ語I　３／German I", "管理部署": "商学部／School of Business Administration" }, "26040005": { "担当教授": "徐　雨フン（HSU YU-FEN） ", "曜時": "火曜４時限／Tuesday 4", "科目": "【100】中国語I　５／ChineseI", "管理部署": "商学部／School of Business Administration" }, "26040009": { "担当教授": "馬　淑毅（MA SYUKUKI） ", "曜時": "火曜４時限／Tuesday 4", "科目": "【100】中国語I　９／ChineseI", "管理部署": "商学部／School of Business Administration" }, "26046003": { "担当教授": "芦田　麻樹子（ASHIDA MAKIKO） ", "曜時": "火曜４時限／Tuesday 4", "科目": "【100】朝鮮語I　３／Korean I", "管理部署": "商学部／School of Business Administration" }, "26048003": { "担当教授": "李　雨洲（I UJU） ", "曜時": "火曜４時限／Tuesday 4", "科目": "【200】朝鮮語III　３／Korean III", "管理部署": "商学部／School of Business Administration" }, "26050002": { "担当教授": "柿原　武史（KAKIHARA TAKESHI） ", "曜時": "火曜４時限／Tuesday 4", "科目": "【100】スペイン語I　２／SpanishI", "管理部署": "商学部／School of Business Administration" }, "26054001": { "担当教授": "禪野　美帆（ZENNO MIHO） ", "曜時": "火曜４時限／Tuesday 4", "科目": "【200】スペイン語III　１／SpanishIII", "管理部署": "商学部／School of Business Administration" }, "26202002": { "担当教授": "西村　正喜（NISHIMURA MASAKI） ", "曜時": "火曜４時限／Tuesday 4", "科目": "【200】民法Ａ　２／Civil Law A", "管理部署": "商学部／School of Business Administration" }, "26246300": { "担当教授": "木山　実（KIYAMA MINORU） ", "曜時": "火曜４時限／Tuesday 4", "科目": "【300】経営史／Business History", "管理部署": "商学部／School of Business Administration" }, "26272300": { "担当教授": "井上　達男（INOUE TATSUO） ", "曜時": "火曜４時限／Tuesday 4", "科目": "【300】財務諸表論I／Financial Accounting I", "管理部署": "商学部／School of Business Administration" }, "26306600": { "担当教授": "須永　努（SUNAGA TSUTOMU） ", "曜時": "火曜４時限／Tuesday 4", "科目": "【300】消費者マーケティング／Consumer Marketing", "管理部署": "商学部／School of Business Administration" }, "26357600": { "担当教授": "阿萬　弘行（AMAN HIROYUKI） ", "曜時": "火曜４時限／Tuesday 4", "科目": "【350】ファイナンス特論Ａ（１０６）【不動産価値論】／Topics in Finance A", "管理部署": "商学部／School of Business Administration" }, "26377300": { "担当教授": "土方　嘉徳（HIJIKATA YOSHINORI） ", "曜時": "火曜４時限／Tuesday 4", "科目": "【300】経営情報システム論／Business Information Systems", "管理部署": "商学部／School of Business Administration" }, "26404500": { "担当教授": "高森　桃太郎（TAKAMORI MOMOTARO） ", "曜時": "火曜４時限／Tuesday 4", "科目": "【300】国際ビジネスコミュニケーション論／International Business Communication", "管理部署": "商学部／School of Business Administration" } }
{"title":"Johnny Hallyday Vie avec 3 titres bonus 1970 FLAC","uid":8814479,"size":330496960,"categoryP":"audio","categoryS":"flac","magnet":"?xt=urn:btih:d66ca97af290a9cfce85932a53a3ac87d97325aa&amp;dn=Johnny+Hallyday+Vie+avec+3+titres+bonus+1970+FLAC&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":"Eijebong","files":15,"time":1376545942,"description":"from http://www.t411.me/torrents/johnny-hallyday-vie-avec-3-titres-bonus-1970-flac","torrent":{"xt":"urn:btih:d66ca97af290a9cfce85932a53a3ac87d97325aa","amp;dn":"Johnny+Hallyday+Vie+avec+3+titres+bonus+1970+FLAC","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":"d66ca97af290a9cfce85932a53a3ac87d97325aa","infoHashBuffer":{"type":"Buffer","data":[214,108,169,122,242,144,169,207,206,133,147,42,83,163,172,135,217,115,37,170]},"announce":[],"urlList":[]}}
{"poster":"Tenken","date":"2015-10-19T20:09:37.105+0000","title":"''La Espada Celestial'' Capitulo 2: La Tristeza de un Yordle Solitario","subforum":"Creaciones de la comunidad","up_votes":7,"down_votes":0,"body":"Hola a todos, aqu&iacute; les traigo el segundo capitulo de mi historia, ojala les guste.\n\n[**Capitulo Anterior**](http://boards.las.leagueoflegends.com/es/c/creaciones-de-la-comunidad/kHb3asiH-la-espada-celestial-capitulo-1-la-espada-caauda-del-cielo)\n-----\n\n&lsquo;&rsquo;_Supongo que ya tengo un objetivo, por ahora&hellip;_&rsquo;&rsquo;\n\nRegistre mi t&uacute;nica para ver si ten&iacute;a algo m&aacute;s, literalmente vaci&eacute; los bolsillos de mi t&uacute;nica, lo que encontr&eacute; fue esto: Vendajes, Unas 3 hojas con un raro aroma, Un peque&ntilde;o frasco de cristal que conten&iacute;a un l&iacute;quido transparente y una especie de pergamino el cual ten&iacute;a escrito una serie de reglamentos.\n\n-&iquest;Un **Invocador**?, Yo cre&iacute;a que eso era una especie de leyenda&hellip;&iexcl;Esto es mejor de lo que pensaba!- Dijo **Veigar**.\n\n&Eacute;l se acerc&oacute; a m&iacute; y me dijo que me &lsquo;&rsquo;**enlazara**&rsquo;&rsquo; a &eacute;l, yo no entend&iacute;a nada de lo que &eacute;l me dec&iacute;a.\nSu rostro mostraba una clara decepci&oacute;n, pero aun as&iacute; salimos de la cueva y caminamos rumbo hacia donde **Veigar** me dirigiera.\nFue un largo camino, pero finalmente llegamos a una especie de ciudad la cual parec&iacute;a estar oculta debido a los largos &aacute;rboles.\n\n-&lsquo;&rsquo;**Ciudad Bandle**&rsquo;&rsquo; dec&iacute;a la entrada al lugar.\n\nMire hacia mi alrededor y vi que **Veigar** ya no se encontraba conmigo, aun as&iacute; decid&iacute; entrar a la curiosa ciudad.\nHab&iacute;a un mont&oacute;n de hombrecitos los cuales **Veigar** me dijo que se llamaban **Yordles**, la ciudad era hermosa y bastante rustica, hab&iacute;an grandes casas de madera y en el centro de la ciudad una gran plaza con una hermosa fuente, por lo que vi all&iacute; en la plaza se ubicaba el mercado, ve&iacute;a ni&ntilde;os jugando y corriendo de un lado a otro.\n\nYo parec&iacute;a ser invisible a todos los habitantes, hasta que o&iacute; a un ni&ntilde;o decir:\n\n-Mami, &iquest;Qui&eacute;n es ese se&ntilde;or?\n\nEn un abrir y cerrar de ojos tenia a toda la ciudad con los ojos en m&iacute;, y no eran precisamente miradas de bienvenida, los **Yordles** me rodearon y pude ver que se acercaba un peque&ntilde;o **Yordle de pelo azul y un raro peinado, ten&iacute;a un aspecto de mecánico, algo sucio con un olor a aceite y combustible**.\n\n-&iquest;Que has venido a hacer aqu&iacute; **humano**?, los de tu especie no son bienvenidos aqu&iacute;- Me dijo el peque&ntilde;o **Yordle**.\n\nR&aacute;pidamente ten&iacute;a a unos soldados yendo directamente hacia m&iacute; con grandes ca&ntilde;ones que apuntaban hacia mi cara, en ese momento o&iacute; una voz familiar.\n\n-&iexcl;Bien hecho **Tenken**, ahora destr&uacute;yelos!\n\n**Veigar** estaba en el tejado de un edificio, cargando un gran proyectil m&aacute;gico.\nYo no sab&iacute;a lo que ten&iacute;a que hacer, **Veigar** nunca me explico ning&uacute;n plan, &eacute;l arrojo un proyectil desde el cielo que hizo temblar el suelo, derribando a los soldados y civiles que ah&iacute; estaban.\nVi que algunas madres ca&iacute;an al suelo junto con sus hijos, no pude evitar sentir compasi&oacute;n por ellos, as&iacute; que decid&iacute; ayudarlos.\n\n-&iexcl;**Veigar** detente, esto no es lo que yo pensaba!- Le grite, mientras ayudaba a una madre y a su hijo a levantarse del suelo.\n\nPero el hizo caso omiso a mis palabras y en un momento ten&iacute;a gran parte del centro de la ciudad destrozada por los proyectiles que lanzaba. Algunos soldados comenzaron a dispararme mientras yo ayudaba a los civiles. Corr&iacute; lo m&aacute;s r&aacute;pido que pude y al ver que los soldados rodeaban la entrada, no tuve m&aacute;s remedio que abrirme paso por la fuerza.\nFue dif&iacute;cil pero finalmente logre huir y esconderme, de lo lejos vi a **Veigar** corriendo hacia m&iacute;.\n\n-&iexcl;&iquest;Por qu&eacute; no atacaste?!, &iexcl;Era nuestra oportunidad!, solo ten&iacute;as que&hellip;- Me grito **Veigar**\n\n-&iexcl;Por qu&eacute; esto no es lo que yo quiero hacer, esto&hellip;no es correcto, est&aacute; mal!- Lo interrump&iacute;\n\n**Veigar** me miro estupefacto y me sigui&oacute; mientras me alejaba del lugar, sin quitarme esa mirada de encima.\nYa hab&iacute;a ca&iacute;do la noche, regresamos a la cueva que era ahora nuestro refugio, mientras prend&iacute;a una fogata le pregunte a **Veigar** por qu&eacute; actuaba de esa manera.\nA pesar de que a&uacute;n segu&iacute;a con esa mirada de duda, pude ver como la mirada de **Veigar** se volv&iacute;a una especie de mirada de lamento; agach&oacute; la cabeza y se acost&oacute; en el suelo d&aacute;ndome la espalda, aun as&iacute; pude notar una gran tristeza en &eacute;l.\nNo pude evitar preguntarle el por qu&eacute; luc&iacute;a triste, aun d&aacute;ndome la espalda me dijo el por qu&eacute;.\n\n-Yo&hellip;nunca fui siempre as&iacute;, yo era un **Yordle** normal como el resto que viste en esa ciudad.\n\nMe cont&oacute; su historia, como hab&iacute;a sido apresado por unos individuos de una ciudad conocida como** Noxus**, las humillaciones y torturas que tuvo que soportar y sobre todo el aislamiento que tuvo que vivir durante mucho tiempo.\n\n-**Noxus**&hellip;- Dije en voz baja, mientras entrecerraba los ojos, pensando.\n\n-Son lo peor que puede existir&hellip;- Me respondi&oacute; con un tono de tristeza que nunca cre&iacute; que oir&iacute;a.\n\nMe cont&oacute; como hab&iacute;a escapado de aquella prisi&oacute;n y como hab&iacute;a aprendido todo lo que sabe respecto a **Magia**, me dijo que a pesar de buscar hacer el mal, le gustaba tener a alguien que lo acompa&ntilde;ara. Mientras me acostaba en el suelo pude ver como lloraba en silencio.\nUn sentimiento que pronto supe que se llamaba &lsquo;&rsquo;**odio**&rsquo;&rsquo; brotaba en mi interior, **Noxus**&hellip;su visi&oacute;n era lo contrario a lo que yo cre&iacute;a, en ese momento no pude evitar sentir deseos de venganza.\n\n&lsquo;&rsquo;_Un d&iacute;a, solo un d&iacute;a y ya hab&iacute;a descubierto lo que era el odio, la tristeza, el da&ntilde;o y los deseos, no puede seguir as&iacute;, debo ayudarlo o aparentar que lo hago y cuando llegue el momento&hellip;ayudarlo de verdad_ &rsquo;&rsquo;\n\n------\n\nGracias por leer, si tienen alguna sugerencia o algo mas si&eacute;ntanse libres de comentar.\n\nSaludos y suerte! {{champion:85}}\n\n[**Capitulo Siguiente**](http://boards.las.leagueoflegends.com/es/c/creaciones-de-la-comunidad/zL7YPqbm-la-espada-celestial-capitulo-3-la-muralla-en-la-cueva-y-la-pagina-perdida)\n\nhttp://vignette3.wikia.nocookie.net/leagueoflegends/images/f/f2/Bandle_City.jpg/revision/latest?cb=20101207230558","replies":[{"poster":"Natzka","date":"2016-08-28T15:01:05.999+0000","up_votes":2,"down_votes":0,"body":"¡Oh! Quiero saber porque los humanos no son bienvenidos en la ciudad de Bandle, ¿que pasará con Veigar ? Y cuando aparecerá Kennen, porque se nota que él es tu yordle que más te interesa.\n\n En cuanto a redacción e historia ¡me gusta mucho, muchísimo! Trataré de no leer todo de una pasada jajaja.\n\n¡Saludos Invocador!","replies":[{"poster":"Tenken","date":"2016-08-28T15:14:54.318+0000","up_votes":1,"down_votes":0,"body":"Hahaha, los primeros capítulos que volveré a escribir cuando cumplan un año espero.\n\nAunque estos eran mas cortos y tenían algunos errores, he mejorado un poco mi redacción y espero mejorar aun mas para los capítulos futuros.\n\nCreo que tendrás que esperar un buen tiempo para que **mi Kennen** incluso sea nombrado xD\n\nSaludos y suerte! ( ^ 3^)http://i.imgur.com/dP2JdDJ.png?1 ❤","replies":[]}]},{"poster":"Demianaimed","date":"2015-11-23T12:03:17.699+0000","up_votes":1,"down_votes":0,"body":"No sé bien qué pero tu historia tiene algo adictivo. Si bien Veigar es uno de los Yordles que más me gustan los Yordles en si me parecen un poco aburridos en las historias pero en tu caso hiciste bastante bien las cosas y creo que no solo a mi sino a mucha gente le está buscando. Espero que esta historia me siga sorprendiendo!","replies":[{"poster":"Tenken","date":"2015-11-23T12:25:32.993+0000","up_votes":1,"down_votes":0,"body":"Heheh, a mi me encantan los Yordles, son lo único que me interesa de League Of Legends (Y mucho mas Kennen)!\n\nLo mejor es que le gusto a mucha gente, algunos me han corregido algunas cosas que me han servido para redactar mejor y que la historia tenga algo de coherencia.\nAunque estos primeros capítulos son bastante flojos y aburridos a comparación con los últimos que he publicado, al menos en mi opinión, ademas de estar mejor redactados!\n\nSaludos y suerte! ( ^ 3^){{champion:85}} ","replies":[]}]},{"poster":"mordorr","date":"2015-11-12T14:51:47.423+0000","up_votes":1,"down_votes":0,"body":"E....... me gusto, y que linda ciudad.","replies":[]},{"poster":"FurchiDC","date":"2015-11-06T02:33:42.755+0000","up_votes":1,"down_votes":0,"body":"Pobeshito Veigar, pero tremendo maldito es jaja rompió todo. \n¿El azul era Rumble?","replies":[{"poster":"Tenken","date":"2015-11-06T03:15:53.088+0000","up_votes":1,"down_votes":0,"body":"Lo sabrás en el capitulo 8! :D\n\nPffffff mas que obvio que si era él...{{champion:68}} \n\nSaludos y suerte! <3 {{champion:85}} <3","replies":[{"poster":"FurchiDC","date":"2015-11-06T03:55:02.502+0000","up_votes":1,"down_votes":0,"body":"Es que lo describiste muy bien :P jaja","replies":[]}]}]},{"poster":"wiship0","date":"2015-10-20T12:41:30.204+0000","up_votes":1,"down_votes":0,"body":"Muy bueno y pobre {{champion:45}} yo tambien lo ayudaria a... ¡¡¡¡DESTRUIR NOXUS!!!!!\n","replies":[]},{"poster":"Chockad","date":"2015-10-19T21:47:38.296+0000","up_votes":1,"down_votes":0,"body":"Wow cada vez mejor,ya quiero ver el siguiente capitulo\nSaludos pollo ^-^","replies":[]},{"poster":"TheShy Duo","date":"2015-10-19T21:29:02.098+0000","up_votes":1,"down_votes":0,"body":"es genial sigue haci ya espero el proximo capitulo","replies":[]}]}
{"geometry":{"type":"Polygon","coordinates":[[[27.134918,43.008911],[27.142114,43.007683],[27.142375,43.008559],[27.148371,43.007535],[27.147851,43.005783],[27.144253,43.006398],[27.143993,43.005521],[27.142793,43.005726],[27.142273,43.003974],[27.139875,43.004383],[27.138834,43.000879],[27.140033,43.000674],[27.139253,42.998046],[27.134456,42.998864],[27.134976,43.000617],[27.132578,43.001026],[27.132838,43.001902],[27.130439,43.002311],[27.130699,43.003187],[27.123503,43.004415],[27.123763,43.005291],[27.122564,43.005495],[27.123083,43.007248],[27.124283,43.007043],[27.124543,43.007919],[27.126942,43.007510],[27.127201,43.008387],[27.129600,43.007977],[27.129860,43.008854],[27.134658,43.008035],[27.134918,43.008911]]]},"properties":{"qs:a1r":"0","qs:la":"\u041c\u0435\u0434\u043e\u0432\u0435\u0446","geom:longitude":27.134913,"qs:la_lc":"*BGVAR1647620","lbl:latitude":43.000000,"qs:loc_alt":"Medovets","iso:country":"BG","src:geom_alt":[],"wof:geomhash":"9fd0225450184a28a88efcb1514e6a2b","qs:level":"locality","wof:name":"\u041c\u0435\u0434\u043e\u0432\u0435\u0446","src:geom":"quattroshapes","qs:adm0":"\u0411\u044a\u043b\u0433\u0430\u0440\u0438\u044f","wof:breaches":[],"wof:hierarchy":[{"locality_id":101798453,"country_id":85633001,"region_id":85681847}],"qs:type":"rural point-in-poly","qs:loc":"\u041c\u0435\u0434\u043e\u0432\u0435\u0446","wof:id":101798453,"qs:pop":0,"lbl:longitude":27.133330,"wof:supersedes":[],"geom:area":0.000130,"qs:id":0,"geom:latitude":43.004902,"qs:a1_alt":"Varna","qs:source":"RCustom EuroGlobalMap + UMZ Urban Polygons + Geonames + GeoPlanet","src:centroid_lbl":"geonames","wof:belongsto":[85633001,85681847],"wof:placetype":"locality","qs:a0":"\u0411\u044a\u043b\u0433\u0430\u0440\u0438\u044f","qs:a1":"*\u0412\u0430\u0440\u043d\u0430","wof:lastmodified":1439924413,"wof:superseded_by":[],"wof:concordances":{"gn:id":729169},"wof:parent_id":85681847},"type":"Feature","bbox":[27.122564,42.998046,27.148371,43.008911],"id":101798453}
[{"pid":0,"ph":"i","name":"Memory sample","ts":1576857174158000,"args":{"JVM stats":"heap_memory_usage: 205794952\nnon_heap_memory_usage: 168623160\nloaded_class_count: 18440\nthread_count: 27\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857174713000,"args":{"JVM stats":"heap_memory_usage: 220013720\nnon_heap_memory_usage: 168869656\nloaded_class_count: 18442\nthread_count: 30\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857175092000,"args":{"JVM stats":"heap_memory_usage: 237611632\nnon_heap_memory_usage: 169015232\nloaded_class_count: 18442\nthread_count: 30\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857175163000,"args":{"JVM stats":"heap_memory_usage: 240295408\nnon_heap_memory_usage: 169015232\nloaded_class_count: 18442\nthread_count: 30\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857175228000,"args":{"JVM stats":"heap_memory_usage: 243132552\nnon_heap_memory_usage: 169040448\nloaded_class_count: 18442\nthread_count: 30\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857175230000,"args":{"JVM stats":"heap_memory_usage: 243132552\nnon_heap_memory_usage: 169040448\nloaded_class_count: 18442\nthread_count: 30\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857175244000,"args":{"JVM stats":"heap_memory_usage: 243132552\nnon_heap_memory_usage: 169051008\nloaded_class_count: 18442\nthread_count: 30\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857175247000,"args":{"JVM stats":"heap_memory_usage: 243132552\nnon_heap_memory_usage: 169046400\nloaded_class_count: 18442\nthread_count: 30\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857175248000,"args":{"JVM stats":"heap_memory_usage: 243132552\nnon_heap_memory_usage: 169046400\nloaded_class_count: 18442\nthread_count: 30\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857175397000,"args":{"JVM stats":"heap_memory_usage: 251008304\nnon_heap_memory_usage: 168970320\nloaded_class_count: 18442\nthread_count: 30\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857175400000,"args":{"JVM stats":"heap_memory_usage: 251438800\nnon_heap_memory_usage: 168970320\nloaded_class_count: 18442\nthread_count: 30\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857175409000,"args":{"JVM stats":"heap_memory_usage: 251438800\nnon_heap_memory_usage: 168930760\nloaded_class_count: 18442\nthread_count: 30\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857175412000,"args":{"JVM stats":"heap_memory_usage: 251438800\nnon_heap_memory_usage: 168926352\nloaded_class_count: 18442\nthread_count: 30\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857175496000,"args":{"JVM stats":"heap_memory_usage: 254963120\nnon_heap_memory_usage: 168926648\nloaded_class_count: 18442\nthread_count: 30\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857175686000,"args":{"JVM stats":"heap_memory_usage: 263922504\nnon_heap_memory_usage: 169009848\nloaded_class_count: 18442\nthread_count: 30\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857175694000,"args":{"JVM stats":"heap_memory_usage: 263922504\nnon_heap_memory_usage: 169011336\nloaded_class_count: 18442\nthread_count: 30\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857175695000,"args":{"JVM stats":"heap_memory_usage: 263922504\nnon_heap_memory_usage: 169011336\nloaded_class_count: 18442\nthread_count: 30\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857175717000,"args":{"JVM stats":"heap_memory_usage: 264941552\nnon_heap_memory_usage: 169014856\nloaded_class_count: 18442\nthread_count: 30\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857179478000,"args":{"JVM stats":"heap_memory_usage: 243631432\nnon_heap_memory_usage: 170916656\nloaded_class_count: 18571\nthread_count: 31\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 1\n gc_time: 162\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857179486000,"args":{"JVM stats":"heap_memory_usage: 244214600\nnon_heap_memory_usage: 170916656\nloaded_class_count: 18571\nthread_count: 31\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857179489000,"args":{"JVM stats":"heap_memory_usage: 244214600\nnon_heap_memory_usage: 170916656\nloaded_class_count: 18571\nthread_count: 31\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857179491000,"args":{"JVM stats":"heap_memory_usage: 244214600\nnon_heap_memory_usage: 170922392\nloaded_class_count: 18571\nthread_count: 31\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857179494000,"args":{"JVM stats":"heap_memory_usage: 244214600\nnon_heap_memory_usage: 170922392\nloaded_class_count: 18571\nthread_count: 31\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857179494001,"args":{"JVM stats":"heap_memory_usage: 244214600\nnon_heap_memory_usage: 170922392\nloaded_class_count: 18571\nthread_count: 31\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857179553000,"args":{"JVM stats":"heap_memory_usage: 245209512\nnon_heap_memory_usage: 170951432\nloaded_class_count: 18571\nthread_count: 31\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857179554000,"args":{"JVM stats":"heap_memory_usage: 245209512\nnon_heap_memory_usage: 170951432\nloaded_class_count: 18571\nthread_count: 31\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857179608000,"args":{"JVM stats":"heap_memory_usage: 247118456\nnon_heap_memory_usage: 170999200\nloaded_class_count: 18572\nthread_count: 31\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857187702000,"args":{"JVM stats":"heap_memory_usage: 263522672\nnon_heap_memory_usage: 171034152\nloaded_class_count: 18572\nthread_count: 41\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857187853000,"args":{"JVM stats":"heap_memory_usage: 274053576\nnon_heap_memory_usage: 171145640\nloaded_class_count: 18572\nthread_count: 41\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857187884000,"args":{"JVM stats":"heap_memory_usage: 277184816\nnon_heap_memory_usage: 171180072\nloaded_class_count: 18572\nthread_count: 41\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857188170000,"args":{"JVM stats":"heap_memory_usage: 313770808\nnon_heap_memory_usage: 171372120\nloaded_class_count: 18572\nthread_count: 41\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857188180000,"args":{"JVM stats":"heap_memory_usage: 313770808\nnon_heap_memory_usage: 171374296\nloaded_class_count: 18572\nthread_count: 41\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857188281000,"args":{"JVM stats":"heap_memory_usage: 320098272\nnon_heap_memory_usage: 171405792\nloaded_class_count: 18572\nthread_count: 41\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857188284000,"args":{"JVM stats":"heap_memory_usage: 320098272\nnon_heap_memory_usage: 171405792\nloaded_class_count: 18572\nthread_count: 41\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857188309000,"args":{"JVM stats":"heap_memory_usage: 320320560\nnon_heap_memory_usage: 171405792\nloaded_class_count: 18572\nthread_count: 41\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857188313000,"args":{"JVM stats":"heap_memory_usage: 320320560\nnon_heap_memory_usage: 171405792\nloaded_class_count: 18572\nthread_count: 41\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857189322000,"args":{"JVM stats":"heap_memory_usage: 473508080\nnon_heap_memory_usage: 171602752\nloaded_class_count: 18574\nthread_count: 41\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857189323000,"args":{"JVM stats":"heap_memory_usage: 473508080\nnon_heap_memory_usage: 171602752\nloaded_class_count: 18574\nthread_count: 41\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":0,"ph":"i","name":"Memory sample","ts":1576857189395000,"args":{"JVM stats":"heap_memory_usage: 474959240\nnon_heap_memory_usage: 171598688\nloaded_class_count: 18576\nthread_count: 34\ngarbage_collection_stats {\n name: \"PS Scavenge\"\n gc_collections: 0\n gc_time: 0\n}\ngarbage_collection_stats {\n name: \"PS MarkSweep\"\n gc_collections: 0\n gc_time: 0\n}\n"}},{"pid":1,"tid":8,"id":2,"name":"base plugin project configure","args":{"span_id":"2","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n"},"ph":"X","ts":1576857174159000,"dur":12000},{"pid":1,"tid":8,"id":3,"name":"base plugin project base extension creation","args":{"span_id":"3","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n"},"ph":"X","ts":1576857174171000,"dur":26000},{"pid":1,"tid":8,"id":5,"name":"task manager create tasks","args":{"span_id":"5","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n"},"ph":"X","ts":1576857174197000,"dur":1000},{"pid":1,"tid":8,"id":4,"name":"base plugin project tasks creation","args":{"span_id":"4","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n"},"ph":"X","ts":1576857174197000,"dur":1000},{"pid":1,"tid":8,"id":8,"name":"variant manager create variants","args":{"span_id":"8","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n"},"ph":"X","ts":1576857174254000,"dur":35000},{"pid":1,"tid":8,"id":9,"name":"variant manager create tests tasks","args":{"span_id":"9","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n"},"ph":"X","ts":1576857174289000,"dur":100},{"pid":1,"tid":8,"id":11,"name":"app task manager create merge manifest task","args":{"span_id":"11","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174291000,"dur":7000},{"pid":1,"tid":8,"id":12,"name":"app task manager create generate res values task","args":{"span_id":"12","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174298000,"dur":1000},{"pid":1,"tid":8,"id":13,"name":"app task manager create create renderscript task","args":{"span_id":"13","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174299000,"dur":100},{"pid":1,"tid":8,"id":14,"name":"app task manager create merge resources task","args":{"span_id":"14","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174299000,"dur":1000},{"pid":1,"tid":8,"id":15,"name":"app task manager create merge assets task","args":{"span_id":"15","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174300000,"dur":100},{"pid":1,"tid":8,"id":16,"name":"app task manager create build config task","args":{"span_id":"16","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174300000,"dur":1000},{"pid":1,"tid":8,"id":17,"name":"app task manager create process res task","args":{"span_id":"17","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174301000,"dur":11000},{"pid":1,"tid":8,"id":18,"name":"app task manager create aidl task","args":{"span_id":"18","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174312000,"dur":100},{"pid":1,"tid":8,"id":19,"name":"app task manager create shader task","args":{"span_id":"19","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174312000,"dur":1000},{"pid":1,"tid":8,"id":20,"name":"app task manager create ndk task","args":{"span_id":"20","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174313000,"dur":100},{"pid":1,"tid":8,"id":21,"name":"app task manager create external native build task","args":{"span_id":"21","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174313000,"dur":100},{"pid":1,"tid":8,"id":22,"name":"app task manager create merge jnilibs folders task","args":{"span_id":"22","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174313000,"dur":1000},{"pid":1,"tid":8,"id":23,"name":"app task manager create compile task","args":{"span_id":"23","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174314000,"dur":17000},{"pid":1,"tid":8,"id":24,"name":"app task manager create packaging task","args":{"span_id":"24","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174331000,"dur":1000},{"pid":1,"tid":8,"id":25,"name":"app task manager create lint task","args":{"span_id":"25","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174333000,"dur":100},{"pid":1,"tid":8,"id":10,"name":"variant manager create tasks for variant","args":{"span_id":"10","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174289000,"dur":44000},{"pid":1,"tid":8,"id":26,"name":"variant manager create tasks for variant","args":{"span_id":"26","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n"},"ph":"X","ts":1576857174334000,"dur":16000},{"pid":1,"tid":8,"id":28,"name":"app task manager create merge manifest task","args":{"span_id":"28","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 2\nis_debug: false\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174353000,"dur":100},{"pid":1,"tid":8,"id":29,"name":"app task manager create generate res values task","args":{"span_id":"29","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 2\nis_debug: false\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174353000,"dur":1000},{"pid":1,"tid":8,"id":30,"name":"app task manager create create renderscript task","args":{"span_id":"30","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 2\nis_debug: false\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174354000,"dur":100},{"pid":1,"tid":8,"id":31,"name":"app task manager create merge resources task","args":{"span_id":"31","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 2\nis_debug: false\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174354000,"dur":100},{"pid":1,"tid":8,"id":32,"name":"app task manager create merge assets task","args":{"span_id":"32","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 2\nis_debug: false\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174354000,"dur":100},{"pid":1,"tid":8,"id":33,"name":"app task manager create build config task","args":{"span_id":"33","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 2\nis_debug: false\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174354000,"dur":100},{"pid":1,"tid":8,"id":34,"name":"app task manager create process res task","args":{"span_id":"34","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 2\nis_debug: false\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174354000,"dur":9000},{"pid":1,"tid":8,"id":35,"name":"app task manager create aidl task","args":{"span_id":"35","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 2\nis_debug: false\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174363000,"dur":1000},{"pid":1,"tid":8,"id":36,"name":"app task manager create shader task","args":{"span_id":"36","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 2\nis_debug: false\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174364000,"dur":100},{"pid":1,"tid":8,"id":37,"name":"app task manager create ndk task","args":{"span_id":"37","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 2\nis_debug: false\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174364000,"dur":100},{"pid":1,"tid":8,"id":38,"name":"app task manager create external native build task","args":{"span_id":"38","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 2\nis_debug: false\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174364000,"dur":100},{"pid":1,"tid":8,"id":39,"name":"app task manager create merge jnilibs folders task","args":{"span_id":"39","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 2\nis_debug: false\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174364000,"dur":1000},{"pid":1,"tid":8,"id":40,"name":"app task manager create compile task","args":{"span_id":"40","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 2\nis_debug: false\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174365000,"dur":18000},{"pid":1,"tid":8,"id":41,"name":"app task manager create packaging task","args":{"span_id":"41","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 2\nis_debug: false\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174383000,"dur":1000},{"pid":1,"tid":8,"id":42,"name":"app task manager create lint task","args":{"span_id":"42","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 2\nis_debug: false\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174384000,"dur":1000},{"pid":1,"tid":8,"id":27,"name":"variant manager create tasks for variant","args":{"span_id":"27","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 2\nis_debug: false\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n"},"ph":"X","ts":1576857174350000,"dur":35000},{"pid":1,"tid":8,"id":43,"name":"variant manager create tasks for variant","args":{"span_id":"43","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n"},"ph":"X","ts":1576857174385000,"dur":26000},{"pid":1,"tid":8,"id":44,"name":"variant manager create tasks for variant","args":{"span_id":"44","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n"},"ph":"X","ts":1576857174411000,"dur":46000},{"pid":1,"tid":8,"id":7,"name":"variant manager create android tasks","args":{"span_id":"7","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n"},"ph":"X","ts":1576857174253000,"dur":271000},{"pid":1,"tid":8,"id":45,"name":"variant manager external native config values","args":{"span_id":"45","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n"},"ph":"X","ts":1576857174525000,"dur":100},{"pid":1,"tid":8,"id":6,"name":"base plugin create android tasks","args":{"span_id":"6","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n"},"ph":"X","ts":1576857174246000,"dur":279000},{"pid":1,"tid":0,"id":46,"name":"task: unknown task type","args":{"span_id":"46","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","task":"type: 0\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857174713000,"dur":100},{"pid":1,"tid":0,"id":47,"name":"task: app pre build","args":{"span_id":"47","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 92\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857174728000,"dur":362000},{"pid":1,"tid":0,"id":48,"name":"task: aidl compile","args":{"span_id":"48","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 1\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857175099000,"dur":62000},{"pid":1,"tid":0,"id":49,"name":"task: renderscript compile","args":{"span_id":"49","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 54\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857175165000,"dur":61000},{"pid":1,"tid":0,"id":50,"name":"task: check manifest","args":{"span_id":"50","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 8\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857175229000,"dur":1000},{"pid":1,"tid":0,"id":51,"name":"task: generate build config","args":{"span_id":"51","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 24\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857175238000,"dur":6000},{"pid":1,"tid":0,"id":52,"name":"task: generate res values","args":{"span_id":"52","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 26\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857175245000,"dur":2000},{"pid":1,"tid":0,"id":53,"name":"task: unknown task type","args":{"span_id":"53","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","task":"type: 0\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857175248000,"dur":100},{"pid":1,"tid":0,"id":54,"name":"task: merge resources","args":{"span_id":"54","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 40\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857175255000,"dur":140000},{"pid":1,"tid":0,"id":55,"name":"task: compatible screens manifest","args":{"span_id":"55","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 9\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857175398000,"dur":2000},{"pid":1,"tid":0,"id":56,"name":"task: merge manifests","args":{"span_id":"56","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 39\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857175401000,"dur":8000},{"pid":1,"tid":0,"id":57,"name":"task: splits discovery","args":{"span_id":"57","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 87\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857175410000,"dur":1000},{"pid":1,"tid":0,"id":58,"name":"task: process android resources","args":{"span_id":"58","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 51\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857175415000,"dur":80000},{"pid":1,"tid":0,"id":59,"name":"task: kotlin compile","args":{"span_id":"59","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","task":"type: 116\ndid_work: true\nskipped: false\nup_to_date: false\nfailed: false\n"},"ph":"X","ts":1576857175497000,"dur":189000},{"pid":1,"tid":0,"id":60,"name":"task: prepare lint jar","args":{"span_id":"60","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","task":"type: 119\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857175687000,"dur":7000},{"pid":1,"tid":0,"id":61,"name":"task: unknown task type","args":{"span_id":"61","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","task":"type: 0\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857175694000,"dur":100},{"pid":1,"tid":0,"id":62,"name":"task: java pre compile","args":{"span_id":"62","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 76\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857175696000,"dur":21000},{"pid":1,"tid":0,"id":63,"name":"task: android java compile","args":{"span_id":"63","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","task":"type: 3\ndid_work: true\nskipped: false\nup_to_date: false\nfailed: false\n"},"ph":"X","ts":1576857175719000,"dur":3759000},{"pid":1,"tid":0,"id":64,"name":"task: ndk compile","args":{"span_id":"64","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 43\ndid_work: false\nskipped: true\nup_to_date: false\nfailed: false\n"},"ph":"X","ts":1576857179485000,"dur":1000},{"pid":1,"tid":0,"id":65,"name":"task: unknown task type","args":{"span_id":"65","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","task":"type: 0\ndid_work: false\nskipped: false\nup_to_date: false\nfailed: false\n"},"ph":"X","ts":1576857179488000,"dur":100},{"pid":1,"tid":0,"id":66,"name":"task: merge source set folders","args":{"span_id":"66","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 41\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857179489000,"dur":2000},{"pid":1,"tid":0,"id":67,"name":"task: shader compile","args":{"span_id":"67","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 55\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857179493000,"dur":1000},{"pid":1,"tid":0,"id":68,"name":"task: unknown task type","args":{"span_id":"68","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","task":"type: 0\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857179494000,"dur":100},{"pid":1,"tid":0,"id":69,"name":"task: merge source set folders","args":{"span_id":"69","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 41\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857179501000,"dur":51000},{"pid":1,"tid":0,"id":70,"name":"task: extract try with resources support jar","args":{"span_id":"70","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 101\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857179553000,"dur":1000},{"pid":1,"tid":8,"id":72,"name":"transform prep: fix stack frames","args":{"span_id":"72","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","transform":"type: 33\nis_incremental: true\n"},"ph":"X","ts":1576857179588000,"dur":13000},{"pid":1,"tid":8,"id":73,"name":"transform: fix stack frames","args":{"span_id":"73","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","transform":"type: 33\nis_incremental: true\n"},"ph":"X","ts":1576857179602000,"dur":3000},{"pid":1,"tid":0,"id":71,"name":"task: transform","args":{"span_id":"71","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 65\ndid_work: true\nskipped: false\nup_to_date: false\nfailed: false\n"},"ph":"X","ts":1576857179559000,"dur":49000},{"pid":1,"tid":8,"id":75,"name":"transform prep: desugar","args":{"span_id":"75","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","transform":"type: 32\nis_incremental: false\n"},"ph":"X","ts":1576857179650000,"dur":9000},{"pid":1,"tid":8,"id":76,"name":"transform: desugar","args":{"span_id":"76","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","transform":"type: 32\nis_incremental: false\n"},"ph":"X","ts":1576857179660000,"dur":7913000},{"pid":1,"tid":0,"id":74,"name":"task: transform","args":{"span_id":"74","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 65\ndid_work: true\nskipped: false\nup_to_date: false\nfailed: false\n"},"ph":"X","ts":1576857179612000,"dur":8090000},{"pid":1,"tid":9,"id":78,"name":"transform prep: dex archive builder","args":{"span_id":"78","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","transform":"type: 29\nis_incremental: true\n"},"ph":"X","ts":1576857187733000,"dur":1000},{"pid":1,"tid":9,"id":79,"name":"transform: dex archive builder","args":{"span_id":"79","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","transform":"type: 29\nis_incremental: true\n"},"ph":"X","ts":1576857187734000,"dur":100000},{"pid":1,"tid":0,"id":77,"name":"task: transform","args":{"span_id":"77","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 65\ndid_work: true\nskipped: false\nup_to_date: false\nfailed: false\n"},"ph":"X","ts":1576857187703000,"dur":150000},{"pid":1,"tid":8,"id":81,"name":"transform prep: external libs merger","args":{"span_id":"81","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","transform":"type: 34\nis_incremental: true\n"},"ph":"X","ts":1576857187864000,"dur":12000},{"pid":1,"tid":8,"id":82,"name":"transform: external libs merger","args":{"span_id":"82","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","transform":"type: 34\nis_incremental: true\n"},"ph":"X","ts":1576857187877000,"dur":3000},{"pid":1,"tid":0,"id":80,"name":"task: transform","args":{"span_id":"80","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 65\ndid_work: true\nskipped: false\nup_to_date: false\nfailed: false\n"},"ph":"X","ts":1576857187856000,"dur":28000},{"pid":1,"tid":9,"id":84,"name":"transform prep: dex merger","args":{"span_id":"84","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","transform":"type: 30\nis_incremental: true\n"},"ph":"X","ts":1576857187925000,"dur":15000},{"pid":1,"tid":9,"id":85,"name":"transform: dex merger","args":{"span_id":"85","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","transform":"type: 30\nis_incremental: true\n"},"ph":"X","ts":1576857187940000,"dur":223000},{"pid":1,"tid":0,"id":83,"name":"task: transform","args":{"span_id":"83","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 65\ndid_work: true\nskipped: false\nup_to_date: false\nfailed: false\n"},"ph":"X","ts":1576857187886000,"dur":284000},{"pid":1,"tid":0,"id":86,"name":"task: merge source set folders","args":{"span_id":"86","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 41\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857188172000,"dur":8000},{"pid":1,"tid":0,"id":87,"name":"task: transform","args":{"span_id":"87","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 65\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857188181000,"dur":100000},{"pid":1,"tid":0,"id":88,"name":"task: unknown task type","args":{"span_id":"88","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","task":"type: 0\ndid_work: false\nskipped: true\nup_to_date: false\nfailed: false\n"},"ph":"X","ts":1576857188283000,"dur":1000},{"pid":1,"tid":0,"id":89,"name":"task: transform","args":{"span_id":"89","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 65\ndid_work: false\nskipped: true\nup_to_date: true\nfailed: false\n"},"ph":"X","ts":1576857188285000,"dur":24000},{"pid":1,"tid":0,"id":90,"name":"task: validate signing","args":{"span_id":"90","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 67\ndid_work: true\nskipped: false\nup_to_date: false\nfailed: false\n"},"ph":"X","ts":1576857188310000,"dur":3000},{"pid":1,"tid":0,"id":91,"name":"task: package application","args":{"span_id":"91","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","variant":"id: 1\nis_debug: true\nminify_enabled: false\nuse_multidex: true\nuse_legacy_multidex: true\nvariant_type: APPLICATION\nannotation_processors {\n spec: \"butterknife-compiler.jar (com.jakewharton:butterknife-compiler:8.8.1)\"\n}\njava8_lang_support: INTERNAL\nmin_sdk_version {\n api_level: 16\n}\ntarget_sdk_version {\n api_level: 27\n}\ndex_builder: DX_DEXER\ndex_merger: DX_MERGER\n","task":"type: 45\ndid_work: true\nskipped: false\nup_to_date: false\nfailed: false\n"},"ph":"X","ts":1576857188314000,"dur":1008000},{"pid":1,"tid":0,"id":92,"name":"task: unknown task type","args":{"span_id":"92","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n","task":"type: 0\ndid_work: false\nskipped: false\nup_to_date: false\nfailed: false\n"},"ph":"X","ts":1576857189323000,"dur":100},{"pid":1,"tid":8,"id":93,"name":"base plugin build finished","args":{"span_id":"93","project":"id: 1\nandroid_plugin_version: \"3.0.1\"\nandroid_plugin: APPLICATION\nplugin_generation: FIRST\nbuild_tools_version: \"26.0.2\"\ncompile_sdk: \"android-27\"\nsplits {\n}\nkotlin_plugin_version: \"1.3.50\"\n"},"ph":"X","ts":1576857189350000,"dur":100}]
{ "name": "@my-app/components", "version": "1.0.0", "private": false, "description": "", "main": "dist/index.js", "author": "", "license": "ISC", "scripts": { "start": "webpack --watch --config ../../webpack/webpack.dev.config", "build": "webpack --config ../../webpack/webpack.prod.config" }, "files": [ "dist" ], "dependencies": { "@material-ui/core": "^4.5.1" } }
{"geometry":{"type":"Polygon","coordinates":[[[2.413884,48.721297],[2.415067,48.719356],[2.415072,48.719358],[2.415042,48.719247],[2.415495,48.718492],[2.414849,48.718184],[2.408862,48.714901],[2.406448,48.713066],[2.404806,48.710556],[2.402778,48.706355],[2.401716,48.703555],[2.399978,48.700948],[2.396115,48.697568],[2.391191,48.693126],[2.390452,48.692142],[2.389143,48.692478],[2.389181,48.692554],[2.386713,48.692490],[2.385196,48.692450],[2.381731,48.692359],[2.378716,48.695208],[2.377544,48.696316],[2.371506,48.697402],[2.359667,48.699531],[2.354167,48.701557],[2.359136,48.705276],[2.365675,48.705849],[2.370233,48.706249],[2.367764,48.715672],[2.369610,48.718524],[2.370678,48.720173],[2.370683,48.720173],[2.386306,48.720455],[2.392554,48.721548],[2.397489,48.722412],[2.398377,48.722968],[2.403161,48.725960],[2.410981,48.726040],[2.410992,48.726040],[2.411011,48.726008],[2.413884,48.721297]]]},"properties":{"qs:a1r":"0\u00cele-de-France","qs:la":"Bruy\u00e8res-sur-Oise","geom:longitude":2.386873,"lbl:latitude":48.705220,"qs:loc_alt":"Athis-Mons","iso:country":"FR","src:geom_alt":[],"wof:geomhash":"eedd6ed22dae7ad4fd89d43c72cd5873","qs:level":"locality","wof:name":"Athis-Mons","src:geom":"quattroshapes","qs:adm0":"France","wof:breaches":[],"wof:hierarchy":[{"locality_id":101749035,"country_id":85633147,"region_id":85683371,"county_id":102064597}],"qs:la_lc":"*FR1195303116","qs:loc":"Athis-Mons","wof:id":101749035,"qs:pop":0,"lbl:longitude":2.391470,"wof:supersedes":[],"geom:area":0.001069,"qs:id":0,"geom:latitude":48.709301,"qs:source":"ACustom EuroGlobalMap + UMZ Urban Polygons + Geonames + GeoPlanet","name:fre_p":["Athis-Mons"],"src:centroid_lbl":"geonames","wof:belongsto":[85633147,85683371,102064597],"qs:type":"urban core","wof:placetype":"locality","gn:population":31225,"qs:a0":"France","qs:a1":"*Essonne","wof:lastmodified":1439924422,"wof:superseded_by":[],"wof:concordances":{"gn:id":3036460,"gp:id":55863418,"fct:id":"0a3f4aa6-8f76-11e1-848f-cfd5bf3ef515"},"wof:parent_id":102064597},"type":"Feature","bbox":[2.354167,48.692142,2.415495,48.726040],"id":101749035}
{ "201802070201": { "name":"白瀚洋" , "school":"电气工程学院" , "monitorA": "徐磊" , "monitorB": "谢晓莹" , "dormitory": "主校区-荷园4号楼-A单元.04户-1-4", "phone": "15206667699" }, "201802070202": { "name":"白佳辉" , "school":"电气工程学院" , "monitorA": "徐磊" , "monitorB": "谢晓莹" , "dormitory": "主校区-荷园4号楼-A单元.04户-1-4", "phone": "13992180403" }, "201802070110": { "name":"李金元" , "school":"电气工程学院" , "monitorA": "徐磊" , "monitorB": "谢晓莹" , "dormitory": "主校区-荷园4号楼-A单元.04户-1-4", "phone": "17614300223" }, "201802070221": { "name":"叶靖" , "school":"电气工程学院" , "monitorA": "徐磊" , "monitorB": "谢晓莹" , "dormitory": "主校区-荷园4号楼-A单元.05户-1-4", "phone": "17311832283" }, "201802070222": { "name":"余晨瑞" , "school":"电气工程学院" , "monitorA": "徐磊" , "monitorB": "谢晓莹" , "dormitory": "主校区-荷园4号楼-A单元.05户-1-4", "phone": "15932808048" }, "201807010106": { "name":"代杭" , "school":"管理工程学院" , "monitorA": "徐磊" , "monitorB": "谢晓莹" , "dormitory": "主校区-荷园4号楼-A单元.04户-1-4", "phone": "17614300223" }, "201802060125": { "name":"刘凯豪" , "school":"电气工程学院" , "monitorA": "徐磊" , "monitorB": "谢晓莹" , "dormitory": "主校区-荷园8号楼-B单元.05户-13-18", "phone": "15237480317" }, "201802070229": { "name":"朱觐镳" , "school":"电气工程学院" , "monitorA": "徐磊" , "monitorB": "谢晓莹" , "dormitory": "主校区-荷园4号楼-A单元.05户-5-8", "phone": "17836910686" } }
{"response":{"meta":{"hits":35,"time":17,"offset":0},"docs":[{"web_url":"http:\/\/www.nytimes.com\/2016\/09\/28\/sports\/real-madrid-settles-for-champions-league-tie-after-dortmunds-late-goal.html","snippet":"The Borussia Dortmund substitute Andr\u00e9 Sch\u00fcrrle scored in the 87th minute to earn his team a point and extend Madrid\u2019s winless skid....","lead_paragraph":"The Borussia Dortmund substitute Andr\u00e9 Sch\u00fcrrle scored in the 87th minute to earn his team a point and extend Madrid\u2019s winless skid.","abstract":null,"print_page":"12","blog":[],"source":"The New York Times","multimedia":[],"headline":{"main":"Real Madrid Settles for Champions League Tie After Dortmund\u2019s Late Goal","content_kicker":"Sports Briefing","kicker":"Sports Briefing","print_headline":"Real Madrid Settles for Tie After a Late Goal"},"keywords":[{"rank":"1","is_major":"N","name":"subject","value":"Soccer"},{"rank":"2","is_major":"N","name":"organizations","value":"Real Madrid (Basketball Team)"},{"rank":"3","is_major":"N","name":"organizations","value":"Borussia Dortmund (Soccer Team)"},{"rank":"4","is_major":"N","name":"subject","value":"Football"},{"rank":"5","is_major":"N","name":"persons","value":"Watt, J J (1989- )"},{"rank":"6","is_major":"N","name":"subject","value":"Baseball"},{"rank":"7","is_major":"N","name":"organizations","value":"Toronto Blue Jays"},{"rank":"8","is_major":"N","name":"organizations","value":"Baltimore Orioles"},{"rank":"9","is_major":"N","name":"subject","value":"Tennis"},{"rank":"10","is_major":"N","name":"persons","value":"Kerber, Angelique"}],"pub_date":"2016-09-28T04:00:00+0000","document_type":"article","news_desk":"Sports","section_name":"Sports","subsection_name":null,"byline":{"person":[],"original":"By THE ASSOCIATED PRESS","organization":"THE ASSOCIATED PRESS"},"type_of_material":"News","_id":"57eb3dbc95d0e021d7988bca","word_count":"1040","slideshow_credits":null},{"web_url":"http:\/\/www.nytimes.com\/2016\/09\/28\/sports\/olympics\/american-athlete-tax-break-vote.html","snippet":"Connecticut\u2019s Jim Himes, the only United States representative who voted against a bill to grant medalists a break on their bonuses, called it \u201ca lonely, lonely moment.\u201d...","lead_paragraph":"Connecticut\u2019s Jim Himes, the only United States representative who voted against a bill to grant medalists a break on their bonuses, called it \u201ca lonely, lonely moment.\u201d","abstract":null,"print_page":"10","blog":[],"source":"The New York Times","multimedia":[{"width":190,"url":"images\/2016\/09\/28\/sports\/28MACURweb1\/28MACURweb1-thumbWide.jpg","height":126,"subtype":"wide","legacy":{"wide":"images\/2016\/09\/28\/sports\/28MACURweb1\/28MACURweb1-thumbWide.jpg","wideheight":"126","widewidth":"190"},"type":"image"},{"width":600,"url":"images\/2016\/09\/28\/sports\/28MACURweb1\/28MACURweb1-articleLarge.jpg","height":399,"subtype":"xlarge","legacy":{"xlargewidth":"600","xlarge":"images\/2016\/09\/28\/sports\/28MACURweb1\/28MACURweb1-articleLarge.jpg","xlargeheight":"399"},"type":"image"},{"width":75,"url":"images\/2016\/09\/28\/sports\/28MACURweb1\/28MACURweb1-thumbStandard.jpg","height":75,"subtype":"thumbnail","legacy":{"thumbnailheight":"75","thumbnail":"images\/2016\/09\/28\/sports\/28MACURweb1\/28MACURweb1-thumbStandard.jpg","thumbnailwidth":"75"},"type":"image"}],"headline":{"main":"Tax Break for Olympic Heroes? A Sole Lawmaker Says No","content_kicker":"Sports of The Times","kicker":"Sports of The Times","print_headline":"Tax Break for Olympic Heroes? A Sole Lawmaker Says No "},"keywords":[{"rank":"1","is_major":"N","name":"subject","value":"Taxation"},{"rank":"2","is_major":"Y","name":"subject","value":"Olympic Games"},{"rank":"3","is_major":"Y","name":"persons","value":"Himes, James A (1966- )"},{"rank":"4","is_major":"N","name":"subject","value":"Law and Legislation"},{"rank":"5","is_major":"Y","name":"subject","value":"Income Tax"},{"rank":"6","is_major":"N","name":"organizations","value":"House of Representatives"},{"rank":"7","is_major":"N","name":"glocations","value":"Connecticut"}],"pub_date":"2016-09-28T04:00:00+0000","document_type":"article","news_desk":"Sports","section_name":"Sports","subsection_name":"Olympics","byline":{"person":[{"organization":"","role":"reported","firstname":"Juliet","rank":1,"lastname":"MACUR"}],"original":"By JULIET MACUR"},"type_of_material":"News","_id":"57ea90d695d0e021d79889f2","word_count":"878","slideshow_credits":null},{"web_url":"http:\/\/www.nytimes.com\/reuters\/2016\/09\/28\/sports\/soccer\/28reuters-soccer-fifa-guatemala.html","snippet":"A Guatemalan sports confederation has voted to reinstate a FIFA-appointed oversight committee, officials said, in a bid to head off the suspension of the country's national soccer federation....","lead_paragraph":"A Guatemalan sports confederation has voted to reinstate a FIFA-appointed oversight committee, officials said, in a bid to head off the suspension of the country's national soccer federation.","abstract":null,"print_page":null,"blog":[],"source":"","multimedia":[],"headline":{"main":"Guatemala Sports Body Backs Down in Fight With FIFA","print_headline":"Guatemala Sports Body Backs Down in Fight With FIFA"},"keywords":[],"pub_date":"2016-09-28T15:33:16Z","document_type":"article","news_desk":"None","section_name":"Sports","subsection_name":"Soccer","byline":{"person":[],"original":"By REUTERS","organization":"REUTERS"},"type_of_material":"News","_id":"57ebe38f95d0e021d7988dd0","word_count":null,"slideshow_credits":null},{"web_url":"http:\/\/www.nytimes.com\/aponline\/2016\/09\/28\/us\/ap-us-skateboarder-comes-out.html","snippet":"Professional skateboarder Brian Anderson has publicly come out as gay....","lead_paragraph":"Professional skateboarder Brian Anderson has publicly come out as gay.","abstract":null,"print_page":null,"blog":[],"source":"","multimedia":[],"headline":{"main":"Pro Skateboarder Brian Anderson Comes Out as Gay","print_headline":"Pro Skateboarder Brian Anderson Comes Out as Gay"},"keywords":[],"pub_date":"2016-09-28T17:15:01Z","document_type":"article","news_desk":"None","section_name":"U.S.","subsection_name":null,"byline":{"person":[],"original":"By THE ASSOCIATED PRESS","organization":"THE ASSOCIATED PRESS"},"type_of_material":"News","_id":"57ebfbdd95d0e021d7988e3e","word_count":null,"slideshow_credits":null},{"web_url":"http:\/\/www.nytimes.com\/reuters\/2016\/09\/28\/sports\/cycling\/28reuters-sport-doping-wada-tue.html","snippet":"The World Anti-Doping Agency (WADA) on Wednesday defended the Therapeutic Use Exemption (TUE) system after some athletes' confidential medical data was leaked by a group of Russian hackers, shedding light on potential abuse....","lead_paragraph":"The World Anti-Doping Agency (WADA) on Wednesday defended the Therapeutic Use Exemption (TUE) system after some athletes' confidential medical data was leaked by a group of Russian hackers, shedding light on potential abuse.","abstract":null,"print_page":null,"blog":[],"source":"","multimedia":[],"headline":{"main":"WADA Defends TUE System After Leaked Data","print_headline":"WADA Defends TUE System After Leaked Data"},"keywords":[],"pub_date":"2016-09-28T14:26:45Z","document_type":"article","news_desk":"None","section_name":"Sports","subsection_name":"Cycling","byline":{"person":[],"original":"By REUTERS","organization":"REUTERS"},"type_of_material":"News","_id":"57ebd36495d0e021d7988d86","word_count":null,"slideshow_credits":null},{"web_url":"http:\/\/www.nytimes.com\/reuters\/2016\/09\/28\/sports\/soccer\/28reuters-soccer-champions-lyo-violence.html","snippet":"Olympique Lyonnais president Jean-Michel Aulas was left fuming after Spanish police allegedly used excessive force when they charged the French club's fans ahead of the team's Champions League game at Sevilla on Tuesday....","lead_paragraph":"Olympique Lyonnais president Jean-Michel Aulas was left fuming after Spanish police allegedly used excessive force when they charged the French club's fans ahead of the team's Champions League game at Sevilla on Tuesday.","abstract":null,"print_page":null,"blog":[],"source":"","multimedia":[],"headline":{"main":"Lyon Fuming Over Spanish Police Show of Force","print_headline":"Lyon Fuming Over Spanish Police Show of Force"},"keywords":[],"pub_date":"2016-09-28T11:08:36Z","document_type":"article","news_desk":"None","section_name":"Sports","subsection_name":"Soccer","byline":{"person":[],"original":"By REUTERS","organization":"REUTERS"},"type_of_material":"News","_id":"57eba4f695d0e021d7988cdc","word_count":null,"slideshow_credits":null},{"web_url":"http:\/\/www.nytimes.com\/reuters\/2016\/09\/28\/sports\/olympics\/28reuters-olympics-kenya-charges.html","snippet":"Three former officials of Kenya's disbanded Olympic committee were charged on Wednesday with theft and fraud offences relating to this year's Games in Rio de Janeiro....","lead_paragraph":"Three former officials of Kenya's disbanded Olympic committee were charged on Wednesday with theft and fraud offences relating to this year's Games in Rio de Janeiro. ","abstract":null,"print_page":null,"blog":[],"source":"","multimedia":[],"headline":{"main":"Former Kenyan Officials Charged With Theft, Fraud","print_headline":"Former Kenyan Officials Charged With Theft, Fraud"},"keywords":[],"pub_date":"2016-09-28T12:55:27Z","document_type":"article","news_desk":"None","section_name":"Sports","subsection_name":"Olympics","byline":{"person":[],"original":"By REUTERS","organization":"REUTERS"},"type_of_material":"News","_id":"57ebbe3f95d0e021d7988d2b","word_count":null,"slideshow_credits":null},{"web_url":"http:\/\/www.nytimes.com\/aponline\/2016\/09\/28\/us\/ap-us-soda-tax-glance.html","snippet":"A soda tax is on the Nov. 8 ballots of three San Francisco Bay Area cities as part of a national movement by advocates to curb consumption of liquid sugar. Here's a closer look at the proposals:...","lead_paragraph":"A soda tax is on the Nov. 8 ballots of three San Francisco Bay Area cities as part of a national movement by advocates to curb consumption of liquid sugar. Here's a closer look at the proposals:","abstract":null,"print_page":null,"blog":[],"source":"","multimedia":[],"headline":{"main":"Things to Know About California Soda Tax Measures","print_headline":"Things to Know About California Soda Tax Measures"},"keywords":[],"pub_date":"2016-09-28T17:50:48Z","document_type":"article","news_desk":"None","section_name":"U.S.","subsection_name":null,"byline":{"person":[],"original":"By THE ASSOCIATED PRESS","organization":"THE ASSOCIATED PRESS"},"type_of_material":"News","_id":"57ec043495d0e021d7988e5d","word_count":null,"slideshow_credits":null},{"web_url":"http:\/\/www.nytimes.com\/2016\/09\/28\/learning\/questions-for-emotion-takes-center-stage-after-tragic-loss-of-jose-fernandez.html","snippet":"How did the team and the fans pay tribute to Fernandez during the Marlins\u2019 game against the Mets?...","lead_paragraph":"How did the team and the fans pay tribute to Fernandez during the Marlins\u2019 game against the Mets?","abstract":null,"print_page":null,"blog":[],"source":"The New York Times","multimedia":[{"width":190,"url":"images\/2016\/09\/27\/sports\/27sub-KEPNER\/27sub-KEPNER-thumbWide.jpg","height":126,"subtype":"wide","legacy":{"wide":"images\/2016\/09\/27\/sports\/27sub-KEPNER\/27sub-KEPNER-thumbWide.jpg","wideheight":"126","widewidth":"190"},"type":"image"},{"width":600,"url":"images\/2016\/09\/27\/sports\/27sub-KEPNER\/27sub-KEPNER-articleLarge.jpg","height":439,"subtype":"xlarge","legacy":{"xlargewidth":"600","xlarge":"images\/2016\/09\/27\/sports\/27sub-KEPNER\/27sub-KEPNER-articleLarge.jpg","xlargeheight":"439"},"type":"image"},{"width":75,"url":"images\/2016\/09\/27\/sports\/27sub-KEPNER\/27sub-KEPNER-thumbStandard.jpg","height":75,"subtype":"thumbnail","legacy":{"thumbnailheight":"75","thumbnail":"images\/2016\/09\/27\/sports\/27sub-KEPNER\/27sub-KEPNER-thumbStandard.jpg","thumbnailwidth":"75"},"type":"image"}],"headline":{"main":"Questions for: \u2018Emotion Takes Center Stage After Tragic Loss of Jose Fernandez\u2019","content_kicker":"Article of the Day","kicker":"Article of the Day"},"keywords":[],"pub_date":"2016-09-28T04:00:00+0000","document_type":"article","news_desk":"Learning","section_name":"The Learning Network","subsection_name":null,"byline":{"person":[{"organization":"","role":"reported","firstname":"Michael","rank":1,"lastname":"GONCHAR"}],"original":"By MICHAEL GONCHAR"},"type_of_material":"News","_id":"57eb7f9195d0e021d7988c62","word_count":"160","slideshow_credits":null},{"web_url":"http:\/\/www.nytimes.com\/reuters\/2016\/09\/28\/sports\/soccer\/28reuters-soccer-soccerex-mcclaren.html","snippet":"Former England manager Steve McClaren has expressed sympathy for Sam Allardyce who left his job as national team coach on Tuesday following a sting by the Daily Telegraph newspaper....","lead_paragraph":"Former England manager Steve McClaren has expressed sympathy for Sam Allardyce who left his job as national team coach on Tuesday following a sting by the Daily Telegraph newspaper.","abstract":null,"print_page":null,"blog":[],"source":"","multimedia":[],"headline":{"main":"McClaren Criticises Lack of Privacy Following Allardyce Departure","print_headline":"McClaren Criticises Lack of Privacy Following Allardyce Departure"},"keywords":[],"pub_date":"2016-09-28T16:48:43Z","document_type":"article","news_desk":"None","section_name":"Sports","subsection_name":"Soccer","byline":{"person":[],"original":"By REUTERS","organization":"REUTERS"},"type_of_material":"News","_id":"57ebf51d95d0e021d7988e27","word_count":null,"slideshow_credits":null}]},"status":"OK","copyright":"Copyright (c) 2013 The New York Times Company. All Rights Reserved."}
{"poster":"PabloDiT","date":"2015-05-11T06:11:23.101+0000","title":"Super Nerf Jinx - Da tank support le cammino in testa","subforum":"Discussioni generali","up_votes":1,"down_votes":4,"body":"Ovviamente &quot;cammino&quot; &egrave; un eufemismo, diciamo che a fine partita &egrave; diventata bionda.. La sua ulti in lane ormai &egrave; una puntura di zanzara, a questo punto molto megio quella di Ashe!\r\n\r\nCome gi&agrave; per Lucian, alla Riot si devono essere stancati di vederla pickata un buon 50% e pi&ugrave; delle partite, quindi adesso tutti su Sivir, Varus e Graves!","replies":[{"poster":"Firenheit","date":"2015-05-11T09:30:44.885+0000","up_votes":1,"down_votes":1,"body":"Perché devo leggere falsità, nel titolo, nell'argomentazione e nei commenti?\n1. Super Nerf Jinx - Da tank support le cammino in testa\n2. La sua ulti in lane ormai è una puntura di zanzara\n3. Ma dai ti toglieva mezza vita tra un po'\n4. Adesso la ulti serve come last hit\n5. Varus.\n\nPuoi dirmi esattamente cosa è cambiato? Mi spiego, cosa tu hai capito del cambiamento? Per capire se lo hai inteso...\n{{champion:222}} \n\n ","replies":[{"poster":"PabloDiT","date":"2015-05-11T10:06:42.859+0000","up_votes":2,"down_votes":1,"body":"Io gioco spesso supp e ti assicuro che almeno 3-4 kill in lane le perdi, vedi sta cosa blu che ti lancia addosso il cannone senza far danni, per poi venire bastonata di conseguenza","replies":[{"poster":"Firenheit","date":"2015-05-11T11:02:31.037+0000","up_votes":2,"down_votes":0,"body":"Mi dispiace per il tuo elo allora... Non è un'offesa, ma vuol dire che giochi con e contro persone che non sanno cosa fanno i personaggi che usano.\n**@Heavenly Yasha** ha risposto per te, non è cambiato nulla, hanno praticamente fixato una cosa.","replies":[{"poster":"PabloDiT","date":"2015-05-11T12:56:23.040+0000","up_votes":1,"down_votes":2,"body":"Non vorrai dire che una bella double lanciando il razzo sotto torre contro i due avversari con il 20% di vita non contava, adesso non si può più fare.. O quando sei a tu per tu con l'altro adc, adesso non hai più la ulti per prevalere, invece Varus, Graves e Ashe ce l'hanno","replies":[{"poster":"Firenheit","date":"2015-05-11T13:13:32.275+0000","up_votes":1,"down_votes":0,"body":"1. \"Non vorrai dire che una bella double lanciando il razzo sotto torre contro i due avversari con il 20% di vita non contava\"\nCosa ti sfugge del fatto che non è cambiato nulla?\n2. \"O quando sei a tu per tu con l'altro adc\" Se tu usavi la R per prevalere 1v1 contro un ADC vuol dire che non sai usarla...\n3. \"invece Varus, Graves e Ashe ce l'hanno\" \nVarus ha un cc, quindi cosa c'entra? \nAshe anche ha un CC, ma col range globale, infatti corpo a corpo non serve a niente.\nGraves ha un attacco con un range limitato, cosa c'entra?","replies":[{"poster":"PabloDiT","date":"2015-05-11T14:19:21.834+0000","up_votes":1,"down_votes":1,"body":"Eh no la ulti di ashe nel corpo a corpo serve eccome, fino a 600 danni piu stun, cioè un paio di attacchi se cominciamo con la stessa vita sei morto, Graves ti smezza solo con la ulti mentre Jinx ti fa la punturina","replies":[{"poster":"Firenheit","date":"2015-05-11T14:43:39.600+0000","up_votes":1,"down_votes":1,"body":"Scusa, ma la mia reputazione è che non hai capito come si usano questi champ, scusa davvero ma ormai penso questo. \nGraves è un ADC con un kit completamente diverso, la sua R è paragonabile ad un AA molto forte, non c'entra nulla quindi. \nAshe, come Jinx, ha una R che può essere sparata ovunque nella mappa, questo già in primis vuol dire che è una cosa ben diversa rispetto a Graves. \nParlando di danni, hai idea di quanti ne faccia Jinx? http://gameinfo.euw.leagueoflegends.com/it/game-info/champions/jinx/\nSe tu preferisci ultare da vicino piuttosto che andare di AA (e lascio da parte il discorso cast), vuol dire che è il campione NON adatto a te. Attenzione, in fight devi ultare, ed è per questo che il cambiamento di Jinx è stato solo a una distanza lei-suo naso. \nLa R di Ashe fa molti meno danni in confronto a quella di Jinx, ma effettivamente prescindono dalla distanza.\nhttp://gameinfo.euw.leagueoflegends.com/it/game-info/champions/ashe/\nFacendo meno danni, \"solo\" 600, per quando tu upperai la R al 3 dovresti fare già molti più danni di AA.","replies":[]}]}]}]}]},{"poster":"Heavenly Yasha","date":"2015-05-11T10:57:30.686+0000","up_votes":1,"down_votes":0,"body":"È cambiato solo il danno base che faceva lanciando la R in versione melee, per il resto ha lo stesso danno di prima.","replies":[]}]},{"poster":"O V T R Λ G E","date":"2015-05-11T19:46:15.224+0000","up_votes":1,"down_votes":0,"body":"un mio amico ci ha fatto una pentakill con jinx senza usare la ulti per dire","replies":[{"poster":"Firenheit","date":"2015-05-11T20:30:28.695+0000","up_votes":1,"down_votes":0,"body":"Anche io una o due, ma una R in mezzo la ho messa!","replies":[]}]}]},{"poster":"Nerderman","date":"2015-05-11T18:12:49.954+0000","up_votes":1,"down_votes":0,"body":"Secondo me, Jinx rimane ancora un buon pick.\nLa ulti farà anche meno danni, però basta per per lasthittare.","replies":[]},{"poster":"Whommy","date":"2015-05-11T07:20:12.969+0000","up_votes":1,"down_votes":0,"body":"tranquillo graves sparisce alla prossima patch","replies":[]},{"poster":"Darki200","date":"2015-05-11T13:17:59.460+0000","up_votes":1,"down_votes":1,"body":"daje che basta una botrk e una lw e cammini tu in testa ai tank.. che se usi la ulti per fare i teamfight invece che per cercare di finire i nemici sopravvissuti sei tu che sbagli.. (parla un main jinx qui)","replies":[]}]}
{"Name":"[90]Aurablade Spear Recipe","Id":11120,"data":["11120","1477","1478","[90]Aurablade Spear Recipe","4120","4452","2352","1","600","1","0"]}
{"Name":"Hidden Atlas","Id":22956,"data":["22956","Hidden Atlas","606","9999","0"]}
{ "id": 236890123, "type": "Feature", "properties": { "addr:full":"Broomlee Yard West Linton Midlothian EH46 7BT", "addr:housenumber":"", "addr:postcode":"eh46 7bt", "addr:street":"", "edtf:cessation":"uuuu", "edtf:inception":"uuuu", "geom:area":0.0, "geom:area_square_m":0.0, "geom:bbox":"-3.354514,55.749031,-3.354514,55.749031", "geom:latitude":55.749031, "geom:longitude":-3.354514, "iso:country":"GB", "mz:hierarchy_label":1, "mz:is_current":-1, "sg:address":"Broomlee Yard", "sg:city":"West Linton", "sg:classifiers":[ { "category":"Utilities", "subcategory":"Fuel Oil & Lpg", "type":"Services" } ], "sg:owner":"simplegeo", "sg:phone":"+44 1968 660363", "sg:postcode":"EH46 7BT", "sg:province":"Midlothian", "sg:tags":[ "merchant", "coal", "smokeless" ], "src:geom":"simplegeo", "wof:belongsto":[ 85633159, 101873481, 85684241 ], "wof:breaches":[], "wof:concordances":{ "sg:id":"SG_7lfXtpSPxE5Z5m4VJgJuIr_55.749031_-3.354514@1300740562" }, "wof:country":"GB", "wof:geomhash":"12438f5e340c8b235d23f0d7c32692f8", "wof:hierarchy":[ { "continent_id":-1, "country_id":85633159, "locality_id":101873481, "neighbourhood_id":-1, "region_id":85684241, "venue_id":236890123 } ], "wof:id":236890123, "wof:lastmodified":1496964160, "wof:name":"Nicol Bros", "wof:parent_id":-1, "wof:placetype":"venue", "wof:repo":"whosonfirst-data-venue-gb", "wof:superseded_by":[], "wof:supersedes":[], "wof:tags":[ "merchant", "coal", "smokeless" ] }, "bbox": [ -3.354514, 55.749031, -3.354514, 55.749031 ], "geometry": {"coordinates":[-3.354514,55.749031],"type":"Point"} }
{ "groups": [ { "name": "Bay Area OpenStreetMappers" , "contact": "Ben Discoe" , "Meetup": "https://www.meetup.com/Bay-Area-OpenStreetMappers/" } , { "name": "Chattanooga" , "contact": "Jenny Park" , "Facebook": "https://www.facebook.com/home.php?sk=group_123483951073256" , "wiki_city": "https://wiki.openstreetmap.org/wiki/Chattanooga" } , { "name": "DFWosm" , "contact": "Andrew Matheny" , "contact_wiki": "https://wiki.openstreetmap.org/wiki/User:Andrew_Matheny" , "website": "http://dfwosm.org/" , "wiki_city": "https://wiki.openstreetmap.org/wiki/Dallas,_Texas" } , { "name": "GeoPhilly" , "contact": "Dan Ford" , "Meetup": "https://www.meetup.com/GeoPhilly/" } , { "name": "MapMinnesota" , "website": "http://www.mapminnesota.org/" , "wiki": "https://wiki.openstreetmap.org/wiki/MapMinnesota" } , { "name": "MappingDC" , "contact": "Brian DeRocher" , "contact_email": "brian@derocher.org" , "contact2": "Steven Johnson" , "contact2_email": "sejohnson8@gmail.com" , "GitHub": "https://github.com/mappingdc/" , "Meetup": "http://www.meetup.com/MappingDC/" , "wiki": "https://wiki.openstreetmap.org/wiki/MappingDC" , "Slack": "https://osmus.slack.com/messages/C1YLUUR19" , "Twitter": "@mappingdc" , "wiki_city": "https://wiki.openstreetmap.org/wiki/Washington_DC" } , { "name": "opencleveland" , "contact": "Anastasia Diamond-Ortiz" , "contact2": "Will Skora" , "Meetup": "https://www.meetup.com/open-cleveland/" , "Twitter": "@opencleveland" } , { "name": "OpenDataSTL" , "contact": "Abhi Nemani" , "Meetup": "https://www.meetup.com/Open-Data-STL/" , "website": "http://opendatastl.org/" , "wiki_city": "https://wiki.openstreetmap.org/wiki/St._Louis,_Missouri" } , { "name": "OpenStreetMap Boston" , "contact": "Lars Ahlzen" , "contact_wiki": "https://wiki.openstreetmap.org/wiki/User:Ahlzen" , "Meetup": "https://www.meetup.com/OpenStreetMap-Boston/" , "wiki_city": "https://wiki.openstreetmap.org/wiki/Boston,_Massachusetts" } , { "name": "OpenStreetMap Georgia" , "wiki_city": "https://wiki.openstreetmap.org/wiki/Decatur,_Georgia" } , { "name": "OpenStreetMap North Puget Sound" , "contact": "Clifford Snow" , "Meetup": "https://www.meetup.com/OpenStreetMap-North-Puget-Sound/" } , { "name": "OpenStreetMap NYC" , "contact": "Jeff Ferzoco" , "Meetup": "https://www.meetup.com/osm-nyc/" } , { "name": "OpenStreetMap Seattle" , "contact": "Chase Stephens" , "contact_email": "seattlefyi@gmail.com" , "contact2": "Paul McCombs" , "contact2_email": "pablo@imperium.org" , "mailing_list": "https://lists.openstreetmap.org/listinfo/Talk-us-pugetsound" , "Meetup": "https://www.meetup.com/OpenStreetMap-Seattle/" , "Twitter": "@osm_seattle" , "wiki_city": "https://wiki.openstreetmap.org/wiki/Seattle,_Washington" } , { "name": "OpenStreetMap St Louis Mid America Mappers" , "contact": "Rick Marshall" , "Meetup": "https://www.meetup.com/OpenStreetMap-St-Louis-Mid-America-Mappers/" } , { "name": "OpenStreetMap Utah" , "contact": "Martijn van Exel" , "contact_email": "m@rtijn.org" , "contact_wiki": "https://wiki.openstreetmap.org/wiki/User:Mvexel" , "Meetup": "https://www.meetup.com/OpenStreetMap-Utah/" , "wiki_city": "https://wiki.openstreetmap.org/wiki/OpenStreetMap_Utah" } , { "name": "OSM Colorado" , "contact": "Russell Deffner" , "contact_email": "russdeffner@gmail.com" , "Meetup": "http://www.meetup.com/OSM-Colorado/" , "wiki_city": "https://wiki.openstreetmap.org/wiki/Denver,_Colorado" } , { "name": "OpenStreetMap Portland" , "contact": "Madeline Steele" , "Meetup": "https://www.meetup.com/OpenStreetMap-Portland/" } , { "name": "OSM Southern California" , "contact": "Carlott Wolter" , "contact2": "Richard Kachelriess" , "contact2_email": "rkachelriess@esri.com" , "Meetup": "https://www.meetup.com/OSM-Southern-California/" } , { "name": "OSM Tampa Bay" , "contact": "Coleman McCormick" , "contact_email": "cmccormick@gmail.com" , "contact_wiki": "https://wiki.openstreetmap.org/wiki/User:Coleman" , "Meetup": "http://www.meetup.com/osmtampabay/" , "wiki_city": "https://wiki.openstreetmap.org/wiki/Tampa,_Florida" } , { "name": "OSM Wyoming" , "contact": "Russell Deffner" , "Meetup": "https://www.meetup.com/OSM-Wyoming/" } , { "name": "PHXGeo" , "Meetup": "https://www.meetup.com/PHXGeo/" , "contact": "Ryan Arp" , "Twitter": "@phxgeo" } , { "name": "Western Slope OpenStreetMap" , "contact": "Aaron Young" , "Meetup": "https://www.meetup.com/Western-Slope-OpenStreetMap/" , "wiki_city": "https://wiki.openstreetmap.org/wiki/Grand_Junction" } ] }
[ { "city_name":"서울", "state":12, "celsius":17.8, "rainfall_probability":60 }, { "city_name":"춘천", "state":10, "celsius":8.5, "rainfall_probability":20 }, { "city_name":"강릉", "state":13, "celsius":14.3, "rainfall_probability":30 }, { "city_name":"천안", "state":13, "celsius":26.5, "rainfall_probability":50 }, { "city_name":"세종", "state":13, "celsius":24.8, "rainfall_probability":60 }, { "city_name":"청주", "state":11, "celsius":14.5, "rainfall_probability":80 }, { "city_name":"대전", "state":13, "celsius":25.5, "rainfall_probability":20 }, { "city_name":"대구", "state":11, "celsius":23.2, "rainfall_probability":80 }, { "city_name":"울산", "state":12, "celsius":5.3, "rainfall_probability":70 }, { "city_name":"전주", "state":11, "celsius":15.2, "rainfall_probability":40 }, { "city_name":"광주", "state":12, "celsius":21.8, "rainfall_probability":90 }, { "city_name":"목포", "state":10, "celsius":24.3, "rainfall_probability":50 }, { "city_name":"부산", "state":13, "celsius":6.2, "rainfall_probability":20 }, { "city_name":"여수", "state":10, "celsius":9.8, "rainfall_probability":60 }, { "city_name":"제주", "state":11, "celsius":8.2, "rainfall_probability":40 } ]
{"poster":"ssenkaeW","date":"2018-07-12T22:04:58.303+0000","title":"Suchen Top oder Jungler für Flex in ca 20 min (Plat)","subforum":"Clans & Teams","up_votes":1,"down_votes":0,"body":"Gr&uuml;&szlig; dich,\r\n\r\nsuchen jemanden der flexibel Top oder Jungle spielen als 5ten Mann f&uuml;r flex.\r\n\r\nEinfach adden ssenkaeW","replies":[]}
{"Plot": "The equally-straight-laced and \"by the book\" nephew of Joe Friday must work with his more laid-back partner to solve a mystery.", "Rated": "PG-13", "Response": "True", "Language": "English", "Title": "Dragnet", "Country": "USA", "Writer": "Dan Aykroyd, Alan Zweibel, Tom Mankiewicz", "Metascore": "N/A", "imdbRating": "5.9", "Director": "Tom Mankiewicz", "Released": "26 Jun 1987", "Actors": "Dan Aykroyd, Tom Hanks, Christopher Plummer, Harry Morgan", "Year": "1987", "Genre": "Comedy, Crime", "Awards": "N/A", "Runtime": "106 min", "Type": "movie", "Poster": "https://images-na.ssl-images-amazon.com/images/M/MV5BMTUyOTMzNjk0M15BMl5BanBnXkFtZTcwNzc5MjUyMQ@@._V1_SX300.jpg", "imdbVotes": "26,085", "imdbID": "tt0092925"}
{ "id": 16, "name": "My own book", "slug": "my-own-book", "description": "This is my own little book - updated", "created_at": "2020-01-12T14:09:59.000000Z", "updated_at": "2020-01-12T14:16:10.000000Z", "created_by": 1, "updated_by": 1, "owned_by": 1 }
{"ast":null,"code":"export const Navbar = [{\n route: '#home',\n icon: 'Home',\n name: 'Inicio'\n}, {\n route: '#about',\n icon: 'UserDetail',\n name: 'Sobre Mi'\n}, {\n route: '#education',\n icon: 'GraduationCap',\n name: 'Educacion'\n}, {\n route: '#skills',\n icon: 'Books',\n name: 'Habilidades'\n}, {\n route: '#experience',\n icon: 'Work',\n name: 'Experiencia'\n}, {\n route: '#portfolio',\n icon: 'Slideshow',\n name: 'Portafolios'\n}, {\n route: '#interest',\n icon: 'Heart',\n name: 'Intereses'\n}, {\n route: '#contact',\n icon: 'ContactMail',\n name: 'Contactame'\n}];","map":{"version":3,"sources":["/Users/alirioangel/desarrollos/repositorios/proyectos_personales/my-portfolio/Components/menuLinks/_nav.js"],"names":["Navbar","route","icon","name"],"mappings":"AAAA,OAAO,MAAMA,MAAM,GAAG,CACpB;AACEC,EAAAA,KAAK,EAAE,OADT;AAEEC,EAAAA,IAAI,EAAE,MAFR;AAGEC,EAAAA,IAAI,EAAE;AAHR,CADoB,EAMpB;AACEF,EAAAA,KAAK,EAAE,QADT;AAEEC,EAAAA,IAAI,EAAE,YAFR;AAGEC,EAAAA,IAAI,EAAE;AAHR,CANoB,EAWpB;AACEF,EAAAA,KAAK,EAAE,YADT;AAEEC,EAAAA,IAAI,EAAE,eAFR;AAGEC,EAAAA,IAAI,EAAE;AAHR,CAXoB,EAgBpB;AACEF,EAAAA,KAAK,EAAE,SADT;AAEEC,EAAAA,IAAI,EAAE,OAFR;AAGEC,EAAAA,IAAI,EAAE;AAHR,CAhBoB,EAqBpB;AACEF,EAAAA,KAAK,EAAE,aADT;AAEEC,EAAAA,IAAI,EAAE,MAFR;AAGEC,EAAAA,IAAI,EAAE;AAHR,CArBoB,EA0BpB;AACEF,EAAAA,KAAK,EAAE,YADT;AAEEC,EAAAA,IAAI,EAAE,WAFR;AAGEC,EAAAA,IAAI,EAAE;AAHR,CA1BoB,EA+BpB;AACEF,EAAAA,KAAK,EAAE,WADT;AAEEC,EAAAA,IAAI,EAAE,OAFR;AAGEC,EAAAA,IAAI,EAAE;AAHR,CA/BoB,EAoCpB;AACEF,EAAAA,KAAK,EAAE,UADT;AAEEC,EAAAA,IAAI,EAAE,aAFR;AAGEC,EAAAA,IAAI,EAAE;AAHR,CApCoB,CAAf","sourcesContent":["export const Navbar = [\n {\n route: '#home',\n icon: 'Home',\n name: 'Inicio',\n },\n {\n route: '#about',\n icon: 'UserDetail',\n name: 'Sobre Mi',\n },\n {\n route: '#education',\n icon: 'GraduationCap',\n name: 'Educacion',\n },\n {\n route: '#skills',\n icon: 'Books',\n name: 'Habilidades',\n },\n {\n route: '#experience',\n icon: 'Work',\n name: 'Experiencia',\n },\n {\n route: '#portfolio',\n icon: 'Slideshow',\n name: 'Portafolios',\n },\n {\n route: '#interest',\n icon: 'Heart',\n name: 'Intereses',\n },\n {\n route: '#contact',\n icon: 'ContactMail',\n name: 'Contactame',\n },\n];\n"]},"metadata":{},"sourceType":"module"}
{"lines":[{"id":"D96E0773-C559-4747-910A-1957151A29BB","content":"cur\n","styles":[],"paragraphType":"title","attachments":[]},{"id":"0347000C-AF4C-4AE8-8300-06414326103B","content":"\n","styles":[],"attachments":[]},{"id":"49B38145-AD06-4FB3-9DAA-842A2BC50EA5","content":"\n","styles":[],"attachments":[]},{"id":"A1DBC790-3ED5-4F61-97E3-2F22A2429556","content":"\n","styles":[],"paragraphType":"body","attachments":[{"percentageWidth":1,"content":"https:\/\/blog.csdn.net\/breaksoftware\/article\/details\/81564405","type":"link","name":"C1B86FB9-8975-48FB-B47D-858BCBA9B678","location":0}]},{"id":"548F29A4-890A-435E-B52B-13A85C4C7F5E","content":"\n","styles":[],"attachments":[]},{"id":"FA9B0BD9-AD98-48BB-8C8B-082F6D613ED4","content":"## stamped_lock\n","styles":[],"attachments":[]},{"id":"0D8A9D6A-6223-47A1-848D-339D2179960E","content":"\n","styles":[],"paragraphType":"body","attachments":[{"percentageWidth":1,"content":"https:\/\/www.liaoxuefeng.com\/wiki\/1252599548343744\/1309138673991714","type":"link","name":"FDD1339F-36FD-45E2-918D-C4A7ED597C00","location":0}]},{"id":"60ECEC12-5EA1-4E67-8DDE-02D712433140","content":"\n","styles":[],"paragraphType":"body","attachments":[{"percentageWidth":1,"content":"https:\/\/tech.meituan.com\/2018\/11\/15\/java-lock.html","type":"link","name":"B261F576-2772-414E-A295-84F6F3029FCE","location":0}]},{"id":"647DF93A-886C-43D9-927A-E3894AC2EE11","content":"\n","styles":[],"attachments":[]},{"id":"1A5598C5-040F-4272-974F-054F6D2214C2","content":"clickhouse\n","styles":[],"attachments":[]},{"id":"60D7F118-BF9D-4B16-8DCE-F7F3F436A036","content":"\n","styles":[],"attachments":[]},{"id":"CD78AAA1-0583-443C-B95C-33D778FFA65B","content":"\n","styles":[],"attachments":[]},{"id":"155B0C60-E169-4ED8-8DFF-4F1C8FDF2E4F","content":"\n","styles":[],"attachments":[]},{"id":"D0B9B4C9-4C48-4DE3-991E-87E570204FFD","content":"\n","styles":[],"attachments":[]},{"id":"77658845-215A-4290-BB44-63F070D434F2","content":"\n","styles":[],"attachments":[]},{"id":"BCBA50D4-7724-4688-8F1A-71F31828BFCC","content":"\n","styles":[],"attachments":[]},{"id":"D0DA28A7-C958-4591-A156-83F9F7831E56","content":"\n","styles":[],"attachments":[]},{"id":"D53C7B6A-FA4A-4374-BEDC-AD2CD72D5676","content":"\n","styles":[],"attachments":[]},{"id":"1F3A86F4-19DA-4BA0-A786-83AF2C3918EB","content":"\n","styles":[],"attachments":[]},{"id":"17195779-28C2-49B2-BF4D-57281EECDDF8","content":"\n","styles":[],"attachments":[]},{"id":"A84D11B7-4DB5-4C87-8D56-D63DB4F90467","content":"\n","styles":[],"attachments":[]},{"id":"C3886BF4-8705-481B-8041-2AE5AF8D23B3","content":"\n","styles":[],"attachments":[]},{"id":"E900B51B-7D45-4D5E-A1FD-765517AE7DEE","content":"\n","styles":[],"attachments":[]},{"id":"268A1B26-A31A-4A29-9391-1A22DFFF7C04","content":"\n","styles":[],"attachments":[]},{"id":"3254F6A8-6882-4079-A02C-BE8AF3728017","content":"\n","styles":[],"attachments":[]},{"id":"A6EC7909-1786-403A-A6A4-725C61622E8A","content":"\n","styles":[],"attachments":[]},{"id":"2E34055B-9CB6-488C-ADE4-D6BBEED216E8","content":"\n","styles":[],"attachments":[]},{"id":"D7AC3EFC-B107-4990-B0F4-DA70FBC408C4","content":"\n","styles":[],"attachments":[]},{"id":"A1D2637C-40D1-41B0-A87B-BDB75AB0846D","content":"\n","styles":[],"attachments":[]},{"id":"AA4BEA57-5B0D-4210-B131-52FB1A8632F7","content":"\n","styles":[],"attachments":[]},{"id":"1AE86243-2D8D-49B8-BE18-8721D89C38DA","content":"\n","styles":[],"attachments":[]},{"id":"A2B0795D-1839-44D6-8D68-8805280C7C90","content":"","styles":[],"attachments":[]}]}
[{"name":"google-palette","version":"1.1.0","description":"Script for generating colour palettes for use with graphs, charts and cartography.","repository":"git+https:\/\/github.com\/google\/palette.js.git","keyfiles":"palette.js","keywords":["palette","palette.js","palettejs","google","google-color-palette"],"npm":"google-palette"},{"name":"google-palette","version":"1.1.0","description":"Script for generating colour palettes for use with graphs, charts and cartography.","repository":"git+https:\/\/github.com\/google\/palette.js.git","keyfiles":"palette.js","keywords":["palette","palette.js","palettejs","google","google-color-palette"],"npm":"google-palette"}]
{ "name": "scrollup", "homepage": "https://github.com/markgoodyear/scrollup", "version": "2.1.1", "_release": "2.1.1", "_resolution": { "type": "version", "tag": "v2.1.1", "commit": "85d135fbe28a7ebee103e4c2411df51968940754" }, "_source": "git://github.com/markgoodyear/scrollup.git", "_target": "~2.1.1", "_originalSource": "scrollup", "_direct": true }
{ "0": { "id": 0, "type": "biome", "name": "Desert Biome", "description": "Healthy biome: Cannot interact with any cards in this biome" }, "1": { "id": 1, "type": "creature", "name": "Poppy", "tier": "P", "points": 0.25, "Biome": ["Desert"] } }
{ "_id" : ObjectId("56876d04e00daa4deddf5b68"), "name" : "TagBoss", "alias" : "tagboss", "url" : "http://www.wohlig.co.in/tagboss", "Api" : [ ObjectId("568d5e3c9bb3bbbf0cb733af"), ObjectId("56876d4ce00daa4deddf5b69") ], "__v" : NumberInt(3) } { "_id" : ObjectId("568a0a9eeea180360a91084b"), "name" : "jagruti", "alias" : "jagruti", "url" : "http://wohlig.biz:111/jagruti", "Api" : [ ObjectId("571098ee63e5cb5c023f9870") ], "__v" : NumberInt(5) } { "_id" : ObjectId("568cadd430da9499a69a0b28"), "name" : "CCC", "alias" : "noball", "url" : "http://wohlig.co.in/cccbackend/index.php", "Api" : [ ObjectId("568cb65d30da9499a69a0b2a"), ObjectId("568cb98030da9499a69a0b2d"), ObjectId("568cb02e30da9499a69a0b29"), ObjectId("568cbcd5b46e1216021a2124"), ObjectId("568cc2f2b46e1216021a2125"), ObjectId("568cc65db46e1216021a212a"), ObjectId("568cc72db46e1216021a212b"), ObjectId("568cc7d8b46e1216021a212c"), ObjectId("568cc8cdb46e1216021a212d"), ObjectId("568ccecdb46e1216021a2133"), ObjectId("568ccf38b46e1216021a2134"), ObjectId("568ccb53b46e1216021a212e"), ObjectId("568ccbdcb46e1216021a212f"), ObjectId("568cce80b46e1216021a2131"), ObjectId("568ccea9b46e1216021a2132"), ObjectId("5695f8f59b7acdb102e9a5ad"), ObjectId("5695f7c79b7acdb102e9a5ac"), ObjectId("568ce3b68b602dee08c19a5e"), ObjectId("568ce3e736c70cfb08ed6ae3"), ObjectId("568cf0e33443d154095a0dfc"), ObjectId("568cf4513443d154095a0dfd"), ObjectId("568e1db0f20c191e02291485"), ObjectId("568e3f21f20c191e02291486"), ObjectId("568e62840d2ea7200a7bf341"), ObjectId("568fb7a38af9c187088266d4"), ObjectId("5693566ac6a56fb00348031b"), ObjectId("569357c8c6a56fb00348031c"), ObjectId("56938666c6a56fb00348031d"), ObjectId("56938a33c6a56fb00348031e"), ObjectId("56938acac6a56fb00348031f"), ObjectId("5695df669b7acdb102e9a5ab"), ObjectId("56948bfe555b39fc028fb541"), ObjectId("56948c27555b39fc028fb542"), ObjectId("569611d69b7acdb102e9a5ae"), ObjectId("569612199b7acdb102e9a5af"), ObjectId("569dea83a43de2270d13a8e3") ], "__v" : NumberInt(45) } { "_id" : ObjectId("568cfb833443d154095a0dff"), "name" : "Other", "alias" : "other", "url" : "http://www.wohlig.co.in/other", "__v" : NumberInt(5), "Api" : [ ObjectId("568d71768ceb34dd0f2f7ec0"), ObjectId("568a0ba3eea180360a91084d"), ObjectId("568cf9d93443d154095a0dfe"), ObjectId("568cfc263443d154095a0e00") ] } { "_id" : ObjectId("569a08518cdb52782daa2a84"), "name" : "SelfCare", "alias" : "takecare", "url" : "http://wohlig.co.in/selfcareback/index.php", "Api" : [ ObjectId("56aef441149aa3720a78e37f"), ObjectId("569a09ba8cdb52782daa2a85"), ObjectId("569a28508cdb52782daa2a86"), ObjectId("56a09b1b0589c95b091a5fef"), ObjectId("56a0ce310589c95b091a5ff2"), ObjectId("56a0bdc40589c95b091a5ff1"), ObjectId("569a39978cdb52782daa2a87"), ObjectId("56a082d10589c95b091a5fee"), ObjectId("56a0adb70589c95b091a5ff0"), ObjectId("56a0d3b00589c95b091a5ff3"), ObjectId("56a0d41f0589c95b091a5ff4"), ObjectId("56a1c5c06f8b8de603e70dcd"), ObjectId("56a1e7076f8b8de603e70dce"), ObjectId("56a1f9166f8b8de603e70dcf"), ObjectId("56a32d8b19afbfa80451db7b"), ObjectId("56a32de519afbfa80451db7c"), ObjectId("56a32f5b19afbfa80451db7d"), ObjectId("56a352fa19afbfa80451db7e"), ObjectId("56a5b50378af853f055b2c85"), ObjectId("56a5b54778af853f055b2c86"), ObjectId("56a5b59478af853f055b2c87"), ObjectId("56a5cd9d78af853f055b2c88"), ObjectId("56a5da1578af853f055b2c89"), ObjectId("56a85cd1dc9773490521c001"), ObjectId("56a85d21dc9773490521c002"), ObjectId("56aef6df149aa3720a78e380"), ObjectId("56aef95b149aa3720a78e382"), ObjectId("56aef7f0149aa3720a78e381") ], "__v" : NumberInt(23) } { "_id" : ObjectId("56b0822dc9af581404ffcbd5"), "name" : "Mobile", "alias" : "mobileApp", "url" : "http://wohlig.co.in/MobileBackEnd", "Api" : [ ObjectId("56b08a86c9af581404ffcbd8"), ObjectId("56b0aed4c9af581404ffcbda"), ObjectId("56b18c9f5474b33c02f26b3e"), ObjectId("56b1ac4b5474b33c02f26b42"), ObjectId("56b1b6075474b33c02f26b45"), ObjectId("56b1b8c85474b33c02f26b46") ], "__v" : NumberInt(7) } { "_id" : ObjectId("56b0855fc9af581404ffcbd7"), "name" : "Countries", "alias" : "CountriesApp", "url" : "http://www.wohlig.co.in/CountriesApp", "Api" : [ ObjectId("56b09994c9af581404ffcbd9"), ObjectId("56b0af8bc9af581404ffcbdb"), ObjectId("56b1952f5474b33c02f26b3f"), ObjectId("56b197535474b33c02f26b40"), ObjectId("56b1a5b15474b33c02f26b41"), ObjectId("56b1ac615474b33c02f26b43"), ObjectId("56b1acb65474b33c02f26b44") ], "__v" : NumberInt(7) } { "_id" : ObjectId("56b1cfdc5474b33c02f26b47"), "name" : "MyProject", "alias" : "myApp", "url" : "http://wohlig.co.in/MyBackEnd", "Api" : [ ObjectId("56b1da495474b33c02f26b48"), ObjectId("56b1f1206c07aa245719bd5b"), ObjectId("56b2e55956b3bc0f021f4990"), ObjectId("56b4435ec45d4e040940eb24"), ObjectId("56b443a3c45d4e040940eb25"), ObjectId("56b443efc45d4e040940eb26") ], "__v" : NumberInt(6) } { "_id" : ObjectId("56b1e67e6c07aa245719bd59"), "name" : "Forms", "alias" : "formProject", "url" : "http://www.wohlig.co.in/formProject", "Api" : [ ObjectId("56b1e8b66c07aa245719bd5a"), ObjectId("56b3496156b3bc0f021f4991") ], "__v" : NumberInt(2) } { "_id" : ObjectId("56bb07a0da40ad4702f4dec4"), "name" : "TMM", "alias" : "tmm", "url" : "http://www.wohlig.io/tmmbackend/site/index.php", "Api" : [ ObjectId("56bb0801da40ad4702f4dec5") ], "__v" : NumberInt(1) } { "_id" : ObjectId("56b9881b361e0c880296120a"), "name" : "euro", "alias" : "euro", "url" : "http://wohlig.co.in/euro", "Api" : [ ObjectId("56b98da2361e0c880296120c"), ObjectId("56b98c73361e0c880296120b"), ObjectId("56b98eee361e0c880296120d"), ObjectId("56b99086361e0c880296120e"), ObjectId("56b992e8361e0c8802961210"), ObjectId("56b994c5361e0c8802961211"), ObjectId("56b996d2361e0c8802961212"), ObjectId("56b99b22361e0c8802961213"), ObjectId("56bb0e34da40ad4702f4dec6"), ObjectId("56bc209b84fb3a9b0b13bc8f"), ObjectId("56bc2cb384fb3a9b0b13bc90"), ObjectId("56bc2e2484fb3a9b0b13bc91"), ObjectId("56bc7b1c84fb3a9b0b13bc99"), ObjectId("56c3183e67ee0cff09ae5e82"), ObjectId("56c40668ff484f0804200714"), ObjectId("56c6eefa6114076804a01ec5") ], "__v" : NumberInt(21) } { "_id" : ObjectId("56c6c4546114076804a01eba"), "name" : "Flexi", "alias" : "flexi", "url" : "http://wohlig.co.in/flexi", "Api" : [ ObjectId("56c6c5836114076804a01ebb"), ObjectId("56c6c6716114076804a01ebc"), ObjectId("56c6c8d66114076804a01ebd"), ObjectId("56c6e99b6114076804a01ec0"), ObjectId("56c6e98e6114076804a01ebf"), null, ObjectId("56c6eb256114076804a01ec2"), ObjectId("56c6ebf36114076804a01ec3"), ObjectId("56c6f2fc6114076804a01ec6"), ObjectId("56c6fba46114076804a01eca"), ObjectId("56c6fac86114076804a01ec9"), ObjectId("56c6ed0a6114076804a01ec4"), ObjectId("56c6f9d06114076804a01ec8"), ObjectId("56c6f54e6114076804a01ec7"), null, ObjectId("56c700fe6114076804a01ecb"), ObjectId("56c7ff7c8352343802f6d491"), ObjectId("56d14a7a3d8acdfd0214a8c2") ], "__v" : NumberInt(6) } { "_id" : ObjectId("56d52bdf2a28964a03973d18"), "name" : "Blazen", "alias" : "blazen", "url" : "http://blazen.io/blazen", "Api" : [ ObjectId("57025d90b7158a91024fa87d"), ObjectId("56ebf5b12cc4129e02d7ff78"), ObjectId("56d53f4b2a28964a03973d1b"), ObjectId("56d5461c2a28964a03973d1c"), ObjectId("56d548102a28964a03973d1d"), ObjectId("56d576df2a28964a03973d29"), ObjectId("56d548962a28964a03973d1e"), ObjectId("56d577f52a28964a03973d2a"), ObjectId("56d57a072a28964a03973d2b"), ObjectId("56d57aeb2a28964a03973d2c"), ObjectId("56d56d4d2a28964a03973d23"), ObjectId("56d54b002a28964a03973d1f"), ObjectId("56d54bce2a28964a03973d20"), ObjectId("56d54c952a28964a03973d21"), ObjectId("56d54ca32a28964a03973d22"), ObjectId("56d572162a28964a03973d24"), ObjectId("56d575902a28964a03973d27"), ObjectId("56d575a42a28964a03973d28"), ObjectId("56d574b42a28964a03973d25"), ObjectId("56d5821f2a28964a03973d2e"), ObjectId("56d574f42a28964a03973d26"), ObjectId("56d581ce2a28964a03973d2d"), ObjectId("56d585c22a28964a03973d2f"), ObjectId("56d585e42a28964a03973d30") ], "__v" : NumberInt(13) } { "_id" : ObjectId("570f9091a7f8094c0249dd13"), "name" : "ABC", "alias" : "abc", "url" : "http://blazen.io", "Api" : [ ObjectId("570f919da7f8094c0249dd14"), ObjectId("570f973aa7f8094c0249dd15"), ObjectId("570f9809a7f8094c0249dd16"), ObjectId("570f98cda7f8094c0249dd17") ], "__v" : NumberInt(4) } { "_id" : ObjectId("5718a99e42391ed4029d5d27"), "name" : "Jacknows", "alias" : "jacknows", "url" : "http://www.wohlig.co.in/jacknows", "Api" : [ ObjectId("5718aa5042391ed4029d5d28"), ObjectId("5718abfb42391ed4029d5d2a") ], "__v" : NumberInt(4) } { "_id" : ObjectId("571a0b7f0d7e3fab03cf556f"), "name" : "Sortvest", "alias" : "advice", "url" : "http://wohlig.co.in/sortvest", "Api" : [ ObjectId("571b19cccb004ba303756244") ], "__v" : NumberInt(1) } { "_id" : ObjectId("571b18cecb004ba303756243"), "name" : "Stelward", "alias" : "stelward", "url" : "http://wohlig.co.in/stelward", "Api" : [ ObjectId("571b1a12cb004ba303756245"), ObjectId("571b1ab0cb004ba303756246"), ObjectId("571b1ad3cb004ba303756247"), ObjectId("571b1b82cb004ba303756248"), ObjectId("571b1bb3cb004ba303756249"), ObjectId("571b1cc3cb004ba30375624a"), ObjectId("571b1d1bcb004ba30375624b"), ObjectId("571b1d46cb004ba30375624c"), ObjectId("571b1eb4cb004ba30375624f"), ObjectId("571b213fcb004ba303756250"), ObjectId("571b1dd2cb004ba30375624d"), ObjectId("571b1de9cb004ba30375624e") ], "__v" : NumberInt(6) }
{ "id": 119172365, "type": "Feature", "properties": { "addr:full":"48 Cruick Avenue South Ockendon Essex RM15 6EL", "addr:housenumber":"48", "addr:postcode":"rm15 6el", "addr:street":"Cruick Avenue South", "edtf:cessation":"uuuu", "edtf:inception":"uuuu", "geom:area":0.0, "geom:area_square_m":0.0, "geom:bbox":"0.292262,51.503391,0.292262,51.503391", "geom:latitude":51.503391, "geom:longitude":0.292262, "iso:country":"GB", "mz:hierarchy_label":1, "mz:is_current":-1, "sg:address":"48 Cruick Avenue", "sg:city":"South Ockendon", "sg:classifiers":[ { "category":"Building & Trades", "subcategory":"Landscaping Services", "type":"Services" } ], "sg:owner":"simplegeo", "sg:phone":"+44 1708 671110", "sg:postcode":"RM15 6EL", "sg:province":"Essex", "sg:tags":[ "preservation", "timber" ], "src:geom":"simplegeo", "wof:belongsto":[ 85633159, 85859993, 85684177 ], "wof:breaches":[], "wof:concordances":{ "sg:id":"SG_5sUhNelBV99LTnlhXGW44E_51.503391_0.292262@1300740087" }, "wof:country":"GB", "wof:geomhash":"27de90b25a206e485e88ba8caa04d49b", "wof:hierarchy":[ { "country_id":85633159, "neighbourhood_id":85859993, "region_id":85684177, "venue_id":119172365 } ], "wof:id":119172365, "wof:lastmodified":1496966769, "wof:name":"Countrywide Property Care", "wof:parent_id":85859993, "wof:placetype":"venue", "wof:repo":"whosonfirst-data-venue-gb", "wof:superseded_by":[], "wof:supersedes":[], "wof:tags":[] }, "bbox": [ 0.292262, 51.503391, 0.292262, 51.503391 ], "geometry": {"coordinates":[0.292262,51.503391],"type":"Point"} }
{ "id": 118514335, "type": "Feature", "properties": { "addr:full":"14 Marypole Walk, Stoke Hill Exeter Devon EX4 7HB", "addr:housenumber":"14", "addr:postcode":"ex4 7hb", "addr:street":"Marypole Walk Stoke Hill", "edtf:cessation":"uuuu", "edtf:inception":"uuuu", "geom:area":0.0, "geom:area_square_m":0.0, "geom:bbox":"-3.510264,50.736702,-3.510264,50.736702", "geom:latitude":50.736702, "geom:longitude":-3.510264, "iso:country":"GB", "mz:hierarchy_label":1, "mz:is_current":-1, "sg:address":"14 Marypole Walk, Stoke Hill", "sg:city":"Exeter", "sg:classifiers":[ { "category":"Government", "subcategory":"Post Office", "type":"Public Place" } ], "sg:owner":"simplegeo", "sg:postcode":"EX4 7HB", "sg:province":"Devon", "sg:tags":[ "messenger", "courier" ], "src:geom":"simplegeo", "wof:belongsto":[ 85633159, 85792763, 85683773 ], "wof:breaches":[], "wof:concordances":{ "sg:id":"SG_6v4dxBpG7wFWCq2uYorhGW_50.736702_-3.510264@1300740027" }, "wof:country":"GB", "wof:geomhash":"3a274fd8a70674c25ff8502c1be6a3ea", "wof:hierarchy":[ { "country_id":85633159, "neighbourhood_id":85792763, "region_id":85683773, "venue_id":118514335 } ], "wof:id":118514335, "wof:lastmodified":1496966050, "wof:name":"Parcel Link Express", "wof:parent_id":85792763, "wof:placetype":"venue", "wof:repo":"whosonfirst-data-venue-gb", "wof:superseded_by":[], "wof:supersedes":[], "wof:tags":[] }, "bbox": [ -3.510264, 50.736702, -3.510264, 50.736702 ], "geometry": {"coordinates":[-3.510264,50.736702],"type":"Point"} }
[ "ObjectClass/4bbb091609b426da1f826bbd8b94f5dc" ]
{ "directions": [ "Heat oil in heavy large skillet over medium heat. Add next 6 ingredients and saut\u00e9 until onions are tender, about 15 minutes. Stir in parsley and basil. Season with salt and pepper. Add pasta; toss thoroughly. Divide pasta between 2 plates. Top each with half of goat cheese." ], "ingredients": [ "3 tablespoon olive oil", "1 bunch green onions, sliced", "4 plum tomatoes, chopped", "1 red bell pepper, chopped", "6 oil-packed sun-dried tomatoes, drained, chopped", "2 garlic cloves, minced", "1/4 teaspoon dried oregano, crumbled", "1 tablespoon chopped fresh parsley", "1 tablespoon chopped fresh basil or 1 teaspoon dried, crumbled", "Salt and pepper", "8 ounces spinach linguine or spaghetti, freshly cooked", "4 ounces soft goat cheese (such as Montrachet), sliced" ], "language": "en-US", "source": "www.epicurious.com", "tags": [ "Cheese", "Herb", "Onion", "Pasta", "Tomato", "Vegetarian", "Quick & Easy", "Goat Cheese", "Winter", "North Carolina" ], "title": "Spinach Linguine with Goat Cheese", "url": "http://www.epicurious.com/recipes/food/views/spinach-linguine-with-goat-cheese-1135" }
{ "info": { "name": "Stub", "code": "stub", "year": "2015", "notes": "Верстка типового проекта", "productionUrl": "" }, "paths": { "dev": { "root": "./dev", "views": "./dev/views", "dummy": "./dev/dummy", "templates": "./dev/templates", "lib": "./dev/lib", "js": "./dev/public/js", "images": "./dev/public/i", "css": "./dev/public/css", "fonts": "./dev/public/fonts", "docs": "./dev/docs/" }, "prod": { "root": "./prod", "dummy": "./prod/dummy", "fonts": "./prod/fonts", "images": "./prod/i", "css": "./prod/css", "js": "./prod/js", "pages": "./prod/pages", "archives": "./archives" } }, "pages": { "home": { "name": "Главная страница", "progress": "0", "template": "base" } } }
{"cookie":{"originalMaxAge":2592000000,"expires":"2019-07-30T14:39:16.595Z","httpOnly":true,"path":"/"},"__lastAccess":1561905556595}
[{"jsonrpc": "2.0", "result": [{"blockTime": 1632311106, "confirmationStatus": "finalized", "err": null, "memo": null, "signature": "2hfUVfpjqhaAfEN8F5xtKuhTTy47zqqCrqguAw7p17Mf5vfaSu6rmYkT7xnyv1tvppXFUaSNeKqSedZM9MXQuiui", "slot": 97794628}, {"blockTime": 1632310896, "confirmationStatus": "finalized", "err": null, "memo": null, "signature": "36Z4UXKywuD7iAPEGKvg3NkYxZhSWp9gJW2yywW1WG3iMYPB7eGq2RfTpZtv23QfcKfitBrs2mgxb7zLD6fDD1VF", "slot": 97794222}, {"blockTime": 1632310849, "confirmationStatus": "finalized", "err": null, "memo": null, "signature": "2E9yMTDMckHNdZwgC4jpWY8nPyPQTWtRPbPJaAoVqepZHfmR3tNebgCwktfyLDPx9eV8maT9PWM57cV2svM4L4pH", "slot": 97794141}, {"blockTime": 1632310799, "confirmationStatus": "finalized", "err": null, "memo": null, "signature": "4heYgR1S5jzZgZ9sGyDXMsXgAtMKZA5yZ9K9cKp38bNUnqwhdDDTbxhVWeDCsyTm4mL4JUTvoZLkuGce7Th8F9yL", "slot": 97794045}], "id": "533de89c-e083-4930-b91e-c1a1e4921e06"}]
{"notes": [{"id": "BJl84vQ18Q", "original": null, "number": 3, "cdate": 1534175021997, "ddate": null, "tcdate": 1534175021997, "tmdate": 1534175353278, "tddate": null, "forum": "Sk2u1g-0-", "replyto": "ByEAfwS7z", "invitation": "ICLR.cc/2018/Conference/-/Paper544/Public_Comment", "content": {"title": "Follow-up related to section 5.1, paragraph 2", "comment": "Thank you for this wonderful contribution. Referring to the section 5.1, paragraph 2 the reference of the equation given in the paragraph is Equation 7 (meta-update while training), should that be rewritten as Equation 9?"}, "signatures": ["(anonymous)"], "readers": ["everyone"], "nonreaders": [], "writers": ["(anonymous)"], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments", "abstract": "Ability to continuously learn and adapt from limited experience in nonstationary environments is an important milestone on the path towards general intelligence. In this paper, we cast the problem of continuous adaptation into the learning-to-learn framework. We develop a simple gradient-based meta-learning algorithm suitable for adaptation in dynamically changing and adversarial scenarios. Additionally, we design a new multi-agent competitive environment, RoboSumo, and define iterated adaptation games for testing various aspects of continuous adaptation. We demonstrate that meta-learning enables significantly more efficient adaptation than reactive baselines in the few-shot regime. Our experiments with a population of agents that learn and compete suggest that meta-learners are the fittest.", "pdf": "/pdf/a4d3a6673dbadf98ccf48e6e6a05164f62b31565.pdf", "paperhash": "alshedivat|continuous_adaptation_via_metalearning_in_nonstationary_and_competitive_environments", "_bibtex": "@inproceedings{\nal-shedivat2018continuous,\ntitle={Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments},\nauthor={Maruan Al-Shedivat and Trapit Bansal and Yura Burda and Ilya Sutskever and Igor Mordatch and Pieter Abbeel},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=Sk2u1g-0-},\n}", "keywords": ["reinforcement learning", "nonstationarity", "meta-learning", "transfer learning", "multi-agent"], "authors": ["Maruan Al-Shedivat", "Trapit Bansal", "Yura Burda", "Ilya Sutskever", "Igor Mordatch", "Pieter Abbeel"], "authorids": ["alshedivat@cs.cmu.edu", "tbansal@cs.umass.edu", "yburda@openai.com", "ilyasu@openai.com", "mordatch@openai.com", "pabbeel@cs.berkeley.edu"]}, "tags": [], "invitation": {"rdate": null, "duedate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "tmdate": 1512791684414, "id": "ICLR.cc/2018/Conference/-/Paper544/Public_Comment", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "invitees": ["~"], "reply": {"replyto": null, "forum": "Sk2u1g-0-", "writers": {"values-regex": "~.*|\\(anonymous\\)"}, "signatures": {"values-regex": "~.*|\\(anonymous\\)", "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/Authors_and_Higher", "ICLR.cc/2018/Conference/Reviewers_and_Higher", "ICLR.cc/2018/Conference/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": ["ICLR.cc/2018/Conference/Paper544/Authors", "ICLR.cc/2018/Conference/Paper544/Reviewers", "ICLR.cc/2018/Conference/Paper544/Area_Chair"], "cdate": 1512791684414}}}, {"tddate": null, "ddate": null, "tmdate": 1525124766053, "tcdate": 1525124766053, "number": 2, "cdate": 1525124766053, "id": "H18sRbHaM", "invitation": "ICLR.cc/2018/Conference/-/Paper544/Public_Comment", "forum": "Sk2u1g-0-", "replyto": "Sk2u1g-0-", "signatures": ["~Yuchen_Lu1"], "readers": ["everyone"], "writers": ["~Yuchen_Lu1"], "content": {"title": "Meta-learned Policy Starting Weak?", "comment": "Congratulations on winning the best paper, and I really enjoy reading the paper and the demo. However, I have some questions about this paper:\n\nThere is one thing that I notice in both experiments is that the policy trained from meta-learning starts with a weak point. For example, at episode 1 in locomotion experiment, meta-updates mostly perform the worst. I can guess there might be a trade-off between getting a good policy for a specific environment and a good policy for fast adaptation. Is this phenomenon also common in your experiments?"}, "nonreaders": [], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments", "abstract": "Ability to continuously learn and adapt from limited experience in nonstationary environments is an important milestone on the path towards general intelligence. In this paper, we cast the problem of continuous adaptation into the learning-to-learn framework. We develop a simple gradient-based meta-learning algorithm suitable for adaptation in dynamically changing and adversarial scenarios. Additionally, we design a new multi-agent competitive environment, RoboSumo, and define iterated adaptation games for testing various aspects of continuous adaptation. We demonstrate that meta-learning enables significantly more efficient adaptation than reactive baselines in the few-shot regime. Our experiments with a population of agents that learn and compete suggest that meta-learners are the fittest.", "pdf": "/pdf/a4d3a6673dbadf98ccf48e6e6a05164f62b31565.pdf", "paperhash": "alshedivat|continuous_adaptation_via_metalearning_in_nonstationary_and_competitive_environments", "_bibtex": "@inproceedings{\nal-shedivat2018continuous,\ntitle={Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments},\nauthor={Maruan Al-Shedivat and Trapit Bansal and Yura Burda and Ilya Sutskever and Igor Mordatch and Pieter Abbeel},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=Sk2u1g-0-},\n}", "keywords": ["reinforcement learning", "nonstationarity", "meta-learning", "transfer learning", "multi-agent"], "authors": ["Maruan Al-Shedivat", "Trapit Bansal", "Yura Burda", "Ilya Sutskever", "Igor Mordatch", "Pieter Abbeel"], "authorids": ["alshedivat@cs.cmu.edu", "tbansal@cs.umass.edu", "yburda@openai.com", "ilyasu@openai.com", "mordatch@openai.com", "pabbeel@cs.berkeley.edu"]}, "tags": [], "invitation": {"rdate": null, "duedate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "tmdate": 1512791684414, "id": "ICLR.cc/2018/Conference/-/Paper544/Public_Comment", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "invitees": ["~"], "reply": {"replyto": null, "forum": "Sk2u1g-0-", "writers": {"values-regex": "~.*|\\(anonymous\\)"}, "signatures": {"values-regex": "~.*|\\(anonymous\\)", "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/Authors_and_Higher", "ICLR.cc/2018/Conference/Reviewers_and_Higher", "ICLR.cc/2018/Conference/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": ["ICLR.cc/2018/Conference/Paper544/Authors", "ICLR.cc/2018/Conference/Paper544/Reviewers", "ICLR.cc/2018/Conference/Paper544/Area_Chair"], "cdate": 1512791684414}}}, {"tddate": null, "ddate": null, "tmdate": 1519406069205, "tcdate": 1509126003606, "number": 544, "cdate": 1518730173726, "id": "Sk2u1g-0-", "invitation": "ICLR.cc/2018/Conference/-/Blind_Submission", "forum": "Sk2u1g-0-", "original": "Sk5uJx-0b", "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "writers": ["ICLR.cc/2018/Conference"], "content": {"title": "Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments", "abstract": "Ability to continuously learn and adapt from limited experience in nonstationary environments is an important milestone on the path towards general intelligence. In this paper, we cast the problem of continuous adaptation into the learning-to-learn framework. We develop a simple gradient-based meta-learning algorithm suitable for adaptation in dynamically changing and adversarial scenarios. Additionally, we design a new multi-agent competitive environment, RoboSumo, and define iterated adaptation games for testing various aspects of continuous adaptation. We demonstrate that meta-learning enables significantly more efficient adaptation than reactive baselines in the few-shot regime. Our experiments with a population of agents that learn and compete suggest that meta-learners are the fittest.", "pdf": "/pdf/a4d3a6673dbadf98ccf48e6e6a05164f62b31565.pdf", "paperhash": "alshedivat|continuous_adaptation_via_metalearning_in_nonstationary_and_competitive_environments", "_bibtex": "@inproceedings{\nal-shedivat2018continuous,\ntitle={Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments},\nauthor={Maruan Al-Shedivat and Trapit Bansal and Yura Burda and Ilya Sutskever and Igor Mordatch and Pieter Abbeel},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=Sk2u1g-0-},\n}", "keywords": ["reinforcement learning", "nonstationarity", "meta-learning", "transfer learning", "multi-agent"], "authors": ["Maruan Al-Shedivat", "Trapit Bansal", "Yura Burda", "Ilya Sutskever", "Igor Mordatch", "Pieter Abbeel"], "authorids": ["alshedivat@cs.cmu.edu", "tbansal@cs.umass.edu", "yburda@openai.com", "ilyasu@openai.com", "mordatch@openai.com", "pabbeel@cs.berkeley.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, "tmdate": 1518940297772, "tcdate": 1518940297772, "number": 1, "cdate": 1518940297772, "id": "rJfcgnLPf", "invitation": "ICLR.cc/2018/Conference/-/Paper544/Public_Comment", "forum": "Sk2u1g-0-", "replyto": "Sk2u1g-0-", "signatures": ["(anonymous)"], "readers": ["everyone"], "writers": ["(anonymous)"], "content": {"title": "code", "comment": "Thanks for the work, do you plan to release the code recently?"}, "nonreaders": [], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments", "abstract": "Ability to continuously learn and adapt from limited experience in nonstationary environments is an important milestone on the path towards general intelligence. In this paper, we cast the problem of continuous adaptation into the learning-to-learn framework. We develop a simple gradient-based meta-learning algorithm suitable for adaptation in dynamically changing and adversarial scenarios. Additionally, we design a new multi-agent competitive environment, RoboSumo, and define iterated adaptation games for testing various aspects of continuous adaptation. We demonstrate that meta-learning enables significantly more efficient adaptation than reactive baselines in the few-shot regime. Our experiments with a population of agents that learn and compete suggest that meta-learners are the fittest.", "pdf": "/pdf/a4d3a6673dbadf98ccf48e6e6a05164f62b31565.pdf", "paperhash": "alshedivat|continuous_adaptation_via_metalearning_in_nonstationary_and_competitive_environments", "_bibtex": "@inproceedings{\nal-shedivat2018continuous,\ntitle={Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments},\nauthor={Maruan Al-Shedivat and Trapit Bansal and Yura Burda and Ilya Sutskever and Igor Mordatch and Pieter Abbeel},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=Sk2u1g-0-},\n}", "keywords": ["reinforcement learning", "nonstationarity", "meta-learning", "transfer learning", "multi-agent"], "authors": ["Maruan Al-Shedivat", "Trapit Bansal", "Yura Burda", "Ilya Sutskever", "Igor Mordatch", "Pieter Abbeel"], "authorids": ["alshedivat@cs.cmu.edu", "tbansal@cs.umass.edu", "yburda@openai.com", "ilyasu@openai.com", "mordatch@openai.com", "pabbeel@cs.berkeley.edu"]}, "tags": [], "invitation": {"rdate": null, "duedate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "tmdate": 1512791684414, "id": "ICLR.cc/2018/Conference/-/Paper544/Public_Comment", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "invitees": ["~"], "reply": {"replyto": null, "forum": "Sk2u1g-0-", "writers": {"values-regex": "~.*|\\(anonymous\\)"}, "signatures": {"values-regex": "~.*|\\(anonymous\\)", "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/Authors_and_Higher", "ICLR.cc/2018/Conference/Reviewers_and_Higher", "ICLR.cc/2018/Conference/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": ["ICLR.cc/2018/Conference/Paper544/Authors", "ICLR.cc/2018/Conference/Paper544/Reviewers", "ICLR.cc/2018/Conference/Paper544/Area_Chair"], "cdate": 1512791684414}}}, {"tddate": null, "ddate": null, "original": null, "tmdate": 1517260101095, "tcdate": 1517249196978, "number": 16, "cdate": 1517249196965, "id": "r1HnfkTBf", "invitation": "ICLR.cc/2018/Conference/-/Acceptance_Decision", "forum": "Sk2u1g-0-", "replyto": "Sk2u1g-0-", "signatures": ["ICLR.cc/2018/Conference/Program_Chairs"], "readers": ["everyone"], "writers": ["ICLR.cc/2018/Conference/Program_Chairs"], "content": {"title": "ICLR 2018 Conference Acceptance Decision", "comment": "Looks like a great contribution to ICLR. Continuous adaptation in nonstationary (and competitive) environments is something that an intelligent agent acting in the real world would need to solve and this paper suggests that a meta-learning approach may be quite appropriate for this task.", "decision": "Accept (Oral)"}, "nonreaders": [], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments", "abstract": "Ability to continuously learn and adapt from limited experience in nonstationary environments is an important milestone on the path towards general intelligence. In this paper, we cast the problem of continuous adaptation into the learning-to-learn framework. We develop a simple gradient-based meta-learning algorithm suitable for adaptation in dynamically changing and adversarial scenarios. Additionally, we design a new multi-agent competitive environment, RoboSumo, and define iterated adaptation games for testing various aspects of continuous adaptation. We demonstrate that meta-learning enables significantly more efficient adaptation than reactive baselines in the few-shot regime. Our experiments with a population of agents that learn and compete suggest that meta-learners are the fittest.", "pdf": "/pdf/a4d3a6673dbadf98ccf48e6e6a05164f62b31565.pdf", "paperhash": "alshedivat|continuous_adaptation_via_metalearning_in_nonstationary_and_competitive_environments", "_bibtex": "@inproceedings{\nal-shedivat2018continuous,\ntitle={Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments},\nauthor={Maruan Al-Shedivat and Trapit Bansal and Yura Burda and Ilya Sutskever and Igor Mordatch and Pieter Abbeel},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=Sk2u1g-0-},\n}", "keywords": ["reinforcement learning", "nonstationarity", "meta-learning", "transfer learning", "multi-agent"], "authors": ["Maruan Al-Shedivat", "Trapit Bansal", "Yura Burda", "Ilya Sutskever", "Igor Mordatch", "Pieter Abbeel"], "authorids": ["alshedivat@cs.cmu.edu", "tbansal@cs.umass.edu", "yburda@openai.com", "ilyasu@openai.com", "mordatch@openai.com", "pabbeel@cs.berkeley.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": 1515642466359, "tcdate": 1511546812776, "number": 1, "cdate": 1511546812776, "id": "ryBakJUlz", "invitation": "ICLR.cc/2018/Conference/-/Paper544/Official_Review", "forum": "Sk2u1g-0-", "replyto": "Sk2u1g-0-", "signatures": ["ICLR.cc/2018/Conference/Paper544/AnonReviewer3"], "readers": ["everyone"], "content": {"title": "review", "rating": "8: Top 50% of accepted papers, clear accept", "review": "This is a dense, rich, and impressive paper on rapid meta-learning. It is already highly polished, so I have mostly minor comments.\n\nRelated work: I think there is a distinction between continual and life-long learning, and I think that your proposed setup is a form of continual learning (see Ring \u201894/\u201897). Given the proliferation of terminology for very related setups, I\u2019d encourage you to reuse the old term.\n\nTerminology: I find it confusing which bits are \u201cmeta\u201d and which are not, and the paper could gain clarity by making this consistent. In particular, it would be good to explicitly name the \u201cmeta-loss\u201d (currently the unnamed triple expectation in (3)). By definition, then, the \u201cmeta-gradient\u201d is the gradient of the meta-loss -- and not the one in (2), which is the gradient of the regular loss.\n\nNotation: there\u2019s redundancy/inconsistency in the reward definition: pick either R_T or \\bold{r}, not both, and maybe include R_T in the task tuple definition? It is also confusing that \\mathcal{R} is a loss, not a reward (and is minimized) -- maybe use another symbol?\n\nA question about the importance sampling correction: given that this spans multiple (long) trajectories, don\u2019t the correction weights become really small in practice? Do you have some ballpark numbers?\n\nTypos:\n- \u201cevent their learning\u201d\n- \u201cin such setting\u201d\n- \u201cexperience to for\u201d\n", "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": "Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments", "abstract": "Ability to continuously learn and adapt from limited experience in nonstationary environments is an important milestone on the path towards general intelligence. In this paper, we cast the problem of continuous adaptation into the learning-to-learn framework. We develop a simple gradient-based meta-learning algorithm suitable for adaptation in dynamically changing and adversarial scenarios. Additionally, we design a new multi-agent competitive environment, RoboSumo, and define iterated adaptation games for testing various aspects of continuous adaptation. We demonstrate that meta-learning enables significantly more efficient adaptation than reactive baselines in the few-shot regime. Our experiments with a population of agents that learn and compete suggest that meta-learners are the fittest.", "pdf": "/pdf/a4d3a6673dbadf98ccf48e6e6a05164f62b31565.pdf", "paperhash": "alshedivat|continuous_adaptation_via_metalearning_in_nonstationary_and_competitive_environments", "_bibtex": "@inproceedings{\nal-shedivat2018continuous,\ntitle={Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments},\nauthor={Maruan Al-Shedivat and Trapit Bansal and Yura Burda and Ilya Sutskever and Igor Mordatch and Pieter Abbeel},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=Sk2u1g-0-},\n}", "keywords": ["reinforcement learning", "nonstationarity", "meta-learning", "transfer learning", "multi-agent"], "authors": ["Maruan Al-Shedivat", "Trapit Bansal", "Yura Burda", "Ilya Sutskever", "Igor Mordatch", "Pieter Abbeel"], "authorids": ["alshedivat@cs.cmu.edu", "tbansal@cs.umass.edu", "yburda@openai.com", "ilyasu@openai.com", "mordatch@openai.com", "pabbeel@cs.berkeley.edu"]}, "tags": [], "invitation": {"rdate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "duedate": 1511845199000, "tmdate": 1515642466260, "id": "ICLR.cc/2018/Conference/-/Paper544/Official_Review", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "invitees": ["ICLR.cc/2018/Conference/Paper544/Reviewers"], "noninvitees": ["ICLR.cc/2018/Conference/Paper544/AnonReviewer3", "ICLR.cc/2018/Conference/Paper544/AnonReviewer2", "ICLR.cc/2018/Conference/Paper544/AnonReviewer1"], "reply": {"forum": "Sk2u1g-0-", "replyto": "Sk2u1g-0-", "writers": {"values": []}, "signatures": {"values-regex": "ICLR.cc/2018/Conference/Paper544/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": 1515642466260}}}, {"tddate": null, "ddate": null, "original": null, "tmdate": 1515642466322, "tcdate": 1511844659250, "number": 2, "cdate": 1511844659250, "id": "BJiNow9gG", "invitation": "ICLR.cc/2018/Conference/-/Paper544/Official_Review", "forum": "Sk2u1g-0-", "replyto": "Sk2u1g-0-", "signatures": ["ICLR.cc/2018/Conference/Paper544/AnonReviewer2"], "readers": ["everyone"], "content": {"title": "Review for Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments", "rating": "7: Good paper, accept", "review": "This paper proposed a gradient-based meta-learning approach for continuous adaptation in nonstationary and adversarial environment. The idea is to treat a nonstationary task as a sequence of stationary tasks and train agents to exploit the dependencies between consecutive tasks such that they can deal with nonstationarities at test time. The proposed method was evaluated based on a nonstationary locomotion and within a competitive multi agent setting. For the later, this paper specifically designed the RomoSumo environment and defined iterated adaptation games to test various aspect of adaptation strategies. The empirical results in both cases demonstrate the efficacy of the proposed meta-learned adaptation rules over the baselines in the few-short regime. The superiority of meta-learners is further justified on a population level.\n\nThe paper addressed a very important problem for general AI and it is well-written. Careful experiment designs, and thorough comparisons make the results conniving. I\n\nFurther comments:\n\n1. In the experiment the trajectory number seems very small, I wonder if directly using importance weight as shown in (9) will cause high variance in the performance?\n\n2. One of the assumption in this work is that trajectories from T_i contain some information about T_{i+1}, I wonder what will happen if the mutually information is very small between them (The extreme case is that two tasks are independent), will current method still perform well?\n\nP7, For the RL^2 policy, the authors mentioned that \u201c\u2026with a given environment (or an opponent), reset the state once the latter changes\u201d How does the agent know when an environment (or opponent) changes? \n\nP10, \u201cThis suggests that it meta-learned a particular\u2026\u201d This sentence need to be rewritten.\n\nP10, ELO is undefined\n", "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": "Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments", "abstract": "Ability to continuously learn and adapt from limited experience in nonstationary environments is an important milestone on the path towards general intelligence. In this paper, we cast the problem of continuous adaptation into the learning-to-learn framework. We develop a simple gradient-based meta-learning algorithm suitable for adaptation in dynamically changing and adversarial scenarios. Additionally, we design a new multi-agent competitive environment, RoboSumo, and define iterated adaptation games for testing various aspects of continuous adaptation. We demonstrate that meta-learning enables significantly more efficient adaptation than reactive baselines in the few-shot regime. Our experiments with a population of agents that learn and compete suggest that meta-learners are the fittest.", "pdf": "/pdf/a4d3a6673dbadf98ccf48e6e6a05164f62b31565.pdf", "paperhash": "alshedivat|continuous_adaptation_via_metalearning_in_nonstationary_and_competitive_environments", "_bibtex": "@inproceedings{\nal-shedivat2018continuous,\ntitle={Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments},\nauthor={Maruan Al-Shedivat and Trapit Bansal and Yura Burda and Ilya Sutskever and Igor Mordatch and Pieter Abbeel},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=Sk2u1g-0-},\n}", "keywords": ["reinforcement learning", "nonstationarity", "meta-learning", "transfer learning", "multi-agent"], "authors": ["Maruan Al-Shedivat", "Trapit Bansal", "Yura Burda", "Ilya Sutskever", "Igor Mordatch", "Pieter Abbeel"], "authorids": ["alshedivat@cs.cmu.edu", "tbansal@cs.umass.edu", "yburda@openai.com", "ilyasu@openai.com", "mordatch@openai.com", "pabbeel@cs.berkeley.edu"]}, "tags": [], "invitation": {"rdate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "duedate": 1511845199000, "tmdate": 1515642466260, "id": "ICLR.cc/2018/Conference/-/Paper544/Official_Review", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "invitees": ["ICLR.cc/2018/Conference/Paper544/Reviewers"], "noninvitees": ["ICLR.cc/2018/Conference/Paper544/AnonReviewer3", "ICLR.cc/2018/Conference/Paper544/AnonReviewer2", "ICLR.cc/2018/Conference/Paper544/AnonReviewer1"], "reply": {"forum": "Sk2u1g-0-", "replyto": "Sk2u1g-0-", "writers": {"values": []}, "signatures": {"values-regex": "ICLR.cc/2018/Conference/Paper544/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": 1515642466260}}}, {"tddate": null, "ddate": null, "original": null, "tmdate": 1515642466279, "tcdate": 1511894321370, "number": 3, "cdate": 1511894321370, "id": "SyK4pmsgG", "invitation": "ICLR.cc/2018/Conference/-/Paper544/Official_Review", "forum": "Sk2u1g-0-", "replyto": "Sk2u1g-0-", "signatures": ["ICLR.cc/2018/Conference/Paper544/AnonReviewer1"], "readers": ["everyone"], "content": {"title": "This is a strong paper presenting a novel approach to few-shot eval-time adaptation in non-stationary environments, supported by multiple analyses in two synthetic domains. ", "rating": "9: Top 15% of accepted papers, strong accept", "review": "---- Summary ----\nThis paper addresses the problem of learning to operate in non-stationary environments, represented as a Markov chain of distinct tasks. The goal is to meta-learn updates that are optimal with respect to transitions between pairs of tasks, allowing for few-shot execution time adaptation that does not degrade as the environment diverges ever further from the training time task set.\n\nDuring learning, an inner loop iterates iterates over consecutive task pairs. For each pair, (T_i, T_{i+1}) trajectories sampled from T_i are used to construct a local policy that is then used to sample trajectories from T_{i+1}. By calculating the outer-loop policy gradient with respect to expectations of the trajectories sampled from T_i, and the trajectories sampled from T_{i+1} using the locally optimal inner-loop policy, the approach learns updates that are optimal with respect to the Markovian transitions between pairs of consecutive tasks.\n\nThe training time optimization algorithm requires multiple passes through a given sequence of tasks. Since this is not feasible at execution time, the trajectories calculated while solving task T_i are used to calculate updates for task T_{i+1} and these updates are importance weighted w.r.t the sampled trajectories' expectation under the final training-time policy.\n\nThe approach is evaluated on a pair of tasks. In the locomotion task, a six legged agent has to adapt to deal with an increasing inhibition to a pair of its legs. In the new RoboSumo task, agents have to adapt to effectively compete with increasingly competent components, that have been trained for longer periods of time via self-play.\n\nIt is clear that, in the locomotion task, the meta learning strategy maintains performance much more consistently than approaches that adapt through PPO-tracking, or implicitly by maintaining state in the RL^2 approach. This behaviour is less visible in the RoboSumo task (Fig 5.) but it does seem to present. Further experiments show that when the adaptation approaches are forced to fight against each other in 100 round iterated adaptation games, the meta learning strategy is dominant. However, the authors also do point out that this behaviour is highly dependent on the number of episodes allowed in each game, and when the agent can accumulate a large amount of evidence in a given environment the meta learning approach falls behind adaptation through tracking. The bias that allows the agent to learn effectively from few examples precludes it from effectively using many examples.\n\n---- Questions for author ----\nUpdates are performed from \\theta to \\phi_{i+1} rather than from \\phi_i to \\phi_{i+1}. Footnote 2 states that this was due to empirical observations of instability but it also necessitates the importance weight correction during execution time. I would like to know how the authors expect the sample in Eqn 9 to behave in much longer running scenarios, when \\pi_{\\phi} starts to diverge drastically from \\pi_{\\theta} but very few trajectories are available.\n\nThe spider-spider results in Fig. 6 do not support the argument that meta learning is better than PPO tracking in the few-shot regime. Do you have any idea of why this is?\n\n---- Nits ----\nThere is a slight muddiness of notation around the use of \\tau in lines 7 & 9 in of Algorithm 1. I think it should be edited to line up with the definition given in Eqn. 8. \n\nThe figures in this paper depend excessively and unnecessarily on color. They should be made more printer, and colorblind, friendly.\n\n---- Conclusion ----\nI think this paper would be a very worthy contribution to ICLR. Learning to adapt on the basis of few observations is an important prerequisite for real world agents, and this paper presents a reasonable approach backed up by a suite of informative evaluations. The quality of the writing is high, and the contributions are significant. However, this topic is very much outside of my realm of expertise and I am unfamiliar with the related work, so I am assigning my review a low confidence.", "confidence": "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"}, "writers": [], "nonreaders": [], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments", "abstract": "Ability to continuously learn and adapt from limited experience in nonstationary environments is an important milestone on the path towards general intelligence. In this paper, we cast the problem of continuous adaptation into the learning-to-learn framework. We develop a simple gradient-based meta-learning algorithm suitable for adaptation in dynamically changing and adversarial scenarios. Additionally, we design a new multi-agent competitive environment, RoboSumo, and define iterated adaptation games for testing various aspects of continuous adaptation. We demonstrate that meta-learning enables significantly more efficient adaptation than reactive baselines in the few-shot regime. Our experiments with a population of agents that learn and compete suggest that meta-learners are the fittest.", "pdf": "/pdf/a4d3a6673dbadf98ccf48e6e6a05164f62b31565.pdf", "paperhash": "alshedivat|continuous_adaptation_via_metalearning_in_nonstationary_and_competitive_environments", "_bibtex": "@inproceedings{\nal-shedivat2018continuous,\ntitle={Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments},\nauthor={Maruan Al-Shedivat and Trapit Bansal and Yura Burda and Ilya Sutskever and Igor Mordatch and Pieter Abbeel},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=Sk2u1g-0-},\n}", "keywords": ["reinforcement learning", "nonstationarity", "meta-learning", "transfer learning", "multi-agent"], "authors": ["Maruan Al-Shedivat", "Trapit Bansal", "Yura Burda", "Ilya Sutskever", "Igor Mordatch", "Pieter Abbeel"], "authorids": ["alshedivat@cs.cmu.edu", "tbansal@cs.umass.edu", "yburda@openai.com", "ilyasu@openai.com", "mordatch@openai.com", "pabbeel@cs.berkeley.edu"]}, "tags": [], "invitation": {"rdate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "duedate": 1511845199000, "tmdate": 1515642466260, "id": "ICLR.cc/2018/Conference/-/Paper544/Official_Review", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "invitees": ["ICLR.cc/2018/Conference/Paper544/Reviewers"], "noninvitees": ["ICLR.cc/2018/Conference/Paper544/AnonReviewer3", "ICLR.cc/2018/Conference/Paper544/AnonReviewer2", "ICLR.cc/2018/Conference/Paper544/AnonReviewer1"], "reply": {"forum": "Sk2u1g-0-", "replyto": "Sk2u1g-0-", "writers": {"values": []}, "signatures": {"values-regex": "ICLR.cc/2018/Conference/Paper544/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": 1515642466260}}}, {"tddate": null, "ddate": null, "tmdate": 1514660593630, "tcdate": 1514660593630, "number": 4, "cdate": 1514660593630, "id": "B19e7vSmf", "invitation": "ICLR.cc/2018/Conference/-/Paper544/Official_Comment", "forum": "Sk2u1g-0-", "replyto": "ryBakJUlz", "signatures": ["ICLR.cc/2018/Conference/Paper544/Authors"], "readers": ["everyone"], "writers": ["ICLR.cc/2018/Conference/Paper544/Authors"], "content": {"title": "Thank you", "comment": "Thank you for carefully reading the paper and the thoughtful comments. We answer the questions below:\n\nRelated work:\nWe agree that continuous adaptation is indeed a variation of continual learning. The updated version of the paper now points this out.\n\nTerminology:\nThank you for suggestions. We have improved our terminology and notation throughout the paper, explicitly named the meta-loss, and renamed the inner loop gradient update (as given in Eq. 2) from \u201cmeta-update\u201d to \u201cadaptation update\u201d.\n\nNotation:\nInitially, \\mathcal{R}_T was standing for the risk (i.e., the expected loss, as commonly used in machine learning literature). This notation was indeed a bit confusing in the RL context where R is often used for rewards, so we have altered it.\n\nImportance sampling:\nGood point. Eq. 9 gives a general form of the estimator for \\phi. In practice, the adaptation gradient (i.e., the gradient of L_{T_{i-1}} as now given in Eq. 9) decouples into a sum over time steps, so we compute importance weights for each time step (i.e., for each action) separately. The effective sample size in our experiments was no less than 20% of the given sample size. (Also, see our answer to a similar question asked by R2.)"}, "nonreaders": [], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments", "abstract": "Ability to continuously learn and adapt from limited experience in nonstationary environments is an important milestone on the path towards general intelligence. In this paper, we cast the problem of continuous adaptation into the learning-to-learn framework. We develop a simple gradient-based meta-learning algorithm suitable for adaptation in dynamically changing and adversarial scenarios. Additionally, we design a new multi-agent competitive environment, RoboSumo, and define iterated adaptation games for testing various aspects of continuous adaptation. We demonstrate that meta-learning enables significantly more efficient adaptation than reactive baselines in the few-shot regime. Our experiments with a population of agents that learn and compete suggest that meta-learners are the fittest.", "pdf": "/pdf/a4d3a6673dbadf98ccf48e6e6a05164f62b31565.pdf", "paperhash": "alshedivat|continuous_adaptation_via_metalearning_in_nonstationary_and_competitive_environments", "_bibtex": "@inproceedings{\nal-shedivat2018continuous,\ntitle={Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments},\nauthor={Maruan Al-Shedivat and Trapit Bansal and Yura Burda and Ilya Sutskever and Igor Mordatch and Pieter Abbeel},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=Sk2u1g-0-},\n}", "keywords": ["reinforcement learning", "nonstationarity", "meta-learning", "transfer learning", "multi-agent"], "authors": ["Maruan Al-Shedivat", "Trapit Bansal", "Yura Burda", "Ilya Sutskever", "Igor Mordatch", "Pieter Abbeel"], "authorids": ["alshedivat@cs.cmu.edu", "tbansal@cs.umass.edu", "yburda@openai.com", "ilyasu@openai.com", "mordatch@openai.com", "pabbeel@cs.berkeley.edu"]}, "tags": [], "invitation": {"rdate": null, "duedate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "tmdate": 1516825731846, "id": "ICLR.cc/2018/Conference/-/Paper544/Official_Comment", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "reply": {"replyto": null, "forum": "Sk2u1g-0-", "writers": {"values-regex": "ICLR.cc/2018/Conference/Paper544/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper544/Authors|ICLR.cc/2018/Conference/Paper544/Area_Chair|ICLR.cc/2018/Conference/Program_Chairs"}, "signatures": {"values-regex": "ICLR.cc/2018/Conference/Paper544/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper544/Authors|ICLR.cc/2018/Conference/Paper544/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/Paper544/Authors_and_Higher", "ICLR.cc/2018/Conference/Paper544/Reviewers_and_Higher", "ICLR.cc/2018/Conference/Paper544/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/Paper544/Reviewers", "ICLR.cc/2018/Conference/Paper544/Authors", "ICLR.cc/2018/Conference/Paper544/Area_Chair", "ICLR.cc/2018/Conference/Program_Chairs"], "cdate": 1516825731846}}}, {"tddate": null, "ddate": null, "tmdate": 1514660555796, "tcdate": 1514660555796, "number": 3, "cdate": 1514660555796, "id": "ByEAfwS7z", "invitation": "ICLR.cc/2018/Conference/-/Paper544/Official_Comment", "forum": "Sk2u1g-0-", "replyto": "BJiNow9gG", "signatures": ["ICLR.cc/2018/Conference/Paper544/Authors"], "readers": ["everyone"], "writers": ["ICLR.cc/2018/Conference/Paper544/Authors"], "content": {"title": "Thank you", "comment": "Thank you for carefully reading the paper and the thoughtful comments. We answer the questions below:\n\n1. Good point, the estimator in Eq. 9 may cause high variance in \\phi. Three points to note:\n(i) We used importance weight correction only at execution time (indeed, the variance of the estimator hindered learning in such a regime; see footnote 2).\n(ii) Even though Eq. 9 shows the sum over K episodes, each episode consists of multiple time steps (typically 100-500 time steps, depending on the experiment) each of which is treated as a separate sample and gets an importance weight. Even with a limited number of episodes, we get quite a substantial number of time steps (with 3 episodes of 500 steps each, we get 1,500 time steps). In our experiments, the effective sample size was always reasonable (more than 20%), which worked at execution time (but not for learning).\n(iii) To compute adaptation updates using Eq. 9 in practice, meta-learners not only used the immediate past episode, but multiple previous episodes (see section 5.1, paragraph 2), which increased the number of samples and further helped to reduce the variance of the estimator.\n\n2. No, the method is not designed to work in the regime with no mutual information between T_i and T_{i+1}. Our meta-learning approach targets to solve a zero-shot problem (i.e., do well at T_{i+1} without previous interaction experience with that particular task) knowing that tasks are sequentially dependent. If the tasks are independent, having some initial interaction with each new task is perhaps the only way to solve the problem.\n\n3. In our setup, the number of episodes after which the environment/opponent changes is fixed. Moreover, we assume that the agent knows a priori the number of episodes or rounds after which the environment or opponent changes. This information is directly used by RL^2."}, "nonreaders": [], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments", "abstract": "Ability to continuously learn and adapt from limited experience in nonstationary environments is an important milestone on the path towards general intelligence. In this paper, we cast the problem of continuous adaptation into the learning-to-learn framework. We develop a simple gradient-based meta-learning algorithm suitable for adaptation in dynamically changing and adversarial scenarios. Additionally, we design a new multi-agent competitive environment, RoboSumo, and define iterated adaptation games for testing various aspects of continuous adaptation. We demonstrate that meta-learning enables significantly more efficient adaptation than reactive baselines in the few-shot regime. Our experiments with a population of agents that learn and compete suggest that meta-learners are the fittest.", "pdf": "/pdf/a4d3a6673dbadf98ccf48e6e6a05164f62b31565.pdf", "paperhash": "alshedivat|continuous_adaptation_via_metalearning_in_nonstationary_and_competitive_environments", "_bibtex": "@inproceedings{\nal-shedivat2018continuous,\ntitle={Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments},\nauthor={Maruan Al-Shedivat and Trapit Bansal and Yura Burda and Ilya Sutskever and Igor Mordatch and Pieter Abbeel},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=Sk2u1g-0-},\n}", "keywords": ["reinforcement learning", "nonstationarity", "meta-learning", "transfer learning", "multi-agent"], "authors": ["Maruan Al-Shedivat", "Trapit Bansal", "Yura Burda", "Ilya Sutskever", "Igor Mordatch", "Pieter Abbeel"], "authorids": ["alshedivat@cs.cmu.edu", "tbansal@cs.umass.edu", "yburda@openai.com", "ilyasu@openai.com", "mordatch@openai.com", "pabbeel@cs.berkeley.edu"]}, "tags": [], "invitation": {"rdate": null, "duedate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "tmdate": 1516825731846, "id": "ICLR.cc/2018/Conference/-/Paper544/Official_Comment", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "reply": {"replyto": null, "forum": "Sk2u1g-0-", "writers": {"values-regex": "ICLR.cc/2018/Conference/Paper544/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper544/Authors|ICLR.cc/2018/Conference/Paper544/Area_Chair|ICLR.cc/2018/Conference/Program_Chairs"}, "signatures": {"values-regex": "ICLR.cc/2018/Conference/Paper544/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper544/Authors|ICLR.cc/2018/Conference/Paper544/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/Paper544/Authors_and_Higher", "ICLR.cc/2018/Conference/Paper544/Reviewers_and_Higher", "ICLR.cc/2018/Conference/Paper544/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/Paper544/Reviewers", "ICLR.cc/2018/Conference/Paper544/Authors", "ICLR.cc/2018/Conference/Paper544/Area_Chair", "ICLR.cc/2018/Conference/Program_Chairs"], "cdate": 1516825731846}}}, {"tddate": null, "ddate": null, "tmdate": 1514660448765, "tcdate": 1514660448765, "number": 2, "cdate": 1514660448765, "id": "B1YwMwHmf", "invitation": "ICLR.cc/2018/Conference/-/Paper544/Official_Comment", "forum": "Sk2u1g-0-", "replyto": "SyK4pmsgG", "signatures": ["ICLR.cc/2018/Conference/Paper544/Authors"], "readers": ["everyone"], "writers": ["ICLR.cc/2018/Conference/Paper544/Authors"], "content": {"title": "Thank you", "comment": "Thank you for carefully reading the paper and thoughtful questions. We have improved the notation and the color-coding in the figures. We answer the questions below:\n\n- When \\pi_{\\phi} significantly diverges from \\pi_{\\theta}, the estimate given Eq. 9 would become of very high variance. In our setup, \\pi_{\\phi} was always at most a few gradient steps away from \\pi_{\\theta} in the parameter space. This gave difference in behaviors while keeping the effective sample size reasonable (always more than 20%). Much longer running scenarios may require a better estimator (i.e., of lower variance) which should also take into account the sequential structure of the tasks (e.g., a particle filter).\n\n- Good point, different methods yielded similar performance in the spider-spider experiments. This is because the agents tended to learn very similar behaviors regardless of the algorithm. The spectrum of behaviors learned by the agent highly depends on the morphology. From videos, we noticed that spiders always picked up a very particular fighting style, using front legs to kick the opponent and back legs to stabilize the posture, and never altered it during adaptation. This could be due to, perhaps, optimality of such behavior, but we did not further quantify this effect.\n"}, "nonreaders": [], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments", "abstract": "Ability to continuously learn and adapt from limited experience in nonstationary environments is an important milestone on the path towards general intelligence. In this paper, we cast the problem of continuous adaptation into the learning-to-learn framework. We develop a simple gradient-based meta-learning algorithm suitable for adaptation in dynamically changing and adversarial scenarios. Additionally, we design a new multi-agent competitive environment, RoboSumo, and define iterated adaptation games for testing various aspects of continuous adaptation. We demonstrate that meta-learning enables significantly more efficient adaptation than reactive baselines in the few-shot regime. Our experiments with a population of agents that learn and compete suggest that meta-learners are the fittest.", "pdf": "/pdf/a4d3a6673dbadf98ccf48e6e6a05164f62b31565.pdf", "paperhash": "alshedivat|continuous_adaptation_via_metalearning_in_nonstationary_and_competitive_environments", "_bibtex": "@inproceedings{\nal-shedivat2018continuous,\ntitle={Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments},\nauthor={Maruan Al-Shedivat and Trapit Bansal and Yura Burda and Ilya Sutskever and Igor Mordatch and Pieter Abbeel},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=Sk2u1g-0-},\n}", "keywords": ["reinforcement learning", "nonstationarity", "meta-learning", "transfer learning", "multi-agent"], "authors": ["Maruan Al-Shedivat", "Trapit Bansal", "Yura Burda", "Ilya Sutskever", "Igor Mordatch", "Pieter Abbeel"], "authorids": ["alshedivat@cs.cmu.edu", "tbansal@cs.umass.edu", "yburda@openai.com", "ilyasu@openai.com", "mordatch@openai.com", "pabbeel@cs.berkeley.edu"]}, "tags": [], "invitation": {"rdate": null, "duedate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "tmdate": 1516825731846, "id": "ICLR.cc/2018/Conference/-/Paper544/Official_Comment", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "reply": {"replyto": null, "forum": "Sk2u1g-0-", "writers": {"values-regex": "ICLR.cc/2018/Conference/Paper544/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper544/Authors|ICLR.cc/2018/Conference/Paper544/Area_Chair|ICLR.cc/2018/Conference/Program_Chairs"}, "signatures": {"values-regex": "ICLR.cc/2018/Conference/Paper544/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper544/Authors|ICLR.cc/2018/Conference/Paper544/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/Paper544/Authors_and_Higher", "ICLR.cc/2018/Conference/Paper544/Reviewers_and_Higher", "ICLR.cc/2018/Conference/Paper544/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/Paper544/Reviewers", "ICLR.cc/2018/Conference/Paper544/Authors", "ICLR.cc/2018/Conference/Paper544/Area_Chair", "ICLR.cc/2018/Conference/Program_Chairs"], "cdate": 1516825731846}}}, {"tddate": null, "ddate": null, "tmdate": 1514660358656, "tcdate": 1514660358656, "number": 1, "cdate": 1514660358656, "id": "HyyfMDSQf", "invitation": "ICLR.cc/2018/Conference/-/Paper544/Official_Comment", "forum": "Sk2u1g-0-", "replyto": "Sk2u1g-0-", "signatures": ["ICLR.cc/2018/Conference/Paper544/Authors"], "readers": ["everyone"], "writers": ["ICLR.cc/2018/Conference/Paper544/Authors"], "content": {"title": "Thank you", "comment": "We thank reviewers for their time and thoughtful feedback.\n\nWe have updated the submission: improved notation throughout the paper, resolved ambiguities, and improved color-coding in the plots. We answer specific questions raised in the reviews by separately replying to each of them."}, "nonreaders": [], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments", "abstract": "Ability to continuously learn and adapt from limited experience in nonstationary environments is an important milestone on the path towards general intelligence. In this paper, we cast the problem of continuous adaptation into the learning-to-learn framework. We develop a simple gradient-based meta-learning algorithm suitable for adaptation in dynamically changing and adversarial scenarios. Additionally, we design a new multi-agent competitive environment, RoboSumo, and define iterated adaptation games for testing various aspects of continuous adaptation. We demonstrate that meta-learning enables significantly more efficient adaptation than reactive baselines in the few-shot regime. Our experiments with a population of agents that learn and compete suggest that meta-learners are the fittest.", "pdf": "/pdf/a4d3a6673dbadf98ccf48e6e6a05164f62b31565.pdf", "paperhash": "alshedivat|continuous_adaptation_via_metalearning_in_nonstationary_and_competitive_environments", "_bibtex": "@inproceedings{\nal-shedivat2018continuous,\ntitle={Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environments},\nauthor={Maruan Al-Shedivat and Trapit Bansal and Yura Burda and Ilya Sutskever and Igor Mordatch and Pieter Abbeel},\nbooktitle={International Conference on Learning Representations},\nyear={2018},\nurl={https://openreview.net/forum?id=Sk2u1g-0-},\n}", "keywords": ["reinforcement learning", "nonstationarity", "meta-learning", "transfer learning", "multi-agent"], "authors": ["Maruan Al-Shedivat", "Trapit Bansal", "Yura Burda", "Ilya Sutskever", "Igor Mordatch", "Pieter Abbeel"], "authorids": ["alshedivat@cs.cmu.edu", "tbansal@cs.umass.edu", "yburda@openai.com", "ilyasu@openai.com", "mordatch@openai.com", "pabbeel@cs.berkeley.edu"]}, "tags": [], "invitation": {"rdate": null, "duedate": null, "tddate": null, "ddate": null, "multiReply": null, "taskCompletionCount": null, "tmdate": 1516825731846, "id": "ICLR.cc/2018/Conference/-/Paper544/Official_Comment", "writers": ["ICLR.cc/2018/Conference"], "signatures": ["ICLR.cc/2018/Conference"], "readers": ["everyone"], "reply": {"replyto": null, "forum": "Sk2u1g-0-", "writers": {"values-regex": "ICLR.cc/2018/Conference/Paper544/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper544/Authors|ICLR.cc/2018/Conference/Paper544/Area_Chair|ICLR.cc/2018/Conference/Program_Chairs"}, "signatures": {"values-regex": "ICLR.cc/2018/Conference/Paper544/AnonReviewer[0-9]+|ICLR.cc/2018/Conference/Paper544/Authors|ICLR.cc/2018/Conference/Paper544/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/Paper544/Authors_and_Higher", "ICLR.cc/2018/Conference/Paper544/Reviewers_and_Higher", "ICLR.cc/2018/Conference/Paper544/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/Paper544/Reviewers", "ICLR.cc/2018/Conference/Paper544/Authors", "ICLR.cc/2018/Conference/Paper544/Area_Chair", "ICLR.cc/2018/Conference/Program_Chairs"], "cdate": 1516825731846}}}], "count": 12}
{"code":"9209282001","province_code":"92","regency_code":"9209","district_code":"920928","name":"MESERIKWEDA"}
{"clustering_alg": {"affinity_propagation": {"clustering": {"adjusted_mutual_info_score": 0.6023232971281608, "adjusted_rand_score": 0.22612283313933168, "completeness_score": 0.4322292983077935, "fowlkes_mallows_score": 0.4037450780758279, "homogeneity_score": 0.9999999999999997, "v_measure_score": 0.6035755570961726}, "classification": {"f1_score": 0.03637870171648558, "hamming_loss": 0.8654, "jaccard_score": 0.021536, "accuracy_score": 0.1346, "recall_score": 0.021536, "precision_score": 0.12}, "found_clusters": 25, "expected_clusters": 4, "time": 170.3534}, "agglomerative": {"clustering": {"adjusted_mutual_info_score": 1.0, "adjusted_rand_score": 1.0, "completeness_score": 1.0, "fowlkes_mallows_score": 1.0, "homogeneity_score": 1.0, "v_measure_score": 1.0}, "classification": {"f1_score": 1.0, "hamming_loss": 0.0, "jaccard_score": 1.0, "accuracy_score": 1.0, "recall_score": 1.0, "precision_score": 1.0}, "found_clusters": 4, "expected_clusters": 4, "time": 1.4459}, "birch": {"clustering": {"adjusted_mutual_info_score": 0.8570721064109494, "adjusted_rand_score": 0.7141631882897822, "completeness_score": 1.0, "fowlkes_mallows_score": 0.8163876493575091, "homogeneity_score": 0.7500000000000001, "v_measure_score": 0.8571428571428573}, "classification": {"f1_score": 0.41666666666666663, "hamming_loss": 0.5, "jaccard_score": 0.375, "accuracy_score": 0.5, "recall_score": 0.5, "precision_score": 0.375}, "found_clusters": 3, "expected_clusters": 4, "time": 1.142}, "dbscan": {"clustering": {"adjusted_mutual_info_score": 0.023781183588231183, "adjusted_rand_score": 3.420006514646979e-05, "completeness_score": 0.18018278041399038, "fowlkes_mallows_score": 0.4915816866960611, "homogeneity_score": 0.01660227294404318, "v_measure_score": 0.030403159683139048}, "classification": {"f1_score": 0.0005312084993359894, "hamming_loss": 0.999, "jaccard_score": 0.0002666666666666667, "accuracy_score": 0.001, "recall_score": 0.0002666666666666667, "precision_score": 0.06666666666666667}, "found_clusters": 15, "expected_clusters": 4, "time": 0.067}, "k_means": {"clustering": {"adjusted_mutual_info_score": 1.0, "adjusted_rand_score": 1.0, "completeness_score": 1.0, "fowlkes_mallows_score": 1.0, "homogeneity_score": 1.0, "v_measure_score": 1.0}, "classification": {"f1_score": 1.0, "hamming_loss": 0.0, "jaccard_score": 1.0, "accuracy_score": 1.0, "recall_score": 1.0, "precision_score": 1.0}, "found_clusters": 4, "expected_clusters": 4, "time": 0.038}, "mini_batch_k_means": {"clustering": {"adjusted_mutual_info_score": 1.0, "adjusted_rand_score": 1.0, "completeness_score": 1.0, "fowlkes_mallows_score": 1.0, "homogeneity_score": 1.0, "v_measure_score": 1.0}, "classification": {"f1_score": 1.0, "hamming_loss": 0.0, "jaccard_score": 1.0, "accuracy_score": 1.0, "recall_score": 1.0, "precision_score": 1.0}, "found_clusters": 4, "expected_clusters": 4, "time": 0.045}, "mean_shift": {"clustering": {"adjusted_mutual_info_score": 0.6665704110789465, "adjusted_rand_score": 0.49984992496248126, "completeness_score": 1.0, "fowlkes_mallows_score": 0.7069652890828426, "homogeneity_score": 0.5000000000000003, "v_measure_score": 0.666666666666667}, "classification": {"f1_score": 0.0, "hamming_loss": 1.0, "jaccard_score": 0.0, "accuracy_score": 0.0, "recall_score": 0.0, "precision_score": 0.0}, "found_clusters": 2, "expected_clusters": 4, "time": 14.256}, "optics": {"clustering": {"adjusted_mutual_info_score": 0.07453137882181887, "adjusted_rand_score": 0.00020258013598540114, "completeness_score": 0.1822340184702792, "fowlkes_mallows_score": 0.4691242261718502, "homogeneity_score": 0.06183856611371983, "v_measure_score": 0.09234212370512984}, "classification": {"f1_score": 0.00031746031746031746, "hamming_loss": 0.998, "jaccard_score": 0.00016, "accuracy_score": 0.002, "recall_score": 0.00016, "precision_score": 0.02}, "found_clusters": 50, "expected_clusters": 4, "time": 4.2603}, "spectral_clustering": {"clustering": {"adjusted_mutual_info_score": 1.0, "adjusted_rand_score": 1.0, "completeness_score": 1.0, "fowlkes_mallows_score": 1.0, "homogeneity_score": 1.0, "v_measure_score": 1.0}, "classification": {"f1_score": 1.0, "hamming_loss": 0.0, "jaccard_score": 1.0, "accuracy_score": 1.0, "recall_score": 1.0, "precision_score": 1.0}, "found_clusters": 4, "expected_clusters": 4, "time": 5.0445}, "gaussian_mixture_model": {"clustering": {"adjusted_mutual_info_score": 1.0, "adjusted_rand_score": 1.0, "completeness_score": 1.0, "fowlkes_mallows_score": 1.0, "homogeneity_score": 1.0, "v_measure_score": 1.0}, "classification": {"f1_score": 1.0, "hamming_loss": 0.0, "jaccard_score": 1.0, "accuracy_score": 1.0, "recall_score": 1.0, "precision_score": 1.0}, "found_clusters": 4, "expected_clusters": 4, "time": 0.022}}, "classification_alg": {"KNeighborsClassifier": {"clustering": {"adjusted_mutual_info_score": 1.0, "adjusted_rand_score": 1.0, "completeness_score": 1.0, "fowlkes_mallows_score": 1.0, "homogeneity_score": 1.0, "v_measure_score": 1.0}, "classification": {"f1_score": 1.0, "hamming_loss": 0.0, "jaccard_score": 1.0, "accuracy_score": 1.0, "recall_score": 1.0, "precision_score": 1.0}, "time": 0.053}, "DecisionTreeClassifier": {"clustering": {"adjusted_mutual_info_score": 1.0, "adjusted_rand_score": 1.0, "completeness_score": 1.0, "fowlkes_mallows_score": 1.0, "homogeneity_score": 1.0, "v_measure_score": 1.0}, "classification": {"f1_score": 1.0, "hamming_loss": 0.0, "jaccard_score": 1.0, "accuracy_score": 1.0, "recall_score": 1.0, "precision_score": 1.0}, "time": 0.005}, "RandomForestClassifier": {"clustering": {"adjusted_mutual_info_score": 1.0, "adjusted_rand_score": 1.0, "completeness_score": 1.0, "fowlkes_mallows_score": 1.0, "homogeneity_score": 1.0, "v_measure_score": 1.0}, "classification": {"f1_score": 1.0, "hamming_loss": 0.0, "jaccard_score": 1.0, "accuracy_score": 1.0, "recall_score": 1.0, "precision_score": 1.0}, "time": 0.267}, "LinearSVC": {"clustering": {"adjusted_mutual_info_score": 1.0, "adjusted_rand_score": 1.0, "completeness_score": 1.0, "fowlkes_mallows_score": 1.0, "homogeneity_score": 1.0, "v_measure_score": 1.0}, "classification": {"f1_score": 1.0, "hamming_loss": 0.0, "jaccard_score": 1.0, "accuracy_score": 1.0, "recall_score": 1.0, "precision_score": 1.0}, "time": 0.006}, "LogisticRegression": {"clustering": {"adjusted_mutual_info_score": 1.0, "adjusted_rand_score": 1.0, "completeness_score": 1.0, "fowlkes_mallows_score": 1.0, "homogeneity_score": 1.0, "v_measure_score": 1.0}, "classification": {"f1_score": 1.0, "hamming_loss": 0.0, "jaccard_score": 1.0, "accuracy_score": 1.0, "recall_score": 1.0, "precision_score": 1.0}, "time": 0.118}, "GaussianNB": {"clustering": {"adjusted_mutual_info_score": 1.0, "adjusted_rand_score": 1.0, "completeness_score": 1.0, "fowlkes_mallows_score": 1.0, "homogeneity_score": 1.0, "v_measure_score": 1.0}, "classification": {"f1_score": 1.0, "hamming_loss": 0.0, "jaccard_score": 1.0, "accuracy_score": 1.0, "recall_score": 1.0, "precision_score": 1.0}, "time": 0.002}}}
{ "cve": { "data_type": "CVE", "data_format": "MITRE", "data_version": "4.0", "CVE_data_meta": { "ID": "CVE-2018-14984", "ASSIGNER": "cve@mitre.org" }, "affects": { "vendor": { "vendor_data": [ ] } }, "problemtype": { "problemtype_data": [ { "description": [ ] } ] }, "references": { "reference_data": [ { "url": "https://www.kryptowire.com/portal/android-firmware-defcon-2018/", "name": "https://www.kryptowire.com/portal/android-firmware-defcon-2018/", "refsource": "MISC", "tags": [ ] }, { "url": "https://www.kryptowire.com/portal/wp-content/uploads/2018/12/DEFCON-26-Johnson-and-Stavrou-Vulnerable-Out-of-the-Box-An-Eval-of-Android-Carrier-Devices-WP-Updated.pdf", "name": "https://www.kryptowire.com/portal/wp-content/uploads/2018/12/DEFCON-26-Johnson-and-Stavrou-Vulnerable-Out-of-the-Box-An-Eval-of-Android-Carrier-Devices-WP-Updated.pdf", "refsource": "MISC", "tags": [ ] } ] }, "description": { "description_data": [ { "lang": "en", "value": "The Leagoo Z5C Android device with a build fingerprint of sp7731c_1h10_32v4_bird:6.0/MRA58K/android.20170629.214736:user/release-keys contains a pre-installed app with a package name of com.android.messaging (versionCode=1000110, versionName=1.0.001, (android.20170630.092853-0)) with an exported broadcast receiver app component named com.android.messaging.trackersender.TrackerSender. Any app co-located on the device, even one with no permissions, can send a broadcast intent with certain embedded data to the exported broadcast receiver application component that will result in the programmatic sending of a text message where the phone number and body of the text message is controlled by the attacker." } ] } }, "configurations": { "CVE_data_version": "4.0", "nodes": [ ] }, "impact": { }, "publishedDate": "2018-12-28T21:29Z", "lastModifiedDate": "2018-12-28T21:29Z" }
{"uuid":"59b64978-df7c-44b2-bb76-c5892738beb9","name":"Suite","children":["ec530be6-0fcb-47bb-af09-6ebce7af45b7"],"befores":[],"afters":[],"links":[],"start":1584822218610,"stop":1584822291312}
[{"jsonrpc": "2.0", "result": [{"blockTime": 1631733137, "confirmationStatus": "finalized", "err": null, "memo": null, "signature": "3P5zZtSKRjEZ5LQX6wLyWDvMtWv32Y9KyfzA3crhfZeHph8zFRMv5f3tPkjBDFytMYxUpS39BzCubsUthPtJEpNs", "slot": 96648748}, {"blockTime": 1631733134, "confirmationStatus": "finalized", "err": null, "memo": null, "signature": "2kaCA7yPzWTxhraQQnQRHctDRjHw5Q229dR9tqkdtbmPpXre9oACjtxzVso7v7nD3vRQW2J3okpLbVhNKdDbShuT", "slot": 96648741}, {"blockTime": 1631733132, "confirmationStatus": "finalized", "err": null, "memo": null, "signature": "59AtgCX9jGdLVsYxQMwh2cDi3XxMBbzqPhkHUmWL5m7ypV7BcBd4soaNGUngiSDnzksdzpHfCXAxfqxq3mUv8phQ", "slot": 96648736}], "id": "533de89c-e083-4930-b91e-c1a1e4921e06"}]
{"per_page": 25, "items": [{"salary": null, "name": "Intern to Academy of Business", "area": {"url": "https://api.hh.ru/areas/88", "id": "88", "name": "Казань"}, "url": "https://api.hh.ru/vacancies/8770135", "created_at": "2013-09-04T17:55:32+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/4900", "alternate_url": "http://hh.ru/employer/4900", "logo_urls": {"90": "http://hh.ru/employer-logo/913511.jpeg", "240": "http://hh.ru/employer-logo/913512.jpeg", "original": "http://hh.ru/file/11616729.jpg"}, "name": "EY", "id": "4900"}, "response_letter_required": false, "address": {"building": "6", "city": "Казань", "street": "улица Спартаковская", "description": "офис 1214", "metro": {"line_name": "Центральная", "station_id": "49.274", "line_id": "49", "lat": 55.776426000000001, "station_name": "Суконная слобода", "lng": 49.143442999999998}, "raw": null, "lat": 55.778593000000001, "lng": 49.129410999999998}, "alternate_url": "http://hh.ru/vacancy/8770135", "type": {"id": "open", "name": "Открытая"}, "id": "8770135"}, {"salary": {"to": 46000, "from": 33000, "currency": "RUR"}, "name": "Инженер ОТК", "area": {"url": "https://api.hh.ru/areas/2", "id": "2", "name": "Санкт-Петербург"}, "url": "https://api.hh.ru/vacancies/8630043", "created_at": "2013-09-04T17:36:41+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/38351", "alternate_url": "http://hh.ru/employer/38351", "logo_urls": null, "name": "Diakont", "id": "38351"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/8630043", "type": {"id": "open", "name": "Открытая"}, "id": "8630043"}, {"salary": null, "name": "Волонтер (общественный деятель)", "area": {"url": "https://api.hh.ru/areas/26", "id": "26", "name": "Воронеж"}, "url": "https://api.hh.ru/vacancies/8769815", "created_at": "2013-09-04T17:29:54+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/1247487", "alternate_url": "http://hh.ru/employer/1247487", "logo_urls": {"90": "http://hh.ru/employer-logo/878909.jpeg", "240": "http://hh.ru/employer-logo/878910.jpeg", "original": "http://hh.ru/file/11252604.jpg"}, "name": "Центр поддержки малого и среднего бизнеса", "id": "1247487"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/8769815", "type": {"id": "open", "name": "Открытая"}, "id": "8769815"}, {"salary": {"to": null, "from": 25000, "currency": "RUR"}, "name": "Менеджер по развитию клиентской базы (Home office)", "area": {"url": "https://api.hh.ru/areas/25", "id": "25", "name": "Вологда"}, "url": "https://api.hh.ru/vacancies/8289300", "created_at": "2013-09-04T17:02:06+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/589513", "alternate_url": "http://hh.ru/employer/589513", "logo_urls": {"90": "http://hh.ru/employer-logo/696941.png", "240": "http://hh.ru/employer-logo/696942.png", "original": "http://hh.ru/file/8919708.png"}, "name": "Неотек, ОАО", "id": "589513"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/8289300", "type": {"id": "open", "name": "Открытая"}, "id": "8289300"}, {"salary": null, "name": "Аналитик по продуктам", "area": {"url": "https://api.hh.ru/areas/1", "id": "1", "name": "Москва"}, "url": "https://api.hh.ru/vacancies/7525259", "created_at": "2013-09-04T16:58:13+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/1833", "alternate_url": "http://hh.ru/employer/1833", "logo_urls": {"90": "http://hh.ru/employer-logo/309175.png", "240": "http://hh.ru/employer-logo/382032.png", "original": "http://hh.ru/file/2504942.gif"}, "name": "Брокеркредитсервис", "id": "1833"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/7525259", "type": {"id": "open", "name": "Открытая"}, "id": "7525259"}, {"salary": {"to": 25000, "from": 20000, "currency": "RUR"}, "name": "Менеджер по работе с клиентами", "area": {"url": "https://api.hh.ru/areas/78", "id": "78", "name": "Самара"}, "url": "https://api.hh.ru/vacancies/8767925", "created_at": "2013-09-04T15:14:01+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/93090", "alternate_url": "http://hh.ru/employer/93090", "logo_urls": {"90": "http://hh.ru/employer-logo/885365.jpeg", "240": "http://hh.ru/employer-logo/885366.jpeg", "original": "http://hh.ru/file/11374484.jpg"}, "name": "Самарский Стройфарфор", "id": "93090"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/8767925", "type": {"id": "open", "name": "Открытая"}, "id": "8767925"}, {"salary": null, "name": "Старший продавец-консультант автомобилей", "area": {"url": "https://api.hh.ru/areas/1", "id": "1", "name": "Москва"}, "url": "https://api.hh.ru/vacancies/8503231", "created_at": "2013-09-04T12:45:37+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/13520", "alternate_url": "http://hh.ru/employer/13520", "logo_urls": {"90": "http://hh.ru/employer-logo/540641.jpeg", "240": "http://hh.ru/employer-logo/540642.jpeg", "original": "http://hh.ru/file/7941425.jpg"}, "name": "АвтоСпецЦентр", "id": "13520"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/8503231", "type": {"id": "open", "name": "Открытая"}, "id": "8503231"}, {"salary": {"to": null, "from": 50000, "currency": "RUR"}, "name": "Ведущий специалист по подбору персонала (регионы)", "area": {"url": "https://api.hh.ru/areas/1", "id": "1", "name": "Москва"}, "url": "https://api.hh.ru/vacancies/8383345", "created_at": "2013-09-04T11:18:05+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/5755", "alternate_url": "http://hh.ru/employer/5755", "logo_urls": {"90": "http://hh.ru/employer-logo/806600.png", "240": "http://hh.ru/employer-logo/806601.png", "original": "http://hh.ru/file/10382012.png"}, "name": "Авангард, АКБ", "id": "5755"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/8383345", "type": {"id": "open", "name": "Открытая"}, "id": "8383345"}, {"salary": {"to": 8000, "from": 8000, "currency": "RUR"}, "name": "Медицинский работник на предрейсовые осмотры водителей", "area": {"url": "https://api.hh.ru/areas/1", "id": "1", "name": "Москва"}, "url": "https://api.hh.ru/vacancies/8715710", "created_at": "2013-09-04T10:16:02+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/1439", "alternate_url": "http://hh.ru/employer/1439", "logo_urls": {"90": "http://hh.ru/employer-logo/559940.jpeg", "240": "http://hh.ru/employer-logo/559941.jpeg", "original": "http://hh.ru/file/7962180.jpg"}, "name": "ВСК, СОАО", "id": "1439"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/8715710", "type": {"id": "open", "name": "Открытая"}, "id": "8715710"}, {"salary": null, "name": "Врач онколог-маммолог", "area": {"url": "https://api.hh.ru/areas/1", "id": "1", "name": "Москва"}, "url": "https://api.hh.ru/vacancies/8126396", "created_at": "2013-09-04T09:11:52+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/19804", "alternate_url": "http://hh.ru/employer/19804", "logo_urls": {"90": "http://hh.ru/employer-logo/313671.jpeg", "240": "http://hh.ru/employer-logo/386528.jpeg", "original": "http://hh.ru/file/2087745.jpg"}, "name": "СМ-Клиника", "id": "19804"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/8126396", "type": {"id": "open", "name": "Открытая"}, "id": "8126396"}, {"salary": null, "name": "Территориальный представитель", "area": {"url": "https://api.hh.ru/areas/54", "id": "54", "name": "Красноярск"}, "url": "https://api.hh.ru/vacancies/8133002", "created_at": "2013-09-04T08:20:02+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/402", "alternate_url": "http://hh.ru/employer/402", "logo_urls": {"90": "http://hh.ru/employer-logo/615113.jpeg", "240": "http://hh.ru/employer-logo/615114.jpeg", "original": "http://hh.ru/file/8016896.jpg"}, "name": "Компания ТТК", "id": "402"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/8133002", "type": {"id": "open", "name": "Открытая"}, "id": "8133002"}, {"salary": null, "name": "Территориальный представитель", "area": {"url": "https://api.hh.ru/areas/103", "id": "103", "name": "Абакан"}, "url": "https://api.hh.ru/vacancies/8133007", "created_at": "2013-09-04T08:20:02+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/402", "alternate_url": "http://hh.ru/employer/402", "logo_urls": {"90": "http://hh.ru/employer-logo/615113.jpeg", "240": "http://hh.ru/employer-logo/615114.jpeg", "original": "http://hh.ru/file/8016896.jpg"}, "name": "Компания ТТК", "id": "402"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/8133007", "type": {"id": "open", "name": "Открытая"}, "id": "8133007"}, {"salary": null, "name": "Территориальный представитель", "area": {"url": "https://api.hh.ru/areas/91", "id": "91", "name": "Кызыл"}, "url": "https://api.hh.ru/vacancies/8133008", "created_at": "2013-09-04T08:20:02+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/402", "alternate_url": "http://hh.ru/employer/402", "logo_urls": {"90": "http://hh.ru/employer-logo/615113.jpeg", "240": "http://hh.ru/employer-logo/615114.jpeg", "original": "http://hh.ru/file/8016896.jpg"}, "name": "Компания ТТК", "id": "402"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/8133008", "type": {"id": "open", "name": "Открытая"}, "id": "8133008"}, {"salary": {"to": 35500, "from": null, "currency": "RUR"}, "name": "Руководитель АХО", "area": {"url": "https://api.hh.ru/areas/3", "id": "3", "name": "Екатеринбург"}, "url": "https://api.hh.ru/vacancies/8693617", "created_at": "2013-09-04T08:08:33+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/78933", "alternate_url": "http://hh.ru/employer/78933", "logo_urls": {"90": "http://hh.ru/employer-logo/895691.png", "240": "http://hh.ru/employer-logo/895692.png", "original": "http://hh.ru/file/11468929.png"}, "name": "Mallino development group, ООО", "id": "78933"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/8693617", "type": {"id": "open", "name": "Открытая"}, "id": "8693617"}, {"salary": null, "name": "Специалист по бронированию и продаже авиабилетов", "area": {"url": "https://api.hh.ru/areas/1", "id": "1", "name": "Москва"}, "url": "https://api.hh.ru/vacancies/8609169", "created_at": "2013-09-04T08:08:08+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/637368", "alternate_url": "http://hh.ru/employer/637368", "logo_urls": {"90": "http://hh.ru/employer-logo/922850.jpeg", "240": "http://hh.ru/employer-logo/922851.jpeg", "original": "http://hh.ru/file/11722856.jpg"}, "name": "OTI Holding", "id": "637368"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/8609169", "type": {"id": "open", "name": "Открытая"}, "id": "8609169"}, {"salary": null, "name": "Экономист-программист", "area": {"url": "https://api.hh.ru/areas/1", "id": "1", "name": "Москва"}, "url": "https://api.hh.ru/vacancies/8605470", "created_at": "2013-09-04T08:08:06+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/1031144", "alternate_url": "http://hh.ru/employer/1031144", "logo_urls": null, "name": "АПК, ООО", "id": "1031144"}, "response_letter_required": false, "address": {"building": "42к6", "city": "Москва", "street": "Ленинский проспект", "description": "89647610938", "metro": null, "raw": null, "lat": 55.703032999999998, "lng": 37.564400999999997}, "alternate_url": "http://hh.ru/vacancy/8605470", "type": {"id": "open", "name": "Открытая"}, "id": "8605470"}, {"salary": null, "name": "Юрисконсульт Отдела исполнительного производства", "area": {"url": "https://api.hh.ru/areas/1", "id": "1", "name": "Москва"}, "url": "https://api.hh.ru/vacancies/8760291", "created_at": "2013-09-03T19:14:38+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/2457", "alternate_url": "http://hh.ru/employer/2457", "logo_urls": {"90": "http://hh.ru/employer-logo/309438.png", "240": "http://hh.ru/employer-logo/382295.png", "original": "http://hh.ru/file/927444.gif"}, "name": "DeltaCredit Bank, Societe Generale group", "id": "2457"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/8760291", "type": {"id": "open", "name": "Открытая"}, "id": "8760291"}, {"salary": {"to": null, "from": 150000, "currency": "RUR"}, "name": "Руководитель направления по работе с крупными корпоративными заказчиками", "area": {"url": "https://api.hh.ru/areas/1", "id": "1", "name": "Москва"}, "url": "https://api.hh.ru/vacancies/8187689", "created_at": "2013-09-03T19:07:53+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/32569", "alternate_url": "http://hh.ru/employer/32569", "logo_urls": {"90": "http://hh.ru/employer-logo/857330.jpeg", "240": "http://hh.ru/employer-logo/857331.jpeg", "original": "http://hh.ru/file/10862010.jpg"}, "name": "Русклимат, ООО, Москва", "id": "32569"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/8187689", "type": {"id": "open", "name": "Открытая"}, "id": "8187689"}, {"salary": {"to": null, "from": 30000, "currency": "RUR"}, "name": "Ведущий специалист по закупкам", "area": {"url": "https://api.hh.ru/areas/112", "id": "112", "name": "Ярославль"}, "url": "https://api.hh.ru/vacancies/8060420", "created_at": "2013-09-03T18:25:12+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/104439", "alternate_url": "http://hh.ru/employer/104439", "logo_urls": {"90": "http://hh.ru/employer-logo/333008.jpeg", "240": "http://hh.ru/employer-logo/405865.jpeg", "original": "http://hh.ru/file/4321936.jpg"}, "name": "Промышленные силовые машины", "id": "104439"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/8060420", "type": {"id": "open", "name": "Открытая"}, "id": "8060420"}, {"salary": {"to": null, "from": 40000, "currency": "RUR"}, "name": "Менеджер по продажам", "area": {"url": "https://api.hh.ru/areas/2025", "id": "2025", "name": "Домодедово"}, "url": "https://api.hh.ru/vacancies/7529283", "created_at": "2013-09-03T17:58:16+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/505", "alternate_url": "http://hh.ru/employer/505", "logo_urls": {"90": "http://hh.ru/employer-logo/308438.jpeg", "240": "http://hh.ru/employer-logo/381295.jpeg", "original": "http://hh.ru/file/3772074.jpg"}, "name": "Связной", "id": "505"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/7529283", "type": {"id": "open", "name": "Открытая"}, "id": "7529283"}, {"salary": null, "name": "Руководитель группы по работе с договорами аренды", "area": {"url": "https://api.hh.ru/areas/2", "id": "2", "name": "Санкт-Петербург"}, "url": "https://api.hh.ru/vacancies/8726860", "created_at": "2013-09-03T16:15:38+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/81077", "alternate_url": "http://hh.ru/employer/81077", "logo_urls": {"90": "http://hh.ru/employer-logo/802265.jpeg", "240": "http://hh.ru/employer-logo/802266.jpeg", "original": "http://hh.ru/file/10351276.jpg"}, "name": "oodji", "id": "81077"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/8726860", "type": {"id": "open", "name": "Открытая"}, "id": "8726860"}, {"salary": null, "name": "Техник-ремонтник", "area": {"url": "https://api.hh.ru/areas/2", "id": "2", "name": "Санкт-Петербург"}, "url": "https://api.hh.ru/vacancies/8757463", "created_at": "2013-09-03T15:40:26+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/750651", "alternate_url": "http://hh.ru/employer/750651", "logo_urls": {"90": "http://hh.ru/employer-logo/620330.jpeg", "240": "http://hh.ru/employer-logo/620331.jpeg", "original": "http://hh.ru/file/8021299.jpg"}, "name": "TPV CIS", "id": "750651"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/8757463", "type": {"id": "open", "name": "Открытая"}, "id": "8757463"}, {"salary": null, "name": "Главный специалист по методологии (сопровождение проектов автоматизации на базе SAP)", "area": {"url": "https://api.hh.ru/areas/1", "id": "1", "name": "Москва"}, "url": "https://api.hh.ru/vacancies/7256530", "created_at": "2013-09-03T15:02:40+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/33089", "alternate_url": "http://hh.ru/employer/33089", "logo_urls": null, "name": "Транснефть Финанс, ООО", "id": "33089"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/7256530", "type": {"id": "open", "name": "Открытая"}, "id": "7256530"}, {"salary": null, "name": "Ведущий специалист группы планирования отдела маркетинга", "area": {"url": "https://api.hh.ru/areas/3", "id": "3", "name": "Екатеринбург"}, "url": "https://api.hh.ru/vacancies/7430542", "created_at": "2013-09-03T14:56:20+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/2748", "alternate_url": "http://hh.ru/employer/2748", "logo_urls": {"90": "http://hh.ru/employer-logo/617567.jpeg", "240": "http://hh.ru/employer-logo/617568.jpeg", "original": "http://hh.ru/file/8019254.jpg"}, "name": "Ростелеком", "id": "2748"}, "response_letter_required": false, "address": {"building": null, "city": null, "street": null, "description": null, "metro": null, "raw": "ул. Луначарского, 134 б", "lat": 0.0, "lng": 0.0}, "alternate_url": "http://hh.ru/vacancy/7430542", "type": {"id": "open", "name": "Открытая"}, "id": "7430542"}, {"salary": null, "name": "Специалист по логистике", "area": {"url": "https://api.hh.ru/areas/58", "id": "58", "name": "Липецк"}, "url": "https://api.hh.ru/vacancies/8756660", "created_at": "2013-09-03T14:45:39+0400", "relations": [], "employer": {"url": "https://api.hh.ru/employers/2523", "alternate_url": "http://hh.ru/employer/2523", "logo_urls": {"90": "http://hh.ru/employer-logo/551240.png", "240": "http://hh.ru/employer-logo/551241.png", "original": "http://hh.ru/file/7953130.gif"}, "name": "М.Видео", "id": "2523"}, "response_letter_required": false, "address": null, "alternate_url": "http://hh.ru/vacancy/8756660", "type": {"id": "open", "name": "Открытая"}, "id": "8756660"}], "page": 0, "pages": 7, "found": 155}
{ "name": "Plie Dumbbell Squat", "force": "push", "level": "beginner", "mechanic": "compound", "equipment": "dumbbell", "primaryMuscles": [ "quadriceps" ], "secondaryMuscles": [ "abdominals", "calves", "glutes", "hamstrings" ], "instructions": [ "Hold a dumbbell at the base with both hands and stand straight up. Move your legs so that they are wider than shoulder width apart from each other with your knees slightly bent.", "Your toes should be facing out. Note: Your arms should be stationary while performing the exercise. This is the starting position.", "Slowly bend the knees and lower your legs until your thighs are parallel to the floor. Make sure to inhale as this is the eccentric part of the exercise.", "Press mainly with the heel of the foot to bring the body back to the starting position while exhaling.", "Repeat for the recommended amount of repetitions." ], "category": "strength" }
{"response": {"status": "ok", "userTier": "developer", "total": 1, "content": {"id": "commentisfree/2007/aug/14/comment.media", "type": "article", "sectionId": "commentisfree", "sectionName": "Opinion", "webPublicationDate": "2007-08-13T23:06:22Z", "webTitle": "George Monbiot: The editorials urge us to cut emissions, but the ads tell a very different story", "webUrl": "https://www.theguardian.com/commentisfree/2007/aug/14/comment.media", "apiUrl": "https://content.guardianapis.com/commentisfree/2007/aug/14/comment.media", "fields": {"headline": "The editorials urge us to cut emissions, but the ads tell a very different story", "bodyText": "I am sorry to be crude, but however else I try to say it, the phrase \"lying bastards\" comes to mind. In March, I claimed that the government was fudging its figures on cutting carbon emissions and that it was due to miss its targets for renewable energy. It denied the charges, claimed its cuts were \" correctly quantified\" and suggested I had got my facts wrong. Yesterday, the Guardian published a secret briefing by civil servants admitting that the government's programmes are way off track and urging ministers to try to amend them not with new investments but through \"statistical interpretations of the target\". While no expense is spared in expanding motorways, airports and thermal power stations, every possible tactic is used to frustrate the programme for installing renewable power. The reason is not hard to fathom: big business has invested massively in constructing old technologies and wants to maximise its returns before switching to the new ones. It also demands the hyper-mobility which enables its executives and its goods and services to go anywhere at any time. But I write all this with the blush of the hypocrite, for I have been forced to concede that, I too, am complicit in the strategies of corporate power. A few weeks ago I was challenged by the editors of a website called Medialens over advertisements carried by the Guardian. Does not part of my living ultimately come from the companies I campaign against? Why don't I discuss this contradiction in my column? It is a good question, and it requires an answer. You cannot open a newspaper without being confronted by a host of incongruities. Yesterday, the Telegraph urged people to share their car journeys as \"a simple way to lessen your carbon footprint\". Beside this exhortation, and at six times the size, was an ad by Ryanair for \u00a310 flights to France. Johann Hari in the Independent urged people to join the climate campers at Heathrow, then that newspaper pressed its readers to take advantage of its own special offers - to fly to Spain, Kenya or California. The Guardian led on its story about the government's renewables policy, then ran an ad for renewable energy by E.ON, which (in view of its plans to build new coal-burning power stations) looks to me like greenwash. The paper also carried a reader offer of a cruise around Scotland, which begins by \"flying from a range of UK airports\". The editorials urge us to cut our emissions. The ads urge us to raise them. The World Development Movement kindly offered to conduct a survey for me. I asked it to add up the space given to ads for cars, air travel, holidays requiring air travel and oil companies in the weekday print editions of the five quality dailies, across 10 days in July. The Financial Times carried the fewest such advertisements - a total of 2.75 pages across the 10 days, or 0.8% of its total space. Its weekday editions have fewer ads of all kinds than the other papers (the result might have been different if we had assessed the Saturday papers). The Guardian came next, with some 15.6 pages of fossil fuel ads (2.5%). The Independent carried 24 pages (3.1%); the Telegraph ran 30.5 pages (7.3% of the whole paper), and the Times devoted 42 pages to fossil fuel consumption (4.4%). I sent the editors a list of questions about their ads. Neither the Telegraph nor the Times would answer them: they sent me general environmental statements instead. I asked how much of the newspapers' revenue these ads provide. Only the FT would tell me. Advertising by travel, motor companies and heavy industry accounts for 13.7% of its total print advertising revenue, and 10.4% of all the paper's income. I asked whether the papers are helping to accelerate manmade global warming by taking this advertising. The editor of the FT answered no. The Independent argued that, because it needs the revenue, \"it is only by taking this advertising that we are, in fact, able to continue to raise these issues to the public's attention. We believe that the overall effect of the Independent and our green campaigns will slow down, rather than accelerate, the effects of global warming.\" The Guardian noted that \"carrying an advert does not imply endorsement of any product or service and we'd rather let readers decide what not to buy rather than deciding for them\". I asked whether they would contemplate ceasing to carry this advertising. \"No,\" said the FT. The Guardian replied: \"We would rather encourage advertisers ... to become more sustainable. We have just appointed a commercial sustainability manager who will be considering ways to achieve this. She will also be looking at how [Guardian News and Media] can enable more sustainable companies to advertise with us.\" Dropping these ads would be \"financially damaging and ethically complex\". The Independent proposed that \"if it became financially feasible to continue to publish the newspaper without this advertising, it may well be an issue that is debated\". But \"ceasing to carry this advertising would also have wider implications for the independence of the advertising and editorial sections ... Another problem is, where do you draw the line on which advertising does or doesn't contribute to global warming?\" I believe that most of these answers are inadequate. Newspaper editors make decisions every day about which stories to run and which angles to take. Why can they not also make decisions about the ads they carry? While it is true that readers can make up their own minds, advertising helps to generate behavioural norms. These advertisements make the destruction of the biosphere seem socially acceptable. If there is a case for banning ads for tobacco and unregulated gambling sites on the grounds of the social harm they cause, then there is a stronger case for blocking ads that promote the greatest social hazard of all. The Independent raises a difficult question about drawing the line. Almost all advertising - by promoting excessive consumption - threatens the biosphere. A ban on all car ads would prevent manufacturers from promoting the efficient models they might one day produce. Perhaps the most difficult case would be greenwash by oil companies. Ads for their investments in wind and solar power are designed to distract attention from their core business, thereby promoting the brands which are wrecking the planet. But could the blocking of ads for wind or solar power be justified, even if the space is bought by oil companies? But some lines seem clear. Why could the newspapers not ban ads for cars which produce more than 150g of CO2 per kilometre? Why could they not drop all direct advertisements for flights? The reason is that newspapers derive around three quarters of their income from advertising, and most of them are struggling. The media companies will not volunteer to lower their chances of survival. So the campaign for a ban on fossil fuel ads will have to begin elsewhere. I urge you, hypocrite lecteur, to lobby to reduce the income that all newspapers now receive, by demanding that they drop some of their advertisements. www.monbiot.com"}, "isHosted": false, "pillarId": "pillar/opinion", "pillarName": "Opinion"}}}
{"category": "Original Proceeding", "status": "Disposition Filed/Case Closed", "case_url": "http://caseinfo.nvsupremecourt.us/public/caseView.do?csIID=8796", "caption": "STOVALL VS. STATE BAR OF NEVADA", "type": "Civil", "case_no": "40945", "subtype": "Mandamus", "parties": [{"Represented By": "D. Neal Tomlinson (Cobeaga Tomlinson, LLP)", "Role": "Petitioner", "Party Name": "Leslie Mark Stovall"}, {"Represented By": "Rob W. Bare (State Bar of Nevada/Las Vegas)", "Role": "Respondent", "Party Name": "Southern Nevada Disciplinary Board"}, {"Represented By": "Rob W. Bare (State Bar of Nevada/Las Vegas)", "Role": "Respondent", "Party Name": "The State Bar of Nevada"}], "docket": [{"Date": "02/18/2003", "Type/Subtype": "Filing Fee - Filing Fee Waived", "Description": "Filing Fee Waived."}, {"Type/Subtype": "Petition/Writ - Petition for Writ of Mandamus", "Description": "Filed Petition for Writ of Mandamus.", "Document Number": "03-02655", "Document URL": "/document/view.do?csNameID=8796&csIID=8796&deLinkID=7809&sireDocumentNumber=03-02655", "Date": "02/18/2003", "Pending?": "NA"}, {"Type/Subtype": "Motion - Motion for Stay", "Description": "Filed Motion for Stay. Emergency Motion for Stay of Disciplinary Proceeding pursuant to NRAP 8(c).", "Document Number": "03-02656", "Document URL": "/document/view.do?csNameID=8796&csIID=8796&deLinkID=81891&sireDocumentNumber=03-02656", "Date": "02/18/2003", "Pending?": "NA"}, {"Type/Subtype": "Exhibit - Exhibits (copies)", "Description": "Filed Exhibits (copies). Exhibits in Support of the Emergency Motion for Stay of Disciplinary Proceedings, and Exhibits in Support of Petitioner's Writ of Mandamus.", "Document Number": "03-02672", "Document URL": "/document/view.do?csNameID=8796&csIID=8796&deLinkID=81900&sireDocumentNumber=03-02672", "Date": "02/18/2003", "Pending?": "NA"}, {"Type/Subtype": "Notice/Incoming - Proof of Service", "Description": "Filed Proof of Service. Receipt of Copy (Petition for Writ of Mandamus, Emergency Motion for Stay of Disciplinary Proceeding Pursuant to NAP 8(C) and Exhibits in Support of the Emergency Motion for Stay of Disciplinary Proceeding and Exhibits in Support of Petitioner's Writ of Mandamus.", "Document Number": "03-02867", "Document URL": "/document/view.do?csNameID=8796&csIID=8796&deLinkID=82065&sireDocumentNumber=03-02867", "Date": "02/20/2003", "Pending?": "NA"}, {"Type/Subtype": "Order/Procedural - Order Granting Motion", "Description": "Filed Order Granting Motion. filed Februry 18, 2003. We grant the motion and stay the State Bar's disciplinary proceedings in Case No. 02-005-0022, pending resolution of this writ petition. Respondent shall have 30 days from this order's date to file an answer, including authorities, against the writ's issuance.", "Document Number": "03-02890", "Document URL": "/document/view.do?csNameID=8796&csIID=8796&deLinkID=260859&sireDocumentNumber=03-02890", "Date": "02/20/2003", "Pending?": "NA"}, {"Type/Subtype": "Petition/Writ - Answer to Petition for Writ", "Description": "Filed Answer to Petition for Writ. Opposition to Petition for Writ of Mandamus.", "Document Number": "03-05108", "Document URL": "/document/view.do?csNameID=8796&csIID=8796&deLinkID=83807&sireDocumentNumber=03-05108", "Date": "03/26/2003", "Pending?": "NA"}, {"Type/Subtype": "Motion - Motion to Strike", "Description": "Filed Motion to Strike. Motion to Strike Respondent's Opposition to Petition for Writ of Mandamus.", "Document Number": "03-06411", "Document URL": "/document/view.do?csNameID=8796&csIID=8796&deLinkID=7330&sireDocumentNumber=03-06411", "Date": "04/15/2003", "Pending?": "NA"}, {"Type/Subtype": "Motion - Response to Motion", "Description": "Filed Response to Motion. Respondent's Opposition to Petitioner's Motion to Strike and Nonopposition to Petitioner's Motion for Order Allowing Reply Brief.", "Document Number": "03-07126", "Document URL": "/document/view.do?csNameID=8796&csIID=8796&deLinkID=85402&sireDocumentNumber=03-07126", "Date": "04/28/2003", "Pending?": "NA"}, {"Type/Subtype": "Order/Procedural - Order Denying Motion", "Description": "Filed Order Denying Motion. to Strike, Directing Amended Answer and Granting Motion to file Reply. Petitioner has filed a motion to strike the answer, or alternatively, to be permitted to file a reply. Respondents oppose the motion to strike, but do not oppose the request to file a reply. We deny the motion to strike. We conclude that our review of this matter would be assisted by respondents' citation to the exhibits on file in this matter for the factual assertions in their answer. Respondents shall have 20 days from this order's date to file an amended answer with citations to the exhibits filed by either petitioner or respondents. We grant petitioner's request to file a reply. Petitioner shall have 20 days from service of the amended answer to file any reply.", "Document Number": "03-18729", "Document URL": "/document/view.do?csNameID=8796&csIID=8796&deLinkID=93742&sireDocumentNumber=03-18729", "Date": "11/10/2003", "Pending?": "NA"}, {"Type/Subtype": "Motion - Motion to Extend Time", "Description": "Filed Motion to Extend Time. Motion to Enlarge Time to Comply with Court's November 10, 2003 Order.", "Document Number": "03-20008", "Document URL": "/document/view.do?csNameID=8796&csIID=8796&deLinkID=237508&sireDocumentNumber=03-20008", "Date": "12/02/2003", "Pending?": "NA"}, {"Type/Subtype": "Order/Procedural - Order Granting Motion", "Description": "Filed Order Granting Motion. filed December 2, 2003. Respondent shall have until December 30, 2003, to file and serve its amended answer. Petitioner shall have 20 days from service of the amended answer to file any reply. Further, petitioner shall immediately inform this court if the hearing panel accepts the conditional plea and reinstatement agreement.", "Document Number": "03-20923", "Document URL": "/document/view.do?csNameID=8796&csIID=8796&deLinkID=95259&sireDocumentNumber=03-20923", "Date": "12/16/2003", "Pending?": "NA"}, {"Type/Subtype": "Motion - Motion to Extend Time", "Description": "Filed Motion to Extend Time. Joint Motion to Enlarge Time to Comply with Court's November 10, 2003 Order and to Lift Stay in Disciplinary Proceedings (Second Request).", "Document Number": "03-21706", "Document URL": "/document/view.do?csNameID=8796&csIID=8796&deLinkID=95818&sireDocumentNumber=03-21706", "Date": "12/31/2003", "Pending?": "NA"}, {"Type/Subtype": "Order/Procedural - Order Granting Motion", "Description": "Filed Order Granting Motion. for Extension and to Lift Stay of Disciplinary Proceedings. We grant the motion in all respects. We vacate our February 20, 2003 stay order for the purpose of permitting the January 14, 2004, hearing to proceed. Also, respondents shall have until January 30, 2004, within which to file an amended answer. Alternatively, if the hearing panel approves the parties' plea agreement and this matter becomes moot, then respondents shall so inform this court by January 30, 2004.", "Document Number": "04-00431", "Document URL": "/document/view.do?csNameID=8796&csIID=8796&deLinkID=211596&sireDocumentNumber=04-00431", "Date": "01/08/2004", "Pending?": "NA"}, {"Type/Subtype": "Notice/Incoming - Notice", "Description": "Filed Notice. Notice of Panel Recommendation to Approve Plea Memorandum and Reinstate Petitioner.", "Document Number": "04-01706", "Document URL": "/document/view.do?csNameID=8796&csIID=8796&deLinkID=96858&sireDocumentNumber=04-01706", "Date": "01/27/2004", "Pending?": "NA"}, {"Type/Subtype": "Notice/Incoming - Notice", "Description": "Filed Notice. Supplemental Notice of Panel Recommendation to Approve Plea Memorandum and Reinstate Petitioner.", "Document Number": "04-02938", "Document URL": "/document/view.do?csNameID=8796&csIID=8796&deLinkID=97627&sireDocumentNumber=04-02938", "Date": "02/17/2004", "Pending?": "NA"}, {"Type/Subtype": "Order/Dispositional - Order Dismissing Petition", "Description": "Filed Order Dismissing Petition. Dismissing Petition for Writ of Mandamus. This original petition for a writ of mandamus challenges several decisions by the Southern Nevada Disciplinary Board chair. The parties have reached a stipulated resolution in the underlying case, and have agreed to dismiss the petition. 'We dismiss this petition.' SNP04S-MS/RR/WM", "Document Number": "04-05687", "Document URL": "/document/view.do?csNameID=8796&csIID=8796&deLinkID=99437&sireDocumentNumber=04-05687", "Date": "03/26/2004", "Pending?": "NA"}, {"Date": "03/26/2004", "Type/Subtype": "Case Status Update - Case Closed", "Description": "Case Closed. No notice in lieu of remittitur issued."}], "filed.date": "02/18/2003", "metadata": {"To SP/Judge:": "NA", "Lower Court Case(s):": "NONE", "Submission Date:": "NA", "Panel Assigned:": "Panel", "Case Status:": "Disposition Filed/Case Closed", "Replacement:": "NA", "Oral Argument Location:": "NA", "Classification:": "Original Proceeding - Civil - Mandamus", "Oral Argument:": "NA", "Disqualifications:": "NA", "SP Status:": "NA", "Short Caption:": "STOVALL VS. STATE BAR OF NEVADA", "How Submitted:": "NA"}}
{"other":"Ostalo","classBreaks":"Klasični prekidi","classBreaksNormFieldAsPercent":"Prekidi klase sa normalizationField kao procentom","heatmap":"Mapa žarišta","simple":"Jednostavan","simpleNormFieldAsPercent":"Jednostavno sa normalizationField kao procenat","uniqueValues":"Jedinstvene vrednosti","uniqueValuesNormFieldAsPercent":"Jedinstvene vrednosti uz normalizationField kao procenat","normFieldLabel":"{expression1} podeljeno sa {expression2}","normFieldLabelAsPercent":"Procenat za {expression1} i {expression2}","competingFields":"kompetitivne kategorije","mostCommon":"Najčešće {expression}","basicSummary":"Osnovni rezime","orderedListOfValues":"Naručena lista vrednosti","sumOfCategories":"Zbir kategorija","listOfCategories":"Lista kategorija","predominantCategoryWithTotal":"Predominantna kategorija uz zbir","predominantCategoryWithTotalAndStrength":"Predominantna kategorija uz zbir i snagu","predominantCategoryWithChart":"Predominantna kategorija uz grafik","predominantCategory":"Najzastupljenija kategorija","strengthOfPredominance":"Jačina zastupljenosti","marginOfVictory":"Pobednička margina","predominantCategoryValue":"Vrednost predominantne kategorije","predominantCategoryContent":"Najčešća kategorija u ovoj oblasti je {expression}.","predominantCategoryValueContent":"Najčešća kategorija u ovoj oblasti je {expression1}, koja ima vrednost od {expression2}.","predominantCategoryValueMarginContent":"{expression1} ima vrednost od {expression2}, koja premašuje sve ostale <b>kategorije</b> za marginu od {expression3} poena u procentima.","predominantCategoryStrengthContent":"Uz vrednost od {expression1}, {expression2} je najčešća kategorija od {title} u ovoj oblasti, što je {expression3} od svih kombinovanih kategorija.","predominantCategoryTotalContent":"Uz vrednost od {expression1}, {expression2} je najčešća kategorija od svih {expression3} {title} u ovoj oblasti.","predominantCategoryTotalStrengthContent":"Uz vrednost od {expression1}, {expression2} je najčešća kategorija u ovoj oblasti, koja čini do {expression3} od svih {expression4} {title}.","ageInfo_years":"Starost, u godinama, od {startTime} do {endTime}","ageInfo_months":"Starost, u mesecima, od {startTime} do {endTime}","ageInfo_days":"Starost u danima, od {startTime} do {endTime}","ageInfo_hours":"Starost u satima, od {startTime} do {endTime}","ageInfo_minutes":"Starost u minutima, od {startTime} do {endTime}","ageInfo_seconds":"Starost u sekundama, od {startTime} do {endTime}","relationship":{"legendTitle":"Povezanost","HL":"Visoko – nisko","HH":"Visoko – visoko","LL":"Nisko – nisko","LH":"Nisko – visoko","HM":"Visoko – srednje","ML":"Srednje – nisko","MM":"Srednje – srednje","MH":"Srednje – visoko","LM":"Nisko – srednje","HM1":"High - Mild","HM2":"High - Medium","M2L":"Medium - Low","M2M1":"Srednje – blago","M2M2":"Srednje – srednje","M2H":"Medium - High","M1L":"Mild - Low","M1M1":"Blago – blago","M1M2":"Blago – srednje","M1H":"Mild - High","LM1":"Low - Mild","LM2":"Low - Medium"}}
{"title":"Jian wedding.wmv","uid":7764379,"size":281307250,"categoryP":"video","categoryS":"handheld","magnet":"?xt=urn:btih:bd63a58de619cd12352a7f0e75c1b7142ba92b71&amp;dn=Jian+wedding.wmv&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":"saritpg2002","files":1,"time":1351330044,"description":"kfjfkdjfdk","torrent":{"xt":"urn:btih:bd63a58de619cd12352a7f0e75c1b7142ba92b71","amp;dn":"Jian+wedding.wmv","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":"bd63a58de619cd12352a7f0e75c1b7142ba92b71","infoHashBuffer":{"type":"Buffer","data":[189,99,165,141,230,25,205,18,53,42,127,14,117,193,183,20,43,169,43,113]},"announce":[],"urlList":[]}}
{ "pack": { "pack_format": 1, "description": "\u00A7bDelogger\n\u00A77Lightweight logging API for debugging functions.\n\u00A78v0.0.1-dev for Minecraft 1.14\n\u00A77By \u00A7eArcensoth" } }
{ "name": "breaddevil/online-bdd", "description": "online bdd", "minimum-stability": "stable", "license": "tobedefined", "authors": [ { "name": "author's name", "email": "email@example.com" } ], "require": { "behat/behat": "2.4.*@stable", "behat/mink": "1.4.*@stable", "behat/mink-extension": "*", "behat/mink-goutte-driver": "*", "behat/mink-selenium2-driver": "*", "silex/silex": "~1.1", "symfony/security": "~2.3", "twig/twig": ">=1.8,<2.0-dev", "helios-ag/fm-elfinder-php-connector": "dev-master" }, "minimum-stability": "dev", "config": { "bin-dir": "bin/" } }
{"poster":"Khristophoros","date":"2018-08-04T05:12:05.149+0000","title":"I'm starting a crusade against targeted/reliable burst damage.","subforum":"Gameplay","up_votes":3,"down_votes":4,"body":"As a Vel&#039;Koz main I think this game will only be truly fair when all champions can potentially miss their entire kit.\r\n\r\nBut I&#039;ll settle for simple number nerfs to point and click burst.","replies":[{"poster":"KazaJhodo","date":"2018-08-04T05:43:18.000+0000","up_votes":2,"down_votes":2,"body":"I'm with you, skill game please.\n\nNo point and click cc. Gimme my counter-play.\n\nI don't understand how you can take a point and click stun from taric, but leave similar things on other champs. Like annie, the counterplay is to stay away.... ok. Sounds like fun.","replies":[{"poster":"Ranmaru","date":"2018-08-04T07:04:11.090+0000","up_votes":2,"down_votes":0,"body":"> [{quoted}](name=KazaJhodo,realm=NA,application-id=3ErqAdtq,discussion-id=Bt5nisa1,comment-id=0004,timestamp=2018-08-04T05:43:18.000+0000)\n>\n> I&#x27;m with you, skill game please.\n> \n> No point and click cc. Gimme my counter-play.\n> \n> I don&#x27;t understand how you can take a point and click stun from taric, but leave similar things on other champs. Like annie, the counterplay is to stay away.... ok. Sounds like fun.\n\nBecause annie cant use it whenever she wants the counterplay is watch under her health bar? mmk got it?","replies":[{"poster":"KazaJhodo","date":"2018-08-04T19:03:00.785+0000","up_votes":1,"down_votes":0,"body":"> [{quoted}](name=MyBackFlipFailed,realm=NA,application-id=3ErqAdtq,discussion-id=Bt5nisa1,comment-id=00040001,timestamp=2018-08-04T07:04:11.090+0000)\n>\n> Because annie cant use it whenever she wants the counterplay is watch under her health bar? mmk got it?\n\nWas that supposed to be a counter argument?\n\nYour only chance of trading in lane is if she uses stun to farm. Otherwise you can't get close and she can do whatever she wants in lane depending on jungles.\n\nSure, there is counterplay AFTER she uses it- or before she has it stacked. YET, all she has to do is stay back to eliminate that weakness. Her q range is huge, so she takes no penalties for that weakness. If she wasn't able to farm during that time, that would be more reasonable, that would be an actual weakness.\n\nIf she has flash up you can't walk into lane. If you don't know where the enemy jungle is you can't contest anything, one stun hit and you ded. Point and click from a mile away.\n\nJust, sit down, mmk got it? I can't believe you actually thought you had outplayed. ffs","replies":[]}]},{"poster":"Khristophoros","date":"2018-08-04T05:51:25.208+0000","up_votes":1,"down_votes":1,"body":"Yeah when they removed things like that, and gutted Kassadin, everything else became fair game in my eyes. They need to go all the way with the counterplay philosophy, not half ass it.","replies":[{"poster":"KazaJhodo","date":"2018-08-04T06:19:24.625+0000","up_votes":1,"down_votes":1,"body":"> [{quoted}](name=Khristophoros,realm=NA,application-id=3ErqAdtq,discussion-id=Bt5nisa1,comment-id=00040000,timestamp=2018-08-04T05:51:25.208+0000)\n>\n> Yeah when they removed things like that, and gutted Kassadin, everything else became fair game in my eyes. They need to go all the way with the counterplay philosophy, not half ass it.\n\nAbsolutely. They do have bigger fish to fry atm though. Overall balance period, and fixing the terrible matchmaking. I can't even play the game in its current state right now. Games are radically inconsistent.","replies":[]}]}]},{"poster":"lightdragoon88","date":"2018-08-04T05:13:04.883+0000","up_votes":2,"down_votes":0,"body":"{{champion:101}} You have my support.","replies":[]},{"poster":"Nekozei","date":"2018-08-04T05:24:06.150+0000","up_votes":2,"down_votes":1,"body":"Reliable burst damage is a fair trade for being melee which most burst damage champs are. Velkoz has a major range advantage on most burst champs. So if players who use mages can properly hit their skills, they can beat burst champs.","replies":[{"poster":"Khristophoros","date":"2018-08-04T05:28:41.811+0000","up_votes":1,"down_votes":1,"body":"Not when those melee champs have insane mobility.","replies":[{"poster":"Nekozei","date":"2018-08-04T14:55:20.333+0000","up_votes":1,"down_votes":0,"body":"If they didn't have mobility they would never be able to touch a spell caster. People get frustrated by burst champs because they don't know how to counterplay. You stun them, they're dead.","replies":[{"poster":"Khristophoros","date":"2018-08-04T19:33:02.746+0000","up_votes":1,"down_votes":0,"body":"The mobility is already so strong against a champ like Vel'koz that he can't duel any of those champs. The only reason he's viable is he can spam waveclear and then group with his team.","replies":[]}]}]},{"poster":"Generalist","date":"2018-08-04T06:41:38.103+0000","up_votes":1,"down_votes":0,"body":"> [{quoted}](name=Nekozei,realm=NA,application-id=3ErqAdtq,discussion-id=Bt5nisa1,comment-id=0003,timestamp=2018-08-04T05:24:06.150+0000)\n>\n> Reliable burst damage is a fair trade for being melee which most burst damage champs are. Velkoz has a major range advantage on most burst champs. So if players who use mages can properly hit their skills, they can beat burst champs.\n\nYou forgot that every melee burster has at least 2 gap closers or a windwall type ability that blocks your one advantage that range gives you","replies":[{"poster":"Nekozei","date":"2018-08-04T14:58:00.476+0000","up_votes":1,"down_votes":0,"body":"If you stun them they will fall. Gap closers are essential. How useful would a squishy katarina who couldn't blink be? It's a different playstyle that a lot of spell casters can't counter because they don't think. CC stops bursters.","replies":[]}]}]},{"poster":"Warlord Rhinark","date":"2018-08-04T06:23:11.712+0000","up_votes":1,"down_votes":0,"body":"As a Kayle main, this makes me cry.","replies":[{"poster":"Khristophoros","date":"2018-08-04T06:33:15.955+0000","up_votes":1,"down_votes":0,"body":"You don't want to know what I think about Kayle.","replies":[{"poster":"BEK Makadur","date":"2018-08-04T14:57:23.434+0000","up_votes":1,"down_votes":0,"body":"Only skillshot champs is completely stupid.\nEvery yasuo would love to get these changes.\n\nIt just breaks the game. \nAlso it is completely dumb for new players.\n\nWithout point and click cc some champs would just be way to strong and if nerfed just completely useless e.g. yi, tryn.\nAlso every champ with an enhanced aa would have to be changed, you want a game with mages only?...\n\nIf you rly want a skillshot game play smite...","replies":[{"poster":"KazaJhodo","date":"2018-08-04T19:06:09.939+0000","up_votes":1,"down_votes":0,"body":"> [{quoted}](name=Makadur,realm=EUW,application-id=3ErqAdtq,discussion-id=Bt5nisa1,comment-id=000600000000,timestamp=2018-08-04T14:57:23.434+0000)\n>\n> Only skillshot champs is completely stupid.\n> Every yasuo would love to get these changes.\n> \n> It just breaks the game. \n> Also it is completely dumb for new players.\n> \n> Without point and click cc some champs would just be way to strong and if nerfed just completely useless e.g. yi, tryn.\n> Also every champ with an enhanced aa would have to be changed, you want a game with mages only?...\n> \n> If you rly want a skillshot game play smite...\n\nWell, yeah. It should be point and click ranged stuns. Those should go. Melee stuns are fine.\n\nI had just assumed that was the idea. We're not eliminating stuns completely, just point and click ranged. Point and click itself implies that its ranged.","replies":[{"poster":"BEK Makadur","date":"2018-08-04T20:54:37.569+0000","up_votes":1,"down_votes":0,"body":"Some easy and reliable stuns need to be in the game, not only for below gold/plat/dia players but also to counter heavy mobilty and high dmg champs or just fed ones. On the other hand point and click cc ofc shouldn't be as long as skill cc. Unless its the only thing a champ does.","replies":[{"poster":"KazaJhodo","date":"2018-08-05T01:45:57.705+0000","up_votes":1,"down_votes":0,"body":"> [{quoted}](name=Makadur,realm=EUW,application-id=3ErqAdtq,discussion-id=Bt5nisa1,comment-id=00060000000000000000,timestamp=2018-08-04T20:54:37.569+0000)\n>\n> Some easy and reliable stuns need to be in the game, not only for below gold/plat/dia players but also to counter heavy mobilty and high dmg champs or just fed ones. On the other hand point and click cc ofc shouldn&#x27;t be as long as skill cc. Unless its the only thing a champ does.\n\nI agree that stuns should exist. I do not agree they need to be easy and reliable.\n\nMy main thing is what you said, long range point and click stuns.\n\nI would even take that further and say that long range, large area hitting shots of any sort should also not exist. LIke fizz ult, zoe stun, zyra ult. Where as syndra stuns I don't have an issue with because they require setup and can be visually outplayed.","replies":[]}]}]},{"poster":"Khristophoros","date":"2018-08-04T19:35:33.683+0000","up_votes":1,"down_votes":0,"body":"I'm really just saying they should nerf reliable and easy burst. If the champ can simply gap close across the screen and 100-0 a target with no counterplay, that's stupid.","replies":[{"poster":"BEK Makadur","date":"2018-08-04T20:51:45.061+0000","up_votes":1,"down_votes":0,"body":"Your first part in the post says something different.\n\nOn that I do agree unless the person is far ahead and against a target without a defensive item e.g. adcs.","replies":[]}]}]}]}]},{"poster":"Nut on my Butt","date":"2018-08-04T06:00:16.206+0000","up_votes":1,"down_votes":0,"body":"As a Vel'Koz main, you should be happy about targetted cc/burst keeping mobile champs in check, while at the same time countering champs like Liss and Annie who use it with your range.","replies":[{"poster":"Khristophoros","date":"2018-08-04T06:02:23.953+0000","up_votes":1,"down_votes":2,"body":"This is not the case when it's a mobile champ with reliable burst from items which is currently pretty much every mobile champ, regardless of whether it's AP or AD.","replies":[]}]},{"poster":"Zezockary","date":"2018-08-04T05:21:08.347+0000","up_votes":1,"down_votes":0,"body":"{{champion:45}} I agree. Just make my ult an aoe projectile that goes over minions and we are square.","replies":[{"poster":"Khristophoros","date":"2018-08-04T05:28:15.491+0000","up_votes":1,"down_votes":0,"body":"Executes shouldn't be considered \"reliable\" though because first you have to get the target low. If you have a reliable means to achieve that condition, then the true offender is whatever reliable means you have to get them into execute range.","replies":[]}]},{"poster":"Ranmaru","date":"2018-08-04T05:16:30.082+0000","up_votes":1,"down_votes":0,"body":"{{champion:1}} how do you feel about annie q?","replies":[{"poster":"Khristophoros","date":"2018-08-04T05:26:48.422+0000","up_votes":1,"down_votes":0,"body":"The ability by itself is not a huge offender because it's a low CD, low burst ability. The AP ratio is a little bit high but there are still many things that are more problematic.\n\nAnnie's kit as a whole is a moderate offender because her rotation is extremely clean and reliable. It's easy for her to instantly kill a target with almost no counterplay (tiny delays on W and R make them flashable but otherwise there's no much you can do) However, I only consider her kit as a whole a moderate offender because she has no built in mobility and low cast ranges, so positioning matters a lot for her and her opponents.\n\nI find reliable burst to be more of a problem on champions with high mobility because there is basically no positioning based counterplay. Instead the counterplay has to be somewhere else. In a lot of those cases because of their item and rune options, it leaves me wondering where the counterplay is.\n\nIdeally I wish Annie would get a small rework (think like Warwick's rework) but there are bigger problems.","replies":[]}]}]}
{ "name": "prysmalight", "private": true, "version": "1.2.0", "description": "GraphQL Server for PrysmaLight.", "main": "src/index.js", "repository": "https://github.com/Rooknj/prysmalight.git", "author": "Nick Rook <rooknj@outlook.com>", "license": "MIT", "devDependencies": { "cross-spawn": "^6.0.5", "eslint": "^5.15.1", "husky": "^0.14.3", "jest": "^24.3.1", "lint-staged": "^7.0.0", "nodemon": "^1.18.3", "pkg": "^4.3.3", "prettier": "^1.11.1", "prysma-docker": "0.1.0-alpha", "rimraf": "^2.6.2", "spawn-args": "^0.2.0" }, "dependencies": { "amqplib": "^0.5.3", "apollo-server": "^2.4.8", "apollo-server-express": "^2.4.8", "async-mqtt": "^1.0.1", "compression": "^1.7.3", "cors": "^2.8.4", "debug": "^3.1.0", "express": "^4.16.2", "graphql": "^0.13.2", "graphql-subscriptions": "^1.0.0", "helmet": "^3.12.1", "redis": "^2.8.0", "rxjs": "^6.3.3" }, "lint-staged": { "src/**/*.{js,json,graphql}": [ "prettier --write", "git add" ] }, "scripts": { "precommit": "lint-staged", "test": "node scripts/test", "build": "node scripts/build", "start": "node scripts/start", "clean": "node scripts/clean", "docker": "node scripts/dockerScripts" }, "bin": { "prod-server": "src/index.js" }, "pkg": { "assets": "node_modules/casual/src/providers/*" } }
{"response": {"status": "ok", "userTier": "developer", "total": 1, "content": {"id": "world/2009/dec/01/iran-yahtsmen-miliband", "type": "article", "sectionId": "world", "sectionName": "World news", "webPublicationDate": "2009-12-01T22:33:38Z", "webTitle": "Foreign Office concerned about Iran's refusal to reveal yachtsmen's location", "webUrl": "https://www.theguardian.com/world/2009/dec/01/iran-yahtsmen-miliband", "apiUrl": "https://content.guardianapis.com/world/2009/dec/01/iran-yahtsmen-miliband", "fields": {"headline": "Foreign Office concerned about Iran's refusal to reveal yachtsmen's location", "bodyText": "The Foreign Office said that Iran's reluctance to reveal how and where it was detaining five British yachtsmen was a matter for increasing concern as Iranian officials threatened \"serious measures\" if the men were found to have \"evil intentions\". In a meeting between the Iranian ambassador and the Foreign Office's top civil servant, Britain stressed the urgent need for Iran to allow consular access to the men, who were seized after reportedly straying into Iranian waters on their way to an international yacht race. Oliver Smith, 31, the yacht's skipper from Southampton, Oliver Young, 21, from Plymouth, Sam Usher, 26, from Scarborough and Luke Porter, 21, from Weston-super-Mare, all experienced yachtsmen, were en route to join the Dubai-Muscat offshore sailing race when, it seems, they inadvertently crossed into Iran's territorial waters near the small island of Sirri. With them is David Bloomer, a Bahrain-based radio sports presenter in his 60s thought to have dual British and Irish nationality. Iran's reluctance to give a full explanation of the circumstances under which it detained the men, or to reveal where it was holding them, was raised as a matter of urgency at the meeting between the Iranian ambassador and Peter Ricketts, permanent under-secretary at the Foreign Office. An FO spokesman said the message at yesterday's meeting was: \"Since it was now almost a week since the yachtsmen were held, the delay in providing a full explanation of what had happened and clarity on Iranian intentions were a matter of increasing concern.\" As delicate diplomatic negotiations continue, the foreign secretary, David Miliband, spoke personally to the Iranian foreign affairs minister yesterday evening. Throughout the day Miliband kept his comments low-key, saying it was a \"consular matter\". The yachtsmen had \"no malicious intent\", he said. \"This is a human story. It's got nothing to do with politics. It's got nothing to do with nuclear enrichment programmes.\" It had \"no relationship to any of the other, bigger issues\". In a statement released through the semi-official Fars news agency, Esfandiar Rahim-Mashaie, President Mahmoud Ahmadinejad's head of staff, said the fate of the five was now with the courts. \"The judiciary will decide about the five \u2026 naturally our measures will be hard and serious if we find out they had evil intentions\". Ahmadinejad, who made a televised address last night, failed to mention the captive sailors in the first 80 minutes of a rambling discourse in which he railed against the west and defended Iran's nuclear programme. But he gave a clear sign that relations between London and Tehran were at a new low by accusing Britain, along with Israel, of sabotaging a deal intended to resolve the dispute over Iran's nuclear programme. The deal, worked out in Geneva in October, would have seen Iran export uranium fuel to France and Russia for further enrichment. \"We are sure that the UK was against the Geneva talks. The Zionist regime and the UK were the major players \u2013 they pushed the panic button,\" he said. News of the crew's detention last Wednesday became public on Monday, one day after the announcement of Iran's plans to build 10 new uranium enrichment plants in breach of UN resolutions. The fear is the fate of the five could be jeopardised by the bigger political picture. Families, who have had brief mobile phone conversations with the men, stressed they were all highly experienced sailors. Charles Porter, father of Luke, said: \"We are extremely worried about Luke and his friends, but looking at similar incidents, we believe they will be released.\" The men were unable to tell relatives where they were being held, but the Foreign Office believes it could be on Sirri, a military installation site. Unconfirmed reports suggested their yacht Kingdom of Bahrain suffered propeller problems and could have been drifting for up to 10 hours as they waited for a tow. The UK's former ambassador to Iran, Sir Richard Dalton, warned not to expect an overnight resolution. \"There is quite a long way to go, I believe,\" he said. Iranians were extremely sensitive over their territorial waters, he added. \"Iran is very, very prickly and it regards illegal entry to its waters or lands as a crime which is prosecutable. So their comments are bound to reflect that situation,\" said Dalton, ambassador from 2002 until 2006. \"Add to that the fact that Britain's military forces \u2013 and, Iranians believe, espionage guys \u2013 are active, and that Iran thinks it has a regional terrorist problem in which Britain and the US are involved.\" The Kingdom of Bahrain yacht is owned by the Sail Bahrain project, which aims to promote the island as a yachting destination and was recently launched by Team Pindar, owned by GA Pindar &amp; Son, a family-owned publishing business based in Scarborough, North Yorkshire. Andrew Pindar, chairman of Sail Bahrain and owner of the boat, said the crew \"appeared to be in good spirits\" and he hoped they would be reunited with their families soon. In March 2007 eight Royal Navy sailors and seven Marines were held for 13 days after being detained in the mouth of the Shatt al-Arab waterway that separates Iran and Iraq. In June 2004 eight military personnel and three boats were seized, again in the Shatt al-Arab, delivering boats for the Iraqi river service. They were shown blindfold on Iranian TV before being released. But three young Americans, who allegedly strayed into Iran from Iraq after accidentally crossing the border whilst hiking, are still being detained and face spying charges."}, "isHosted": false, "pillarId": "pillar/news", "pillarName": "News"}}}
{ "thag1.87:0.1": "Theragāthā", "thag1.87:0.2": "Ekakanipāta", "thag1.87:0.3": "Navamavagga", "thag1.87:0.4": "1.87. Paviṭṭhattheragāthā", "thag1.87:1.1": "“Khandhā diṭṭhā yathābhūtaṃ,", "thag1.87:1.2": "bhavā sabbe padālitā;", "thag1.87:1.3": "Vikkhīṇo jātisaṃsāro,", "thag1.87:1.4": "natthi dāni punabbhavo”ti.", "thag1.87:1.5": "…", "thag1.87:1.6": "Paviṭṭho thero …." }
{"phone":"1234567890","id":"mz5gf7jyy9v5aa0n8kwy","expires":1628004037263}
{ "name": "Rakna Lanka (Diyawanna Kotthu Hut)", "address": "No. 545A, Madiwela Road, Thalawathugoda", "open_until": " Open until 08:00 PM", "telephone": "0114345253", "description": "Just opposite the Diyawanna Jogging Track car park is the newly built army kotthu shop. This is the closest place for joggers to come and have a bite after a light workout. They do a chicken and egg kotthu, and that pretty much sums up the whole menu. They do however have a convenient little shop which sells biscuits, soft drinks and even cigarettes. \n", "reviews": "Just opposite the Diyawanna Jogging Track car park is the newly built army kotthu shop. This is the closest place for joggers to come and have a bite after a light workout. They do a chicken and egg kotthu, and that pretty much sums up the whole menu. They do however have a convenient little shop which sells biscuits, soft drinks and even cigarettes.\n\nJust opposite the Diyawanna Jogging Track car park is the newly built army kotthu shop. This is the closest place for joggers to come and have a bite after a light workout. They do a chicken and egg kotthu, and that pretty much sums up the whole menu. They do however have a convenient little shop which sells biscuits, soft drinks and even cigarettes.\n\n\u0d85\u0dbd\u0dd4\u0dad\u0dd9\u0db1\u0dca \u0dc4\u0daf\u0db1 \u0dbd\u0daf \u0dba\u0dd4\u0daf \u0dc4\u0db8\u0dd4\u0daf\u0dcf \u0d9a\u0ddc\u0dad\u0dca\u0dad\u0dd4 \u0dc4\u0dbd \u0dad\u0dd2\u0db6\u0dd9\u0db1\u0dca\u0db1\u0dda \u0daf\u0dd2\u0dba\u0dc0\u0db1\u0dca\u0db1\u0dcf\u0dc0 \u0d85\u0daf\u0dca\u0daf\u0dbb \u0da2\u0ddc\u0d9c\u0dd2\u0d82 \u0d9a\u0dd2\u0dbb\u0dd3\u0db8 \u0dc4\u0dd9\u0dc0\u0dad\u0dca \u0dc4\u0dd0\u0dbd\u0dca\u0db8\u0dda \u0daf\u0dd2\u0dc0\u0dd4\u0db8 \u0dc0\u0dd9\u0db1\u0dd4\u0dc0\u0dd9\u0db1\u0dca \u0d89\u0daf\u0dd2 \u0d9a\u0dbb\u0db1 \u0dbd\u0daf \u0db8\u0d9c \u0db7\u0dcf\u0dc0\u0dd2\u0dad\u0dcf \u0d9a\u0dbb\u0db1 \u0d85\u0dba\u0d9c\u0dda \u0d9a\u0dcf\u0dbb\u0dca \u200d\u0db1\u0dd0\u0dc0\u0dad\u0dd4\u0db8\u0dca\u0db4\u0dc5 \u0d89\u0daf\u0dd2\u0dbb\u0dd2\u0db4\u0dd2\u0da7\u0dba\u0dd2. \u0dc3\u0dd0\u0dc4\u0dd0\u0dbd\u0dca\u0dbd\u0dd4 \u0dc0\u0dca\u200d\u0dba\u0dcf\u0dba\u0dcf\u0db8 \u0d9a\u0dd2\u0dbb\u0dd3\u0db8\u0d9a\u0dd2\u0db1\u0dca \u0db4\u0dc3\u0dd4\u0dc0 \u0db4\u0dd0\u0db8\u0dd2\u0dab \u0dba\u0db8\u0d9a\u0dca \u0dc4\u0db4\u0db1\u0dca\u0db1 \u0db4\u0dd4\u0dc5\u0dd4\u0dc0\u0db1\u0dca \u0dc5\u0d9f\u0dd2\u0db1\u0dca \u0db8 \u0db4\u0dd2\u0dc4\u0dd2\u0da7\u0dd2 \u0dad\u0dd0\u0db1 \u0dad\u0db8\u0dba\u0dd2, \u0daf\u0dd2\u0dba\u0dc0\u0db1\u0dca\u0db1\u0dcf \u0d9a\u0ddc\u0dad\u0dca\u0dad\u0dd4 \u0dc4\u0da7\u0dca \u0d91\u0d9a. \u0d91\u0dc4\u0dd2 \u0dad\u0dd2\u0db6\u0dd9\u0db1\u0dc0\u0dcf \u0da0\u0dd2\u0d9a\u0db1\u0dca \u0dc4\u0dcf \u0db6\u0dd2\u0dad\u0dca\u0dad\u0dbb \u0d9a\u0ddc\u0dad\u0dca\u0dad\u0dd4. \u0db8\u0dd9\u0db1\u0dd4\u0dc0\u0dda \u0dad\u0dd2\u0db6\u0dd9\u0db1\u0dca\u0db1\u0dda \u0d91\u0da0\u0dca\u0da0\u0dbb\u0db8\u0dba\u0dd2 \u0dc0\u0d9c\u0dda. \u0d91\u0dc4\u0dd9\u0dad\u0dca, \u0d9a\u0ddc\u0dad\u0dca\u0dad\u0dd4\u0dc4\u0dbd\u0da7 \u0dba\u0dcf\u0db6\u0daf\u0dc0 \u0db4\u0dd2\u0dc4\u0dd2\u0da7\u0dd4\u0dc0\u0dcf \u0dad\u0dd2\u0db6\u0dd9\u0db1 \u0db4\u0dd4\u0d82\u0da0\u0dd2 \u0d9a\u0da9\u0dba\u0dda \u0db6\u0dd2\u0dc3\u0dca\u0d9a\u0da7\u0dca, \u0db4\u0dd0\u0dab\u0dd2 \u0db6\u0dd3\u0db8 \u0db4\u0db8\u0dab\u0d9a\u0dca \u0db1\u0ddc\u0dc0\u0dd9\u0dba\u0dd2, \u0daf\u0dd4\u0db8\u0dca\u0dc0\u0dd0\u0da7\u0dd2 \u0db4\u0dc0\u0dcf \u0dc0\u0dd2\u0d9a\u0dd4\u0dab\u0db1\u0dca\u0db1 \u0dad\u0dd2\u0db6\u0dd9\u0db1\u0dc0\u0dcf.\n", "yamu_rating": "It's alright", "url": "https://www.yamu.lk/place/diyawanna-kotthu-hut/review-15392", "img_urls": [ "https://d3dz4rogqkqh6r.cloudfront.net/uploads/files/2018/06/yimg_oarYI3.jpg", "https://d3dz4rogqkqh6r.cloudfront.net/uploads/files/2018/01/yimg_iCGWqc.png", "https://www.yamu.lk/l/assets/img/fork.svg", "https://www.yamu.lk/l/assets/img/culture.svg", "https://www.yamu.lk/l/assets/img/yamu_logo.svg", "https://d3dz4rogqkqh6r.cloudfront.net/uploads/files/2018/06/yimg_amrU6R.jpg", "https://www.yamu.lk/uploads/files/2015/08/yimg_Wy54EA-150x100.JPG", "https://www.yamu.lk/uploads/files/2015/08/yimg_CWzbch-150x100.JPG", "https://www.yamu.lk/uploads/files/2015/08/yimg_nMb7uP-150x100.JPG", "https://www.yamu.lk/uploads/files/2015/08/yimg_WWjUPP-150x100.JPG", "https://www.yamu.lk/uploads/files/2015/08/yimg_F23PGP-150x100.JPG", "https://www.yamu.lk/uploads/files/2015/08/yimg_Jtojqe-150x100.JPG", "https://www.yamu.lk/uploads/files/2015/08/yimg_KzpKBL-150x100.JPG", "https://www.yamu.lk/uploads/files/2015/08/yimg_FofmaF-150x100.JPG", "https://www.yamu.lk/wp-content/uploads/2013/05/army-1-150x105.jpg", "https://www.yamu.lk/wp-content/uploads/2013/05/army-2-150x105.jpg", "https://www.yamu.lk/wp-content/uploads/2013/05/army-3-150x105.jpg", "https://www.yamu.lk/wp-content/uploads/2013/05/army-150x105.jpg", "https://www.yamu.lk/uploads/files/2015/08/yimg_qd33kK-150x100.JPG", "https://www.yamu.lk/uploads/files/2015/08/yimg_857Mhz-150x100.JPG", "https://www.yamu.lk/uploads/files/2015/08/yimg_xeAerE-150x100.JPG", "https://www.yamu.lk/uploads/files/2015/08/yimg_pehCTo-150x100.JPG", "https://www.yamu.lk/uploads/files/2015/08/yimg_ityBpn-150x100.JPG", "https://www.yamu.lk/uploads/files/2015/08/yimg_rOCkEY-150x100.JPG", "https://d3dz4rogqkqh6r.cloudfront.net/uploads/files/2017/03/yimg_DWnStO.png", "https://d3dz4rogqkqh6r.cloudfront.net/uploads/files/2016/01/yimg_Ptuiqe-600x250.JPG", "https://www.yamu.lk/uploads/files/2015/06/yimg_yPKV0U-600x250.jpg", "https://d3dz4rogqkqh6r.cloudfront.net/uploads/files/2018/03/yimg_V9gegf.jpg", "https://www.yamu.lk/uploads/files/2015/08/yimg_Wy54EA-640x480.JPG", "https://www.yamu.lk/uploads/files/2015/08/yimg_CWzbch-640x480.JPG", "https://www.yamu.lk/uploads/files/2015/08/yimg_nMb7uP-640x480.JPG", "https://www.yamu.lk/uploads/files/2015/08/yimg_WWjUPP-640x517.JPG", "https://d3dz4rogqkqh6r.cloudfront.net/uploads/files/2018/01/yimg_sl08gd.gif", "https://www.facebook.com/tr?id=609408732574388&ev=PageView&noscript=1" ] }
{"geometry":{"type":"Polygon","coordinates":[[[0.685187,44.428905],[0.671154,44.426042],[0.655119,44.418128],[0.642253,44.423239],[0.651121,44.426049],[0.661622,44.441682],[0.652886,44.449845],[0.643288,44.450891],[0.642179,44.454254],[0.653269,44.464253],[0.678960,44.478369],[0.685789,44.474730],[0.674783,44.464025],[0.675595,44.454054],[0.685208,44.447763],[0.690986,44.438329],[0.685187,44.428905]]]},"id":102070441,"type":"Feature","properties":{"qs:a1r":"AQUITAINE","geom:longitude":0.667404,"qs:a1_lc":"47","geom:latitude":44.446658,"src:geom_alt":[],"wof:hierarchy":[{"country_id":85633147,"region_id":85683341,"county_id":102070441}],"iso:country":"FR","wof:geomhash":"e188eeffcd98d898fbee89d6567cb4d2","qs:level":"adm2","qs:a2_lc":"34","wof:name":"","src:geom":"quattroshapes","qs:adm0":"France","wof:supersedes":[],"wof:id":102070441,"qs:a2r_lc":"3","wof:breaches":[],"qs:a1r_lc":"72","geom:area":0.001466,"qs:adm0_a3":"FRA","qs:source":"France IGN","wof:belongsto":[85633147,85683341],"wof:placetype":"county","qs:a0":"France","qs:a1":"LOT-ET-GARONNE","wof:lastmodified":1439487550,"wof:superseded_by":[],"wof:concordances":{},"wof:parent_id":85683341},"bbox":[0.642179,44.418128,0.690986,44.478369]}
{ "template": "episode", "href": "les-jours-la-campagne-anaxago", "number": 7, "date": "2016-03-17T10:00+01:00", "title": "Devenez actionnaire des «&nbsp;Jours&nbsp;»", "intro": "Pour financer notre première année d'activité, nous cherchons à lever 750&nbsp;000&nbsp;euros. Nous comptons sur vous&nbsp;!", "subtitle": "Pour financer notre première année d'activité, nous cherchons à lever 750&nbsp;000&nbsp;euros. Nous comptons sur vous&nbsp;!", "lead": "«&nbsp;Les Jours&nbsp;» cherchent 750&nbsp;000 euros. Si un industriel fait un chèque de ce montant, il s’achète un média et de l’influence politique. Si 750 personnes font un chèque de 1000 euros, elles cofinancent un média indépendant&nbsp;»", "tags": ["Les Jours", "journalisme"], "rel": { "authors": [ { "text": "Les Jours" }, { "photo": "author:sebastien-calvet" } ], "first": "episode:les-jours-c-quoi/les-jours-le-projet", "prev": "episode:les-jours-c-quoi/les-jours-l-equipe", "last": "episode:les-jours-c-quoi/les-jours-la-campagne-anaxago" } }
{ "_class": "artboard", "backgroundColor": { "_class": "color", "alpha": 1, "blue": 1, "green": 1, "red": 1 }, "do_objectID": "307F5503-588C-422C-B3B5-B3B1EE0512FF", "exportOptions": { "_class": "exportOptions", "exportFormats": [ { "_class": "exportFormat", "absoluteSize": 0, "fileFormat": "png", "name": "", "namingScheme": 0, "scale": 1, "visibleScaleType": 0 } ], "includedLayerIds": [ ], "layerOptions": 0, "shouldTrim": false }, "frame": { "_class": "rect", "constrainProportions": false, "height": 17711, "width": 1024, "x": 73818, "y": 9564 }, "hasBackgroundColor": true, "hasClickThrough": true, "horizontalRulerData": { "_class": "rulerData", "base": 0, "guides": [ ] }, "includeBackgroundColorInExport": true, "includeInCloudUpload": true, "isFlippedHorizontal": false, "isFlippedVertical": false, "isFlowHome": false, "isLocked": false, "isVisible": true, "layerListExpandedType": 2, "layers": [ { "class": "symbolInstance", "id": "1EB2DFCC-83AF-4CBE-BA1C-9DB92CD9C29E" }, { "class": "group", "id": "AE7F3A79-3319-4F6E-B840-85E8E81AB402" }, { "class": "group", "id": "F74525CA-F56C-4ED8-B2D3-75354DA53E1E" }, { "class": "group", "id": "1125AAAF-1902-40E1-9990-E47E4A7EE3E4" }, { "class": "group", "id": "0F0AD22A-D01B-4F76-A038-138AC58726D2" }, { "class": "group", "id": "E023E73C-7FDA-40B0-A9D4-183B4F50AE47" }, { "class": "group", "id": "FA2BA367-A864-4EFF-A5F6-2BE18B8F7C44" }, { "class": "group", "id": "7262D1BA-B604-4B30-8BB0-28E626B4AA3A" }, { "class": "group", "id": "48E9CDB8-381B-4203-8C31-082E0A41CF86" }, { "class": "group", "id": "1B3E6CFF-C65B-4613-9D97-6EF2C7C7D8DC" }, { "class": "symbolInstance", "id": "B81940C9-1D38-43DB-A82B-78D0260850A3" }, { "class": "symbolInstance", "id": "B8FFAAAC-BBA3-4718-B39D-3030273F72EB" }, { "class": "group", "id": "D4BD7B47-6417-48AC-B74D-7C06055EDCE4" }, { "class": "symbolInstance", "id": "99B11983-DB93-42AD-808C-69092D2CE0B3" }, { "class": "symbolInstance", "id": "CB2A2A39-60C9-45ED-8EB6-A19D8514EC6F" }, { "class": "symbolInstance", "id": "5BD23901-4792-422D-90FA-FEF7CE95DBDC" }, { "class": "group", "id": "1A760ADD-8E48-4271-987E-F5F3D769131B" }, { "class": "group", "id": "81250A3D-38BD-4D00-91AD-B8D02738C772" }, { "class": "text", "id": "43ECC628-0C2F-4D76-9D3E-2189C45385CB" }, { "class": "text", "id": "170D86A9-43BD-4CC0-A6B2-79BDD622CC1B" }, { "class": "text", "id": "3634CBD0-2836-419B-AAC3-069927AB83D2" }, { "class": "text", "id": "1885923C-B619-4900-8437-CB10B1069006" }, { "class": "text", "id": "BDD79378-37D6-4C8D-B3D9-D793C2FB768A" }, { "class": "shapeGroup", "id": "D1D5E6B6-04BA-418B-ABC9-167C33AAD743" }, { "class": "shapeGroup", "id": "8152D0D5-694A-4EB2-80E5-038DB886A5B0" }, { "class": "shapeGroup", "id": "96EC6635-B5A5-471F-AFA0-FE52E25665DE" }, { "class": "shapeGroup", "id": "5B118E8A-9210-4D92-9CCC-6181894E4EFF" }, { "class": "shapeGroup", "id": "79E8B412-345B-46F9-A216-0F9C1653F9A9" }, { "class": "shapeGroup", "id": "FBA6B685-10F8-4A4F-925C-5B3ADF6B8A6F" }, { "class": "text", "id": "2815750C-FBB6-4D4D-A199-9B8A10A2BB59" }, { "class": "text", "id": "5F15FCD4-783D-4FBA-BE56-BCF2B662A28E" }, { "class": "shapeGroup", "id": "1A384CAF-79D7-44CE-A618-03A4D8E608C1" }, { "class": "shapeGroup", "id": "E5709893-0D47-442A-8844-14BA6BA9D162" }, { "class": "group", "id": "69672B0B-8142-497B-96C3-F1E9DD60EE94" }, { "class": "group", "id": "DBF72830-16E1-405F-9C64-DD8D73FD9DB2" }, { "class": "group", "id": "27632EE5-DED7-4935-9FF0-6099A6F49638" }, { "class": "group", "id": "68D84C04-2A85-4481-BC8C-B406731C6F4C" }, { "class": "symbolInstance", "id": "E91F7CE2-BD47-4375-BBA6-9C7933FD07A8" }, { "class": "symbolInstance", "id": "AEA4AE4F-6312-4CB7-B332-7865248F648B" }, { "class": "symbolInstance", "id": "B94D4818-F157-4351-8B93-D1925716D7FF" }, { "class": "text", "id": "C44BE6A1-31EE-41AD-81E2-8CFD1AA755AE" }, { "class": "shapeGroup", "id": "BABC2E50-018E-453A-8A3A-644119D120AA" }, { "class": "group", "id": "A1AD816B-77A8-472F-81E3-CA93FC42A246" }, { "class": "group", "id": "40DA91E7-0540-4AA5-8674-E1AFDFE7417C" }, { "class": "shapeGroup", "id": "CD2F0091-DB16-4797-8563-59AE8B6A66E3" }, { "class": "group", "id": "385B073A-718C-472B-8884-050D7A3E966C" }, { "class": "group", "id": "72572456-0FEA-4DD0-B3A0-C77CD8837367" }, { "class": "shapeGroup", "id": "732880A1-3770-4515-96BB-51FDA959128E" }, { "class": "group", "id": "F385253D-2DBD-4954-89D8-59152F669307" }, { "class": "text", "id": "9066536C-977F-426F-9037-04BBC785452C" }, { "class": "group", "id": "D407ADBD-74CE-4569-B9D1-C49DDEA8229E" }, { "class": "text", "id": "1B269381-679D-4C94-B323-7E45430D3540" }, { "class": "group", "id": "5D744FDB-A920-425A-8A66-5314D78AFFC3" }, { "class": "group", "id": "7B17842B-EC3A-44F8-976C-BFEC5619E4D0" }, { "class": "group", "id": "4EC2A7EC-55BE-42B9-8026-DA3FF962B0BB" }, { "class": "shapeGroup", "id": "C39843D6-8931-4F5E-87C4-39288F6EA1DD" }, { "class": "shapeGroup", "id": "8DEE58CB-BBDF-4934-8292-2635A29D1F88" }, { "class": "text", "id": "9FDCE862-F006-4E85-A6EC-E7770DF7B7BE" }, { "class": "shapeGroup", "id": "3C4E57D3-8A1A-4218-BCE5-67C116A3ED63" }, { "class": "shapeGroup", "id": "1B863F2E-4D43-4703-AD33-99B60B0C1812" }, { "class": "text", "id": "DFF64AB0-507C-4A83-BA67-0110423A1095" }, { "class": "shapeGroup", "id": "9424A63F-2B75-424A-85CE-2C79C20D21BC" }, { "class": "group", "id": "D18A69BD-2CD2-4395-AF4B-8DEED0B0AC27" }, { "class": "group", "id": "B28C91AB-DE89-4A25-A96D-B1757457FECF" }, { "class": "group", "id": "48755BF5-6D7F-44A4-8FD4-76D349FCB158" }, { "class": "group", "id": "24114A52-F0B3-4CB4-BDDC-1F554FDB6256" }, { "class": "group", "id": "397D96C2-4469-4528-87D9-4EF6DA3B08A5" }, { "class": "group", "id": "DDB123E7-52F1-409B-B05E-6E139D2C83F8" }, { "class": "group", "id": "6A865C33-EAB3-4647-A265-8F664EA43FE2" }, { "class": "group", "id": "7F3F07B5-D398-4E60-A5B3-BDC50F894F20" }, { "class": "shapeGroup", "id": "190E40CC-711E-448B-BC50-6BAEB65496DF" }, { "class": "symbolInstance", "id": "8832A009-6B66-42D1-9F9A-E58185A7DAC0" }, { "class": "symbolInstance", "id": "74CFDA19-CFB5-4B08-AD88-04EE9C4E1C61" }, { "class": "group", "id": "B833A29F-4F26-4481-84C2-3D2371239A83" }, { "class": "group", "id": "968E2FB1-6CC8-4C36-9F47-A926C8D25F5C" }, { "class": "group", "id": "95F2258E-8C3C-4590-B002-A90ABC9C6E74" }, { "class": "group", "id": "3F06528B-86BB-4E2B-9A62-B0AA7BDEC99E" }, { "class": "group", "id": "113272B9-3193-4880-9C9E-F26AE49F9F21" }, { "class": "group", "id": "EEA750B2-7424-439E-91B2-739801B15562" } ], "layout": { "_class": "layoutGrid", "columnWidth": 60, "drawHorizontal": false, "drawHorizontalLines": false, "drawVertical": true, "gutterHeight": 12, "gutterWidth": 21.81818181818182, "guttersOutside": false, "horizontalOffset": 32, "isEnabled": false, "numberOfColumns": 12, "rowHeightMultiplication": 5, "totalWidth": 960 }, "name": "2) Specs & States", "nameIsFixed": true, "resizesContent": false, "resizingConstraint": 63, "resizingType": 0, "rotation": 0, "shouldBreakMaskChain": true, "style": { "_class": "style", "endDecorationType": 0, "fills": [ { "_class": "fill", "color": { "_class": "color", "alpha": 1, "blue": 1, "green": 1, "red": 1 }, "fillType": 0, "isEnabled": true, "noiseIndex": 0, "noiseIntensity": 0, "patternFillType": 1, "patternTileScale": 1 } ], "miterLimit": 10, "startDecorationType": 0 }, "verticalRulerData": { "_class": "rulerData", "base": 0, "guides": [ ] } }
{"title":"Atmospheric Energy - Progressive Future 084","uid":5546896,"size":297183211,"categoryP":"audio","categoryS":"music","magnet":"?xt=urn:btih:4a43c5eb73d237d31cb6440424dbf6ec1ec0fc98&amp;dn=Atmospheric+Energy+-+Progressive+Future+084&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":"cyberunknown","files":5,"time":1273364851,"description":"artist...: Atmospheric Energy\ntitle....: Progressive Future 084\n\ngenre....: Trance\nrls.date.: 09-may-2010\nsource...: SBD\n\nduration.: 02:03:48\nencoder..: LAME 3.98.4\nquality..: MP3 CBR 320 kbps / 44.1 kHz / Joint Stereo\nsize.....: 283 MB\n\noff.site.:\n\n\nTracklist:\n\n01. Tom Colontonio - Subdued (Mike Nichol Remix) [Discover]\n02. Faruk Sabanci - Truly Blessed [High Light]\n03. High Noon At Salinas &amp; Kyrst - Virgin Kyle Beach (Angel Ace Remix) [Magic Island]\n04. Mark Pledger feat. Melinda Gareh - Time Stands Still (7 Skies Dub) [Solaris]\n05. Garry Heaney - X Marks The Spot (Sean Truby Remix) [2 Play]\n06. Juventa - Sapphire (Suncatcher Remix) [Infrasonic]\n07. Motionchild &amp; Will Holland feat. Tiff Lacey - Arctic Kiss (Andy Blueman Instrumental Remix) [Enhanced]\n08. Gravity pres. Harry Dyer - Red Light Green Light (Adam Nickey Remix) [Red Force]\n09. John Askew - Misfit (Adam Foley Remix) [Discover]\n10. Nathan Profitt - Strange Days (Manuel Le Saux Remix) [Camouflage]\n11. John Askew - Fade To Black (Sean Tyas Remix) [Discover]\n12. Joel Gershom - Purple Sunset (Dallaz Project Remix) [Perceptive]\n13. Nitrous Oxide - Dreamcatcher [Anjunabeats]\n14. Anemosphere - Kyra (Adam Nickey Remix) [Affective]\n15. Elias B - After All (Sunny Lax Remix) [Blue Soho]\n16. Odonbat - Beside The Moon (ReOrder Remix) [Silent Shore]\n17. Ronald Van Gelderen - Backstabberzz (Ummet Ozcan Mix) [Raw Sessions]\n18. Deep Voices - Sinewave (Thomas Datt Remix) [Deep Voices]\n19. David Murtagh - Forward [Vaccine]\n20. Vibrasphere vs. Ticon - Dews Drops (John '00' Fleming Mash Up Mix) [Iboga]\n21. J Michael Kober - Lost Moon (Magnus Remix) [JOOF]","torrent":{"xt":"urn:btih:4a43c5eb73d237d31cb6440424dbf6ec1ec0fc98","amp;dn":"Atmospheric+Energy+-+Progressive+Future+084","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":"4a43c5eb73d237d31cb6440424dbf6ec1ec0fc98","infoHashBuffer":{"type":"Buffer","data":[74,67,197,235,115,210,55,211,28,182,68,4,36,219,246,236,30,192,252,152]},"announce":[],"urlList":[]}}
{"poster":"Bèst Zileán EUW","date":"2016-01-09T09:39:49.131+0000","title":"Zilean Main sucht ADC // GOLD-PLATIN","subforum":"Clans & Teams","up_votes":2,"down_votes":1,"body":"Hallo, ich suche f&uuml;r jetzt und S6 einen Main ADC, ich bin Zilean Supp und carry mich gerade hoch, nat&uuml;rlich kann ich auch andere Supports. Zu mir, ich bin 24 und hei&szlig;e Arnold ;) Bitte keine mundfaulen Leute, sympathie ist mir sehr wichtig. Teamsspeak ist vorhanden. Und nein ich spiele mit euch nicht sofort Blind DuoQ...","replies":[{"poster":"Bèst Zileán EUW","date":"2016-01-09T11:52:08.127+0000","up_votes":1,"down_votes":0,"body":"Oh yes, shame on me! You are the real Lord of Zilean ;)\nBut my KDA is better :p","replies":[{"poster":"Ragnarskar","date":"2016-01-09T12:00:20.414+0000","up_votes":1,"down_votes":0,"body":"Mal schauen ob das auch stimmt wenn du 450games+ hast^^ Viel glück beim suchen und LP farmen^^","replies":[{"poster":"Bèst Zileán EUW","date":"2016-01-09T12:07:49.423+0000","up_votes":1,"down_votes":0,"body":"Danke aber ichglaub solangr habe ich kein bock auf Zil:) Warum kaufst du dir L.Qualen auf ihn?","replies":[{"poster":"Ragnarskar","date":"2016-01-09T20:44:53.874+0000","up_votes":1,"down_votes":0,"body":"Ich hab MPen runen drinne, mit masteries und liandrys ~30mpen. Den dmg unterschied merkt man enorm, grade da die base values gut sind auf zilean dazu kommt das es stark im late game ist.","replies":[]}]}]}]},{"poster":"Ragnarskar","date":"2016-01-09T10:54:22.793+0000","up_votes":1,"down_votes":0,"body":"http://euw.op.gg/summoner/userName=emperor+eternity Get on my lvl bro! Best Zilean EUW my ass ;P","replies":[]}]}
{ "id": 412516275231793152, "text": "1730 市區綫列車服務安排：\n\n將軍澳綫：全綫暫停\n\n觀塘綫：分段服務１）油麻地－觀塘，～3分鐘一班、2）觀塘站 2 號月台－北角，8分鐘一班\n\n荃灣綫：因訊號系統故障，間中會受阻\n\n港島綫：因訊號系統故障，間中會受阻 #MTR", "created_at": "2013-12-16 17:35:18 +0800", "lang": "ja", "reply_to": null }
{"id":"9/14/2002","name":"2002-09-14","date":"0001-01-01T00:00:00","entries":[{"id":"1-across","group":["1-across"],"separatorLocations":{},"number":1,"humanNumber":"1","clue":" Seat of Silver Bow County","direction":"across","length":5,"position":{"x":0,"y":0},"solution":"BUTTE"},{"id":"6-across","group":["6-across"],"separatorLocations":{},"number":6,"humanNumber":"6","clue":" It may be pulled or pumped","direction":"across","length":6,"position":{"x":7,"y":0},"solution":"MUSCLE"},{"id":"12-across","group":["12-across"],"separatorLocations":{},"number":12,"humanNumber":"12","clue":" Strip","direction":"across","length":6,"position":{"x":0,"y":1},"solution":"UNROBE"},{"id":"14-across","group":["14-across"],"separatorLocations":{},"number":14,"humanNumber":"14","clue":" Bump along the way?","direction":"across","length":7,"position":{"x":7,"y":1},"solution":"ANTHILL"},{"id":"16-across","group":["16-across"],"separatorLocations":{},"number":16,"humanNumber":"16","clue":" One striking out, maybe","direction":"across","length":6,"position":{"x":0,"y":2},"solution":"EDITOR"},{"id":"17-across","group":["17-across"],"separatorLocations":{},"number":17,"humanNumber":"17","clue":" Took off on","direction":"across","length":8,"position":{"x":7,"y":2},"solution":"PARODIED"},{"id":"19-across","group":["19-across"],"separatorLocations":{},"number":19,"humanNumber":"19","clue":" Catholic devotion","direction":"across","length":6,"position":{"x":0,"y":3},"solution":"NOVENA"},{"id":"20-across","group":["20-across"],"separatorLocations":{},"number":20,"humanNumber":"20","clue":" 48-Down military group member","direction":"across","length":4,"position":{"x":7,"y":3},"solution":"SEAL"},{"id":"21-across","group":["21-across"],"separatorLocations":{},"number":21,"humanNumber":"21","clue":" Swimmer with a long snout","direction":"across","length":3,"position":{"x":12,"y":3},"solution":"GAR"},{"id":"22-across","group":["22-across"],"separatorLocations":{},"number":22,"humanNumber":"22","clue":" Shaman's doctrine","direction":"across","length":7,"position":{"x":0,"y":4},"solution":"ANIMISM"},{"id":"24-across","group":["24-across"],"separatorLocations":{},"number":24,"humanNumber":"24","clue":" Enumerate","direction":"across","length":7,"position":{"x":8,"y":4},"solution":"SPECIFY"},{"id":"26-across","group":["26-across"],"separatorLocations":{},"number":26,"humanNumber":"26","clue":" Right of passage","direction":"across","length":8,"position":{"x":1,"y":5},"solution":"EASEMENT"},{"id":"28-across","group":["28-across"],"separatorLocations":{},"number":28,"humanNumber":"28","clue":" Russian mint product","direction":"across","length":5,"position":{"x":10,"y":5},"solution":"RUBLE"},{"id":"29-across","group":["29-across"],"separatorLocations":{},"number":29,"humanNumber":"29","clue":" Soft, twilled silk","direction":"across","length":5,"position":{"x":4,"y":6},"solution":"SURAH"},{"id":"30-across","group":["30-across"],"separatorLocations":{},"number":30,"humanNumber":"30","clue":" Less likely to make mistakes","direction":"across","length":5,"position":{"x":10,"y":6},"solution":"ABLER"},{"id":"31-across","group":["31-across"],"separatorLocations":{},"number":31,"humanNumber":"31","clue":" Supermodel Veronica","direction":"across","length":4,"position":{"x":0,"y":7},"solution":"WEBB"},{"id":"35-across","group":["35-across"],"separatorLocations":{},"number":35,"humanNumber":"35","clue":" Two for the record","direction":"across","length":5,"position":{"x":5,"y":7},"solution":"SIDES"},{"id":"37-across","group":["37-across"],"separatorLocations":{},"number":37,"humanNumber":"37","clue":" Three in a match, maybe","direction":"across","length":4,"position":{"x":11,"y":7},"solution":"SETS"},{"id":"38-across","group":["38-across"],"separatorLocations":{},"number":38,"humanNumber":"38","clue":" Caseharden","direction":"across","length":5,"position":{"x":0,"y":8},"solution":"INURE"},{"id":"40-across","group":["40-across"],"separatorLocations":{},"number":40,"humanNumber":"40","clue":" Portion for the plate","direction":"across","length":5,"position":{"x":6,"y":8},"solution":"TITHE"},{"id":"42-across","group":["42-across"],"separatorLocations":{},"number":42,"humanNumber":"42","clue":" Advice to a type-A person","direction":"across","length":5,"position":{"x":0,"y":9},"solution":"RELAX"},{"id":"43-across","group":["43-across"],"separatorLocations":{},"number":43,"humanNumber":"43","clue":" Like some old film sleuths","direction":"across","length":8,"position":{"x":6,"y":9},"solution":"ORIENTAL"},{"id":"47-across","group":["47-across"],"separatorLocations":{},"number":47,"humanNumber":"47","clue":" Transistor electrode","direction":"across","length":7,"position":{"x":0,"y":10},"solution":"EMITTER"},{"id":"49-across","group":["49-across"],"separatorLocations":{},"number":49,"humanNumber":"49","clue":" Nitpicky person","direction":"across","length":7,"position":{"x":8,"y":10},"solution":"CAVILER"},{"id":"51-across","group":["51-across"],"separatorLocations":{},"number":51,"humanNumber":"51","clue":" Net supporter","direction":"across","length":3,"position":{"x":0,"y":11},"solution":"RIM"},{"id":"52-across","group":["52-across"],"separatorLocations":{},"number":52,"humanNumber":"52","clue":" Pelvic bones","direction":"across","length":4,"position":{"x":4,"y":11},"solution":"ILIA"},{"id":"54-across","group":["54-across"],"separatorLocations":{},"number":54,"humanNumber":"54","clue":" Get rid of the holes in, maybe","direction":"across","length":6,"position":{"x":9,"y":11},"solution":"REPAVE"},{"id":"55-across","group":["55-across"],"separatorLocations":{},"number":55,"humanNumber":"55","clue":" Feudal lord","direction":"across","length":8,"position":{"x":0,"y":12},"solution":"SEIGNIOR"},{"id":"57-across","group":["57-across"],"separatorLocations":{},"number":57,"humanNumber":"57","clue":" Main order","direction":"across","length":6,"position":{"x":9,"y":12},"solution":"ENTREE"},{"id":"58-across","group":["58-across"],"separatorLocations":{},"number":58,"humanNumber":"58","clue":" Private retreat","direction":"across","length":7,"position":{"x":1,"y":13},"solution":"SANCTUM"},{"id":"59-across","group":["59-across"],"separatorLocations":{},"number":59,"humanNumber":"59","clue":" Sure to fail","direction":"across","length":6,"position":{"x":9,"y":13},"solution":"DOOMED"},{"id":"60-across","group":["60-across"],"separatorLocations":{},"number":60,"humanNumber":"60","clue":" Pie preceder","direction":"across","length":6,"position":{"x":2,"y":14},"solution":"CUTESY"},{"id":"61-across","group":["61-across"],"separatorLocations":{},"number":61,"humanNumber":"61","clue":" Unpleasant","direction":"across","length":5,"position":{"x":10,"y":14},"solution":"MESSY"},{"id":"1-down","group":["1-down"],"separatorLocations":{},"number":1,"humanNumber":"1","clue":" ___ Park, Calif.","direction":"down","length":5,"position":{"x":0,"y":0},"solution":"BUENA"},{"id":"2-down","group":["2-down"],"separatorLocations":{},"number":2,"humanNumber":"2","clue":" Foiled","direction":"down","length":6,"position":{"x":1,"y":0},"solution":"UNDONE"},{"id":"3-down","group":["3-down"],"separatorLocations":{},"number":3,"humanNumber":"3","clue":" Material for many a game show","direction":"down","length":6,"position":{"x":2,"y":0},"solution":"TRIVIA"},{"id":"4-down","group":["4-down"],"separatorLocations":{},"number":4,"humanNumber":"4","clue":" Figures on poles","direction":"down","length":6,"position":{"x":3,"y":0},"solution":"TOTEMS"},{"id":"5-down","group":["5-down"],"separatorLocations":{},"number":5,"humanNumber":"5","clue":" Sources of wood for cabinetwork","direction":"down","length":7,"position":{"x":4,"y":0},"solution":"EBONIES"},{"id":"6-down","group":["6-down"],"separatorLocations":{},"number":6,"humanNumber":"6","clue":" They have scales and keys","direction":"down","length":4,"position":{"x":7,"y":0},"solution":"MAPS"},{"id":"7-down","group":["7-down"],"separatorLocations":{},"number":7,"humanNumber":"7","clue":" Like an eyesore","direction":"down","length":11,"position":{"x":8,"y":0},"solution":"UNAESTHETIC"},{"id":"8-down","group":["8-down"],"separatorLocations":{},"number":8,"humanNumber":"8","clue":" Flog, in a way","direction":"down","length":5,"position":{"x":9,"y":0},"solution":"STRAP"},{"id":"9-down","group":["9-down"],"separatorLocations":{},"number":9,"humanNumber":"9","clue":" Case for a veterinarian","direction":"down","length":7,"position":{"x":10,"y":0},"solution":"CHOLERA"},{"id":"10-down","group":["10-down"],"separatorLocations":{},"number":10,"humanNumber":"10","clue":" Top","direction":"down","length":3,"position":{"x":11,"y":0},"solution":"LID"},{"id":"11-down","group":["11-down"],"separatorLocations":{},"number":11,"humanNumber":"11","clue":" Fit to be picked","direction":"down","length":8,"position":{"x":12,"y":0},"solution":"ELIGIBLE"},{"id":"13-down","group":["13-down"],"separatorLocations":{},"number":13,"humanNumber":"13","clue":" \"Institutio principis Christiani\" writer","direction":"down","length":7,"position":{"x":5,"y":1},"solution":"ERASMUS"},{"id":"15-down","group":["15-down"],"separatorLocations":{},"number":15,"humanNumber":"15","clue":" Circular","direction":"down","length":7,"position":{"x":13,"y":1},"solution":"LEAFLET"},{"id":"18-down","group":["18-down"],"separatorLocations":{},"number":18,"humanNumber":"18","clue":" Things that tumble","direction":"down","length":6,"position":{"x":14,"y":2},"solution":"DRYERS"},{"id":"23-down","group":["23-down"],"separatorLocations":{},"number":23,"humanNumber":"23","clue":" Praiseworthy","direction":"down","length":11,"position":{"x":6,"y":4},"solution":"MERITORIOUS"},{"id":"25-down","group":["25-down"],"separatorLocations":{},"number":25,"humanNumber":"25","clue":" Forest litter","direction":"down","length":4,"position":{"x":11,"y":4},"solution":"CUBS"},{"id":"27-down","group":["27-down"],"separatorLocations":{},"number":27,"humanNumber":"27","clue":" Crest's antithesis","direction":"down","length":5,"position":{"x":7,"y":5},"solution":"NADIR"},{"id":"31-down","group":["31-down"],"separatorLocations":{},"number":31,"humanNumber":"31","clue":" Cable workers, e.g.","direction":"down","length":6,"position":{"x":0,"y":7},"solution":"WIRERS"},{"id":"32-down","group":["32-down"],"separatorLocations":{},"number":32,"humanNumber":"32","clue":" \"Wise men learn much from ___\": Aristophanes","direction":"down","length":7,"position":{"x":1,"y":7},"solution":"ENEMIES"},{"id":"33-down","group":["33-down"],"separatorLocations":{},"number":33,"humanNumber":"33","clue":" Problem eater: Var.","direction":"down","length":8,"position":{"x":2,"y":7},"solution":"BULIMIAC"},{"id":"34-down","group":["34-down"],"separatorLocations":{},"number":34,"humanNumber":"34","clue":" See 53-Down","direction":"down","length":4,"position":{"x":3,"y":7},"solution":"BRAT"},{"id":"36-down","group":["36-down"],"separatorLocations":{},"number":36,"humanNumber":"36","clue":" Cut","direction":"down","length":7,"position":{"x":9,"y":7},"solution":"SHEARED"},{"id":"39-down","group":["39-down"],"separatorLocations":{},"number":39,"humanNumber":"39","clue":" Gone","direction":"down","length":7,"position":{"x":4,"y":8},"solution":"EXTINCT"},{"id":"41-down","group":["41-down"],"separatorLocations":{},"number":41,"humanNumber":"41","clue":" Acerbate","direction":"down","length":7,"position":{"x":10,"y":8},"solution":"ENVENOM"},{"id":"44-down","group":["44-down"],"separatorLocations":{},"number":44,"humanNumber":"44","clue":" Move with stealth","direction":"down","length":6,"position":{"x":11,"y":9},"solution":"TIPTOE"},{"id":"45-down","group":["45-down"],"separatorLocations":{},"number":45,"humanNumber":"45","clue":" They're set for rising","direction":"down","length":6,"position":{"x":12,"y":9},"solution":"ALARMS"},{"id":"46-down","group":["46-down"],"separatorLocations":{},"number":46,"humanNumber":"46","clue":" Bank deposits?","direction":"down","length":6,"position":{"x":13,"y":9},"solution":"LEVEES"},{"id":"48-down","group":["48-down"],"separatorLocations":{},"number":48,"humanNumber":"48","clue":" First-class","direction":"down","length":5,"position":{"x":5,"y":10},"solution":"ELITE"},{"id":"50-down","group":["50-down"],"separatorLocations":{},"number":50,"humanNumber":"50","clue":" Overrun with cattails","direction":"down","length":5,"position":{"x":14,"y":10},"solution":"REEDY"},{"id":"53-down","group":["53-down"],"separatorLocations":{},"number":53,"humanNumber":"53","clue":" With 34-Down, soldier's son, say","direction":"down","length":4,"position":{"x":7,"y":11},"solution":"ARMY"},{"id":"56-down","group":["56-down"],"separatorLocations":{},"number":56,"humanNumber":"56","clue":" African with a mane","direction":"down","length":3,"position":{"x":3,"y":12},"solution":"GNU"}],"dimensions":{"cols":15,"rows":15},"crosswordType":"genius"}
[{"lineNumber": 76, "col_offset": 0, "nodeName": "hard_concrete_mean", "type": "Callable[..., Any]"}, {"lineNumber": 25, "col_offset": 0, "nodeName": "EPSILON", "type": "float"}, {"lineNumber": 28, "col_offset": 0, "nodeName": "BETA", "type": "float"}, {"lineNumber": 29, "col_offset": 0, "nodeName": "GAMMA", "type": "float"}, {"lineNumber": 30, "col_offset": 0, "nodeName": "ZETA", "type": "float"}, {"lineNumber": 35, "col_offset": 9, "nodeName": "BETA", "type": "float"}, {"lineNumber": 36, "col_offset": 10, "nodeName": "GAMMA", "type": "float"}, {"lineNumber": 37, "col_offset": 9, "nodeName": "ZETA", "type": "float"}, {"lineNumber": 38, "col_offset": 8, "nodeName": "EPSILON", "type": "float"}, {"lineNumber": 66, "col_offset": 2, "nodeName": "gate_inputs", "type": "Any"}, {"lineNumber": 67, "col_offset": 2, "nodeName": "gate_inputs", "type": "Any"}, {"lineNumber": 68, "col_offset": 2, "nodeName": "stretched_values", "type": "Any"}, {"lineNumber": 76, "col_offset": 40, "nodeName": "GAMMA", "type": "float"}, {"lineNumber": 76, "col_offset": 52, "nodeName": "ZETA", "type": "float"}, {"lineNumber": 93, "col_offset": 2, "nodeName": "stretched_values", "type": "Any"}, {"lineNumber": 58, "col_offset": 17, "nodeName": "random_uniform", "type": "Any"}, {"lineNumber": 67, "col_offset": 16, "nodeName": "sigmoid", "type": "Any"}, {"lineNumber": 68, "col_offset": 52, "nodeName": "gamma", "type": "Any"}, {"lineNumber": 70, "col_offset": 9, "nodeName": "clip_by_value", "type": "Any"}, {"lineNumber": 71, "col_offset": 6, "nodeName": "stretched_values", "type": "Any"}, {"lineNumber": 93, "col_offset": 62, "nodeName": "gamma", "type": "Any"}, {"lineNumber": 94, "col_offset": 9, "nodeName": "clip_by_value", "type": "Any"}, {"lineNumber": 95, "col_offset": 6, "nodeName": "stretched_values", "type": "Any"}, {"lineNumber": 58, "col_offset": 17, "nodeName": "tf", "type": "Any"}, {"lineNumber": 59, "col_offset": 6, "nodeName": "shape", "type": "Any"}, {"lineNumber": 59, "col_offset": 15, "nodeName": "log_alpha", "type": "Any"}, {"lineNumber": 66, "col_offset": 16, "nodeName": "log", "type": "Any"}, {"lineNumber": 66, "col_offset": 45, "nodeName": "log", "type": "Any"}, {"lineNumber": 67, "col_offset": 16, "nodeName": "tf", "type": "Any"}, {"lineNumber": 67, "col_offset": 55, "nodeName": "beta", "type": "Any"}, {"lineNumber": 68, "col_offset": 21, "nodeName": "gate_inputs", "type": "Any"}, {"lineNumber": 70, "col_offset": 9, "nodeName": "tf", "type": "Any"}, {"lineNumber": 94, "col_offset": 9, "nodeName": "tf", "type": "Any"}, {"lineNumber": 59, "col_offset": 6, "nodeName": "tf", "type": "Any"}, {"lineNumber": 66, "col_offset": 16, "nodeName": "tf", "type": "Any"}, {"lineNumber": 66, "col_offset": 23, "nodeName": "random_noise", "type": "Any"}, {"lineNumber": 66, "col_offset": 38, "nodeName": "eps", "type": "Any"}, {"lineNumber": 66, "col_offset": 45, "nodeName": "tf", "type": "Any"}, {"lineNumber": 66, "col_offset": 58, "nodeName": "random_noise", "type": "Any"}, {"lineNumber": 67, "col_offset": 28, "nodeName": "gate_inputs", "type": "Any"}, {"lineNumber": 67, "col_offset": 42, "nodeName": "log_alpha", "type": "Any"}, {"lineNumber": 68, "col_offset": 36, "nodeName": "zeta", "type": "Any"}, {"lineNumber": 68, "col_offset": 43, "nodeName": "gamma", "type": "Any"}, {"lineNumber": 93, "col_offset": 21, "nodeName": "sigmoid", "type": "Any"}, {"lineNumber": 93, "col_offset": 32, "nodeName": "log_alpha", "type": "Any"}, {"lineNumber": 93, "col_offset": 46, "nodeName": "zeta", "type": "Any"}, {"lineNumber": 93, "col_offset": 53, "nodeName": "gamma", "type": "Any"}, {"lineNumber": 93, "col_offset": 21, "nodeName": "tf", "type": "Any"}]
{ "AX": { "error": 0.004523815303237134, "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 2 }, "fit": "Average", "fn": 115, "include_baseline_error": false, "n": 120, "reviewed": true, "value": 0.15630021723716156 }, "CDD": { "error": 3.453442425663834e-06, "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 10 }, "fit": "Average", "fn": 120, "include_baseline_error": false, "n": 120, "reviewed": true, "value": 6.598069618727701e-06 }, "H1": { "error": 0.002875613467951673, "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 2 }, "fit": "Average", "fn": 113, "include_baseline_error": false, "n": 120, "reviewed": true, "value": 0.19970442697537683 }, "H2": { "error": 0.1363621645335584, "fit": "average_SEM", "value": -0.09345135904053072 }, "L1": { "error": 0.022217222385990776, "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 2 }, "fit": "Average", "fn": 118, "include_baseline_error": false, "n": 120, "reviewed": true, "value": 0.08314027110019982 }, "L2": { "error": 0.004765484763960252, "filter_outliers_dict": { "filter_outliers": true, "iterations": 1, "std_devs": 2 }, "fit": "Average", "fn": 114, "include_baseline_error": false, "n": 120, "reviewed": true, "value": 0.14007168223983363 } }
{"poster":"SterilePerNatura","date":"2016-11-10T02:01:20.578+0000","title":"Voto del cavaliere","subforum":"Discussioni generali","up_votes":1,"down_votes":0,"body":"{{item:3109}} \r\nSbaglio o &egrave; l&#039;oggetto pi&ugrave; virile del gioco?","replies":[{"poster":"Giorgio di villa","date":"2016-11-10T10:00:57.938+0000","up_votes":1,"down_votes":0,"body":"{{champion:44}} con quell'oggetto + le nuove maestrie che conferiscono armatura è oltraggioso\nVeramente veramente veramente oltraggioso","replies":[{"poster":"SterilePerNatura","date":"2016-11-10T11:42:15.569+0000","up_votes":1,"down_votes":0,"body":"Devo ancora provalo su {{champion:44}} . Oggi rimedio.","replies":[]}]},{"poster":"vondarck","date":"2016-11-10T08:06:05.762+0000","up_votes":1,"down_votes":0,"body":"più che altro mi sembra un core sui tank support\n\nsenza di quello gli ADC esplodono","replies":[]},{"poster":"Samel Seifer","date":"2016-11-10T07:03:57.967+0000","up_votes":1,"down_votes":0,"body":"Avrei detto il più nobile.","replies":[]}]}
["83efd97c1622eb98dfb329cc32150caf646523a9"]
{"uuid": "cfc7df9c-2655-4a49-b7ff-a7ad0bd716d2", "befores": [{"name": "data_dict", "status": "passed", "start": 1580623611508, "stop": 1580623611509}], "start": 1580623611508, "stop": 1580623611615}
{"last_check":"2018-08-20T18:59:07Z","pypi_version":"18.0"}
["3c7a21b831cb50007fd3174302cbba6f951b39ef"]
{"supplychain":{"category":18,"created":1337794382,"enable_comments":true,"flags":0,"id":3136,"modified":1337794382,"other_perms":1,"passcode":null,"user_featured":false,"usergroup_id":null,"usergroup_perms":0,"user_id":2190,"owner":{"id":2190,"name":"anyamemby","avatar":"http:\/\/free.sourcemap.com\/assets\/images\/default-user.png","banner_url":null,"display_name":null},"taxonomy":[{"description":"Miscellaneous\n","id":18,"left":33,"name":"miscellaneous","right":34,"title":"Miscellaneous"}],"attributes":{"title":"Atento: Global Image","description":"Countries available and locations of facilities.","tags":""},"stops":[],"hops":[]},"editable":false}
{"poster":"FeelsBlankMan","date":"2019-12-14T08:39:09.180+0000","title":"JG Main LF for chilled Clash Team","subforum":"Team Recruitment","up_votes":1,"down_votes":0,"body":"P4 jungle main but fairly rusty at the moment so just looking for a chill team, can flex to any role apart from Support if needed.\r\n\r\nIGN: FeelsBlankMan","replies":[]}
{ "bundle_id": "EGAZ00001317349", "bundle_type": "analysis", "donor_gender": "female", "ega_analysis_id": "EGAZ00001317349", "ega_dataset_id": "EGAD00001004018", "ega_experiment_id": "", "ega_metadata_file_name": "bundle.EGAZ00001317349.xml", "ega_metadata_repo": "https://raw.githubusercontent.com/icgc-dcc/ega-file-transfer/master/ega_xml/v20181002", "ega_run_id": "", "ega_sample_id": "EGAN00001669195", "ega_study_id": "EGAS00001000083", "files": [ { "ega_file_id": "EGAF00001883326", "file_md5sum": "09f273a1a0a8caa27dceef5eedfaf4e1", "file_name": "09f273a1a0a8caa27dceef5eedfaf4e1.RS1141419TU-CUT1-40.sorted.dup.recal.bam", "size": "363537545" } ], "insert_size": "", "library_strategy": "WGS", "name": "EGAZ00001317349", "paired_end": "", "project_code": "RECA-EU", "reference_genome": "GRCh37", "submitter": "RECA-EU", "submitter_donor_id": "RS1141419", "submitter_sample_id": "RS1141419TU-CUT1-40", "submitter_specimen_id": "RS1141419TU-CUT1-40", "submitter_specimen_type": "Primary tumour - solid tissue" }
{"title":"Youre Next [2013] DVDR NTSC Latino YG","uid":9451617,"size":3925230162,"categoryP":"video","categoryS":"movies_dvdr","magnet":"?xt=urn:btih:6b55c9d8d59771950894c40927899a4dcfe63a95&amp;dn=Youre+Next+%5B2013%5D+DVDR+NTSC+Latino+YG&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":1,"leechers":1,"uploader":"yerisan710","files":-1,"time":1389192308,"description":"-------------------------------------------------------------------------------\n Yerisan Group\n-------------------------------------------------------------------------------\n (for your consideration)\n\n*******************************************************************************\n Youre Next [2013] DVDR NTSC Latino YG \n*******************************************************************************\n\nPantalla.........: WS 16:9\nAudio............: Ingles 5.1 - Español Latino 5.1\nSubtitles........: Ingles - Español Latino \nMenu.............: Si\nExtras...........: Si\n\n*******************************************************************************\n ScreenShot....:\n &lt;a href=&quot;\nhttp://www.piczhub.com/image/1640.html&quot; rel=&quot;nofollow&quot; target=&quot;_NEW&quot;&gt;\nhttp://www.piczhub.com/image/1640.html&lt;/a&gt; &lt;a href=&quot;\nhttp://www.piczhub.com/image/1641.html&quot; rel=&quot;nofollow&quot; target=&quot;_NEW&quot;&gt;\nhttp://www.piczhub.com/image/1641.html&lt;/a&gt; &lt;a href=&quot;\nhttp://www.piczhub.com/image/1642.html&quot; rel=&quot;nofollow&quot; target=&quot;_NEW&quot;&gt;\nhttp://www.piczhub.com/image/1642.html&lt;/a&gt; &lt;a href=&quot;\nhttp://www.piczhub.com/image/1643.html&quot; rel=&quot;nofollow&quot; target=&quot;_NEW&quot;&gt;\nhttp://www.piczhub.com/image/1643.html&lt;/a&gt;\n\n*******************************************************************************\n\n\n------------------------------------------------------------------------------\n Yerisan Group\n-------------------------------------------------------------------------------\n (for your consideration)\n\n Please Seed\n Enjoy ;)\n\n Please Seed :)\n Enjoy\n-------------------------------------------------------------------------------\n Free Torrents DOES **NOT** MEAN YOU CAN HIT &amp; RUN!!\n-------------------------------------------------------------------------------\t\t","torrent":{"xt":"urn:btih:6b55c9d8d59771950894c40927899a4dcfe63a95","amp;dn":"Youre+Next+%5B2013%5D+DVDR+NTSC+Latino+YG","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":"6b55c9d8d59771950894c40927899a4dcfe63a95","infoHashBuffer":{"type":"Buffer","data":[107,85,201,216,213,151,113,149,8,148,196,9,39,137,154,77,207,230,58,149]},"announce":[],"urlList":[]}}
{"poster":"RMan360","date":"2016-05-12T02:45:51.683+0000","title":"Could we possibly get an option to report a player outside of end-game screen?","subforum":"Player Behaviour","up_votes":4,"down_votes":0,"body":"Recently joined a ranked lobby only to be matched up with a delightful fellow who immediately started cussing out other players and then selected a champion and summoner spell set, clearly intending to troll seeing as how he was assigned adc and chose some melee champion and ghost/cleanse. Images of chat for any rioters 1- http://postimg.org/image/8a94y9kxt/ 2- http://postimg.org/image/omj6nzz9d/ 3- http://postimg.org/image/wgjs9e729/","replies":[{"poster":"Sarge","date":"2016-05-12T23:57:50.866+0000","up_votes":1,"down_votes":0,"body":"There is an option, its called submitting a ticket. Submit a ticket, submit your screenshots and let riot deal with it.\n\nFYI - just cos I'm bored I've already submitted a ticket against this Dannnnnnnn character (People with so many n's in their name do it so they dont get banned or reported as easy I'm sure) . Banning peoples selected preferred in champ select is against riots ToS and should be punished.\n\nKappa","replies":[]},{"poster":"Devils Advocate","date":"2016-05-12T23:05:52.063+0000","up_votes":1,"down_votes":0,"body":"approved- i had to post with names on forums because im unable to report player harassment outside of a ranked game.","replies":[]},{"poster":"Vote 1 Trump","date":"2016-05-12T05:48:07.587+0000","up_votes":1,"down_votes":0,"body":"\"fuck up %%%%\"\n\nLOL","replies":[{"poster":"RMan360","date":"2016-05-12T05:49:38.518+0000","up_votes":1,"down_votes":0,"body":"it's not even an asian language... it's italian...","replies":[]}]}]}
{"type": "Feature", "id": 2028046, "geometry": {"type": "MultiPolygon", "coordinates": [[[[61.3563, 59.12125], [61.3563, 59.130348], [61.338581, 59.130348], [61.338581, 59.12125], [61.3563, 59.12125]]]]}, "properties": {"woe:id": 2028046, "woe:parent_id": 12599337, "woe:name": "Krapivnyj", "woe:placetype": 7, "woe:placetype_name": "Town", "woe:lang": "ENG", "iso:country": "RU", "meta:provider": ["geoplanet:7.8.1", "geoplanet:7.9.0", "geoplanet:7.10.0", "geoplanet:8.0.0", "woeplanet:8.0.0"], "meta:indexed": "2020-08-21T10:27:18.083997", "woe:alias_UNK_V": ["Krapivnaya"], "woe:alias_UNK_Q": ["\u041a\u0440\u0430\u043f\u0438\u0432\u043d\u0430\u044f"], "meta:updated": "2020-10-14T10:58:32.863930", "woe:adjacent": [2075196, 2121517], "woe:hierarchy": {"continent": 24865671, "country": 23424936, "town": 0, "planet": 1, "county": 12599337, "suburb": 0, "state": 2346926, "region": 0, "localadmin": 0}, "woe:timezone_id": 28350866, "woe:hash": "v6e87gxbfbnj", "geom:min_latitude": 59.12125, "woe:centroid": [61.347439, 59.125801], "geom:latitude": 59.125801, "woe:max_longitude": 61.3563, "geom:max_longitude": 61.3563, "geom:centroid": [61.347439, 59.125801], "geom:max_latitude": 59.130348, "woe:bbox": [61.338581, 59.12125, 61.3563, 59.130348], "geom:bbox": [61.338581, 59.12125, 61.3563, 59.130348], "woe:min_latitude": 59.12125, "woe:min_longitude": 61.338581, "geom:longitude": 61.347439, "geom:hash": "v6e87gxbfbnj", "woe:latitude": 59.125801, "geom:min_longitude": 61.338581, "woe:longitude": 61.347439, "woe:max_latitude": 59.130348, "woe:repo": "woeplanet-town-ru", "geom:area": 1028378.4620609283, "woe:scale": 16}}
{ "auth": { "randombytesauth": { "service": "Cognito", "providerPlugin": "awscloudformation" } }, "api": { "apirandombytes": { "service": "AppSync", "providerPlugin": "awscloudformation", "output": { "securityType": "AMAZON_COGNITO_USER_POOLS" } } }, "storage": { "rbcontent": { "service": "S3", "providerPlugin": "awscloudformation" } } }
{"notes": [{"id": "BkglSTNFDB", "original": "SkxMQ3EvwH", "number": 509, "cdate": 1569439031529, "ddate": null, "tcdate": 1569439031529, "tmdate": 1583912024074, "tddate": null, "forum": "BkglSTNFDB", "replyto": null, "invitation": "ICLR.cc/2020/Conference/-/Blind_Submission", "content": {"title": "Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP", "authors": ["Yuanhao Wang", "Kefan Dong", "Xiaoyu Chen", "Liwei Wang"], "authorids": ["yuanhao-16@mails.tsinghua.edu.cn", "dkf16@mails.tsinghua.edu.cn", "cxy30@pku.edu.cn", "wanglw@cis.pku.edu.cn"], "keywords": ["theory", "reinforcement learning", "sample complexity"], "TL;DR": "We adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards without accessing a generative model, and improves the previously best known result.", "abstract": "A fundamental question in reinforcement learning is whether model-free algorithms are sample efficient. Recently, Jin et al. (2018) proposed a Q-learning algorithm with UCB exploration policy, and proved it has nearly optimal regret bound for finite-horizon episodic MDP. In this paper, we adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards \\emph{without} accessing a generative model. We show that the \\textit{sample complexity of exploration} of our algorithm is bounded by $\\tilde{O}({\\frac{SA}{\\epsilon^2(1-\\gamma)^7}})$. This improves the previously best known result of $\\tilde{O}({\\frac{SA}{\\epsilon^4(1-\\gamma)^8}})$ in this setting achieved by delayed Q-learning (Strehlet al., 2006),, and matches the lower bound in terms of $\\epsilon$ as well as $S$ and $A$ up to logarithmic factors.", "pdf": "/pdf/3a261a8730f71c072aeea18bbd7d9a757ebc725d.pdf", "paperhash": "wang|qlearning_with_ucb_exploration_is_sample_efficient_for_infinitehorizon_mdp", "_bibtex": "@inproceedings{\nWang2020Q-learning,\ntitle={Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP},\nauthor={Yuanhao Wang and Kefan Dong and Xiaoyu Chen and Liwei Wang},\nbooktitle={International Conference on Learning Representations},\nyear={2020},\nurl={https://openreview.net/forum?id=BkglSTNFDB}\n}", "full_presentation_video": "", "original_pdf": "/attachment/f18e675c2d09159773e2a027f9c388e9156c4d70.pdf", "appendix": "", "poster": "", "spotlight_video": "", "slides": ""}, "signatures": ["ICLR.cc/2020/Conference"], "readers": ["everyone"], "nonreaders": [], "writers": ["ICLR.cc/2020/Conference"], "details": {"replyCount": 13, "writable": false, "overwriting": [], "revisions": true, "tags": [], "invitation": {"reply": {"readers": {"values-regex": ".*"}, "writers": {"values": ["ICLR.cc/2020/Conference"]}, "signatures": {"values": ["ICLR.cc/2020/Conference"]}, "content": {"spotlight_video": {"value-regex": ".*"}, "full_presentation_video": {"value-regex": ".*"}, "original_pdf": {"required": false, "description": "Upload a PDF file that ends with .pdf", "value-regex": ".*"}, "appendix": {"value-regex": ".*"}, "authorids": {"values-regex": ".*"}, "poster": {"value-regex": ".*"}, "authors": {"values": ["Anonymous"]}, "slides": {"value-regex": ".*"}}}, "final": [], "signatures": ["ICLR.cc/2020/Conference"], "readers": ["everyone"], "nonreaders": [], "writers": ["ICLR.cc/2020/Conference"], "invitees": ["ICLR.cc/2020/Conference"], "noninvitees": [], "tcdate": 1569271260237, "tmdate": 1593459412141, "id": "ICLR.cc/2020/Conference/-/Blind_Submission"}}, "tauthor": "ICLR.cc/2020/Conference"}, {"id": "Tex4z872T", "original": null, "number": 1, "cdate": 1576798698461, "ddate": null, "tcdate": 1576798698461, "tmdate": 1576800937347, "tddate": null, "forum": "BkglSTNFDB", "replyto": "BkglSTNFDB", "invitation": "ICLR.cc/2020/Conference/Paper509/-/Decision", "content": {"decision": "Accept (Poster)", "comment": "In this paper, the authors extended Q-learning with UCB exploration bonus by Jin et al. to infinite-horizon MDP with discounted rewards without accessing a generative model, and proved nearly optimal regret bound for finite-horizon episodic MDP. The authors also proved PAC-type sample complexity of exploration, which matches the lower bound up to logarithmic factors. Overall this is a solid theoretical reinforcement learning work. After author response, we reached a unanimous agreement to accept this paper.", "title": "Paper Decision"}, "signatures": ["ICLR.cc/2020/Conference/Program_Chairs"], "readers": ["everyone"], "nonreaders": [], "writers": ["ICLR.cc/2020/Conference/Program_Chairs"], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP", "authors": ["Yuanhao Wang", "Kefan Dong", "Xiaoyu Chen", "Liwei Wang"], "authorids": ["yuanhao-16@mails.tsinghua.edu.cn", "dkf16@mails.tsinghua.edu.cn", "cxy30@pku.edu.cn", "wanglw@cis.pku.edu.cn"], "keywords": ["theory", "reinforcement learning", "sample complexity"], "TL;DR": "We adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards without accessing a generative model, and improves the previously best known result.", "abstract": "A fundamental question in reinforcement learning is whether model-free algorithms are sample efficient. Recently, Jin et al. (2018) proposed a Q-learning algorithm with UCB exploration policy, and proved it has nearly optimal regret bound for finite-horizon episodic MDP. In this paper, we adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards \\emph{without} accessing a generative model. We show that the \\textit{sample complexity of exploration} of our algorithm is bounded by $\\tilde{O}({\\frac{SA}{\\epsilon^2(1-\\gamma)^7}})$. This improves the previously best known result of $\\tilde{O}({\\frac{SA}{\\epsilon^4(1-\\gamma)^8}})$ in this setting achieved by delayed Q-learning (Strehlet al., 2006),, and matches the lower bound in terms of $\\epsilon$ as well as $S$ and $A$ up to logarithmic factors.", "pdf": "/pdf/3a261a8730f71c072aeea18bbd7d9a757ebc725d.pdf", "paperhash": "wang|qlearning_with_ucb_exploration_is_sample_efficient_for_infinitehorizon_mdp", "_bibtex": "@inproceedings{\nWang2020Q-learning,\ntitle={Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP},\nauthor={Yuanhao Wang and Kefan Dong and Xiaoyu Chen and Liwei Wang},\nbooktitle={International Conference on Learning Representations},\nyear={2020},\nurl={https://openreview.net/forum?id=BkglSTNFDB}\n}", "full_presentation_video": "", "original_pdf": "/attachment/f18e675c2d09159773e2a027f9c388e9156c4d70.pdf", "appendix": "", "poster": "", "spotlight_video": "", "slides": ""}, "tags": [], "invitation": {"reply": {"writers": {"description": "How your identity will be displayed.", "values-regex": ["ICLR.cc/2020/Conference/Program_Chairs"]}, "signatures": {"values": ["ICLR.cc/2020/Conference/Program_Chairs"], "description": "How your identity will be displayed."}, "content": {"decision": {"value-radio": ["Accept (Spotlight)", "Accept (Talk)", "Accept (Poster)", "Reject"], "description": "Decision", "required": true, "order": 2}, "title": {"value": "Paper Decision", "required": true, "order": 1}, "comment": {"value-regex": "[\\S\\s]{0,5000}", "description": "", "required": false, "order": 3}}, "forum": "BkglSTNFDB", "replyto": "BkglSTNFDB", "readers": {"values": ["everyone"], "description": "Select all user groups that should be able to read this comment."}, "nonreaders": {"values": []}}, "expdate": 1576854540000, "duedate": 1576853940000, "multiReply": false, "readers": ["everyone"], "invitees": ["ICLR.cc/2020/Conference/Program_Chairs"], "tcdate": 1576795729386, "tmdate": 1576800281966, "super": "ICLR.cc/2020/Conference/-/Decision", "signatures": ["ICLR.cc/2020/Conference"], "writers": ["ICLR.cc/2020/Conference"], "id": "ICLR.cc/2020/Conference/Paper509/-/Decision"}}}, {"id": "HJgxIUpioS", "original": null, "number": 12, "cdate": 1573799495644, "ddate": null, "tcdate": 1573799495644, "tmdate": 1573799857082, "tddate": null, "forum": "BkglSTNFDB", "replyto": "BylcpEQYsS", "invitation": "ICLR.cc/2020/Conference/Paper509/-/Official_Comment", "content": {"title": "Thanks for the response and new comments", "comment": "We sincerely thank the reviewer for the quick response and new comments.\n\nRegarding the definition of PAC in infinite horizon settings: Actually this has been extensively discussed in the past two decades. It is believed that sample complexity of exploration is the most natural PAC measurement in this setting. Plese see [1, 2, 3] (below) for more detailed discussion on the performance measurement in infinite horizon settings.\n\n\n>>Actually I do not agree with this. You can set your Q-value in the last stage to be the Q-value of the first stage of the previous iteration. Then even the middle ones (1+R/2) are guaranteed to have near-optimal actions.\n\nIf we understand correctly, the reviewer is proposing replacing Q-value of the last stage by Q-value of the first stage in the algorithm. (Pleasae correct us if our understanding is wrong.) However, the resulting Q-learning algorithm does not converge. This is because in the finite horizon algorithm there is no discount factor, and replacing the Q-value in the last stage will lead to an unbounded increase in Q-value. If algorithm is modified so that discount factor is included, then the algorithm will be like the one we proposed in the paper. In this case, it is possible to bound the number of sub-optimal steps of this algorithm using our analysis framework. However, this approach is no longer a black box reduction to finite horizon setting because the algorithm is changed.\n\n\n>>I would guess you can use the same argument in your paper to bound the number of errors made by the regret algorithm.\n\nYes, we agree that the argument in our paper (namely carefully designed Condition 1 and Condition 2) can be used to bound the number of errors. This argument is one of the technical contribution of our paper.\n\n[1] Alexander L Strehl and Michael L Littman. An analysis of model-based interval estimation for markov decision processes. Journal of Computer and System Sciences, 74(8):1309\u20131331, 2008.\n[2] Kakade, Sham Machandranath. On the sample complexity of reinforcement learning. Diss. University of London, 2003.\n[3] Alexander L Strehl, Lihong Li, Eric Wiewiora, John Langford, and Michael L Littman. Pac model- free reinforcement learning. In Proceedings of the 23rd international conference on Machine learning, pp. 881\u2013888. ACM, 2006.\n"}, "signatures": ["ICLR.cc/2020/Conference/Paper509/Authors"], "readers": ["everyone"], "nonreaders": [], "writers": ["ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference"], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP", "authors": ["Yuanhao Wang", "Kefan Dong", "Xiaoyu Chen", "Liwei Wang"], "authorids": ["yuanhao-16@mails.tsinghua.edu.cn", "dkf16@mails.tsinghua.edu.cn", "cxy30@pku.edu.cn", "wanglw@cis.pku.edu.cn"], "keywords": ["theory", "reinforcement learning", "sample complexity"], "TL;DR": "We adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards without accessing a generative model, and improves the previously best known result.", "abstract": "A fundamental question in reinforcement learning is whether model-free algorithms are sample efficient. Recently, Jin et al. (2018) proposed a Q-learning algorithm with UCB exploration policy, and proved it has nearly optimal regret bound for finite-horizon episodic MDP. In this paper, we adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards \\emph{without} accessing a generative model. We show that the \\textit{sample complexity of exploration} of our algorithm is bounded by $\\tilde{O}({\\frac{SA}{\\epsilon^2(1-\\gamma)^7}})$. This improves the previously best known result of $\\tilde{O}({\\frac{SA}{\\epsilon^4(1-\\gamma)^8}})$ in this setting achieved by delayed Q-learning (Strehlet al., 2006),, and matches the lower bound in terms of $\\epsilon$ as well as $S$ and $A$ up to logarithmic factors.", "pdf": "/pdf/3a261a8730f71c072aeea18bbd7d9a757ebc725d.pdf", "paperhash": "wang|qlearning_with_ucb_exploration_is_sample_efficient_for_infinitehorizon_mdp", "_bibtex": "@inproceedings{\nWang2020Q-learning,\ntitle={Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP},\nauthor={Yuanhao Wang and Kefan Dong and Xiaoyu Chen and Liwei Wang},\nbooktitle={International Conference on Learning Representations},\nyear={2020},\nurl={https://openreview.net/forum?id=BkglSTNFDB}\n}", "full_presentation_video": "", "original_pdf": "/attachment/f18e675c2d09159773e2a027f9c388e9156c4d70.pdf", "appendix": "", "poster": "", "spotlight_video": "", "slides": ""}, "tags": [], "invitation": {"reply": {"content": {"title": {"required": true, "description": "Brief summary of your comment.", "order": 0, "value-regex": ".{1,500}"}, "comment": {"required": true, "description": "Your comment or reply (max 5000 characters). Add TeX formulas using the following formats: $In-line Formula$ or $$Block Formula$$", "order": 1, "value-regex": "[\\S\\s]{1,5000}"}}, "forum": "BkglSTNFDB", "readers": {"values-dropdown": ["everyone", "ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference/Paper509/AnonReviewer.*", "ICLR.cc/2020/Conference/Paper509/Reviewers/Submitted", "ICLR.cc/2020/Conference/Paper509/Reviewers", "ICLR.cc/2020/Conference/Paper509/Area_Chairs", "ICLR.cc/2020/Conference/Program_Chairs"], "description": "Who your comment will be visible to. If replying to a specific person make sure to add the group they are a member of so that they are able to see your response"}, "writers": {"values-copied": ["ICLR.cc/2020/Conference", "{signatures}"]}, "signatures": {"description": "How your identity will be displayed.", "values-regex": "ICLR.cc/2020/Conference/Paper509/AnonReviewer[0-9]+|ICLR.cc/2020/Conference/Paper509/Authors|ICLR.cc/2020/Conference/Paper509/Area_Chair[0-9]+|ICLR.cc/2020/Conference/Program_Chairs"}}, "readers": ["everyone"], "tcdate": 1569504170369, "tmdate": 1576860541346, "super": "ICLR.cc/2020/Conference/-/Comment", "signatures": ["ICLR.cc/2020/Conference"], "writers": ["ICLR.cc/2020/Conference"], "invitees": ["ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference/Paper509/Reviewers", "ICLR.cc/2020/Conference/Paper509/Area_Chairs", "ICLR.cc/2020/Conference/Program_Chairs"], "id": "ICLR.cc/2020/Conference/Paper509/-/Official_Comment"}}}, {"id": "HyxP6tXTtB", "original": null, "number": 1, "cdate": 1571793343477, "ddate": null, "tcdate": 1571793343477, "tmdate": 1573742141747, "tddate": null, "forum": "BkglSTNFDB", "replyto": "BkglSTNFDB", "invitation": "ICLR.cc/2020/Conference/Paper509/-/Official_Review", "content": {"experience_assessment": "I have read many papers in this area.", "rating": "6: Weak Accept", "review_assessment:_checking_correctness_of_experiments": "N/A", "review_assessment:_thoroughness_in_paper_reading": "I made a quick assessment of this paper.", "title": "Official Blind Review #1", "review": "This paper considered a Q-learning algorithm with UCB exploration policy for infinite-horizon MDP, and derived the sample complexity of exploration bound. The bound was shown to improve the existing results and matched the lower bound up to some log factors. The problem considered is interesting and challenging. However, I have a few major concerns.\n\n1. Assumptions: The Condition 2 is on the term $X_t^{(i)}$ which is the i-th largest item of the gap $\\Delta_t$ (the difference between the value function and the Q function fo the optimal policy). How to verify this condition in practice? Do you need this condition for all $t$? Does this condition depend on the choice of length $R$? The conditions are listed without any discussions. \n\n2. Algorithm: The Algorithm depends on the choice of the parameter $R$. How to choose $R$ in practice?\n\n3. Writing: This paper is not well written. There are many typos and grammar errors. In addition, the key components Sections 3.3 and 3.4 are very hard to follow. For instance, in Section 3.3, the authors first introduced Condition 1 and then Condition 2, and then claimed that Condition 2 implied Condition 1. Similarly, in Section 3.4, Lemma 1 was introduced before Lemma 2. Then the authors claimed that Lemma 2 implies Lemma 1. If would be easier to follow if the authors only introduced the latter result, and then discuss the former result as a remark. \n\n~~~~~~~~~~~~~~~~~~~~~~\nAfter rebuttal: Thanks the authors for addressing my questions. My first two major concerns have been nicely addressed. Therefore, I would like to increase my rating to 6.\n", "review_assessment:_checking_correctness_of_derivations_and_theory": "I assessed the sensibility of the derivations and theory."}, "signatures": ["ICLR.cc/2020/Conference/Paper509/AnonReviewer1"], "readers": ["everyone"], "nonreaders": [], "writers": ["ICLR.cc/2020/Conference/Paper509/AnonReviewer1"], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP", "authors": ["Yuanhao Wang", "Kefan Dong", "Xiaoyu Chen", "Liwei Wang"], "authorids": ["yuanhao-16@mails.tsinghua.edu.cn", "dkf16@mails.tsinghua.edu.cn", "cxy30@pku.edu.cn", "wanglw@cis.pku.edu.cn"], "keywords": ["theory", "reinforcement learning", "sample complexity"], "TL;DR": "We adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards without accessing a generative model, and improves the previously best known result.", "abstract": "A fundamental question in reinforcement learning is whether model-free algorithms are sample efficient. Recently, Jin et al. (2018) proposed a Q-learning algorithm with UCB exploration policy, and proved it has nearly optimal regret bound for finite-horizon episodic MDP. In this paper, we adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards \\emph{without} accessing a generative model. We show that the \\textit{sample complexity of exploration} of our algorithm is bounded by $\\tilde{O}({\\frac{SA}{\\epsilon^2(1-\\gamma)^7}})$. This improves the previously best known result of $\\tilde{O}({\\frac{SA}{\\epsilon^4(1-\\gamma)^8}})$ in this setting achieved by delayed Q-learning (Strehlet al., 2006),, and matches the lower bound in terms of $\\epsilon$ as well as $S$ and $A$ up to logarithmic factors.", "pdf": "/pdf/3a261a8730f71c072aeea18bbd7d9a757ebc725d.pdf", "paperhash": "wang|qlearning_with_ucb_exploration_is_sample_efficient_for_infinitehorizon_mdp", "_bibtex": "@inproceedings{\nWang2020Q-learning,\ntitle={Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP},\nauthor={Yuanhao Wang and Kefan Dong and Xiaoyu Chen and Liwei Wang},\nbooktitle={International Conference on Learning Representations},\nyear={2020},\nurl={https://openreview.net/forum?id=BkglSTNFDB}\n}", "full_presentation_video": "", "original_pdf": "/attachment/f18e675c2d09159773e2a027f9c388e9156c4d70.pdf", "appendix": "", "poster": "", "spotlight_video": "", "slides": ""}, "tags": [], "invitation": {"reply": {"content": {"experience_assessment": {"required": true, "order": 4, "description": "Please make a selection that represents your experience correctly", "value-radio": ["I have published in this field for several years.", "I have published one or two papers in this area.", "I have read many papers in this area.", "I do not know much about this area."]}, "rating": {"value-dropdown": ["1: Reject", "3: Weak Reject", "6: Weak Accept", "8: Accept"], "order": 3, "required": true}, "review_assessment:_checking_correctness_of_experiments": {"required": true, "order": 7, "description": "If no experiments, please select N/A", "value-radio": ["I carefully checked the experiments.", "I assessed the sensibility of the experiments.", "I did not assess the experiments.", "N/A"]}, "review_assessment:_thoroughness_in_paper_reading": {"required": true, "order": 5, "description": "If this is not applicable, please select N/A", "value-radio": ["I read the paper thoroughly.", "I read the paper at least twice and used my best judgement in assessing the paper.", "I made a quick assessment of this paper.", "N/A"]}, "title": {"value-regex": "Official Blind Review #[0-9]+", "order": 1, "required": true, "description": "Please replace NUM with your AnonReviewer number (it is the number following \"AnonReviewer\" in your signatures below)", "default": "Official Blind Review #NUM"}, "review": {"value-regex": "[\\S\\s]{500,200000}", "order": 2, "description": "Provide your complete review here (500 - 200000 characters). For guidance in writing a good review, see this brief reviewer guide (https://iclr.cc/Conferences/2020/ReviewerGuide) with three key bullet points.", "required": true}, "review_assessment:_checking_correctness_of_derivations_and_theory": {"required": true, "order": 6, "description": "If no derivations or theory, please select N/A", "value-radio": ["I carefully checked the derivations and theory.", "I assessed the sensibility of the derivations and theory.", "I did not assess the derivations or theory.", "N/A"]}}, "forum": "BkglSTNFDB", "replyto": "BkglSTNFDB", "readers": {"values": ["everyone"], "description": "Select all user groups that should be able to read this comment."}, "nonreaders": {"values": []}, "writers": {"values-regex": "ICLR.cc/2020/Conference/Paper509/AnonReviewer[0-9]+", "description": "How your identity will be displayed."}, "signatures": {"values-regex": "ICLR.cc/2020/Conference/Paper509/AnonReviewer[0-9]+", "description": "How your identity will be displayed."}}, "expdate": 1575713021812, "duedate": 1572706740000, "multiReply": false, "readers": ["everyone"], "nonreaders": [], "invitees": ["ICLR.cc/2020/Conference/Paper509/Reviewers"], "noninvitees": [], "tcdate": 1570237751110, "tmdate": 1575713021830, "super": "ICLR.cc/2020/Conference/-/Official_Review", "signatures": ["ICLR.cc/2020/Conference"], "writers": ["ICLR.cc/2020/Conference"], "id": "ICLR.cc/2020/Conference/Paper509/-/Official_Review"}}}, {"id": "r1eZ4jA9iS", "original": null, "number": 11, "cdate": 1573739305188, "ddate": null, "tcdate": 1573739305188, "tmdate": 1573739305188, "tddate": null, "forum": "BkglSTNFDB", "replyto": "S1leQbZqir", "invitation": "ICLR.cc/2020/Conference/Paper509/-/Official_Comment", "content": {"title": "Thanks for the feedback", "comment": "We thank the reviewer for the feedback.\n\nFirst, we would like to clarify that both Condition 1 and Condition 2 are not assumptions for our theorem to hold. We do not have additional assumptions beyond the problem formulation. Instead, they are simply used as a proxy for sample complexity in our proof.\n\nBelow we answer the three questions raised by the reviewer:\n\n1.Do we need Condition 2 for all t?\nWe do not require Condition 2 to hold for all t. Instead, we count the number of times such that Condition 2 is violated, which is an upper bound for sample complexity. This counting is done in the series of inequalities on page 7 (above the final bound), where it can be noted that the second line counts the number of times such that Condition 2 is violated.\n\n2.Does this condition depend on the choice of length R?\nThe condition itself does depend on the choice of $R$, in the sense that the logarithmic of $R$ is involved in the definition of $M$.\n\n3.How to verify Condition 2 in practice? \nCondition 2 is not an assumption of the theorem. It is a statement to make the roadmap of the proof easier to understand. Verifying whether Condition 2 holds at a particular time step is similar to verifying whether the algorithm is performing bad at a particular time. Currently we think this is hard but unnecessary.\n"}, "signatures": ["ICLR.cc/2020/Conference/Paper509/Authors"], "readers": ["everyone"], "nonreaders": [], "writers": ["ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference"], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP", "authors": ["Yuanhao Wang", "Kefan Dong", "Xiaoyu Chen", "Liwei Wang"], "authorids": ["yuanhao-16@mails.tsinghua.edu.cn", "dkf16@mails.tsinghua.edu.cn", "cxy30@pku.edu.cn", "wanglw@cis.pku.edu.cn"], "keywords": ["theory", "reinforcement learning", "sample complexity"], "TL;DR": "We adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards without accessing a generative model, and improves the previously best known result.", "abstract": "A fundamental question in reinforcement learning is whether model-free algorithms are sample efficient. Recently, Jin et al. (2018) proposed a Q-learning algorithm with UCB exploration policy, and proved it has nearly optimal regret bound for finite-horizon episodic MDP. In this paper, we adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards \\emph{without} accessing a generative model. We show that the \\textit{sample complexity of exploration} of our algorithm is bounded by $\\tilde{O}({\\frac{SA}{\\epsilon^2(1-\\gamma)^7}})$. This improves the previously best known result of $\\tilde{O}({\\frac{SA}{\\epsilon^4(1-\\gamma)^8}})$ in this setting achieved by delayed Q-learning (Strehlet al., 2006),, and matches the lower bound in terms of $\\epsilon$ as well as $S$ and $A$ up to logarithmic factors.", "pdf": "/pdf/3a261a8730f71c072aeea18bbd7d9a757ebc725d.pdf", "paperhash": "wang|qlearning_with_ucb_exploration_is_sample_efficient_for_infinitehorizon_mdp", "_bibtex": "@inproceedings{\nWang2020Q-learning,\ntitle={Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP},\nauthor={Yuanhao Wang and Kefan Dong and Xiaoyu Chen and Liwei Wang},\nbooktitle={International Conference on Learning Representations},\nyear={2020},\nurl={https://openreview.net/forum?id=BkglSTNFDB}\n}", "full_presentation_video": "", "original_pdf": "/attachment/f18e675c2d09159773e2a027f9c388e9156c4d70.pdf", "appendix": "", "poster": "", "spotlight_video": "", "slides": ""}, "tags": [], "invitation": {"reply": {"content": {"title": {"required": true, "description": "Brief summary of your comment.", "order": 0, "value-regex": ".{1,500}"}, "comment": {"required": true, "description": "Your comment or reply (max 5000 characters). Add TeX formulas using the following formats: $In-line Formula$ or $$Block Formula$$", "order": 1, "value-regex": "[\\S\\s]{1,5000}"}}, "forum": "BkglSTNFDB", "readers": {"values-dropdown": ["everyone", "ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference/Paper509/AnonReviewer.*", "ICLR.cc/2020/Conference/Paper509/Reviewers/Submitted", "ICLR.cc/2020/Conference/Paper509/Reviewers", "ICLR.cc/2020/Conference/Paper509/Area_Chairs", "ICLR.cc/2020/Conference/Program_Chairs"], "description": "Who your comment will be visible to. If replying to a specific person make sure to add the group they are a member of so that they are able to see your response"}, "writers": {"values-copied": ["ICLR.cc/2020/Conference", "{signatures}"]}, "signatures": {"description": "How your identity will be displayed.", "values-regex": "ICLR.cc/2020/Conference/Paper509/AnonReviewer[0-9]+|ICLR.cc/2020/Conference/Paper509/Authors|ICLR.cc/2020/Conference/Paper509/Area_Chair[0-9]+|ICLR.cc/2020/Conference/Program_Chairs"}}, "readers": ["everyone"], "tcdate": 1569504170369, "tmdate": 1576860541346, "super": "ICLR.cc/2020/Conference/-/Comment", "signatures": ["ICLR.cc/2020/Conference"], "writers": ["ICLR.cc/2020/Conference"], "invitees": ["ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference/Paper509/Reviewers", "ICLR.cc/2020/Conference/Paper509/Area_Chairs", "ICLR.cc/2020/Conference/Program_Chairs"], "id": "ICLR.cc/2020/Conference/Paper509/-/Official_Comment"}}}, {"id": "S1leQbZqir", "original": null, "number": 10, "cdate": 1573683480216, "ddate": null, "tcdate": 1573683480216, "tmdate": 1573683480216, "tddate": null, "forum": "BkglSTNFDB", "replyto": "SyeQKO1HoB", "invitation": "ICLR.cc/2020/Conference/Paper509/-/Official_Comment", "content": {"title": "my questions were not answered", "comment": "Thanks the author for addressing my Question 2. However, I do not think my Question 1 has been clearly addressed.\n\nCondition2: Do you need this condition for all t? Does this condition depend on the choice of length R? How to verify Condition 2 in practice? "}, "signatures": ["ICLR.cc/2020/Conference/Paper509/AnonReviewer1"], "readers": ["everyone"], "nonreaders": [], "writers": ["ICLR.cc/2020/Conference/Paper509/AnonReviewer1", "ICLR.cc/2020/Conference"], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP", "authors": ["Yuanhao Wang", "Kefan Dong", "Xiaoyu Chen", "Liwei Wang"], "authorids": ["yuanhao-16@mails.tsinghua.edu.cn", "dkf16@mails.tsinghua.edu.cn", "cxy30@pku.edu.cn", "wanglw@cis.pku.edu.cn"], "keywords": ["theory", "reinforcement learning", "sample complexity"], "TL;DR": "We adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards without accessing a generative model, and improves the previously best known result.", "abstract": "A fundamental question in reinforcement learning is whether model-free algorithms are sample efficient. Recently, Jin et al. (2018) proposed a Q-learning algorithm with UCB exploration policy, and proved it has nearly optimal regret bound for finite-horizon episodic MDP. In this paper, we adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards \\emph{without} accessing a generative model. We show that the \\textit{sample complexity of exploration} of our algorithm is bounded by $\\tilde{O}({\\frac{SA}{\\epsilon^2(1-\\gamma)^7}})$. This improves the previously best known result of $\\tilde{O}({\\frac{SA}{\\epsilon^4(1-\\gamma)^8}})$ in this setting achieved by delayed Q-learning (Strehlet al., 2006),, and matches the lower bound in terms of $\\epsilon$ as well as $S$ and $A$ up to logarithmic factors.", "pdf": "/pdf/3a261a8730f71c072aeea18bbd7d9a757ebc725d.pdf", "paperhash": "wang|qlearning_with_ucb_exploration_is_sample_efficient_for_infinitehorizon_mdp", "_bibtex": "@inproceedings{\nWang2020Q-learning,\ntitle={Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP},\nauthor={Yuanhao Wang and Kefan Dong and Xiaoyu Chen and Liwei Wang},\nbooktitle={International Conference on Learning Representations},\nyear={2020},\nurl={https://openreview.net/forum?id=BkglSTNFDB}\n}", "full_presentation_video": "", "original_pdf": "/attachment/f18e675c2d09159773e2a027f9c388e9156c4d70.pdf", "appendix": "", "poster": "", "spotlight_video": "", "slides": ""}, "tags": [], "invitation": {"reply": {"content": {"title": {"required": true, "description": "Brief summary of your comment.", "order": 0, "value-regex": ".{1,500}"}, "comment": {"required": true, "description": "Your comment or reply (max 5000 characters). Add TeX formulas using the following formats: $In-line Formula$ or $$Block Formula$$", "order": 1, "value-regex": "[\\S\\s]{1,5000}"}}, "forum": "BkglSTNFDB", "readers": {"values-dropdown": ["everyone", "ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference/Paper509/AnonReviewer.*", "ICLR.cc/2020/Conference/Paper509/Reviewers/Submitted", "ICLR.cc/2020/Conference/Paper509/Reviewers", "ICLR.cc/2020/Conference/Paper509/Area_Chairs", "ICLR.cc/2020/Conference/Program_Chairs"], "description": "Who your comment will be visible to. If replying to a specific person make sure to add the group they are a member of so that they are able to see your response"}, "writers": {"values-copied": ["ICLR.cc/2020/Conference", "{signatures}"]}, "signatures": {"description": "How your identity will be displayed.", "values-regex": "ICLR.cc/2020/Conference/Paper509/AnonReviewer[0-9]+|ICLR.cc/2020/Conference/Paper509/Authors|ICLR.cc/2020/Conference/Paper509/Area_Chair[0-9]+|ICLR.cc/2020/Conference/Program_Chairs"}}, "readers": ["everyone"], "tcdate": 1569504170369, "tmdate": 1576860541346, "super": "ICLR.cc/2020/Conference/-/Comment", "signatures": ["ICLR.cc/2020/Conference"], "writers": ["ICLR.cc/2020/Conference"], "invitees": ["ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference/Paper509/Reviewers", "ICLR.cc/2020/Conference/Paper509/Area_Chairs", "ICLR.cc/2020/Conference/Program_Chairs"], "id": "ICLR.cc/2020/Conference/Paper509/-/Official_Comment"}}}, {"id": "HJlWhQI79B", "original": null, "number": 4, "cdate": 1572197289368, "ddate": null, "tcdate": 1572197289368, "tmdate": 1573627087687, "tddate": null, "forum": "BkglSTNFDB", "replyto": "BkglSTNFDB", "invitation": "ICLR.cc/2020/Conference/Paper509/-/Official_Review", "content": {"experience_assessment": "I have published in this field for several years.", "rating": "6: Weak Accept", "review_assessment:_checking_correctness_of_experiments": "N/A", "review_assessment:_thoroughness_in_paper_reading": "N/A", "title": "Official Blind Review #4", "review": "Summary: This paper adapts the UCB Q-learning method to the inifinite-horizon discounted MDP setting. With an analysis similar to that of Jin et al (2018), it shows that this algorithm achieves a PAC bound of (1-gamma)^-7 |S||A|/eps^2, improving previous best-known bound (Delayed Q-learning, Strehlet et al, 2006, (1-gamma)^-8 |S||A|/eps^4) for this case.\n\nEvaluation: As I see this paper a direct extension of that of Jin et al (2018), I am afraid I have to recommend a rejection. \n\nHere are some more detailed comments:\n\nSignificance: \nThis paper studies the RL problem for the infinite-horizon discounted MDP setting. This is an important setting in reinforcement learning. However, the bound is not optimal as the dependence of (1-gamma) is significantly larger than the lower bound. Moreover, both the algorithm and analysis are direct extensions of that of Jin et al, I do not see a huge technique improvement. \n\nTechnique Novelty:\nAs stated in the paper, the major difficulty is that the inf-horizon case does not have a set of \"consecutive episodes\". Therefore the \"learning error at time t cannot be decomposed as errors from a set of consecutive time\nsteps before t, but errors from a set of non-consecutive time steps without any structure.\" However, I do not see a major technological innovation is needed to get around this issue. As a result, the analysis and algorithm in this paper are very similar to that of Jin et al 2018, who nearly implicitly contain the results in this paper.\n\nFurthermore, I would think there is a (likely) very simple reduction from the inf-horizon to finite-horizon: break the inifinite horizon into episodes of length R = O((1-\\gamma)^-1 log(eps^-1)). Now, although the MDP does not restart, but it can be treated as restarting at a history-dependent initial state distribution at the beginning of every episode. So, an optimal finit-horizon algorithm in this setting is at most epsilon worse than the optimal inf-horizon algorithm, no matter where/when you start. With little to no modification, we can see that Jin et al work in this setting. Thus, we obtain an algorithm for the inf-horizon as well.\n\nA good match for this conference?\nAs this paper is an adaptation of a previously known Q-learning algorithm to a slightly different setting in RL, I do not see how it fits the \"learning representation\" paradigm. Of course, Q-function can be argued as a representation of the MDP model, but this Q-function itself is not a new concept in this paper.\n\n\n\n", "review_assessment:_checking_correctness_of_derivations_and_theory": "I assessed the sensibility of the derivations and theory."}, "signatures": ["ICLR.cc/2020/Conference/Paper509/AnonReviewer4"], "readers": ["everyone"], "nonreaders": [], "writers": ["ICLR.cc/2020/Conference/Paper509/AnonReviewer4"], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP", "authors": ["Yuanhao Wang", "Kefan Dong", "Xiaoyu Chen", "Liwei Wang"], "authorids": ["yuanhao-16@mails.tsinghua.edu.cn", "dkf16@mails.tsinghua.edu.cn", "cxy30@pku.edu.cn", "wanglw@cis.pku.edu.cn"], "keywords": ["theory", "reinforcement learning", "sample complexity"], "TL;DR": "We adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards without accessing a generative model, and improves the previously best known result.", "abstract": "A fundamental question in reinforcement learning is whether model-free algorithms are sample efficient. Recently, Jin et al. (2018) proposed a Q-learning algorithm with UCB exploration policy, and proved it has nearly optimal regret bound for finite-horizon episodic MDP. In this paper, we adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards \\emph{without} accessing a generative model. We show that the \\textit{sample complexity of exploration} of our algorithm is bounded by $\\tilde{O}({\\frac{SA}{\\epsilon^2(1-\\gamma)^7}})$. This improves the previously best known result of $\\tilde{O}({\\frac{SA}{\\epsilon^4(1-\\gamma)^8}})$ in this setting achieved by delayed Q-learning (Strehlet al., 2006),, and matches the lower bound in terms of $\\epsilon$ as well as $S$ and $A$ up to logarithmic factors.", "pdf": "/pdf/3a261a8730f71c072aeea18bbd7d9a757ebc725d.pdf", "paperhash": "wang|qlearning_with_ucb_exploration_is_sample_efficient_for_infinitehorizon_mdp", "_bibtex": "@inproceedings{\nWang2020Q-learning,\ntitle={Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP},\nauthor={Yuanhao Wang and Kefan Dong and Xiaoyu Chen and Liwei Wang},\nbooktitle={International Conference on Learning Representations},\nyear={2020},\nurl={https://openreview.net/forum?id=BkglSTNFDB}\n}", "full_presentation_video": "", "original_pdf": "/attachment/f18e675c2d09159773e2a027f9c388e9156c4d70.pdf", "appendix": "", "poster": "", "spotlight_video": "", "slides": ""}, "tags": [], "invitation": {"reply": {"content": {"experience_assessment": {"required": true, "order": 4, "description": "Please make a selection that represents your experience correctly", "value-radio": ["I have published in this field for several years.", "I have published one or two papers in this area.", "I have read many papers in this area.", "I do not know much about this area."]}, "rating": {"value-dropdown": ["1: Reject", "3: Weak Reject", "6: Weak Accept", "8: Accept"], "order": 3, "required": true}, "review_assessment:_checking_correctness_of_experiments": {"required": true, "order": 7, "description": "If no experiments, please select N/A", "value-radio": ["I carefully checked the experiments.", "I assessed the sensibility of the experiments.", "I did not assess the experiments.", "N/A"]}, "review_assessment:_thoroughness_in_paper_reading": {"required": true, "order": 5, "description": "If this is not applicable, please select N/A", "value-radio": ["I read the paper thoroughly.", "I read the paper at least twice and used my best judgement in assessing the paper.", "I made a quick assessment of this paper.", "N/A"]}, "title": {"value-regex": "Official Blind Review #[0-9]+", "order": 1, "required": true, "description": "Please replace NUM with your AnonReviewer number (it is the number following \"AnonReviewer\" in your signatures below)", "default": "Official Blind Review #NUM"}, "review": {"value-regex": "[\\S\\s]{500,200000}", "order": 2, "description": "Provide your complete review here (500 - 200000 characters). For guidance in writing a good review, see this brief reviewer guide (https://iclr.cc/Conferences/2020/ReviewerGuide) with three key bullet points.", "required": true}, "review_assessment:_checking_correctness_of_derivations_and_theory": {"required": true, "order": 6, "description": "If no derivations or theory, please select N/A", "value-radio": ["I carefully checked the derivations and theory.", "I assessed the sensibility of the derivations and theory.", "I did not assess the derivations or theory.", "N/A"]}}, "forum": "BkglSTNFDB", "replyto": "BkglSTNFDB", "readers": {"values": ["everyone"], "description": "Select all user groups that should be able to read this comment."}, "nonreaders": {"values": []}, "writers": {"values-regex": "ICLR.cc/2020/Conference/Paper509/AnonReviewer[0-9]+", "description": "How your identity will be displayed."}, "signatures": {"values-regex": "ICLR.cc/2020/Conference/Paper509/AnonReviewer[0-9]+", "description": "How your identity will be displayed."}}, "expdate": 1575713021812, "duedate": 1572706740000, "multiReply": false, "readers": ["everyone"], "nonreaders": [], "invitees": ["ICLR.cc/2020/Conference/Paper509/Reviewers"], "noninvitees": [], "tcdate": 1570237751110, "tmdate": 1575713021830, "super": "ICLR.cc/2020/Conference/-/Official_Review", "signatures": ["ICLR.cc/2020/Conference"], "writers": ["ICLR.cc/2020/Conference"], "id": "ICLR.cc/2020/Conference/Paper509/-/Official_Review"}}}, {"id": "BylcpEQYsS", "original": null, "number": 9, "cdate": 1573627074090, "ddate": null, "tcdate": 1573627074090, "tmdate": 1573627074090, "tddate": null, "forum": "BkglSTNFDB", "replyto": "r1xYsw1rjS", "invitation": "ICLR.cc/2020/Conference/Paper509/-/Official_Comment", "content": {"title": "Thanks for explanation", "comment": "Thanks for the explanation. I now agree that the technique sufficiently differs from Jin et al.\nThis is mainly due to the fact that you need to run the algorithm forever and there is no hope to restart even if you stuck at some bad state (this also demonstrates that the def of PAC is not very good ...). \n\n>>The algorithm in Jin et. al finds a time-dependent policy. Running finite-horizon algorithm can only guarantee near-optimal behavior at step 1, 1+R, 1+2R, etc. For other steps, the policy given by Jin et. al can be suboptimal. For example, at step 1+R/2, the policy given by finite horizon algorithm only maximizes over the reward of remaining R/2 steps, which cannot guarantee optimal bound in the infinite horizon setting.\n\nActually I do not agree with this. You can set your Q-value in the last stage to be the Q-value of the first stage of the previous iteration. Then even the middle ones (1+R/2) are guaranteed to have near-optimal actions.\n\n\n>>Sublinear regret does NOT imply finite sample complexity of exploration. For example, if an algorithm takes sub-optimal moves at step 1, 4, 9, \u2026, t^2, \u2026, the regret is bounded by . However, the sample complexity of exploration of this algorithm is unbounded. Therefore, no direct reduction can be made from sample complexity of exploration to regret.\n\nI would guess you can use the same argument in your paper to bound the number of errors made by the regret algorithm.\n\n\n"}, "signatures": ["ICLR.cc/2020/Conference/Paper509/AnonReviewer4"], "readers": ["everyone"], "nonreaders": [], "writers": ["ICLR.cc/2020/Conference/Paper509/AnonReviewer4", "ICLR.cc/2020/Conference"], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP", "authors": ["Yuanhao Wang", "Kefan Dong", "Xiaoyu Chen", "Liwei Wang"], "authorids": ["yuanhao-16@mails.tsinghua.edu.cn", "dkf16@mails.tsinghua.edu.cn", "cxy30@pku.edu.cn", "wanglw@cis.pku.edu.cn"], "keywords": ["theory", "reinforcement learning", "sample complexity"], "TL;DR": "We adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards without accessing a generative model, and improves the previously best known result.", "abstract": "A fundamental question in reinforcement learning is whether model-free algorithms are sample efficient. Recently, Jin et al. (2018) proposed a Q-learning algorithm with UCB exploration policy, and proved it has nearly optimal regret bound for finite-horizon episodic MDP. In this paper, we adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards \\emph{without} accessing a generative model. We show that the \\textit{sample complexity of exploration} of our algorithm is bounded by $\\tilde{O}({\\frac{SA}{\\epsilon^2(1-\\gamma)^7}})$. This improves the previously best known result of $\\tilde{O}({\\frac{SA}{\\epsilon^4(1-\\gamma)^8}})$ in this setting achieved by delayed Q-learning (Strehlet al., 2006),, and matches the lower bound in terms of $\\epsilon$ as well as $S$ and $A$ up to logarithmic factors.", "pdf": "/pdf/3a261a8730f71c072aeea18bbd7d9a757ebc725d.pdf", "paperhash": "wang|qlearning_with_ucb_exploration_is_sample_efficient_for_infinitehorizon_mdp", "_bibtex": "@inproceedings{\nWang2020Q-learning,\ntitle={Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP},\nauthor={Yuanhao Wang and Kefan Dong and Xiaoyu Chen and Liwei Wang},\nbooktitle={International Conference on Learning Representations},\nyear={2020},\nurl={https://openreview.net/forum?id=BkglSTNFDB}\n}", "full_presentation_video": "", "original_pdf": "/attachment/f18e675c2d09159773e2a027f9c388e9156c4d70.pdf", "appendix": "", "poster": "", "spotlight_video": "", "slides": ""}, "tags": [], "invitation": {"reply": {"content": {"title": {"required": true, "description": "Brief summary of your comment.", "order": 0, "value-regex": ".{1,500}"}, "comment": {"required": true, "description": "Your comment or reply (max 5000 characters). Add TeX formulas using the following formats: $In-line Formula$ or $$Block Formula$$", "order": 1, "value-regex": "[\\S\\s]{1,5000}"}}, "forum": "BkglSTNFDB", "readers": {"values-dropdown": ["everyone", "ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference/Paper509/AnonReviewer.*", "ICLR.cc/2020/Conference/Paper509/Reviewers/Submitted", "ICLR.cc/2020/Conference/Paper509/Reviewers", "ICLR.cc/2020/Conference/Paper509/Area_Chairs", "ICLR.cc/2020/Conference/Program_Chairs"], "description": "Who your comment will be visible to. If replying to a specific person make sure to add the group they are a member of so that they are able to see your response"}, "writers": {"values-copied": ["ICLR.cc/2020/Conference", "{signatures}"]}, "signatures": {"description": "How your identity will be displayed.", "values-regex": "ICLR.cc/2020/Conference/Paper509/AnonReviewer[0-9]+|ICLR.cc/2020/Conference/Paper509/Authors|ICLR.cc/2020/Conference/Paper509/Area_Chair[0-9]+|ICLR.cc/2020/Conference/Program_Chairs"}}, "readers": ["everyone"], "tcdate": 1569504170369, "tmdate": 1576860541346, "super": "ICLR.cc/2020/Conference/-/Comment", "signatures": ["ICLR.cc/2020/Conference"], "writers": ["ICLR.cc/2020/Conference"], "invitees": ["ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference/Paper509/Reviewers", "ICLR.cc/2020/Conference/Paper509/Area_Chairs", "ICLR.cc/2020/Conference/Program_Chairs"], "id": "ICLR.cc/2020/Conference/Paper509/-/Official_Comment"}}}, {"id": "r1xYsw1rjS", "original": null, "number": 4, "cdate": 1573349280826, "ddate": null, "tcdate": 1573349280826, "tmdate": 1573349638304, "tddate": null, "forum": "BkglSTNFDB", "replyto": "HJlWhQI79B", "invitation": "ICLR.cc/2020/Conference/Paper509/-/Official_Comment", "content": {"title": "Response to Reviewer 4", "comment": "First of all, we thank the reviewer for giving detailed technical comments. The major concern of the reviewer is that there exists simple reduction from infinite-horizon setting to the episodic setting; and it is straightforward to generalize Jin et al (2018) to obtain our results.\n \nHowever, the reduction given by the reviewer is incorrect. Below we explain why the reduction doesn\u2019t hold, and this clearly illustrates the subtle differences between the infinite-horizon setting and the episodic case. In fact, as we already emphasized in the paper (Section 3.2), infinite-horizon setting cannot be solved by reducing to finite-horizon setting as long as we consider sample complexity instead of regret.\n\nWe focus on sample complexity of exploration in infinite horizon setting, which is a standard measure widely used in previous results in this setting, while Jin et al proved a regret bound. Please note that sublinear regret does NOT imply finite sample complexity of exploration.\n\nThe reduction giving by the reviewer does NOT work for infinite horizon setting.\n1.\tThe algorithm in Jin et. al finds a time-dependent policy. Running finite-horizon algorithm can only guarantee near-optimal behavior at step 1, 1+R, 1+2R, etc. For other steps, the policy given by Jin et. al can be suboptimal. For example, at step 1+R/2, the policy given by finite horizon algorithm only maximizes over the reward of remaining R/2 steps, which cannot guarantee optimal bound in the infinite horizon setting.\n2.\tSublinear regret does NOT imply finite sample complexity of exploration. For example, if an algorithm takes sub-optimal moves at step 1, 4, 9, \u2026, t^2, \u2026, the regret is bounded by $\\sqrt{T}$. However, the sample complexity of exploration of this algorithm is unbounded. Therefore, no direct reduction can be made from sample complexity of exploration to regret.\n\n\nResponse to other comments:\n\nRegarding the dependence of 1-gamma: \nPreviously best-known model-free algorithm for infinite horizon setting is Delayed Q-learning, which achieves a bound of $\\tilde{O}(\\frac{SA}{\\epsilon^4(1-\\gamma)^8})$. We also show that Delayed Q-learning cannot achieve near-optimal bound due to the inefficient usage of samples in Appendix D. Compared to this bound, our result is a significant improvement since we match the lower bound in terms of epsilon as well as S and A up to logarithmic factors. Besides, The previously best claimed result of model-based algorithms is 1/(1-gamma)^6, which is close to our result (1/(1-gamma)^7) and also significantly above the lower bound. Further improving the dependence on 1-gamma is a future direction.\n\nRegarding the technical novelty: \nAs stated in section 3.2, there are two major difficulties. Firstly, since we need to bound sample complexity of exploration, we need to establish convenient sufficient condition for being epsilon-optimal. We carefully design Condition 1 and Condition 2 to solve this problem. Secondly, we need to decompose errors to that of non-consecutive steps without any structure. See section 3.2 for detailed discussion.\n"}, "signatures": ["ICLR.cc/2020/Conference/Paper509/Authors"], "readers": ["everyone"], "nonreaders": [], "writers": ["ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference"], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP", "authors": ["Yuanhao Wang", "Kefan Dong", "Xiaoyu Chen", "Liwei Wang"], "authorids": ["yuanhao-16@mails.tsinghua.edu.cn", "dkf16@mails.tsinghua.edu.cn", "cxy30@pku.edu.cn", "wanglw@cis.pku.edu.cn"], "keywords": ["theory", "reinforcement learning", "sample complexity"], "TL;DR": "We adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards without accessing a generative model, and improves the previously best known result.", "abstract": "A fundamental question in reinforcement learning is whether model-free algorithms are sample efficient. Recently, Jin et al. (2018) proposed a Q-learning algorithm with UCB exploration policy, and proved it has nearly optimal regret bound for finite-horizon episodic MDP. In this paper, we adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards \\emph{without} accessing a generative model. We show that the \\textit{sample complexity of exploration} of our algorithm is bounded by $\\tilde{O}({\\frac{SA}{\\epsilon^2(1-\\gamma)^7}})$. This improves the previously best known result of $\\tilde{O}({\\frac{SA}{\\epsilon^4(1-\\gamma)^8}})$ in this setting achieved by delayed Q-learning (Strehlet al., 2006),, and matches the lower bound in terms of $\\epsilon$ as well as $S$ and $A$ up to logarithmic factors.", "pdf": "/pdf/3a261a8730f71c072aeea18bbd7d9a757ebc725d.pdf", "paperhash": "wang|qlearning_with_ucb_exploration_is_sample_efficient_for_infinitehorizon_mdp", "_bibtex": "@inproceedings{\nWang2020Q-learning,\ntitle={Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP},\nauthor={Yuanhao Wang and Kefan Dong and Xiaoyu Chen and Liwei Wang},\nbooktitle={International Conference on Learning Representations},\nyear={2020},\nurl={https://openreview.net/forum?id=BkglSTNFDB}\n}", "full_presentation_video": "", "original_pdf": "/attachment/f18e675c2d09159773e2a027f9c388e9156c4d70.pdf", "appendix": "", "poster": "", "spotlight_video": "", "slides": ""}, "tags": [], "invitation": {"reply": {"content": {"title": {"required": true, "description": "Brief summary of your comment.", "order": 0, "value-regex": ".{1,500}"}, "comment": {"required": true, "description": "Your comment or reply (max 5000 characters). Add TeX formulas using the following formats: $In-line Formula$ or $$Block Formula$$", "order": 1, "value-regex": "[\\S\\s]{1,5000}"}}, "forum": "BkglSTNFDB", "readers": {"values-dropdown": ["everyone", "ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference/Paper509/AnonReviewer.*", "ICLR.cc/2020/Conference/Paper509/Reviewers/Submitted", "ICLR.cc/2020/Conference/Paper509/Reviewers", "ICLR.cc/2020/Conference/Paper509/Area_Chairs", "ICLR.cc/2020/Conference/Program_Chairs"], "description": "Who your comment will be visible to. If replying to a specific person make sure to add the group they are a member of so that they are able to see your response"}, "writers": {"values-copied": ["ICLR.cc/2020/Conference", "{signatures}"]}, "signatures": {"description": "How your identity will be displayed.", "values-regex": "ICLR.cc/2020/Conference/Paper509/AnonReviewer[0-9]+|ICLR.cc/2020/Conference/Paper509/Authors|ICLR.cc/2020/Conference/Paper509/Area_Chair[0-9]+|ICLR.cc/2020/Conference/Program_Chairs"}}, "readers": ["everyone"], "tcdate": 1569504170369, "tmdate": 1576860541346, "super": "ICLR.cc/2020/Conference/-/Comment", "signatures": ["ICLR.cc/2020/Conference"], "writers": ["ICLR.cc/2020/Conference"], "invitees": ["ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference/Paper509/Reviewers", "ICLR.cc/2020/Conference/Paper509/Area_Chairs", "ICLR.cc/2020/Conference/Program_Chairs"], "id": "ICLR.cc/2020/Conference/Paper509/-/Official_Comment"}}}, {"id": "SyeQKO1HoB", "original": null, "number": 7, "cdate": 1573349499435, "ddate": null, "tcdate": 1573349499435, "tmdate": 1573349499435, "tddate": null, "forum": "BkglSTNFDB", "replyto": "HyxP6tXTtB", "invitation": "ICLR.cc/2020/Conference/Paper509/-/Official_Comment", "content": {"title": "Response to reviewer 1", "comment": "We thank anonymous reviewer 1 for the review. \n\nCondition 2 is a sufficient condition for near-optimal reward. Lemma 1 proved that the number of steps violating condition 2 is bounded. Please note that our algorithm achieves finite sample complexity of exploration in any MDPs, regardless of the suboptimality gap.\n\nOnce the desired performance of our algorithm (namely, epsilon) is determined, $R$ can be chosen as $R=\\ln \\left(\\frac{3}{\\epsilon (1\u2212\\gamma)}\\right) /(1 \u2212 \\gamma).$\n"}, "signatures": ["ICLR.cc/2020/Conference/Paper509/Authors"], "readers": ["everyone"], "nonreaders": [], "writers": ["ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference"], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP", "authors": ["Yuanhao Wang", "Kefan Dong", "Xiaoyu Chen", "Liwei Wang"], "authorids": ["yuanhao-16@mails.tsinghua.edu.cn", "dkf16@mails.tsinghua.edu.cn", "cxy30@pku.edu.cn", "wanglw@cis.pku.edu.cn"], "keywords": ["theory", "reinforcement learning", "sample complexity"], "TL;DR": "We adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards without accessing a generative model, and improves the previously best known result.", "abstract": "A fundamental question in reinforcement learning is whether model-free algorithms are sample efficient. Recently, Jin et al. (2018) proposed a Q-learning algorithm with UCB exploration policy, and proved it has nearly optimal regret bound for finite-horizon episodic MDP. In this paper, we adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards \\emph{without} accessing a generative model. We show that the \\textit{sample complexity of exploration} of our algorithm is bounded by $\\tilde{O}({\\frac{SA}{\\epsilon^2(1-\\gamma)^7}})$. This improves the previously best known result of $\\tilde{O}({\\frac{SA}{\\epsilon^4(1-\\gamma)^8}})$ in this setting achieved by delayed Q-learning (Strehlet al., 2006),, and matches the lower bound in terms of $\\epsilon$ as well as $S$ and $A$ up to logarithmic factors.", "pdf": "/pdf/3a261a8730f71c072aeea18bbd7d9a757ebc725d.pdf", "paperhash": "wang|qlearning_with_ucb_exploration_is_sample_efficient_for_infinitehorizon_mdp", "_bibtex": "@inproceedings{\nWang2020Q-learning,\ntitle={Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP},\nauthor={Yuanhao Wang and Kefan Dong and Xiaoyu Chen and Liwei Wang},\nbooktitle={International Conference on Learning Representations},\nyear={2020},\nurl={https://openreview.net/forum?id=BkglSTNFDB}\n}", "full_presentation_video": "", "original_pdf": "/attachment/f18e675c2d09159773e2a027f9c388e9156c4d70.pdf", "appendix": "", "poster": "", "spotlight_video": "", "slides": ""}, "tags": [], "invitation": {"reply": {"content": {"title": {"required": true, "description": "Brief summary of your comment.", "order": 0, "value-regex": ".{1,500}"}, "comment": {"required": true, "description": "Your comment or reply (max 5000 characters). Add TeX formulas using the following formats: $In-line Formula$ or $$Block Formula$$", "order": 1, "value-regex": "[\\S\\s]{1,5000}"}}, "forum": "BkglSTNFDB", "readers": {"values-dropdown": ["everyone", "ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference/Paper509/AnonReviewer.*", "ICLR.cc/2020/Conference/Paper509/Reviewers/Submitted", "ICLR.cc/2020/Conference/Paper509/Reviewers", "ICLR.cc/2020/Conference/Paper509/Area_Chairs", "ICLR.cc/2020/Conference/Program_Chairs"], "description": "Who your comment will be visible to. If replying to a specific person make sure to add the group they are a member of so that they are able to see your response"}, "writers": {"values-copied": ["ICLR.cc/2020/Conference", "{signatures}"]}, "signatures": {"description": "How your identity will be displayed.", "values-regex": "ICLR.cc/2020/Conference/Paper509/AnonReviewer[0-9]+|ICLR.cc/2020/Conference/Paper509/Authors|ICLR.cc/2020/Conference/Paper509/Area_Chair[0-9]+|ICLR.cc/2020/Conference/Program_Chairs"}}, "readers": ["everyone"], "tcdate": 1569504170369, "tmdate": 1576860541346, "super": "ICLR.cc/2020/Conference/-/Comment", "signatures": ["ICLR.cc/2020/Conference"], "writers": ["ICLR.cc/2020/Conference"], "invitees": ["ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference/Paper509/Reviewers", "ICLR.cc/2020/Conference/Paper509/Area_Chairs", "ICLR.cc/2020/Conference/Program_Chairs"], "id": "ICLR.cc/2020/Conference/Paper509/-/Official_Comment"}}}, {"id": "HJxbUu1SoB", "original": null, "number": 6, "cdate": 1573349449136, "ddate": null, "tcdate": 1573349449136, "tmdate": 1573349449136, "tddate": null, "forum": "BkglSTNFDB", "replyto": "r1gUR9K1qr", "invitation": "ICLR.cc/2020/Conference/Paper509/-/Official_Comment", "content": {"title": "Response to Reviewer 2", "comment": "We thank anonymous reviewer 2 for the review. \n\nComparison to other previous works: The most notable prior work in model-free PAC-RL is Delayed Q-learning (Strehl et al. 2006), which has a $\\tilde{O}\\left(SA/\\epsilon^4(1-\\gamma)^8\\right)$ sample complexity of exploration bound. Our improved dependence on $\\epsilon$ comes from two factors.\n\n1. Strehl et al. treat all mistakes over $\\epsilon$ on the same footing. In our analysis, we require large mistakes to happen rarely, but allow small mistakes to happen with larger probabilities. This is mainly captured by Condition 2.\n\n2. Delayed Q-learning needs $\\epsilon^{-2}$ samples to update the Q-value by $\\epsilon$, which results in slow learning progress at the start. This is illustrated by our example in Appendix D. In comparison, UCB bonus allows faster progress at the start.\n"}, "signatures": ["ICLR.cc/2020/Conference/Paper509/Authors"], "readers": ["everyone"], "nonreaders": [], "writers": ["ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference"], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP", "authors": ["Yuanhao Wang", "Kefan Dong", "Xiaoyu Chen", "Liwei Wang"], "authorids": ["yuanhao-16@mails.tsinghua.edu.cn", "dkf16@mails.tsinghua.edu.cn", "cxy30@pku.edu.cn", "wanglw@cis.pku.edu.cn"], "keywords": ["theory", "reinforcement learning", "sample complexity"], "TL;DR": "We adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards without accessing a generative model, and improves the previously best known result.", "abstract": "A fundamental question in reinforcement learning is whether model-free algorithms are sample efficient. Recently, Jin et al. (2018) proposed a Q-learning algorithm with UCB exploration policy, and proved it has nearly optimal regret bound for finite-horizon episodic MDP. In this paper, we adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards \\emph{without} accessing a generative model. We show that the \\textit{sample complexity of exploration} of our algorithm is bounded by $\\tilde{O}({\\frac{SA}{\\epsilon^2(1-\\gamma)^7}})$. This improves the previously best known result of $\\tilde{O}({\\frac{SA}{\\epsilon^4(1-\\gamma)^8}})$ in this setting achieved by delayed Q-learning (Strehlet al., 2006),, and matches the lower bound in terms of $\\epsilon$ as well as $S$ and $A$ up to logarithmic factors.", "pdf": "/pdf/3a261a8730f71c072aeea18bbd7d9a757ebc725d.pdf", "paperhash": "wang|qlearning_with_ucb_exploration_is_sample_efficient_for_infinitehorizon_mdp", "_bibtex": "@inproceedings{\nWang2020Q-learning,\ntitle={Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP},\nauthor={Yuanhao Wang and Kefan Dong and Xiaoyu Chen and Liwei Wang},\nbooktitle={International Conference on Learning Representations},\nyear={2020},\nurl={https://openreview.net/forum?id=BkglSTNFDB}\n}", "full_presentation_video": "", "original_pdf": "/attachment/f18e675c2d09159773e2a027f9c388e9156c4d70.pdf", "appendix": "", "poster": "", "spotlight_video": "", "slides": ""}, "tags": [], "invitation": {"reply": {"content": {"title": {"required": true, "description": "Brief summary of your comment.", "order": 0, "value-regex": ".{1,500}"}, "comment": {"required": true, "description": "Your comment or reply (max 5000 characters). Add TeX formulas using the following formats: $In-line Formula$ or $$Block Formula$$", "order": 1, "value-regex": "[\\S\\s]{1,5000}"}}, "forum": "BkglSTNFDB", "readers": {"values-dropdown": ["everyone", "ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference/Paper509/AnonReviewer.*", "ICLR.cc/2020/Conference/Paper509/Reviewers/Submitted", "ICLR.cc/2020/Conference/Paper509/Reviewers", "ICLR.cc/2020/Conference/Paper509/Area_Chairs", "ICLR.cc/2020/Conference/Program_Chairs"], "description": "Who your comment will be visible to. If replying to a specific person make sure to add the group they are a member of so that they are able to see your response"}, "writers": {"values-copied": ["ICLR.cc/2020/Conference", "{signatures}"]}, "signatures": {"description": "How your identity will be displayed.", "values-regex": "ICLR.cc/2020/Conference/Paper509/AnonReviewer[0-9]+|ICLR.cc/2020/Conference/Paper509/Authors|ICLR.cc/2020/Conference/Paper509/Area_Chair[0-9]+|ICLR.cc/2020/Conference/Program_Chairs"}}, "readers": ["everyone"], "tcdate": 1569504170369, "tmdate": 1576860541346, "super": "ICLR.cc/2020/Conference/-/Comment", "signatures": ["ICLR.cc/2020/Conference"], "writers": ["ICLR.cc/2020/Conference"], "invitees": ["ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference/Paper509/Reviewers", "ICLR.cc/2020/Conference/Paper509/Area_Chairs", "ICLR.cc/2020/Conference/Program_Chairs"], "id": "ICLR.cc/2020/Conference/Paper509/-/Official_Comment"}}}, {"id": "B1xjlOyroB", "original": null, "number": 5, "cdate": 1573349362550, "ddate": null, "tcdate": 1573349362550, "tmdate": 1573349362550, "tddate": null, "forum": "BkglSTNFDB", "replyto": "H1x2aR8Z9S", "invitation": "ICLR.cc/2020/Conference/Paper509/-/Official_Comment", "content": {"title": "Response to Reviewer 3", "comment": "We thank anonymous reviewer 3 for the review. \n\nRegarding the example in section 3.2: Please note that \u2018sample complexity of exploration\u2019 counts the number of sub-optimal steps. We agree that steps taken in $s_1$ maybe near-optimal. When the agent leaves state $s_1$ and enters other state, it will take sub-optimal steps, which contributes to the sample complexity of exploration.\nFor the finite horizon case, when the leaving probability is small, the regret could be small.\n\nIn summary, this example showed that there are cases where an algorithm is efficient when using regret as complexity measure and inefficient when using sample complexity of exploration. Therefore there is no straight-forward reduction from infinite horizon case to finite horizon case.\n"}, "signatures": ["ICLR.cc/2020/Conference/Paper509/Authors"], "readers": ["everyone"], "nonreaders": [], "writers": ["ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference"], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP", "authors": ["Yuanhao Wang", "Kefan Dong", "Xiaoyu Chen", "Liwei Wang"], "authorids": ["yuanhao-16@mails.tsinghua.edu.cn", "dkf16@mails.tsinghua.edu.cn", "cxy30@pku.edu.cn", "wanglw@cis.pku.edu.cn"], "keywords": ["theory", "reinforcement learning", "sample complexity"], "TL;DR": "We adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards without accessing a generative model, and improves the previously best known result.", "abstract": "A fundamental question in reinforcement learning is whether model-free algorithms are sample efficient. Recently, Jin et al. (2018) proposed a Q-learning algorithm with UCB exploration policy, and proved it has nearly optimal regret bound for finite-horizon episodic MDP. In this paper, we adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards \\emph{without} accessing a generative model. We show that the \\textit{sample complexity of exploration} of our algorithm is bounded by $\\tilde{O}({\\frac{SA}{\\epsilon^2(1-\\gamma)^7}})$. This improves the previously best known result of $\\tilde{O}({\\frac{SA}{\\epsilon^4(1-\\gamma)^8}})$ in this setting achieved by delayed Q-learning (Strehlet al., 2006),, and matches the lower bound in terms of $\\epsilon$ as well as $S$ and $A$ up to logarithmic factors.", "pdf": "/pdf/3a261a8730f71c072aeea18bbd7d9a757ebc725d.pdf", "paperhash": "wang|qlearning_with_ucb_exploration_is_sample_efficient_for_infinitehorizon_mdp", "_bibtex": "@inproceedings{\nWang2020Q-learning,\ntitle={Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP},\nauthor={Yuanhao Wang and Kefan Dong and Xiaoyu Chen and Liwei Wang},\nbooktitle={International Conference on Learning Representations},\nyear={2020},\nurl={https://openreview.net/forum?id=BkglSTNFDB}\n}", "full_presentation_video": "", "original_pdf": "/attachment/f18e675c2d09159773e2a027f9c388e9156c4d70.pdf", "appendix": "", "poster": "", "spotlight_video": "", "slides": ""}, "tags": [], "invitation": {"reply": {"content": {"title": {"required": true, "description": "Brief summary of your comment.", "order": 0, "value-regex": ".{1,500}"}, "comment": {"required": true, "description": "Your comment or reply (max 5000 characters). Add TeX formulas using the following formats: $In-line Formula$ or $$Block Formula$$", "order": 1, "value-regex": "[\\S\\s]{1,5000}"}}, "forum": "BkglSTNFDB", "readers": {"values-dropdown": ["everyone", "ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference/Paper509/AnonReviewer.*", "ICLR.cc/2020/Conference/Paper509/Reviewers/Submitted", "ICLR.cc/2020/Conference/Paper509/Reviewers", "ICLR.cc/2020/Conference/Paper509/Area_Chairs", "ICLR.cc/2020/Conference/Program_Chairs"], "description": "Who your comment will be visible to. If replying to a specific person make sure to add the group they are a member of so that they are able to see your response"}, "writers": {"values-copied": ["ICLR.cc/2020/Conference", "{signatures}"]}, "signatures": {"description": "How your identity will be displayed.", "values-regex": "ICLR.cc/2020/Conference/Paper509/AnonReviewer[0-9]+|ICLR.cc/2020/Conference/Paper509/Authors|ICLR.cc/2020/Conference/Paper509/Area_Chair[0-9]+|ICLR.cc/2020/Conference/Program_Chairs"}}, "readers": ["everyone"], "tcdate": 1569504170369, "tmdate": 1576860541346, "super": "ICLR.cc/2020/Conference/-/Comment", "signatures": ["ICLR.cc/2020/Conference"], "writers": ["ICLR.cc/2020/Conference"], "invitees": ["ICLR.cc/2020/Conference/Paper509/Authors", "ICLR.cc/2020/Conference/Paper509/Reviewers", "ICLR.cc/2020/Conference/Paper509/Area_Chairs", "ICLR.cc/2020/Conference/Program_Chairs"], "id": "ICLR.cc/2020/Conference/Paper509/-/Official_Comment"}}}, {"id": "r1gUR9K1qr", "original": null, "number": 2, "cdate": 1571949261639, "ddate": null, "tcdate": 1571949261639, "tmdate": 1572972586642, "tddate": null, "forum": "BkglSTNFDB", "replyto": "BkglSTNFDB", "invitation": "ICLR.cc/2020/Conference/Paper509/-/Official_Review", "content": {"experience_assessment": "I have published one or two papers in this area.", "rating": "6: Weak Accept", "review_assessment:_thoroughness_in_paper_reading": "I read the paper at least twice and used my best judgement in assessing the paper.", "review_assessment:_checking_correctness_of_experiments": "N/A", "title": "Official Blind Review #2", "review_assessment:_checking_correctness_of_derivations_and_theory": "I assessed the sensibility of the derivations and theory.", "review": "Summary:\nIn this paper, the authors extend the UCB Q-learning algorithm by Jin et al. (2018) to infinite horizon discounted MDPs, and prove a PAC bound of \\tilde{O}(SA/\\epsilon^2 (1-\\gamma)^7) for the resulting algorithm. This bound improves the one for delayed Q-learning by Strehl et al. (2006) and matches the lower-bound in terms of \\epsilon, S, and A. \n\n\nComments:\n- Overall, the paper is well-written and well-structured. Although most of the results are in the appendix, the authors have done a good job in what they reported in the paper and what they left for the appendix. \n- I personally think ICLR is not a good venue for this kind of papers. Places like COLT and journals are better because they allow the authors to report most of the results in the main paper, and give more time to the reviewers to go over all the proofs. \n- I did not have time to go over all the proofs in the appendix but I checked those in the paper. I did not find any error, but the math can be written more rigorously. \n- The algorithm is quite similar to the one by Jin et al. (2018), which is for finite-horizon problems. The authors discuss on Page 4 that why despite the similarity of the algorithms, the techniques in Jin et al. (2018) cannot be directly applied to their case. It would be good if the authors have a discussion on the novelty of the techniques used in their analysis, not only w.r.t. Jin et al. (2018), but w.r.t. other analysis of model free algorithms in infinite-horizon discounted problems. \n- What makes this work different than Jin et al. (2018), and is its novelty, is obtaining a PAC bound. The resulting regret bound is similar to the one in Jin et al. (2018), but the PAC bound is new. It would be good if the authors mention this on Page 4. This makes it more clear in which sense this work is different than that by Jin et al. (2018). \n- It is important to write in the statement of Condition 2 that \"i\" changes between 0 and \\log_2 R. \n"}, "signatures": ["ICLR.cc/2020/Conference/Paper509/AnonReviewer2"], "readers": ["everyone"], "nonreaders": [], "writers": ["ICLR.cc/2020/Conference/Paper509/AnonReviewer2"], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP", "authors": ["Yuanhao Wang", "Kefan Dong", "Xiaoyu Chen", "Liwei Wang"], "authorids": ["yuanhao-16@mails.tsinghua.edu.cn", "dkf16@mails.tsinghua.edu.cn", "cxy30@pku.edu.cn", "wanglw@cis.pku.edu.cn"], "keywords": ["theory", "reinforcement learning", "sample complexity"], "TL;DR": "We adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards without accessing a generative model, and improves the previously best known result.", "abstract": "A fundamental question in reinforcement learning is whether model-free algorithms are sample efficient. Recently, Jin et al. (2018) proposed a Q-learning algorithm with UCB exploration policy, and proved it has nearly optimal regret bound for finite-horizon episodic MDP. In this paper, we adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards \\emph{without} accessing a generative model. We show that the \\textit{sample complexity of exploration} of our algorithm is bounded by $\\tilde{O}({\\frac{SA}{\\epsilon^2(1-\\gamma)^7}})$. This improves the previously best known result of $\\tilde{O}({\\frac{SA}{\\epsilon^4(1-\\gamma)^8}})$ in this setting achieved by delayed Q-learning (Strehlet al., 2006),, and matches the lower bound in terms of $\\epsilon$ as well as $S$ and $A$ up to logarithmic factors.", "pdf": "/pdf/3a261a8730f71c072aeea18bbd7d9a757ebc725d.pdf", "paperhash": "wang|qlearning_with_ucb_exploration_is_sample_efficient_for_infinitehorizon_mdp", "_bibtex": "@inproceedings{\nWang2020Q-learning,\ntitle={Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP},\nauthor={Yuanhao Wang and Kefan Dong and Xiaoyu Chen and Liwei Wang},\nbooktitle={International Conference on Learning Representations},\nyear={2020},\nurl={https://openreview.net/forum?id=BkglSTNFDB}\n}", "full_presentation_video": "", "original_pdf": "/attachment/f18e675c2d09159773e2a027f9c388e9156c4d70.pdf", "appendix": "", "poster": "", "spotlight_video": "", "slides": ""}, "tags": [], "invitation": {"reply": {"content": {"experience_assessment": {"required": true, "order": 4, "description": "Please make a selection that represents your experience correctly", "value-radio": ["I have published in this field for several years.", "I have published one or two papers in this area.", "I have read many papers in this area.", "I do not know much about this area."]}, "rating": {"value-dropdown": ["1: Reject", "3: Weak Reject", "6: Weak Accept", "8: Accept"], "order": 3, "required": true}, "review_assessment:_checking_correctness_of_experiments": {"required": true, "order": 7, "description": "If no experiments, please select N/A", "value-radio": ["I carefully checked the experiments.", "I assessed the sensibility of the experiments.", "I did not assess the experiments.", "N/A"]}, "review_assessment:_thoroughness_in_paper_reading": {"required": true, "order": 5, "description": "If this is not applicable, please select N/A", "value-radio": ["I read the paper thoroughly.", "I read the paper at least twice and used my best judgement in assessing the paper.", "I made a quick assessment of this paper.", "N/A"]}, "title": {"value-regex": "Official Blind Review #[0-9]+", "order": 1, "required": true, "description": "Please replace NUM with your AnonReviewer number (it is the number following \"AnonReviewer\" in your signatures below)", "default": "Official Blind Review #NUM"}, "review": {"value-regex": "[\\S\\s]{500,200000}", "order": 2, "description": "Provide your complete review here (500 - 200000 characters). For guidance in writing a good review, see this brief reviewer guide (https://iclr.cc/Conferences/2020/ReviewerGuide) with three key bullet points.", "required": true}, "review_assessment:_checking_correctness_of_derivations_and_theory": {"required": true, "order": 6, "description": "If no derivations or theory, please select N/A", "value-radio": ["I carefully checked the derivations and theory.", "I assessed the sensibility of the derivations and theory.", "I did not assess the derivations or theory.", "N/A"]}}, "forum": "BkglSTNFDB", "replyto": "BkglSTNFDB", "readers": {"values": ["everyone"], "description": "Select all user groups that should be able to read this comment."}, "nonreaders": {"values": []}, "writers": {"values-regex": "ICLR.cc/2020/Conference/Paper509/AnonReviewer[0-9]+", "description": "How your identity will be displayed."}, "signatures": {"values-regex": "ICLR.cc/2020/Conference/Paper509/AnonReviewer[0-9]+", "description": "How your identity will be displayed."}}, "expdate": 1575713021812, "duedate": 1572706740000, "multiReply": false, "readers": ["everyone"], "nonreaders": [], "invitees": ["ICLR.cc/2020/Conference/Paper509/Reviewers"], "noninvitees": [], "tcdate": 1570237751110, "tmdate": 1575713021830, "super": "ICLR.cc/2020/Conference/-/Official_Review", "signatures": ["ICLR.cc/2020/Conference"], "writers": ["ICLR.cc/2020/Conference"], "id": "ICLR.cc/2020/Conference/Paper509/-/Official_Review"}}}, {"id": "H1x2aR8Z9S", "original": null, "number": 3, "cdate": 1572069059978, "ddate": null, "tcdate": 1572069059978, "tmdate": 1572972586600, "tddate": null, "forum": "BkglSTNFDB", "replyto": "BkglSTNFDB", "invitation": "ICLR.cc/2020/Conference/Paper509/-/Official_Review", "content": {"experience_assessment": "I do not know much about this area.", "rating": "6: Weak Accept", "review_assessment:_thoroughness_in_paper_reading": "N/A", "review_assessment:_checking_correctness_of_experiments": "N/A", "title": "Official Blind Review #3", "review_assessment:_checking_correctness_of_derivations_and_theory": "I assessed the sensibility of the derivations and theory.", "review": "This paper extends Jin et al. (2018)'s idea to infinite horizon and improves the best known sample complexity to $\\tilde{O}(\\frac{SA}{\\epsilon^2 (1-\\gamma)^7})$. The derivation is similar to Jin's paper except a very careful selection on the pseudo-horizon length $H$, where $H$ is given in finite horizon and work as the decaying rate for $\\alpha_k$, but for infinite horizon when we need to decide how to pick $H$.\n\nTheoretical Soundness: I didn't check every step of the proof, but I the steps I check is correct and I can feel that the derivation is solid.\n\nNovelty: In section 3.2, the authors discuss the difference between finite case and infinite case. I don't agree with the example if the starting state $s_1$ is with leaving probability less than $T^{-1}$. In this case, the latter rewards counted for $V(s_1)$ will multiply by $\\gamma^t$ which is pretty small, and will not contribute too much on the error. But I do agree that the case of infinite horizon is different since we need to carefully decide the decaying rate of $\\alpha_k$, which is definitely related to $\\frac{1}{1-\\gamma}$ but we need to figure out the relation. I think that is the most difficult part of the whole proof and this is the main technical contribution for the paper.\n\nMinor issue: In algorithm box I didn't see $V^{\\pi_t}, \\hat{Q}_t$ which occurs a lot in the derivation. Maybe change $\\hat{V}$ and $\\hat{Q}$ in the way align to the derivation?\n\nOverall I think this paper is sufficient to get in the conference. But to be honest since I lack the background of PAC-RL, I would remain a conservative of weak accept and would like to hear more discussions from other reviewers and authors to finalize my decision."}, "signatures": ["ICLR.cc/2020/Conference/Paper509/AnonReviewer3"], "readers": ["everyone"], "nonreaders": [], "writers": ["ICLR.cc/2020/Conference/Paper509/AnonReviewer3"], "details": {"replyCount": 0, "writable": false, "overwriting": [], "revisions": false, "forumContent": {"title": "Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP", "authors": ["Yuanhao Wang", "Kefan Dong", "Xiaoyu Chen", "Liwei Wang"], "authorids": ["yuanhao-16@mails.tsinghua.edu.cn", "dkf16@mails.tsinghua.edu.cn", "cxy30@pku.edu.cn", "wanglw@cis.pku.edu.cn"], "keywords": ["theory", "reinforcement learning", "sample complexity"], "TL;DR": "We adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards without accessing a generative model, and improves the previously best known result.", "abstract": "A fundamental question in reinforcement learning is whether model-free algorithms are sample efficient. Recently, Jin et al. (2018) proposed a Q-learning algorithm with UCB exploration policy, and proved it has nearly optimal regret bound for finite-horizon episodic MDP. In this paper, we adapt Q-learning with UCB-exploration bonus to infinite-horizon MDP with discounted rewards \\emph{without} accessing a generative model. We show that the \\textit{sample complexity of exploration} of our algorithm is bounded by $\\tilde{O}({\\frac{SA}{\\epsilon^2(1-\\gamma)^7}})$. This improves the previously best known result of $\\tilde{O}({\\frac{SA}{\\epsilon^4(1-\\gamma)^8}})$ in this setting achieved by delayed Q-learning (Strehlet al., 2006),, and matches the lower bound in terms of $\\epsilon$ as well as $S$ and $A$ up to logarithmic factors.", "pdf": "/pdf/3a261a8730f71c072aeea18bbd7d9a757ebc725d.pdf", "paperhash": "wang|qlearning_with_ucb_exploration_is_sample_efficient_for_infinitehorizon_mdp", "_bibtex": "@inproceedings{\nWang2020Q-learning,\ntitle={Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP},\nauthor={Yuanhao Wang and Kefan Dong and Xiaoyu Chen and Liwei Wang},\nbooktitle={International Conference on Learning Representations},\nyear={2020},\nurl={https://openreview.net/forum?id=BkglSTNFDB}\n}", "full_presentation_video": "", "original_pdf": "/attachment/f18e675c2d09159773e2a027f9c388e9156c4d70.pdf", "appendix": "", "poster": "", "spotlight_video": "", "slides": ""}, "tags": [], "invitation": {"reply": {"content": {"experience_assessment": {"required": true, "order": 4, "description": "Please make a selection that represents your experience correctly", "value-radio": ["I have published in this field for several years.", "I have published one or two papers in this area.", "I have read many papers in this area.", "I do not know much about this area."]}, "rating": {"value-dropdown": ["1: Reject", "3: Weak Reject", "6: Weak Accept", "8: Accept"], "order": 3, "required": true}, "review_assessment:_checking_correctness_of_experiments": {"required": true, "order": 7, "description": "If no experiments, please select N/A", "value-radio": ["I carefully checked the experiments.", "I assessed the sensibility of the experiments.", "I did not assess the experiments.", "N/A"]}, "review_assessment:_thoroughness_in_paper_reading": {"required": true, "order": 5, "description": "If this is not applicable, please select N/A", "value-radio": ["I read the paper thoroughly.", "I read the paper at least twice and used my best judgement in assessing the paper.", "I made a quick assessment of this paper.", "N/A"]}, "title": {"value-regex": "Official Blind Review #[0-9]+", "order": 1, "required": true, "description": "Please replace NUM with your AnonReviewer number (it is the number following \"AnonReviewer\" in your signatures below)", "default": "Official Blind Review #NUM"}, "review": {"value-regex": "[\\S\\s]{500,200000}", "order": 2, "description": "Provide your complete review here (500 - 200000 characters). For guidance in writing a good review, see this brief reviewer guide (https://iclr.cc/Conferences/2020/ReviewerGuide) with three key bullet points.", "required": true}, "review_assessment:_checking_correctness_of_derivations_and_theory": {"required": true, "order": 6, "description": "If no derivations or theory, please select N/A", "value-radio": ["I carefully checked the derivations and theory.", "I assessed the sensibility of the derivations and theory.", "I did not assess the derivations or theory.", "N/A"]}}, "forum": "BkglSTNFDB", "replyto": "BkglSTNFDB", "readers": {"values": ["everyone"], "description": "Select all user groups that should be able to read this comment."}, "nonreaders": {"values": []}, "writers": {"values-regex": "ICLR.cc/2020/Conference/Paper509/AnonReviewer[0-9]+", "description": "How your identity will be displayed."}, "signatures": {"values-regex": "ICLR.cc/2020/Conference/Paper509/AnonReviewer[0-9]+", "description": "How your identity will be displayed."}}, "expdate": 1575713021812, "duedate": 1572706740000, "multiReply": false, "readers": ["everyone"], "nonreaders": [], "invitees": ["ICLR.cc/2020/Conference/Paper509/Reviewers"], "noninvitees": [], "tcdate": 1570237751110, "tmdate": 1575713021830, "super": "ICLR.cc/2020/Conference/-/Official_Review", "signatures": ["ICLR.cc/2020/Conference"], "writers": ["ICLR.cc/2020/Conference"], "id": "ICLR.cc/2020/Conference/Paper509/-/Official_Review"}}}], "count": 14}
[ { "clave": "test10", "nombre": "Hector" }, { "clave": "abc456", "nombre": "Pedro" }, { "clave": "abc123", "nombre": "Juan" } ]
{"Name": "mamtasharma | trendsapp001 1"}
{ "verbose": true, "automock": false, "resetMocks": true, "transformIgnorePatterns": ["/node_modules/"], "transform": { "\\.(js|jsx|ts|tsx)$": "<rootDir>/node_modules/babel-jest" }, "unmockedModulePathPatterns": ["react"], "setupFilesAfterEnv": ["./test/test.setup.js"], "collectCoverage": true, "collectCoverageFrom": [ "src/**/*.{js,jsx,ts,tsx}", "!**/node_modules/**", "!**/dist/**" ], "coverageDirectory": "coverage", "coverageReporters": ["json", "lcov", "text", "html"], "coverageThreshold": { "global": { "branches": 100, "functions": 100, "lines": 100, "statements": 100 } } }
[ { "userId": 1, "userName": "Fiorella", "followeds": [ { "userId": 3, "userName": "Matias" } ], "followers": [], "listPost": [] }, { "userId": 2, "userName": "Tomas", "followeds": [], "followers": [ { "userId": 4, "userName": "Meii" } ], "listPost": [] }, { "userId": 3, "userName": "Matias", "followeds": [ { "userId": 2, "userName": "Tomas" }, { "userId": "1", "userName": "Fiorella" } ], "followers": [], "listPost": [ { "userId": 1, "date": "2021-06-09T19:03:24.329+00:00", "detail": { "productName": "Camiseta de Racing", "type": "Ropa", "brand": "Kappa", "color": "Celeste y blanca", "notes": "Vamos la acade" }, "category": 22, "price": 6000.0 }, { "userId": 1, "date": "2021-01-01T19:03:24.329+00:00", "detail": { "productName": "Camiseta de Racing", "type": "Ropa", "brand": "Kappa", "color": "Celeste y blanca", "notes": "Vamos la acade" }, "category": 22, "price": 6000.0 } ] }, { "userId": 4, "userName": "Meii", "followeds": [], "followers": [], "listPost": [] }, { "userId": 5, "userName": "Cliente5", "followeds": [], "followers": [], "listPost": [] }, { "userId": 6, "userName": "Cliente6", "followeds": [], "followers": [], "listPost": [] }, { "userId": 7, "userName": "Cliente7", "followeds": [], "followers": [], "listPost": [] }, { "userId": 8, "userName": "Cliente8", "followeds": [], "followers": [], "listPost": [] } ]
{ "images_by_width": { "width60": { "height": 60, "url": "https://mosaic.scdn.co/60/2bb97a6e697ef197bd125236afd69e6035e116e1f513ae2d610d9255913795d4bc28ca33c827b2324d2d29f26bc489d319825a977658bf73acc8ceb5670df044233f25c83e8413546567f39e6c804de0", "width": 60 }, "width300": { "height": 300, "url": "https://mosaic.scdn.co/300/2bb97a6e697ef197bd125236afd69e6035e116e1f513ae2d610d9255913795d4bc28ca33c827b2324d2d29f26bc489d319825a977658bf73acc8ceb5670df044233f25c83e8413546567f39e6c804de0", "width": 300 }, "width640": { "height": 640, "url": "https://mosaic.scdn.co/640/2bb97a6e697ef197bd125236afd69e6035e116e1f513ae2d610d9255913795d4bc28ca33c827b2324d2d29f26bc489d319825a977658bf73acc8ceb5670df044233f25c83e8413546567f39e6c804de0", "width": 640 } }, "playlist": { "collaborative": false, "description": null, "external_urls": { "spotify": "https://open.spotify.com/user/jlewalle/playlist/2QXtDXuuEQCLoA0cww6jGQ" }, "followers": { "href": null, "total": 0 }, "href": "https://api.spotify.com/v1/users/jlewalle/playlists/2QXtDXuuEQCLoA0cww6jGQ", "id": "2QXtDXuuEQCLoA0cww6jGQ", "images": [ { "height": 640, "url": "https://mosaic.scdn.co/640/2bb97a6e697ef197bd125236afd69e6035e116e1f513ae2d610d9255913795d4bc28ca33c827b2324d2d29f26bc489d319825a977658bf73acc8ceb5670df044233f25c83e8413546567f39e6c804de0", "width": 640 }, { "height": 300, "url": "https://mosaic.scdn.co/300/2bb97a6e697ef197bd125236afd69e6035e116e1f513ae2d610d9255913795d4bc28ca33c827b2324d2d29f26bc489d319825a977658bf73acc8ceb5670df044233f25c83e8413546567f39e6c804de0", "width": 300 }, { "height": 60, "url": "https://mosaic.scdn.co/60/2bb97a6e697ef197bd125236afd69e6035e116e1f513ae2d610d9255913795d4bc28ca33c827b2324d2d29f26bc489d319825a977658bf73acc8ceb5670df044233f25c83e8413546567f39e6c804de0", "width": 60 } ], "name": "Liked from Radio", "owner": { "display_name": "Jacob Lewallen", "external_urls": { "spotify": "https://open.spotify.com/user/jlewalle" }, "href": "https://api.spotify.com/v1/users/jlewalle", "id": "jlewalle", "type": "user", "uri": "spotify:user:jlewalle" }, "public": false, "snapshot_id": "GDf0UUC6FNABxIF0Vuriphhqir6t49fhadaDgS5Ohkdg1SL0VASZjOkwQNsHjnbs", "type": "playlist", "uri": "spotify:user:jlewalle:playlist:2QXtDXuuEQCLoA0cww6jGQ", "latest_change": 1465486874000 }, "tracks": [ { "added_at": "2016-06-09T15:41:14Z", "added_by": { "external_urls": { "spotify": "http://open.spotify.com/user/jlewalle" }, "href": "https://api.spotify.com/v1/users/jlewalle", "id": "jlewalle", "type": "user", "uri": "spotify:user:jlewalle" }, "is_local": false, "track": { "album": { "album_type": "album", "artists": [ { "external_urls": { "spotify": "https://open.spotify.com/artist/3M4ThdJR28z9eSMcQHAZ5G" }, "href": "https://api.spotify.com/v1/artists/3M4ThdJR28z9eSMcQHAZ5G", "id": "3M4ThdJR28z9eSMcQHAZ5G", "name": "The Fratellis", "type": "artist", "uri": "spotify:artist:3M4ThdJR28z9eSMcQHAZ5G" } ], "external_urls": { "spotify": "https://open.spotify.com/album/6R6pjR9ocMYuqSuNx5e4mg" }, "href": "https://api.spotify.com/v1/albums/6R6pjR9ocMYuqSuNx5e4mg", "id": "6R6pjR9ocMYuqSuNx5e4mg", "images": [ { "height": 634, "url": "https://i.scdn.co/image/2bb97a6e697ef197bd125236afd69e6035e116e1", "width": 640 }, { "height": 297, "url": "https://i.scdn.co/image/e8408e1ed27c365bcb102d66f3464f4b84d351a4", "width": 300 }, { "height": 63, "url": "https://i.scdn.co/image/412b7869ae566023f582c59bc128b479eec5a800", "width": 64 } ], "name": "Costello Music", "type": "album", "uri": "spotify:album:6R6pjR9ocMYuqSuNx5e4mg" }, "artists": [ { "external_urls": { "spotify": "https://open.spotify.com/artist/3M4ThdJR28z9eSMcQHAZ5G" }, "href": "https://api.spotify.com/v1/artists/3M4ThdJR28z9eSMcQHAZ5G", "id": "3M4ThdJR28z9eSMcQHAZ5G", "name": "The Fratellis", "type": "artist", "uri": "spotify:artist:3M4ThdJR28z9eSMcQHAZ5G" } ], "disc_number": 1, "duration_ms": 215853, "explicit": false, "external_ids": { "isrc": "GBUM70601572" }, "external_urls": { "spotify": "https://open.spotify.com/track/3jp7Ryj1sX3riA7NQaVlLd" }, "href": "https://api.spotify.com/v1/tracks/3jp7Ryj1sX3riA7NQaVlLd", "id": "3jp7Ryj1sX3riA7NQaVlLd", "name": "Whistle For The Choir", "popularity": 52, "preview_url": "https://p.scdn.co/mp3-preview/cbe25d6aa5aae4230c8bd224d2d6a5902f61e167?cid=235801f824094193ba9bd30729786fb1", "track_number": 3, "type": "track", "uri": "spotify:track:3jp7Ryj1sX3riA7NQaVlLd" }, "pretty_added_at": "June 9th 2016" }, { "added_at": "2016-06-09T15:07:56Z", "added_by": { "external_urls": { "spotify": "http://open.spotify.com/user/jlewalle" }, "href": "https://api.spotify.com/v1/users/jlewalle", "id": "jlewalle", "type": "user", "uri": "spotify:user:jlewalle" }, "is_local": false, "track": { "album": { "album_type": "album", "artists": [ { "external_urls": { "spotify": "https://open.spotify.com/artist/7Ln80lUS6He07XvHI8qqHH" }, "href": "https://api.spotify.com/v1/artists/7Ln80lUS6He07XvHI8qqHH", "id": "7Ln80lUS6He07XvHI8qqHH", "name": "Arctic Monkeys", "type": "artist", "uri": "spotify:artist:7Ln80lUS6He07XvHI8qqHH" } ], "external_urls": { "spotify": "https://open.spotify.com/album/5bU1XKYxHhEwukllT20xtk" }, "href": "https://api.spotify.com/v1/albums/5bU1XKYxHhEwukllT20xtk", "id": "5bU1XKYxHhEwukllT20xtk", "images": [ { "height": 640, "url": "https://i.scdn.co/image/486391b05384f2299a4c01b7bd8d5b855f20def9", "width": 640 }, { "height": 300, "url": "https://i.scdn.co/image/10c7b4705032bc99da2d32ec2751ab3fdd64ca5f", "width": 300 }, { "height": 64, "url": "https://i.scdn.co/image/16f51b8f6bc540a844fe97c218a6b3b7c1f4f998", "width": 64 } ], "name": "AM", "type": "album", "uri": "spotify:album:5bU1XKYxHhEwukllT20xtk" }, "artists": [ { "external_urls": { "spotify": "https://open.spotify.com/artist/7Ln80lUS6He07XvHI8qqHH" }, "href": "https://api.spotify.com/v1/artists/7Ln80lUS6He07XvHI8qqHH", "id": "7Ln80lUS6He07XvHI8qqHH", "name": "Arctic Monkeys", "type": "artist", "uri": "spotify:artist:7Ln80lUS6He07XvHI8qqHH" } ], "disc_number": 1, "duration_ms": 272394, "explicit": false, "external_ids": { "isrc": "GBCEL1300362" }, "external_urls": { "spotify": "https://open.spotify.com/track/3jfr0TF6DQcOLat8gGn7E2" }, "href": "https://api.spotify.com/v1/tracks/3jfr0TF6DQcOLat8gGn7E2", "id": "3jfr0TF6DQcOLat8gGn7E2", "name": "Do I Wanna Know?", "popularity": 26, "preview_url": null, "track_number": 1, "type": "track", "uri": "spotify:track:3jfr0TF6DQcOLat8gGn7E2" }, "pretty_added_at": "June 9th 2016" }, { "added_at": "2016-06-09T15:07:47Z", "added_by": { "external_urls": { "spotify": "http://open.spotify.com/user/jlewalle" }, "href": "https://api.spotify.com/v1/users/jlewalle", "id": "jlewalle", "type": "user", "uri": "spotify:user:jlewalle" }, "is_local": false, "track": { "album": { "album_type": "single", "artists": [ { "external_urls": { "spotify": "https://open.spotify.com/artist/3r32a6mMdoPaSP1C7kYhMc" }, "href": "https://api.spotify.com/v1/artists/3r32a6mMdoPaSP1C7kYhMc", "id": "3r32a6mMdoPaSP1C7kYhMc", "name": "Frank Carter & The Rattlesnakes", "type": "artist", "uri": "spotify:artist:3r32a6mMdoPaSP1C7kYhMc" } ], "external_urls": { "spotify": "https://open.spotify.com/album/21tblaCA7YkEAJb8WOJfwD" }, "href": "https://api.spotify.com/v1/albums/21tblaCA7YkEAJb8WOJfwD", "id": "21tblaCA7YkEAJb8WOJfwD", "images": [ { "height": 640, "url": "https://i.scdn.co/image/4d2d29f26bc489d319825a977658bf73acc8ceb5", "width": 640 }, { "height": 300, "url": "https://i.scdn.co/image/a0edd0b3c5b6093d9087baf2aad1979f24f71498", "width": 300 }, { "height": 64, "url": "https://i.scdn.co/image/8ba8a0d5515fafc646ce19b1d7bc91501f03195f", "width": 64 } ], "name": "Devil Inside Me", "type": "album", "uri": "spotify:album:21tblaCA7YkEAJb8WOJfwD" }, "artists": [ { "external_urls": { "spotify": "https://open.spotify.com/artist/3r32a6mMdoPaSP1C7kYhMc" }, "href": "https://api.spotify.com/v1/artists/3r32a6mMdoPaSP1C7kYhMc", "id": "3r32a6mMdoPaSP1C7kYhMc", "name": "Frank Carter & The Rattlesnakes", "type": "artist", "uri": "spotify:artist:3r32a6mMdoPaSP1C7kYhMc" } ], "disc_number": 1, "duration_ms": 178312, "explicit": false, "external_ids": { "isrc": "GB2ME1501260" }, "external_urls": { "spotify": "https://open.spotify.com/track/2QffHjQ9LF5OZKimPUZswo" }, "href": "https://api.spotify.com/v1/tracks/2QffHjQ9LF5OZKimPUZswo", "id": "2QffHjQ9LF5OZKimPUZswo", "name": "Devil Inside Me", "popularity": 34, "preview_url": "https://p.scdn.co/mp3-preview/b79374848018a5fa446d81fe9b3001b8c643b442?cid=235801f824094193ba9bd30729786fb1", "track_number": 1, "type": "track", "uri": "spotify:track:2QffHjQ9LF5OZKimPUZswo" }, "pretty_added_at": "June 9th 2016" }, { "added_at": "2016-06-09T15:07:45Z", "added_by": { "external_urls": { "spotify": "http://open.spotify.com/user/jlewalle" }, "href": "https://api.spotify.com/v1/users/jlewalle", "id": "jlewalle", "type": "user", "uri": "spotify:user:jlewalle" }, "is_local": false, "track": { "album": { "album_type": "album", "artists": [ { "external_urls": { "spotify": "https://open.spotify.com/artist/0Ak6DLKHtpR6TEEnmcorKA" }, "href": "https://api.spotify.com/v1/artists/0Ak6DLKHtpR6TEEnmcorKA", "id": "0Ak6DLKHtpR6TEEnmcorKA", "name": "The Vaccines", "type": "artist", "uri": "spotify:artist:0Ak6DLKHtpR6TEEnmcorKA" } ], "external_urls": { "spotify": "https://open.spotify.com/album/3K9OT3dQWJFnsiP8aTssqS" }, "href": "https://api.spotify.com/v1/albums/3K9OT3dQWJFnsiP8aTssqS", "id": "3K9OT3dQWJFnsiP8aTssqS", "images": [ { "height": 640, "url": "https://i.scdn.co/image/670df044233f25c83e8413546567f39e6c804de0", "width": 640 }, { "height": 300, "url": "https://i.scdn.co/image/2e26b1246384484e571751fdefb4265cf5e533b1", "width": 300 }, { "height": 64, "url": "https://i.scdn.co/image/d7bc7f006a1870080382e35043b716a239440b22", "width": 64 } ], "name": "English Graffiti (Deluxe)", "type": "album", "uri": "spotify:album:3K9OT3dQWJFnsiP8aTssqS" }, "artists": [ { "external_urls": { "spotify": "https://open.spotify.com/artist/0Ak6DLKHtpR6TEEnmcorKA" }, "href": "https://api.spotify.com/v1/artists/0Ak6DLKHtpR6TEEnmcorKA", "id": "0Ak6DLKHtpR6TEEnmcorKA", "name": "The Vaccines", "type": "artist", "uri": "spotify:artist:0Ak6DLKHtpR6TEEnmcorKA" } ], "disc_number": 1, "duration_ms": 225520, "explicit": false, "external_ids": { "isrc": "GBARL1500145" }, "external_urls": { "spotify": "https://open.spotify.com/track/4UiRLwmHSsuzVc54ShHRvv" }, "href": "https://api.spotify.com/v1/tracks/4UiRLwmHSsuzVc54ShHRvv", "id": "4UiRLwmHSsuzVc54ShHRvv", "name": "Dream Lover", "popularity": 46, "preview_url": "https://p.scdn.co/mp3-preview/49bb16de866380e767497f6477d2449681c1006c?cid=235801f824094193ba9bd30729786fb1", "track_number": 2, "type": "track", "uri": "spotify:track:4UiRLwmHSsuzVc54ShHRvv" }, "pretty_added_at": "June 9th 2016" }, { "added_at": "2016-06-09T15:06:54Z", "added_by": { "external_urls": { "spotify": "http://open.spotify.com/user/jlewalle" }, "href": "https://api.spotify.com/v1/users/jlewalle", "id": "jlewalle", "type": "user", "uri": "spotify:user:jlewalle" }, "is_local": false, "track": { "album": { "album_type": "album", "artists": [ { "external_urls": { "spotify": "https://open.spotify.com/artist/0C0XlULifJtAgn6ZNCW2eu" }, "href": "https://api.spotify.com/v1/artists/0C0XlULifJtAgn6ZNCW2eu", "id": "0C0XlULifJtAgn6ZNCW2eu", "name": "The Killers", "type": "artist", "uri": "spotify:artist:0C0XlULifJtAgn6ZNCW2eu" } ], "external_urls": { "spotify": "https://open.spotify.com/album/4undIeGmofnAYKhnDclN1w" }, "href": "https://api.spotify.com/v1/albums/4undIeGmofnAYKhnDclN1w", "id": "4undIeGmofnAYKhnDclN1w", "images": [ { "height": 640, "url": "https://i.scdn.co/image/ae33d84ad5b1b47f5c7b73c63ca0f1fd4d131b84", "width": 629 }, { "height": 300, "url": "https://i.scdn.co/image/e8862e61bc38f868f52bd83c5934b5d41e48500b", "width": 295 }, { "height": 64, "url": "https://i.scdn.co/image/74bcf303c0186b19b873a1bbdc2a6c9b3fd0b90b", "width": 63 } ], "name": "Hot Fuss", "type": "album", "uri": "spotify:album:4undIeGmofnAYKhnDclN1w" }, "artists": [ { "external_urls": { "spotify": "https://open.spotify.com/artist/0C0XlULifJtAgn6ZNCW2eu" }, "href": "https://api.spotify.com/v1/artists/0C0XlULifJtAgn6ZNCW2eu", "id": "0C0XlULifJtAgn6ZNCW2eu", "name": "The Killers", "type": "artist", "uri": "spotify:artist:0C0XlULifJtAgn6ZNCW2eu" } ], "disc_number": 1, "duration_ms": 258986, "explicit": false, "external_ids": { "isrc": "USIR20400271" }, "external_urls": { "spotify": "https://open.spotify.com/track/4auE2w8sP6HYrA3Dcokmdl" }, "href": "https://api.spotify.com/v1/tracks/4auE2w8sP6HYrA3Dcokmdl", "id": "4auE2w8sP6HYrA3Dcokmdl", "name": "On Top", "popularity": 54, "preview_url": "https://p.scdn.co/mp3-preview/0ff70f8c510dd7547b94179ecd3bb22b0f335309?cid=235801f824094193ba9bd30729786fb1", "track_number": 7, "type": "track", "uri": "spotify:track:4auE2w8sP6HYrA3Dcokmdl" }, "pretty_added_at": "June 9th 2016" } ] }