Участник:StasFomin/Bookmarks/Algorithms — различия между версиями

Материал из DISCOPAL
Перейти к: навигация, поиск
(Добавлена закладка solution1.pdf)
(Добавлена закладка статус курсы.xlsx - Google Sheets)
 
(не показано 137 промежуточных версий этого же участника)
Строка 1: Строка 1:
 +
== 2024 ==
 +
=== 2024-03 ===
 +
 +
* 2024-03-28, 16:34:00: [https://docs.google.com/spreadsheets/d/1ioHOHnPrcj6qBrsxotYVeVJVlkqHj2GD/edit?pli=1#gid=1316239506 статус курсы.xlsx - Google Sheets]
 +
*: <html><br><br></html>
 +
<!-- NEXT BOOKMARK -->
 +
* 2024-03-20, 19:14:22: [https://github.com/sheryl-ai/MVGCN sheryl-ai/MVGCN: Multi-View Graph Convolutional Network and Its Applications on Neuroimage Analysis for Parkinson's Disease (AMIA 2018)]
 +
* 2024-03-03, 19:22:07: [https://sysblok.ru/knowhow/kak-ustroena-nejroset-bert-ot-google/ Как устроена нейросеть BERT от Google - Системный Блокъ]
 +
* 2024-03-03, 19:13:07: [https://github.com/LeorFinkelberg/Optimization LeorFinkelberg/Optimization]
 +
 +
=== 2024-02 ===
 +
 +
* 2024-02-27, 20:55:59: [https://vk.com/video-176869000_456239030 Video005 — Видео]
 +
 +
=== 2024-01 ===
 +
 +
* 2024-01-27, 07:22:19: [https://github.com/MykolaHerasymovych/Optimizing-Acceptance-Threshold-in-Credit-Scoring-using-Reinforcement-Learning/blob/master/Source/simulation.py Optimizing-Acceptance-Threshold-in-Credit-Scoring-using-Reinforcement-Learning/Source/simulation.py at master · MykolaHerasymovych/Optimizing-Acceptance-Threshold-in-Credit-Scoring-using-Reinforcement-Learning]
 +
* 2024-01-27, 07:05:06: [https://habr.com/ru/companies/glowbyte/articles/519382/ ML и DS оттенки кредитного риск-менеджмента / Хабр]
 +
* 2024-01-27, 02:47:46: [https://bijournal.hse.ru/data/2015/10/12/1076342406/2.pdf BI 3 (33) 2015 new.indd - 2.pdf]
 +
* 2024-01-26, 03:06:01: [https://habr.com/ru/companies/yandex/articles/263991/ Вероятностное программирование / Хабр]
 +
* 2024-01-21, 03:00:34: [https://github.com/fast-algos/graphs-matrices-optimization/blob/master/lecture1.pdf graphs-matrices-optimization/lecture1.pdf at master · fast-algos/graphs-matrices-optimization]
 +
* 2024-01-21, 02:53:24: [https://github.com/ChrisTX/lecture-notes/tree/7726d59c6caeaa7ac874cbc1fb1e08353bfd98f3/Approximation%20Algorithms lecture-notes/Approximation Algorithms at 7726d59c6caeaa7ac874cbc1fb1e08353bfd98f3 · ChrisTX/lecture-notes]
 +
* 2024-01-20, 00:29:21: [https://github.com/tlkahn/zkSNARKs-Cryptography-Protocol-Survey tlkahn/zkSNARKs-Cryptography-Protocol-Survey]
 +
* 2024-01-20, 00:23:51: [https://github.com/prokls/theoretical-computer-science-2/blob/master/randomized_complexity_classes.pdf theoretical-computer-science-2/randomized_complexity_classes.pdf at master · prokls/theoretical-computer-science-2]
 +
* 2024-01-19, 23:12:56: [https://zhuanlan.zhihu.com/p/37270132 Теорема PCP, часть 1: Введение - Чжиху]
 +
* 2024-01-19, 23:07:56: [https://github.com/mourad1081/complexity-exam-questions mourad1081/complexity-exam-questions: Réponse aux questions de complexité]
 +
* 2024-01-19, 23:06:42: [https://github.com/LucaCappelletti94/lectures-notes/tree/0b0550ee36eab19d0d48f74e407beee1e5a3e78f/Unimi/Algoritmi%20e%20Complessita lectures-notes/Unimi/Algoritmi e Complessita at 0b0550ee36eab19d0d48f74e407beee1e5a3e78f · LucaCappelletti94/lectures-notes]
 +
* 2024-01-19, 22:51:02: [https://github.com/BrownAppliedCryptography/notes BrownAppliedCryptography/notes: Scribed course notes.]
 +
* 2024-01-19, 22:49:27: [https://github.com/mnielsen/expander_graph_notes mnielsen/expander_graph_notes: Notes on expander graphs]
 +
* 2024-01-19, 22:48:32: [https://github.com/pragmaticTNT pragmaticTNT]
 +
* 2024-01-19, 22:43:13: [https://github.com/mnielsen/expander_graph_notes/blob/193880dde69c1aa2bdf974a4975a0b960a278575/expanders_github.tex expander_graph_notes/expanders_github.tex at 193880dde69c1aa2bdf974a4975a0b960a278575 · mnielsen/expander_graph_notes]
 +
* 2024-01-19, 02:36:35: [https://github.com/sleepymalc/Notes/blob/7e28b1c548da109b7e89a62acc6ed1076841352c/EECS598-001-Approximation-Algorithms-and-Hardness-of-Approximation/Lectures/lec_2.tex Notes/EECS598-001-Approximation-Algorithms-and-Hardness-of-Approximation/Lectures/lec_2.tex at 7e28b1c548da109b7e89a62acc6ed1076841352c · sleepymalc/Notes]
 +
* 2024-01-19, 02:16:16: [https://github.com/sleepymalc/Notes/tree/7e28b1c548da109b7e89a62acc6ed1076841352c/EECS598-001-Approximation-Algorithms-and-Hardness-of-Approximation Notes/EECS598-001-Approximation-Algorithms-and-Hardness-of-Approximation at 7e28b1c548da109b7e89a62acc6ed1076841352c · sleepymalc/Notes]
 +
* 2024-01-19, 01:41:18: [https://github.com/arielgabizon/Lectures/blob/master/4elemproofAarhus2019.pdf Lectures/4elemproofAarhus2019.pdf at master · arielgabizon/Lectures]
 +
* 2024-01-19, 01:10:29: [https://github.com/Landarzar/complexityPoster/blob/master/poster.pdf complexityPoster/poster.pdf at master · Landarzar/complexityPoster]
 +
* 2024-01-19, 00:54:25: [https://github.com/jarrodmillman/pcp/blob/master/final.tex pcp/final.tex at master · jarrodmillman/pcp]
 +
* 2024-01-18, 22:17:49: [https://github.com/SanskarX10/Coding-Graph-Theory-101/tree/main SanskarX10/Coding-Graph-Theory-101: Coding and explanation of Graph theory algorithms used in computer science in python-3 . These set of notebooks acts as a course in graph theory.]
 +
* 2024-01-18, 22:16:14: [https://github.com/rjwrobel86/Python4Statistics/tree/main rjwrobel86/Python4Statistics: Python Scripts and Jupyter Notebooks for Prof. Robert Wrobel's Applied Business Statistics course at Webster University and anybody else who wants to learn!]
 +
* 2024-01-18, 22:04:34: [https://github.com/hishamcse/Discrete-Math-Specialization-Coursera-/tree/master hishamcse/Discrete-Math-Specialization-Coursera-: This repository contains the materials, python codes for the quiz and some codes implemented using jupyter notebook related to the specialization ( Introduction to Discrete Mathematics In Computer Science)]
 +
* 2024-01-18, 21:52:09: [https://github.com/i40a/python-for-industry40 i40a/python-for-industry40: Jupyter Notebook files from the course Python for Industry 4.0.]
 +
* 2024-01-18, 21:50:24: [https://github.com/kylebeggs/Numerical-Methods-in-Python kylebeggs/Numerical-Methods-in-Python: A collection of Python notebooks covering topics in an undergraduate Numerical Methods in Engineering course.]
 +
* 2024-01-18, 21:49:05: [https://github.com/sslotin/universum-dl sslotin/universum-dl: Some notebooks from a Deep Learning mini-course taught in Summer '18]
 +
* 2024-01-18, 21:43:06: [https://github.com/ali-tny/boyd-convex-optimisation-py ali-tny/boyd-convex-optimisation-py: homework notebooks for the Stanford Convex Optimisation course in python (rather than Matlab)]
 +
* 2024-01-18, 21:40:45: [https://github.com/Novota15/fourier-transforms-in-python Novota15/fourier-transforms-in-python: A jupyter python notebook that provides a crash course on Fourier Series, Fourier Transforms, Fast Fourier Transforms, and improving Chebyshev Interpolation with FFT]
 +
* 2024-01-18, 21:37:53: [https://github.com/nivkeren/computational-methods nivkeren/computational-methods: computational-methods course notebooks]
 +
* 2024-01-18, 21:36:24: [https://github.com/ptah23/audio-transformers-course-notebooks ptah23/audio-transformers-course-notebooks: Python notebooks for hugging face audio transformers course]
 +
* 2024-01-18, 21:31:16: [https://github.com/iutzeler/refresher-course iutzeler/refresher-course: Jupyter Notebooks for practical sessions of the "Refresher Course in Matrix Analysis and Numerical Optimization" at Université Grenoble Alpes]
 +
* 2024-01-18, 21:30:20: [https://github.com/codeninja55/mathematic_notebooks/tree/master codeninja55/mathematic_notebooks: A repository store for all mathematic references, jupyter notebooks, and notes from various courses taken.]
 +
* 2024-01-18, 21:26:26: [https://github.com/juanklopper/Linear-algebra-for-data-science-with-python/tree/master juanklopper/Linear-algebra-for-data-science-with-python: Jupyter notebooks for my course on linear algebra using symbolic python.]
 +
* 2024-01-18, 21:19:14: [https://github.com/Milwa97/A-level-math Milwa97/A-level-math: A level math course in form of jupyter notebooks. The aim of the course is to develop mathematical intuition and a better understanding of mathematics at the post-elementary level]
 +
* 2024-01-18, 21:18:21: [https://github.com/aezarebski/aas-extended-examples aezarebski/aas-extended-examples: A collection of notebooks used in the tutorials for the applied analytic statistics course in 2020]
 +
* 2024-01-18, 21:17:45: [https://github.com/raghurama123/NumericalMethods raghurama123/NumericalMethods: Contains Jupyter notebooks and other materials prepared for the course Numerical Methods offered at TIFR Hyderabad (https://moldis-group.github.io/teaching.html)]
 +
* 2024-01-18, 21:16:47: [https://github.com/ymlai87416/ComputationalFinance_notebook ymlai87416/ComputationalFinance_notebook: Notebook and assignment for Coursera course: Introduction to Computational Finance and Financial Econometrics by Eric Zivot]
 +
* 2024-01-18, 21:13:14: [https://github.com/Unipisa/HLT Unipisa/HLT: Notebooks for course HLT]
 +
* 2024-01-18, 21:13:01: [https://github.com/Pengyue-Lab/uiuc-cs357-fa21-scripts Pengyue-Lab/uiuc-cs357-fa21-scripts: A repository of useful scripts for the course CS357 in the form of Jupyter Notebook.]
 +
* 2024-01-18, 21:10:36: [https://github.com/inducer/numpde-notes inducer/numpde-notes: Slides/notes and Jupyter notebook demos for an introductory course of numerical methods for PDEs]
 +
* 2024-01-18, 21:09:14: [https://github.com/iutzeler/NumericalOptimization/tree/master/Lab2_GradientDescent NumericalOptimization/Lab2_GradientDescent at master · iutzeler/NumericalOptimization]
 +
* 2024-01-18, 21:05:56: [https://github.com/garth-wells/IA-maths-Jupyter/tree/master garth-wells/IA-maths-Jupyter: Notebooks in support of of the Part IA (Michaelmas Term) mathematics course at the Department of Engineering at University of Cambridge]
 +
* 2024-01-18, 21:00:16: [https://github.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming: Notebook for quick search]
 +
* 2024-01-18, 20:58:40: [https://github.com/inducer/numerics-notes/tree/main inducer/numerics-notes: Slides/notes and Jupyter notebook demos for an introductory course of numerical analysis/scientific computing]
 +
* 2024-01-18, 19:50:42: [https://github.com/croach/oreilly-matplotlib-course croach/oreilly-matplotlib-course: Jupyter notebooks from my O'Reilly Media course "Matplolib for Developers: Data Visualization and Analysis with Python"]
 +
* 2024-01-18, 19:50:04: [https://github.com/z4ir3/finance-courses z4ir3/finance-courses: Notes and examples about Portfolio Construction and Analysis with Python (Jupyter notebooks)]
 +
* 2024-01-18, 19:49:32: [https://github.com/jansenicus/www-coursera-downloader jansenicus/www-coursera-downloader: This Jupyter Notebook will help you downloading Coursera videos, subtitles and quizzes (but not answering the quiz). It will automatically download and convert vtt subtitle files into srt. All resources downloaded are numbered according to their sequence.]
 +
* 2024-01-18, 19:48:16: [https://github.com/fastai/numerical-linear-algebra-v2 fastai/numerical-linear-algebra-v2: Jupyter Notebooks for Computational Linear Algebra course, taught summer 2018 in USF MSDS program]
 +
* 2024-01-18, 19:47:48: [https://github.com/yourwanghao/CMUComputationalPhotography yourwanghao/CMUComputationalPhotography: Jupyter Notebooks for CMU Computational Photography Course 15.463]
 +
* 2024-01-18, 19:45:02: [https://github.com/lmarti/evolutionary-computation-course lmarti/evolutionary-computation-course: Jupyter/IPython notebooks about evolutionary computation.]
 +
* 2024-01-18, 19:43:06: [https://github.com/mandli/intro-numerical-methods mandli/intro-numerical-methods: Jupyter notebooks and other materials developed for the Columbia course APMA 4300]
 +
* 2024-01-17, 19:39:02: [https://github.com/ageron/tf2_course ageron/tf2_course: Notebooks for my "Deep Learning with TensorFlow 2 and Keras" course]
 +
* 2024-01-17, 19:33:55: [https://github.com/fastai/numerical-linear-algebra fastai/numerical-linear-algebra: Free online textbook of Jupyter notebooks for fast.ai Computational Linear Algebra course]
 +
* 2024-01-16, 07:43:24: [https://github.com/juanklopper/MIT_OCW_Linear_Algebra_18_06 juanklopper/MIT_OCW_Linear_Algebra_18_06: IPython notebooks on Gilbert Strang's MIT course on linear algebra (18.06)]
 +
* 2024-01-16, 07:43:04: [https://github.com/xuwenhao/geektime-ai-course xuwenhao/geektime-ai-course: Jupyter Notebooks for Geektime AI Course]
 +
* 2024-01-16, 07:42:49: [https://github.com/ML-course/master ML-course/master: A machine learning course using Python, Jupyter Notebooks, and OpenML]
 +
* 2024-01-16, 07:39:44: [https://github.com/dataflowr/notebooks dataflowr/notebooks: code for deep learning courses]
 +
* 2024-01-16, 07:38:51: [https://github.com/FurkanGozukara/Stable-Diffusion FurkanGozukara/Stable-Diffusion: Stable Diffusion, SDXL, LoRA Training, DreamBooth Training, Automatic1111 Web UI, DeepFake, Deep Fakes, TTS, Animation, Text To Video, Tutorials, Guides, Lectures, Courses, ComfyUI, Google Colab, RunPod, NoteBooks, ControlNet, TTS, Voice Cloning, AI, AI News, ML, ML News, News, Tech, Tech News, Kohya LoRA, Kandinsky 2, DeepFloyd IF, Midjourney]
 +
* 2024-01-16, 07:37:44: [https://github.com/phlippe/uvadlc_notebooks phlippe/uvadlc_notebooks: Repository of Jupyter notebook tutorials for teaching the Deep Learning Course at the University of Amsterdam (MSc AI), Fall 2022/Spring 2022]
 +
* 2024-01-16, 07:36:44: [https://github.com/fastai/course22 fastai/course22: The fast.ai course notebooks]
 +
* 2024-01-16, 07:35:36: [https://github.com/mlabonne/llm-course mlabonne/llm-course: Course to get into Large Language Models (LLMs) with roadmaps and Colab notebooks.]
 +
* 2024-01-16, 07:30:12: [https://github.com/peremartra/Large-Language-Model-Notebooks-Course peremartra/Large-Language-Model-Notebooks-Course: Practical course about Large Language Models.]
 +
* 2024-01-16, 07:29:16: [https://github.com/aperham90/QS_combinatorics/blob/main/Oralists_Aug142023.ipynb QS_combinatorics/Oralists_Aug142023.ipynb at main · aperham90/QS_combinatorics]
 +
* 2024-01-16, 07:28:41: [https://github.com/fastai/numerical-linear-algebra/blob/master/nbs/2.%20Topic%20Modeling%20with%20NMF%20and%20SVD.ipynb numerical-linear-algebra/nbs/2. Topic Modeling with NMF and SVD.ipynb at master · fastai/numerical-linear-algebra]
 +
 +
== 2023 ==
 +
=== 2023-11 ===
 +
 +
* 2023-11-12, 16:18:02: [https://github.com/d-kirsanov/fresheye/blob/master/Code.gs fresheye/Code.gs at master · d-kirsanov/fresheye]
 +
* 2023-11-11, 17:52:20: [https://github.com/bitbank2/TIFF_G4 bitbank2/TIFF_G4: A set of highly optimized functions for decoding and displaying 1-bpp CCITT G4 images]
 +
 +
=== 2023-10 ===
 +
 +
* 2023-10-19, 07:40:49: [https://www.researchgate.net/publication/267146475_Lectures_on_Sphere_Arrangements_-_the_Discrete_Geometric_Side (3) Lectures on Sphere Arrangements – the Discrete Geometric Side | Request PDF]
 +
* 2023-10-02, 23:59:09: [https://sproul.xyz/blog/posts/gurobi-academic-validation.html How to Partially Bypass Gurobi's Academic IP Validation - sproul.xyz]
 +
 +
=== 2023-09 ===
 +
 +
* 2023-09-17, 22:31:02: [https://www.hindawi.com/journals/scn/2020/4195852/ Efficient Privacy-Preserving Fingerprint-Based Authentication System Using Fully Homomorphic Encryption]
 +
* 2023-09-17, 22:30:48: [https://github.com/taeyun1010/HomFingerPrintAuth taeyun1010/HomFingerPrintAuth]
 +
 +
=== 2023-08 ===
 +
 +
* 2023-08-05, 16:03:43: [https://www.math.auckland.ac.nz/~sgal018/crypto-book/ch17.pdf ch17.pdf]
 +
* 2023-08-05, 16:03:30: [https://github.com/kelbyludwig?tab=followers kelbyludwig (Kelby Ludwig) / Followers]
 +
 +
=== 2023-06 ===
 +
 +
* 2023-06-06, 16:10:06: [https://github.com/Geometrein/dashmap.io Geometrein/dashmap.io: DashMap is an open source web platform that gathers, analyses and visualises urban data.]
 +
* 2023-06-06, 15:51:02: [https://github.com/nhabbash/transport-network-analysis/tree/master nhabbash/transport-network-analysis: Graph-based analysis of a city's public transportation network]
 +
* 2023-06-05, 05:58:48: [https://github.com/search?q=pyrosm+plotly+language%3APython&type=code Code search results · GitHub]
 +
* 2023-06-05, 05:58:34: [https://wiki.openstreetmap.org/wiki/PBF_Format PBF Format — OpenStreetMap Wiki]
 +
* 2023-06-05, 05:56:56: [https://github.com/winstonyym/urbanity/tree/db0fa19f0ced219b1bbf4daf146474c649d0d765 GitHub - winstonyym/urbanity at db0fa19f0ced219b1bbf4daf146474c649d0d765]
 +
 +
=== 2023-03 ===
 +
 +
* 2023-03-20, 11:52:55: [https://github.com/NVukobrat/CASIA-Iris-Recognition/tree/master/code CASIA-Iris-Recognition/code at master · NVukobrat/CASIA-Iris-Recognition]
 +
*: <html>          <span class="author flex-self-stretch" itemprop="author">      <a class="url fn" rel="author" data-hovercard-type="user" data-hovercard-url="/users/NVukobrat/hovercard" data-octo-click="hovercard-link-click" data-octo-dimensions="link_type:self" href="https://github.com/NVukobrat">        NVukobrat </a>    </span>    <span class="mx-1 flex-self-stretch color-fg-muted">/</span>    <strong itemprop="name" class="mr-2 flex-self-stretch">      <a data-pjax="#repo-content-pjax-container" data-turbo-frame="repo-content-turbo-frame" href="https://github.com/NVukobrat/CASIA-Iris-Recognition">CASIA-Iris-Recognition</a></strong></html>
 +
<!-- NEXT BOOKMARK -->
 +
* 2023-03-14, 22:56:49: [https://github.com/rogerorr/NtTrace rogerorr/NtTrace: An strace-like program for the Windows 'native' API]
 +
* 2023-03-14, 22:52:46: [https://docs.pyvista.org/examples/00-load/create-point-cloud.html Create Point Cloud — PyVista 0.38.4 documentation]
 +
* 2023-03-12, 22:38:15: [https://www.diva-portal.org/smash/get/diva2:532809/FULLTEXT01.pdf FULLTEXT01.pdf]
 +
* 2023-03-10, 03:47:08: [https://habr.com/ru/company/yandex_praktikum/blog/578910/ Создаём анимационные обучающие видео на Python с помощью Manim / Хабр]
 +
*: <html><div data-gallery-root="" class="tm-comment"><div class="tm-comment__body-content"><div xmlns="http://www.w3.org/1999/xhtml"><p>В After Effects, например, можно использовать JavaScript, и сделать тоже самое, но с большим комфортом</p></div></div> <!----> <!----></div> <div class="tm-comment-footer"><div class="tm-votes-meter tm-comment-footer__votes-meter"><svg height="24" width="24" class="tm-svg-img tm-votes-meter__icon tm-votes-meter__icon tm-votes-meter__icon_appearance-comment"><title>Комментарий пока не оценивали</title> <use xlink:href="https://habr.com/img/megazord-v28.2b11c25e..svg#counter-rating"></use></svg> <span title="Комментарий пока не оценивали" class="tm-votes-meter__value tm-votes-meter__value tm-votes-meter__value_appearance-comment tm-votes-meter__value_rating"></span></div></div></html>
 +
*: <html>Первый видео-курс по Python мне подкинул сосед, спец. по видео пост продакшн. Он его учил чтобы писать скрипты для <a href="https://ru.wikipedia.org/wiki/Houdini_(%D0%B3%D1%80%D0%B0%D1%84%D0%B8%D1%87%D0%B5%D1%81%D0%BA%D0%B0%D1%8F_%D0%BF%D1%80%D0%BE%D0%B3%D1%80%D0%B0%D0%BC%D0%BC%D0%B0)" rel="noopener noreferrer nofollow">Houdini</a>.</html>
 +
<!-- NEXT BOOKMARK -->
 +
* 2023-03-09, 19:39:38: [https://github.com/Xpitfire/symbolicai Xpitfire/symbolicai: Compositional Differentiable Programming Library]
 +
*: <html>pip install symbolicai</html>
 +
<!-- NEXT BOOKMARK -->
 +
* 2023-03-08, 23:08:15: [https://en.wikipedia.org/wiki/Christofides_algorithm Christofides algorithm - Wikipedia]
 +
*: <html>In July 2020 however, Karlin, Klein, and Gharan released a preprint in which they introduced a novel approximation algorithm and claimed that its approximation ratio is 1.5&nbsp;−&nbsp;10<sup>−36</sup>. Their method follows similar principles to Christofides' algorithm, but uses a randomly chosen tree from a carefully chosen random distribution in place of the minimum spanning tree.<sup id="cite_ref-5" class="reference"><a href="https://en.wikipedia.org/wiki/#cite_note-5">[5]</a></sup><sup id="cite_ref-6" class="reference"><a href="https://en.wikipedia.org/wiki/#cite_note-6">[6]</a></sup> The paper was published at <a href="https://en.wikipedia.org/wiki/Symposium_on_Theory_of_Computing" title="Symposium on Theory of Computing">STOC'21</a><sup id="cite_ref-7" class="reference"><a href="https://en.wikipedia.org/wiki/#cite_note-7">[7]</a></sup> where it received a best paper award.<sup id="cite_ref-8" class="reference"><a href="https://en.wikipedia.org/wiki/#cite_note-8">[8]</a></sup></html>
 +
<!-- NEXT BOOKMARK -->
 +
 +
== 2022 ==
 +
=== 2022-04 ===
 +
 +
* 2022-04-27, 22:04:58: [http://nicktitterton.com/SDPmaxcut.html Nick Titterton]
 +
*: <html>X = cvx.Variable((V, V), PSD=True) </html>
 +
 +
=== 2022-03 ===
 +
 +
* 2022-03-15, 10:41:48: [https://slideplayer.com/slide/6504827/ The Traveling Salesman Problem in Theory & Practice Lecture 11: Branch & Cut & Concorde 8 April 2014 David S. Johnson - ppt download]
 +
* 2022-03-15, 09:30:35: [https://github.com/jvkersch/pyconcorde GitHub - jvkersch/pyconcorde: Python wrapper around the Concorde TSP solver]
 +
* 2022-03-15, 09:30:26: [https://github.com/dmishin/tsp-solver GitHub - dmishin/tsp-solver: Travelling Salesman Problem solver in pure Python + some visualizers]
 +
* 2022-03-11, 03:25:24: [https://github.com/spacedeck/spacedeck-open GitHub - spacedeck/spacedeck-open: Spacedeck, a web based, real time, collaborative whiteboard application with rich media support]
 +
 
== 2021 ==
 
== 2021 ==
 +
 +
=== 2021-12 ===
 +
 +
* 2021-12-01, 05:20:51: [https://github.com/ccanonne/phdthesis/blob/master/introduction/sec-introduction.tex phdthesis/sec-introduction.tex at master · ccanonne/phdthesis · GitHub]
 +
 +
=== 2021-11 ===
 +
 +
* 2021-11-26, 19:23:23: [https://activecalculus.org/ Active Calculus Landing Page]
 +
* 2021-11-21, 11:53:11: [https://www.cis.upenn.edu/~plclub/blog/2020-10-09-hs-to-coq/ Tutorial: Verify Haskell Programs with hs-to-coq]
 +
* 2021-11-21, 03:05:00: [https://habr.com/ru/company/JetBrains-education/blog/589343/ Первый truly stateless оптимальный алгоритм модел-чекера и его проверка на Coq / Хабр]
 +
*: <html>Рынок труда и задачи сегодня — скорее академические. Да, есть компании, которые фигачат на коках-агдах что-то в прод (вроде во всяких боингах-BAE было что-то), но в чистом ресёрче больше шансов этим заниматься. Ну и плюс последнее время — блокчейн, там стараются применять формальные методы (например, чуваки из iohk систематически что-то доказывают на агде про свой блокчейн).</html>
 +
<!-- NEXT BOOKMARK -->
 +
* 2021-11-20, 22:02:20: [https://academy.yandex.ru/dataschool/book?from=habr Учебник. Машинное обучение и Data Science: погружение в тему]
 +
*: <html><div><section id="hero" class="lc-section lpc-section "><div class="lc-offsets lc-offsets_padding-top_none lc-offsets_padding-bottom_m"><div class="lc-text lc-text_align_left"><div class="lc-text lc-text_column_xl"><div class="lc-text-block lc-text-block_size_s52 lc-text-block_typeface_medium lc-text-block_font_text lc-text__title" style="color:rgba(0, 0, 0, 1)"><div class="lc-styled-text"><h1 class="lc-styled-text__text lc-styled-text__text_align_left">Машинное обучение и&nbsp;Data Science: погружение в&nbsp;тему</h1></div></div><div class="lc-text-block lc-text-block_size_s18 lc-text-block_typeface_light lc-text-block_font_text lc-text__text" style="color:rgba(0, 0, 0, 1)"><div class="lc-styled-text"><div class="lc-styled-text__text lc-styled-text__text_align_left"><span class="font-weight-500">Знания и опыт выпускников, преподавателей и&nbsp;друзей Школы анализа данных&nbsp;— в&nbsp;одном онлайн учебнике.</span> Погрузитесь в&nbsp;ML и&nbsp;узнайте, какие технологии меняют лицо современной науки и&nbsp;дают жизнь сервисам, которыми пользуются миллионы людей.</div></div></div></div></div></div></section></div><div><section id="hero-button" class="lc-section lpc-section "><div class="lc-offsets lc-offsets_padding-top_none lc-offsets_padding-bottom_none"><div class="lc-button-list lc-button-list_align_left"><div class="lc-button-list__container"><a class="Link link lc-link lc-button lc-button_theme_base lc-button_size_m lc-button_type_link lc-button-list__item" href="https://ml-handbook.ru/?from=habr" target="_blank" data-clickable="true" rel="noopener" data-log-node="0--100"><div class="lc-button__under"></div><span class="lc-button__text"><div class="lc-styled-text"><span class="lc-styled-text__text lc-styled-text__text_align_center"><span class="button-yellow">Перейти в&nbsp;учебник <svg class="footer__button-subscribe-svg" width="26" height="16" viewBox="0 0 26 16" fill="none" xmlns="http://www.w3.org/2000/svg">          </svg></span></span></div></span></a></div></div></div></section></div></html>
 +
<!-- NEXT BOOKMARK -->
 +
* 2021-11-10, 02:57:35: [https://www.youtube.com/channel/UC81Q2wnuk5KqOFVgAbq4nUw Lead Coding by FRAZ - YouTube]
 +
*: <html><yt-img-shadow id="avatar" width="80" class="style-scope ytd-c4-tabbed-header-renderer no-transition" style="background-color: transparent;" loaded=""><img id="img" class="style-scope yt-img-shadow" alt="" src="https://yt3.ggpht.com/C3s-9KNhCtkX9UAhIktZNAngThkd4MUmt3V3GXKDzDzGuIueIR0u3bRpNc-4cnyRRTTeh9AHgA=s88-c-k-c0x00ffffff-no-rj" width="80"></yt-img-shadow><ytd-channel-avatar-editor class="style-scope ytd-c4-tabbed-header-renderer" disable-upgrade="" hidden=""></ytd-channel-avatar-editor><div id="inner-header-container" class="style-scope ytd-c4-tabbed-header-renderer"><div id="meta" class="style-scope ytd-c4-tabbed-header-renderer"><ytd-channel-name id="channel-name" wrap-text="" class="style-scope ytd-c4-tabbed-header-renderer"><!--css-build:shady--><div id="container" class="style-scope ytd-channel-name">  <div id="text-container" class="style-scope ytd-channel-name">    <yt-formatted-string id="text" title="" class="style-scope ytd-channel-name">Lead Coding by FRAZ</yt-formatted-string></div></div></ytd-channel-name></div></div></html>
 +
<!-- NEXT BOOKMARK -->
 +
 +
=== 2021-10 ===
 +
 +
* 2021-10-12, 10:13:18: [https://www.openmined.org/ OpenMined]
 +
 +
=== 2021-09 ===
 +
 +
* 2021-09-23, 10:34:11: [https://habr.com/ru/post/579350/ Что же не так с ДЭГ в Москве? / Хабр]
 +
* 2021-09-02, 16:34:43: [https://xn----8sbfhdabdwf1afqu5baxe0f2d.xn--p1ai/office/contender/my/desc/87164 Личная карточка пользователя]
 +
 +
=== 2021-08 ===
 +
 +
* 2021-08-31, 14:25:23: [https://habr.com/ru/post/566920/ Алгебраические типы данных и Python / Хабр]
 +
 +
=== 2021-07 ===
 +
 +
* 2021-07-01, 16:12:00: [https://habr.com/ru/company/yandex/blog/263991/ Вероятностное программирование / Блог компании Яндекс / Хабр]
 +
*: <html><h1 class="post__title post__title_full"><span class="post__title-text">Вероятностное программирование</span>    </h1>        <ul class="post__hubs post__hubs_full-post inline-list">          <li class="inline-list__item inline-list__item_hub">            <a href="https://habr.com/ru/company/yandex/" class="inline-list__item-link hub-link " title="Вы не подписаны на этот хаб" onclick="if (typeof ga === 'function') { ga('send', 'event', 'hub', 'post page', 'Блог компании Яндекс'); }">Блог компании Яндекс</a>,            </li>          <li class="inline-list__item inline-list__item_hub">            <a href="https://habr.com/ru/hub/search_technologies/" class="inline-list__item-link hub-link " title="Вы не подписаны на этот хаб" onclick="if (typeof ga === 'function') { ga('send', 'event', 'hub', 'post page', 'Поисковые технологии'); }">Поисковые технологии</a>,            </li>          <li class="inline-list__item inline-list__item_hub">            <a href="https://habr.com/ru/hub/programming/" class="inline-list__item-link hub-link " title="Вы не подписаны на этот хаб" onclick="if (typeof ga === 'function') { ga('send', 'event', 'hub', 'post page', 'Программирование'); }">Программирование</a>,            </li>          <li class="inline-list__item inline-list__item_hub">            <a href="https://habr.com/ru/hub/maths/" class="inline-list__item-link hub-link " title="Вы не подписаны на этот хаб" onclick="if (typeof ga === 'function') { ga('send', 'event', 'hub', 'post page', 'Математика'); }">Математика</a>,            </li>          <li class="inline-list__item inline-list__item_hub">            <a href="https://habr.com/ru/hub/machine_learning/" class="inline-list__item-link hub-link " title="Вы не подписаны на этот хаб" onclick="if (typeof ga === 'function') { ga('send', 'event', 'hub', 'post page', 'Машинное обучение'); }">Машинное обучение</a>          </li>      </ul>      <ul class="post__marks inline-list"></ul>      <div class="post__body post__body_full">      <div class="post__text post__text-html post__text_v1" id="post-content-body">Вероятностное моделирование является одним из мощнейших инструментов для специалиста по анализу данных. К сожалению, для его использования необходимо не только уверенно владеть </div></div></html>
 +
<!-- NEXT BOOKMARK -->
 +
 +
=== 2021-06 ===
 +
 +
* 2021-06-29, 21:56:20: [http://ibmdecisionoptimization.github.io/docplex-doc/cp/samples.html Examples of constraint programming — DOcplex.CP: Constraint Programming Modeling for Python V2.20 documentation]
 +
* 2021-06-29, 21:55:42: [https://python-mip.readthedocs.io/en/latest/intro.html Introduction — Python-MIP documentation]
 +
* 2021-06-29, 21:55:20: [http://www.om-db.wi.tum.de/psplib/data.html Data sets]
 +
 +
=== 2021-05 ===
 +
 +
* 2021-05-30, 11:24:30: [https://www.facebook.com/ Facebook]
 +
*: <html>Аллен Дауни прямо радует - читается хорошо, без академической воды и понятно, с адекватными и ясными примерами практических задач. Последний раз все было так ясно и лаконично при перерешивании задач по терверу из советского учебника Вентцель и книги по байесовским методам Джона Крушке.  Покрутил, наверное, в 10 раз в голове теорему Байеса и, вообще, понятие вероятности, условной вероятности, совместной вероятности, априорного и апостериорного распределения, сопряженного приора, pdf, pmf, cdf с разных сторон (и в очередной раз так и не просек простую идею бета-распределения, но, верю, она же есть) - ну чтобы чуйка развилась еще больше. Я честно, от всего сердца и ума, делал несколько подходов к прикладной байесовской статистике с разных сторон и с разными инструментами, прочитал, наверно несколько книг (поняв в них далеко не все) и не помню уже как много статей, но постоянно преследовал вопрос - а зачем и как это мне поможет в повседневной практике? Основная цель, которую я преследовал и до сих пор преследую для себя - научиться понимать "небольшие" данные и причины, стоящие за ними глубже, чем позволяют популярные статистические методы и мало кем, на самом деле, глубоко понимаемые доверительные интервалы на хи-квадратах, погоняемых группами сТЬЮдентов</html>
 +
<!-- NEXT BOOKMARK -->
 +
 +
=== 2021-04 ===
 +
 +
* 2021-04-15, 06:40:47: [https://people.sc.fsu.edu/~jburkardt/datasets/knapsack_multiple/knapsack_multiple.html KNAPSACK_MULTIPLE - Data for the 01 Multiple Knapsack Problem]
 +
<!-- NEXT BOOKMARK -->
 +
* 2021-04-09, 06:30:07: [https://interview.cups.online/live-coding/?room=97803a89-5a70-4eee-9017-a2ebfd6dbc8b Code Editor]
 +
* 2021-04-06, 18:23:38: [https://colab.research.google.com/drive/1F_9BqVAXze6T9U7cj5BsrkyfzaoYnCc6?usp=sharing#scrollTo=CH-o_Xw5tQXm networkx pyvis.ipynb - Colaboratory]
 +
* 2021-04-03, 01:17:44: [https://github.com/Corvince/mesa-geo/blob/master/examples/GeoSIR/README.md mesa-geo/README.md at master · Corvince/mesa-geo]
 +
* 2021-04-02, 19:03:23: [https://habr.com/ru/post/543566/?utm_campaign=543566&utm_source=habrahabr&utm_medium=rss Семейный бюджет, Google sheets и Python / Хабр]
 +
*: <html><p>Localtunnel - <a href="https://localtunnel.github.io/www" rel="noopener noreferrer nofollow"><u>https://localtunnel.github.io/www</u></a></p><p>Teleconsole - <a href="https://www.teleconsole.com/" rel="noopener noreferrer nofollow"><u>https://www.teleconsole.com/</u></a>Pagekite - <a href="https://pagekite.net/" rel="noopener noreferrer nofollow"><u>https://pagekite.net/</u></a>&nbsp;</p></html>
 +
<!-- NEXT BOOKMARK -->
 +
* 2021-04-02, 05:24:20: [https://github.com/trobey/covid trobey/covid: A Coronovirus model in Python Mesa]
 +
* 2021-04-02, 05:11:20: [https://github.com/repast Repast]
 +
* 2021-04-02, 05:05:17: [https://dmnfarrell.github.io/bioinformatics/abm-mesa-python Bioinformatics and other bits - A simple agent based infection model with Mesa and Bokeh]
 +
* 2021-04-02, 04:50:44: [https://github.com/killerfridge/covid/blob/master/COVID%20Agent%20Based%20Model.ipynb covid/COVID Agent Based Model.ipynb at master · killerfridge/covid]
 +
 
=== 2021-03 ===
 
=== 2021-03 ===
  
 +
* 2021-03-22, 16:22:55: [https://www.cyberforum.ru/anylogic/thread1914252.html Литература по AnyLogic - AnyLogic - Киберфорум]
 +
* 2021-03-19, 01:16:41: [https://github.com/arty-name/livejournal-export/blob/master/download_comments.py livejournal-export/download_comments.py at master · arty-name/livejournal-export · GitHub]
 +
* 2021-03-18, 08:51:01: [https://vitus-wagner.dreamwidth.org/2236410.html vitus_wagner | Криптапокалипсис сегодня]
 +
*: <html>Schneier on Security: "No, RSA Is Not Broken"<br><br><a href="https://www.schneier.com/blog/archives/2021/03/no-rsa-is-not-broken.html">https://www.schneier.com/blog/archives/2021/03/no-rsa-is-not-broken.html</a><br><br>Вобщем, реакция общества скептическая пока </html>
 +
<!-- NEXT BOOKMARK -->
 +
* 2021-03-10, 01:54:19: [https://www.noahlab.com.hk/logistics-ranking/#/ranking EMO 2021 Competition-3LVRP]
 +
* 2021-03-04, 02:46:51: [https://www.ics.uci.edu/~irani/s18_cs262/HW/ Index of /~irani/s18_cs262/HW]
 
* 2021-03-04, 01:40:09: [https://www.cl.cam.ac.uk/teaching/0910/L15/solution1.pdf solution1.pdf]
 
* 2021-03-04, 01:40:09: [https://www.cl.cam.ac.uk/teaching/0910/L15/solution1.pdf solution1.pdf]
 
* 2021-03-01, 11:41:58: [https://www.researchgate.net/publication/336370288_Solving_the_Quadratic_Assignment_Problem_using_the_Swallow_Swarm_Optimization_Problem/references (13) (PDF) Solving the Quadratic Assignment Problem using the Swallow Swarm Optimization Problem]
 
* 2021-03-01, 11:41:58: [https://www.researchgate.net/publication/336370288_Solving_the_Quadratic_Assignment_Problem_using_the_Swallow_Swarm_Optimization_Problem/references (13) (PDF) Solving the Quadratic Assignment Problem using the Swallow Swarm Optimization Problem]
Строка 103: Строка 317:
 
*: <html>Исследователи смогли преодолеть барьер в улучшении решения задачи коммивояжера</html>
 
*: <html>Исследователи смогли преодолеть барьер в улучшении решения задачи коммивояжера</html>
 
<!-- NEXT BOOKMARK -->
 
<!-- NEXT BOOKMARK -->
* 2020-10-04, 14:13:10: [https://www.spoj.com/problems/tag/graph-theory Sphere Online Judge (SPOJ)]
+
* 2020-10-04, 14:13:10: [[[spoj/tag]]graph-theory Sphere Online Judge (SPOJ)]
  
 
=== 2020-09 ===
 
=== 2020-09 ===

Текущая версия на 16:34, 28 марта 2024

2024

2024-03

2024-02

2024-01

2023

2023-11

2023-10

2023-09

2023-08

2023-06

2023-03

2022

2022-04

  • 2022-04-27, 22:04:58: Nick Titterton
    X = cvx.Variable((V, V), PSD=True)

2022-03

2021

2021-12

2021-11

2021-10

2021-09

2021-08

2021-07

2021-06

2021-05

  • 2021-05-30, 11:24:30: Facebook
    Аллен Дауни прямо радует - читается хорошо, без академической воды и понятно, с адекватными и ясными примерами практических задач. Последний раз все было так ясно и лаконично при перерешивании задач по терверу из советского учебника Вентцель и книги по байесовским методам Джона Крушке. Покрутил, наверное, в 10 раз в голове теорему Байеса и, вообще, понятие вероятности, условной вероятности, совместной вероятности, априорного и апостериорного распределения, сопряженного приора, pdf, pmf, cdf с разных сторон (и в очередной раз так и не просек простую идею бета-распределения, но, верю, она же есть) - ну чтобы чуйка развилась еще больше. Я честно, от всего сердца и ума, делал несколько подходов к прикладной байесовской статистике с разных сторон и с разными инструментами, прочитал, наверно несколько книг (поняв в них далеко не все) и не помню уже как много статей, но постоянно преследовал вопрос - а зачем и как это мне поможет в повседневной практике? Основная цель, которую я преследовал и до сих пор преследую для себя - научиться понимать "небольшие" данные и причины, стоящие за ними глубже, чем позволяют популярные статистические методы и мало кем, на самом деле, глубоко понимаемые доверительные интервалы на хи-квадратах, погоняемых группами сТЬЮдентов

2021-04

2021-03

2021-02

2021-01

2020

2020-12

2020-11

2020-10

2020-09

2020-08

2020-07