BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Darpass - Your pass to Tech Armenia - ECPv6.15.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Darpass - Your pass to Tech Armenia
X-ORIGINAL-URL:https://darpass.com
X-WR-CALDESC:Events for Darpass - Your pass to Tech Armenia
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Dubai
BEGIN:STANDARD
TZOFFSETFROM:+0400
TZOFFSETTO:+0400
TZNAME:+04
DTSTART:20230101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Dubai:20241121T143000
DTEND;TZID=Asia/Dubai:20241121T180000
DTSTAMP:20260501T223531
CREATED:20241120T094344Z
LAST-MODIFIED:20241120T094344Z
UID:3396-1732199400-1732212000@darpass.com
SUMMARY:Monotonicity Methods for MFGs
DESCRIPTION:𝖬𝗈𝗇𝗈𝗍𝗈𝗇𝗂𝖼𝗂𝗍𝗒 𝖬𝖾𝗍𝗁𝗈𝖽𝗌 𝖿𝗈𝗋 MFGs (𝖬𝖾𝖺𝗇 𝖥𝗂𝖾l𝖽 𝖦𝖺𝗆𝖾𝗌): 𝖠 𝖥𝗎𝗇𝖼𝗍𝗂𝗈𝗇𝖺l 𝖠𝗇𝖺l𝗒𝗍𝗂𝖼 𝖯𝖾𝗋𝗌𝗉𝖾𝖼𝗍𝗂𝗏𝖾 \n𝐒𝐚𝐯𝐞 𝐭𝐡𝐞 𝐝𝐚𝐭𝐞 𝐟𝐨𝐫 𝐚𝐧𝐨𝐭𝐡𝐞𝐫 𝐢𝐧𝐬𝐢𝐠𝐡𝐭𝐟𝐮𝐥 𝐬𝐞𝐦𝐢𝐧𝐚𝐫 𝐩𝐫𝐞𝐬𝐞𝐧𝐭𝐞𝐝 𝐛𝐲 𝐏𝐫𝐨𝐟𝐞𝐬𝐬𝐨𝐫 𝐃𝐢𝐨𝐠𝐨 𝐆𝐨𝐦𝐞𝐬\, 𝐚 𝐥𝐞𝐚𝐝𝐢𝐧𝐠 𝐞𝐱𝐩𝐞𝐫𝐭 𝐢𝐧 𝐀𝐩𝐩𝐥𝐢𝐞𝐝 𝐌𝐚𝐭𝐡𝐞𝐦𝐚𝐭𝐢𝐜𝐬 𝐚𝐧𝐝 𝐂𝐨𝐦𝐩𝐮𝐭𝐚𝐭𝐢𝐨𝐧𝐚𝐥 𝐒𝐜𝐢𝐞𝐧𝐜𝐞!\n𝐓𝐢𝐭𝐥𝐞: 𝖬𝗈𝗇𝗈𝗍𝗈𝗇𝗂𝖼𝗂𝗍𝗒 𝖬𝖾𝗍𝗁𝗈𝖽𝗌 𝖿𝗈𝗋 𝖬𝖾𝖺𝗇 𝖥𝗂𝖾l𝖽 𝖦𝖺𝗆𝖾𝗌: 𝖠 𝖥𝗎𝗇𝖼𝗍𝗂𝗈𝗇𝖺l 𝖠𝗇𝖺l𝗒𝗍𝗂𝖼 𝖯𝖾𝗋𝗌𝗉𝖾𝖼𝗍𝗂𝗏𝖾\n𝐃𝐚𝐭𝐞: 𝖭𝗈𝗏𝖾𝗆𝖻𝖾𝗋 𝟤𝟣\n𝐓𝐢𝐦𝐞: 𝟣𝟦:𝟥𝟢\n𝐋𝐨𝐜𝐚𝐭𝐢𝐨𝐧: 𝖸𝖲𝖴\, 𝖥𝖠𝖢𝖴𝖫𝖳𝖸 𝖮𝖥 𝖬𝖠𝖳𝖧𝖤𝖬𝖠𝖳𝗅𝖢𝖲 𝖠𝖭𝖣 𝖬𝖤𝖢𝖧𝖠𝖭𝗅𝖢𝖲\, 𝖠𝖴𝖣𝗅𝖳𝖮𝖱𝗅𝖴𝖬 𝟤𝟦𝟥 \n\n𝐀𝐛𝐬𝐭𝐫𝐚𝐜𝐭:\n𝖳𝗁𝗂𝗌 𝗉𝗋𝖾𝗌𝖾𝗇𝗍𝖺𝗍𝗂𝗈𝗇 𝖾𝗑𝗉l𝗈𝗋𝖾𝗌 𝗆𝖾𝖺𝗇 𝖿𝗂𝖾l𝖽 𝗀𝖺𝗆𝖾𝗌 (𝖬𝖥𝖦𝗌) 𝗍𝗁𝗋𝗈𝗎𝗀𝗁 𝗍𝗁𝖾 l𝖾𝗇𝗌 𝗈𝖿 𝖿𝗎𝗇𝖼𝗍𝗂𝗈𝗇𝖺l 𝖺𝗇𝖺l𝗒𝗌𝗂𝗌\, 𝖿𝗈𝖼𝗎𝗌𝗂𝗇𝗀 𝗈𝗇 𝗍𝗁𝖾 𝗋𝗈l𝖾 𝗈𝖿 𝗆𝗈𝗇𝗈𝗍𝗈𝗇𝗂𝖼𝗂𝗍𝗒 𝗆𝖾𝗍𝗁𝗈𝖽𝗌 𝗂𝗇 𝗎𝗇𝖽𝖾𝗋𝗌𝗍𝖺𝗇𝖽𝗂𝗇𝗀 𝗍𝗁𝖾𝗂𝗋 𝗉𝗋𝗈𝗉𝖾𝗋𝗍𝗂𝖾𝗌 𝖺𝗇𝖽 𝖽𝖾𝗋𝗂𝗏𝗂𝗇𝗀 𝗌𝗈l𝗎𝗍𝗂𝗈𝗇𝗌. 𝖶𝖾 𝖻𝖾𝗀𝗂𝗇 𝖻𝗒 𝗂𝗇𝗍𝗋𝗈𝖽𝗎𝖼𝗂𝗇𝗀 𝖬𝖥𝖦𝗌 𝖺𝗌 𝗆𝗈𝖽𝖾l𝗌 𝖿𝗈𝗋 l𝖺𝗋𝗀𝖾 𝗉𝗈𝗉𝗎l𝖺𝗍𝗂𝗈𝗇𝗌 𝗈𝖿 𝗂𝗇𝗍𝖾𝗋𝖺𝖼𝗍𝗂𝗇𝗀 𝗋𝖺𝗍𝗂𝗈𝗇𝖺l 𝖺𝗀𝖾𝗇𝗍𝗌\, 𝗂ll𝗎𝗌𝗍𝗋𝖺𝗍𝗂𝗇𝗀 𝗍𝗁𝖾𝗂𝗋 𝖽𝖾𝗋𝗂𝗏𝖺𝗍𝗂𝗈𝗇 𝖿𝗈𝗋 𝖽𝖾𝗍𝖾𝗋𝗆𝗂𝗇𝗂𝗌𝗍𝗂𝖼 𝗉𝗋𝗈𝖻l𝖾𝗆𝗌. 𝖶𝖾 𝗍𝗁𝖾𝗇 𝖾𝗑𝖺𝗆𝗂𝗇𝖾 𝗄𝖾𝗒 𝗊𝗎𝖾𝗌𝗍𝗂𝗈𝗇𝗌 𝗈𝖿 𝗍𝗁𝖾 𝖾𝗑𝗂𝗌𝗍𝖾𝗇𝖼𝖾 𝖺𝗇𝖽 𝗎𝗇𝗂𝗊𝗎𝖾𝗇𝖾𝗌𝗌 𝗈𝖿 𝖬𝖥𝖦 𝗌𝗈l𝗎𝗍𝗂𝗈𝗇𝗌.\n𝖬𝗈𝗇𝗈𝗍𝗈𝗇𝗂𝖼𝗂𝗍𝗒 𝗈𝗉𝖾𝗋𝖺𝗍𝗈𝗋𝗌 𝖾𝗆𝖾𝗋𝗀𝖾 𝖺𝗌 𝖺 𝖼𝖾𝗇𝗍𝗋𝖺l 𝗍𝗈𝗈l 𝗂𝗇 𝗈𝗎𝗋 𝖺𝗇𝖺l𝗒𝗌𝗂𝗌. 𝖶𝖾 𝖾𝗌𝗍𝖺𝖻l𝗂𝗌𝗁 𝗍𝗁𝖾 𝖼𝗈𝗇𝗇𝖾𝖼𝗍𝗂𝗈𝗇 𝖻𝖾𝗍𝗐𝖾𝖾𝗇 𝗆𝗈𝗇𝗈𝗍𝗈𝗇𝖾 𝗈𝗉𝖾𝗋𝖺𝗍𝗈𝗋𝗌 𝖺𝗇𝖽 𝗏𝖺𝗋𝗂𝖺𝗍𝗂𝗈𝗇𝖺l 𝗂𝗇𝖾𝗊𝗎𝖺l𝗂𝗍𝗂𝖾𝗌\, 𝗌𝗁𝗈𝗐𝖼𝖺𝗌𝗂𝗇𝗀 𝗁𝗈𝗐 𝗍𝗁𝖾 l𝖺𝗍𝗍𝖾𝗋 𝗈𝖿𝖿𝖾𝗋𝗌 𝖺 𝖿l𝖾𝗑𝗂𝖻l𝖾 𝖿𝗋𝖺𝗆𝖾𝗐𝗈𝗋𝗄 𝖿𝗈𝗋 𝖺𝖽𝖽𝗋𝖾𝗌𝗌𝗂𝗇𝗀 𝗌𝗂𝗍𝗎𝖺𝗍𝗂𝗈𝗇𝗌 𝗐𝗁𝖾𝗋𝖾 𝗍𝗋𝖺𝖽𝗂𝗍𝗂𝗈𝗇𝖺l 𝗌𝗈l𝗎𝗍𝗂𝗈𝗇𝗌 𝗆𝖺𝗒 𝗇𝗈𝗍 𝖾𝗑𝗂𝗌𝗍. 𝖶𝖾 𝗍𝗁𝖾𝗇 𝗂𝗇𝗏𝖾𝗌𝗍𝗂𝗀𝖺𝗍𝖾 𝗍𝗁𝖾 𝗋𝗈l𝖾 𝗈𝖿 𝖧𝖾𝗌𝗌𝗂𝖺𝗇 𝗈𝗉𝖾𝗋𝖺𝗍𝗈𝗋𝗌\, 𝖡𝗋𝖾𝗀𝗆𝖺𝗇 𝖽𝗂𝗏𝖾𝗋𝗀𝖾𝗇𝖼𝖾\, 𝖺𝗇𝖽 𝗋𝖾𝗀𝗎l𝖺𝗋𝗂𝗓𝖺𝗍𝗂𝗈𝗇 𝗍𝖾𝖼𝗁𝗇𝗂𝗊𝗎𝖾𝗌 𝗂𝗇 𝗈𝖻𝗍𝖺𝗂𝗇𝗂𝗇𝗀 𝗌𝗈l𝗎𝗍𝗂𝗈𝗇𝗌 𝗍𝗈 𝖬𝖥𝖦𝗌 𝗐𝗂𝗍𝗁𝗂𝗇 𝗍𝗁𝗂𝗌 𝖿𝗋𝖺𝗆𝖾𝗐𝗈𝗋𝗄. 𝖡𝗎𝗂l𝖽𝗂𝗇𝗀 𝗈𝗇 𝗍𝗁𝗂𝗌 𝖿𝗈𝗎𝗇𝖽𝖺𝗍𝗂𝗈𝗇\, 𝗐𝖾 𝖾𝗑𝗍𝖾𝗇𝖽 𝗈𝗎𝗋 𝖽𝗂𝗌𝖼𝗎𝗌𝗌𝗂𝗈𝗇 𝗍𝗈 𝗍𝗁𝖾 𝖡𝖺𝗇𝖺𝖼𝗁 𝗌𝗉𝖺𝖼𝖾 𝗌𝖾𝗍𝗍𝗂𝗇𝗀\, 𝖾𝗑𝖺𝗆𝗂𝗇𝗂𝗇𝗀 𝗆𝗈𝗇𝗈𝗍𝗈𝗇𝖾 𝗈𝗉𝖾𝗋𝖺𝗍𝗈𝗋𝗌 𝖻𝖾𝗍𝗐𝖾𝖾𝗇 𝖺 𝖡𝖺𝗇𝖺𝖼𝗁 𝗌𝗉𝖺𝖼𝖾 𝖺𝗇𝖽 𝗂𝗍𝗌 𝖽𝗎𝖺l. 𝖶𝖾 𝗉𝗋𝖾𝗌𝖾𝗇𝗍 𝖾𝗑𝗂𝗌𝗍𝖾𝗇𝖼𝖾 𝗍𝗁𝖾𝗈𝗋𝖾𝗆𝗌 𝖺𝗇𝖽 𝗋𝖾𝗀𝗎l𝖺𝗋𝗂𝗓𝖺𝗍𝗂𝗈𝗇 𝗆𝖾𝗍𝗁𝗈𝖽𝗌 𝗍𝖺𝗂l𝗈𝗋𝖾𝖽 𝗍𝗈 𝗍𝗁𝗂𝗌 𝖼𝗈𝗇𝗍𝖾𝗑𝗍. 𝖶𝖾 𝖼𝗈𝗇𝖼l𝗎𝖽𝖾 𝖻𝗒 𝖾𝗑𝗉l𝗈𝗋𝗂𝗇𝗀 𝗍𝗁𝖾 𝖼𝗈𝗇𝖼𝖾𝗉𝗍 𝗈𝖿 𝗐𝖾𝖺𝗄-𝗌𝗍𝗋𝗈𝗇𝗀 𝗎𝗇𝗂𝗊𝗎𝖾𝗇𝖾𝗌𝗌\, 𝗐𝗁𝗂𝖼𝗁 𝖾𝗌𝗍𝖺𝖻l𝗂𝗌𝗁𝖾𝗌 𝖼𝗈𝗇𝖽𝗂𝗍𝗂𝗈𝗇𝗌 𝗎𝗇𝖽𝖾𝗋 𝗐𝗁𝗂𝖼𝗁 𝗐𝖾𝖺𝗄 𝖺𝗇𝖽 𝗌𝗍𝗋𝗈𝗇𝗀 𝗌𝗈l𝗎𝗍𝗂𝗈𝗇𝗌 𝗈𝖿 𝖬𝖥𝖦𝗌 𝖼𝗈𝗂𝗇𝖼𝗂𝖽𝖾. \n\n𝐀𝐛𝐨𝐮𝐭 𝐭𝐡𝐞 𝐒𝐩𝐞𝐚𝐤𝐞𝐫:\n𝖣𝗂𝗈𝗀𝗈 𝖦𝗈𝗆𝖾𝗌 𝗂𝗌 𝖺 𝖯𝗋𝗈𝖿𝖾𝗌𝗌𝗈𝗋 𝗈𝖿 𝖠𝗉𝗉l𝗂𝖾𝖽 𝖬𝖺𝗍𝗁𝖾𝗆𝖺𝗍𝗂𝖼𝗌 𝖺𝗇𝖽 𝖢𝗈𝗆𝗉𝗎𝗍𝖺𝗍𝗂𝗈𝗇𝖺l 𝖲𝖼𝗂𝖾𝗇𝖼𝖾 (𝖠𝖬𝖢𝖲) 𝖺𝗇𝖽 𝗁𝖺𝗌 𝗌𝖾𝗋𝗏𝖾𝖽 𝖺𝗌 𝖢𝗁𝖺𝗂𝗋 𝗈𝖿 𝗍𝗁𝖾 𝖠𝖬𝖢𝖲 𝖯𝗋𝗈𝗀𝗋𝖺𝗆 𝗌𝗂𝗇𝖼𝖾 𝟤𝟢𝟣𝟪. 𝖧𝗂𝗌 𝗋𝖾𝗌𝖾𝖺𝗋𝖼𝗁 𝖿𝗈𝖼𝗎𝗌𝖾𝗌 𝗈𝗇 𝗉𝖺𝗋𝗍𝗂𝖺l 𝖽𝗂𝖿𝖿𝖾𝗋𝖾𝗇𝗍𝗂𝖺l 𝖾𝗊𝗎𝖺𝗍𝗂𝗈𝗇𝗌 (𝖯𝖣𝖤)\, 𝗐𝗂𝗍𝗁 𝖺𝗇 𝖾𝗆𝗉𝗁𝖺𝗌𝗂𝗌 𝗈𝗇 𝗏𝗂𝗌𝖼𝗈𝗌𝗂𝗍𝗒 𝗌𝗈l𝗎𝗍𝗂𝗈𝗇𝗌 𝗈𝖿 𝖾ll𝗂𝗉𝗍𝗂𝖼\, 𝗉𝖺𝗋𝖺𝖻𝗈l𝗂𝖼\, 𝖺𝗇𝖽 𝖧𝖺𝗆𝗂l𝗍𝗈𝗇-𝖩𝖺𝖼𝗈𝖻𝗂 𝖾𝗊𝗎𝖺𝗍𝗂𝗈𝗇𝗌\, 𝖺𝗌 𝗐𝖾ll 𝖺𝗌 𝗋𝖾l𝖺𝗍𝖾𝖽 𝗆𝖾𝖺𝗇-𝖿𝗂𝖾l𝖽 𝗆𝗈𝖽𝖾l𝗌.\n𝖯𝗋𝗈𝖿𝖾𝗌𝗌𝗈𝗋 𝖦𝗈𝗆𝖾𝗌 𝖾𝖺𝗋𝗇𝖾𝖽 𝗁𝗂𝗌 𝖯𝗁.𝖣. 𝗂𝗇 𝖬𝖺𝗍𝗁𝖾𝗆𝖺𝗍𝗂𝖼𝗌 𝖿𝗋𝗈𝗆 𝗍𝗁𝖾 𝖴𝗇𝗂𝗏𝖾𝗋𝗌𝗂𝗍𝗒 𝗈𝖿 𝖢𝖺l𝗂𝖿𝗈𝗋𝗇𝗂𝖺\, 𝖡𝖾𝗋𝗄𝖾l𝖾𝗒\, 𝗂𝗇 𝟤𝟢𝟢𝟢\, 𝖺𝗇𝖽 𝗋𝖾𝖼𝖾𝗂𝗏𝖾𝖽 𝗁𝗂𝗌 𝖧𝖺𝖻𝗂l𝗂𝗍𝖺𝗍𝗂𝗈𝗇 𝗂𝗇 𝖬𝖺𝗍𝗁𝖾𝗆𝖺𝗍𝗂𝖼𝗌 𝖿𝗋𝗈𝗆 𝖴𝗇𝗂𝗏𝖾𝗋𝗌𝗂𝖽𝖺𝖽𝖾 𝖳é𝖼𝗇𝗂𝖼𝖺 𝖽𝖾 𝖫𝗂𝗌𝖻𝗈𝖺 𝗂𝗇 𝟤𝟢𝟢𝟨. 𝖧𝖾 𝖼𝗈𝗆𝗉l𝖾𝗍𝖾𝖽 𝖺 𝖯𝗈𝗌𝗍-𝖣𝗈𝖼 𝖺𝗍 𝗍𝗁𝖾 𝗅𝗇𝗌𝗍𝗂𝗍𝗎𝗍𝖾 𝖿𝗈𝗋 𝖠𝖽𝗏𝖺𝗇𝖼𝖾𝖽 𝖲𝗍𝗎𝖽𝗒 𝗂𝗇 𝖯𝗋𝗂𝗇𝖼𝖾𝗍𝗈𝗇 𝗂𝗇 𝟤𝟢𝟢𝟢\, 𝖿𝗈ll𝗈𝗐𝖾𝖽 𝖻𝗒 𝖺𝗇𝗈𝗍𝗁𝖾𝗋 𝖯𝗈𝗌𝗍-𝖣𝗈𝖼 𝖺𝗍 𝗍𝗁𝖾 𝖴𝗇𝗂𝗏𝖾𝗋𝗌𝗂𝗍𝗒 𝗈𝖿 𝖳𝖾𝗑𝖺𝗌 𝖺𝗍 𝖠𝗎𝗌𝗍𝗂𝗇 𝗂𝗇 𝟤𝟢𝟢𝟣. 𝖡𝖾𝖿𝗈𝗋𝖾 ј𝗈𝗂𝗇𝗂𝗇𝗀 𝖪𝖠𝖴𝖲𝖳 𝗂𝗇 𝟤𝟢𝟣𝟥\, 𝖯𝗋𝗈𝖿𝖾𝗌𝗌𝗈𝗋 𝖦𝗈𝗆𝖾𝗌 𝗐𝖺𝗌 𝖺 𝖯𝗋𝗈𝖿𝖾𝗌𝗌𝗈𝗋 𝗂𝗇 𝗍𝗁𝖾 𝖬𝖺𝗍𝗁𝖾𝗆𝖺𝗍𝗂𝖼𝗌 𝖣𝖾𝗉𝖺𝗋𝗍𝗆𝖾𝗇𝗍 𝖺𝗍 𝗅𝗇𝗌𝗍𝗂𝗍𝗎𝗍𝗈 𝖲𝗎𝗉𝖾𝗋𝗂𝗈𝗋 𝖳é𝖼𝗇𝗂𝖼𝗈 𝖿𝗋𝗈𝗆 𝟤𝟢𝟢𝟣 𝗍𝗈 𝟤𝟢𝟣𝟥. \nYou can find more tech events happening in Armenia here
URL:https://darpass.com/event/monotonicity-methods-for-mfgs/
LOCATION:Yerevan State University\, 1 Alek Manukyan Str.\, Yerevan\, 0025\, Armenia
CATEGORIES:Tech Events In Armenia
ATTACH;FMTTYPE=image/jpeg:https://darpass.com/wp-content/uploads/2024/11/Monotonicity-Methods-for-MFGs.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Dubai:20241121T190000
DTEND;TZID=Asia/Dubai:20241121T200000
DTSTAMP:20260501T223531
CREATED:20241120T103932Z
LAST-MODIFIED:20241120T103932Z
UID:3406-1732215600-1732219200@darpass.com
SUMMARY:HackShabti - How to Find Bugs
DESCRIPTION:Join us for “HackShabti – How to Find Bugs” an engaging session led by Hayk Aslanyan\, a researcher at the Center of Advanced Software Technologies and a lecturer at the Russian-Armenian University. \n​Hayk will explain how to find bugs in programs using a tool developed by his team. He will also talk about code clones and how they help uncover hidden bugs. Additionally\, he’ll discuss static analysis techniques and their important role in AppSec and the Secure Development Lifecycle (SDLC). \n​This is a great opportunity to learn practical tips for improving code quality and making software more secure. \n​Don’t miss out the “HackShabti – How to Find Bugs” – register now and join us! \n  \nYou can find more tech events happening in Armenia here
URL:https://darpass.com/event/hackshabti-how-to-find-bugs/
LOCATION:Microsoft Innovation Center Armenia\, 105 Teryan Str.\, Yerevan\, Armenia
CATEGORIES:Tech Events In Armenia
ATTACH;FMTTYPE=image/jpeg:https://darpass.com/wp-content/uploads/2024/11/HackShabti-How-to-Find-Bugs.jpg
END:VEVENT
END:VCALENDAR