<?xml version="1.0" encoding="UTF-8" ?>
<rss version="2.0">
    <channel>
      <title>Yòmá&#039;s Notes</title>
      <link>https://yoma.kr</link>
      <description>Last 10 notes on Yòmá&#039;s Notes</description>
      <generator>Quartz -- quartz.jzhao.xyz</generator>
      <item>
    <title>README</title>
    <link>https://yoma.kr/README</link>
    <guid>https://yoma.kr/README</guid>
    <description><![CDATA[ Resume tectonic some.tex . ]]></description>
    <pubDate>Sat, 01 Aug 2026 10:30:30 GMT</pubDate>
  </item><item>
    <title>event loop</title>
    <link>https://yoma.kr/Computer-Science/5-Software-Development/Programming-Language/JavaScript/event-loop</link>
    <guid>https://yoma.kr/Computer-Science/5-Software-Development/Programming-Language/JavaScript/event-loop</guid>
    <description><![CDATA[  callstack → micro task queue → task queue 순으로 우선순위 상위 우선 순위가 비어야 실행된다 micro task queue promise async QueuemicroTask MutationObserver task queue (Web APIs) fetch timers console geolocation web storage file performance html dom url . ]]></description>
    <pubDate>Fri, 22 May 2026 00:00:00 GMT</pubDate>
  </item><item>
    <title>About</title>
    <link>https://yoma.kr/About</link>
    <guid>https://yoma.kr/About</guid>
    <description><![CDATA[  YongMan “Yòmá” Kim Specialized in Philosophy(Mind, Analytical) Interested in AGI, Big-Data, Game, Optimization, … Colemak user on a minimalist 34-key Sweep split keyboard A lifelong learner and Zettelkasten enthusiast, working in harmony with Obsidian Reach Me codeyoma@gmail.com Log Blog Github PS ... ]]></description>
    <pubDate>Mon, 18 May 2026 00:00:00 GMT</pubDate>
  </item><item>
    <title>game engine</title>
    <link>https://yoma.kr/Computer-Science/7-Applications-Development/Game/game-engine</link>
    <guid>https://yoma.kr/Computer-Science/7-Applications-Development/Game/game-engine</guid>
    <description><![CDATA[  unity godot game maker love2d ren’py . ]]></description>
    <pubDate>Tue, 31 Mar 2026 00:00:00 GMT</pubDate>
  </item><item>
    <title>ai writing</title>
    <link>https://yoma.kr/Computer-Science/99-MISC/Prompt/ai-writing</link>
    <guid>https://yoma.kr/Computer-Science/99-MISC/Prompt/ai-writing</guid>
    <description><![CDATA[ AI Writing Tropes to Avoid Add this file to your AI assistant’s system prompt or context to help it avoid common AI writing patterns. ]]></description>
    <pubDate>Wed, 11 Mar 2026 00:00:00 GMT</pubDate>
  </item><item>
    <title>거대 언어 모델과 언어 철학</title>
    <link>https://yoma.kr/Philosophy/%EA%B1%B0%EB%8C%80-%EC%96%B8%EC%96%B4-%EB%AA%A8%EB%8D%B8%EA%B3%BC-%EC%96%B8%EC%96%B4-%EC%B2%A0%ED%95%99</link>
    <guid>https://yoma.kr/Philosophy/%EA%B1%B0%EB%8C%80-%EC%96%B8%EC%96%B4-%EB%AA%A8%EB%8D%B8%EA%B3%BC-%EC%96%B8%EC%96%B4-%EC%B2%A0%ED%95%99</guid>
    <description><![CDATA[ Copyright © 2023 by YongMan Kim &lt; codeyoma@gmail.com &gt; First published Thu Nov 18, 2023 논문 개요 ppt 거대 언어 모델과 언어 철학 - 비트겐슈타인의 언어 철학과의 유사성을 바탕으로 본 논문은 비트겐슈타인의 언어 철학을 바탕으로 현대 인공지능 원리와의 유사점을 찾으려는 시도를 한다. ]]></description>
    <pubDate>Sat, 28 Feb 2026 00:00:00 GMT</pubDate>
  </item><item>
    <title>Util Site</title>
    <link>https://yoma.kr/Computer-Science/7-Applications-Development/Util-Site</link>
    <guid>https://yoma.kr/Computer-Science/7-Applications-Development/Util-Site</guid>
    <description><![CDATA[ CSS GitHub - radix-ui/primitives: Radix Primitives is an open-source UI component library for building high-quality, accessible design systems and web apps. ]]></description>
    <pubDate>Mon, 23 Feb 2026 00:00:00 GMT</pubDate>
  </item><item>
    <title>Knuth–Morris–Pratt Algorithm</title>
    <link>https://yoma.kr/Computer-Science/1-Foundations--and--Theory/Algorithms/Named-Algorithms/Knuth%E2%80%93Morris%E2%80%93Pratt-Algorithm</link>
    <guid>https://yoma.kr/Computer-Science/1-Foundations--and--Theory/Algorithms/Named-Algorithms/Knuth%E2%80%93Morris%E2%80%93Pratt-Algorithm</guid>
    <description><![CDATA[  일반적인 bruteforce 패턴 판별 O(N * M) KMP는 접두사, 접미사로 문자열 일치 판별 O(N+M) Two Pointers 기법 j 접두사 인덱스 i 위치의 값과 일치하면 +1하고, 그 값을 테이블에 저장 불일치시 마지막 일치 순간으로 j 이동 i 접미사 인덱스 한칸씩 이동하면서 일치 판별 table 매칭 실패했을 때 어디까지 pattern index를 돌아갈지 정보가 담긴 배열 이전 일치지점에서 시작 0이라면 처음부터 다시 매칭 값이 있다는건 그 값까지 이미 일치함을 보장 vector&lt;int&gt; make_t... ]]></description>
    <pubDate>Thu, 19 Feb 2026 00:00:00 GMT</pubDate>
  </item><item>
    <title>Util site</title>
    <link>https://yoma.kr/Computer-Science/99-MISC/Util-site</link>
    <guid>https://yoma.kr/Computer-Science/99-MISC/Util-site</guid>
    <description><![CDATA[ 그림 ComfyUI | Generate video, images, 3D, audio with AI pixai.art/en 미드저니 디퓨전 나노바나나 모델 secretsauce3d 사운드 lami soundraw boomy Producer.ai Elevenlabs . ]]></description>
    <pubDate>Thu, 19 Feb 2026 00:00:00 GMT</pubDate>
  </item><item>
    <title>Combination</title>
    <link>https://yoma.kr/Computer-Science/1-Foundations--and--Theory/Algorithms/Combination</link>
    <guid>https://yoma.kr/Computer-Science/1-Foundations--and--Theory/Algorithms/Combination</guid>
    <description><![CDATA[  조합 \frac{n!}{r!(n-r)!} for → 다음 index와 원소의 순서보다, 존재가 중요 {1, 2}와 {2, 1}은 같다 타겟 조합 사이즈 재귀 함수 depth (for문은 항상 depth부터) 재귀 호출시 depth + 1 prev_permutation int n = 4; // 전체 개수 int r = 2; // 조합 개수 vector&lt;bool&gt; v(n); fill(v.begin(), v.begin() + r, true); // 처음 r개를 true로 설정 cout &lt;&lt; endl; do { fo... ]]></description>
    <pubDate>Thu, 05 Feb 2026 00:00:00 GMT</pubDate>
  </item>
    </channel>
  </rss>