-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathindex.html
2 lines (2 loc) · 47.3 KB
/
index.html
1
2
<!DOCTYPE html><html lang="en" data-theme="light"><head><meta charset="UTF-8"><meta http-equiv="X-UA-Compatible" content="IE=edge"><meta name="viewport" content="width=device-width,initial-scale=1,viewport-fit=cover"><title>tinsir888s hjemmeside - Some notes/articles and so on...</title><meta name="author" content="tinsir888"><meta name="copyright" content="tinsir888"><meta name="format-detection" content="telephone=no"><meta name="theme-color" content="#ffffff"><meta name="description" content="This site is under construction. Diese Seite befindet sich im Aufbau."><link rel="shortcut icon" href="/img/favicon.png"><link rel="canonical" href="https://tinsir888.github.io/index.html"><link rel="preconnect" href="//cdn.jsdelivr.net"><link rel="preconnect" href="//busuanzi.ibruce.info"><link rel="stylesheet" href="/css/index.css"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/@fortawesome/fontawesome-free/css/all.min.css"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/@fancyapps/ui/dist/fancybox/fancybox.min.css" media="print" onload='this.media="all"'><script>const GLOBAL_CONFIG={root:"/",algolia:void 0,localSearch:{path:"/search.xml",preload:!0,top_n_per_article:1,unescape:!1,languages:{hits_empty:"We didn't find any results for the search: ${query}",hits_stats:"${hits} results found"}},translate:void 0,noticeOutdate:void 0,highlight:{plugin:"highlight.js",highlightCopy:!0,highlightLang:!0,highlightHeightLimit:!1},copy:{success:"Copy Successful",error:"Copy Error",noSupport:"Browser Not Supported"},relativeDate:{homepage:!1,post:!1},runtime:"",dateSuffix:{just:"Just now",min:"minutes ago",hour:"hours ago",day:"days ago",month:"months ago"},copyright:void 0,lightbox:"fancybox",Snackbar:void 0,infinitegrid:{js:"https://cdn.jsdelivr.net/npm/@egjs/infinitegrid/dist/infinitegrid.min.js",buttonText:"Load More"},isPhotoFigcaption:!1,islazyload:!1,isAnchor:!1,percent:{toc:!0,rightside:!1},autoDarkmode:!1}</script><script id="config-diff">var GLOBAL_CONFIG_SITE={title:"tinsir888s hjemmeside",isPost:!1,isHome:!0,isHighlightShrink:!0,isToc:!1,postUpdate:"2025-01-12 17:42:52"}</script><script>(e=>{e.saveToLocal={set:(e,t,o)=>{if(0===o)return;const a={value:t,expiry:Date.now()+864e5*o};localStorage.setItem(e,JSON.stringify(a))},get:e=>{const t=localStorage.getItem(e);if(!t)return;const o=JSON.parse(t);if(!(Date.now()>o.expiry))return o.value;localStorage.removeItem(e)}},e.getScript=(e,t={})=>new Promise((o,a)=>{const n=document.createElement("script");n.src=e,n.async=!0,n.onerror=a,n.onload=n.onreadystatechange=function(){const e=this.readyState;e&&"loaded"!==e&&"complete"!==e||(n.onload=n.onreadystatechange=null,o())},Object.keys(t).forEach(e=>{n.setAttribute(e,t[e])}),document.head.appendChild(n)}),e.getCSS=(e,t=!1)=>new Promise((o,a)=>{const n=document.createElement("link");n.rel="stylesheet",n.href=e,t&&(n.id=t),n.onerror=a,n.onload=n.onreadystatechange=function(){const e=this.readyState;e&&"loaded"!==e&&"complete"!==e||(n.onload=n.onreadystatechange=null,o())},document.head.appendChild(n)}),e.activateDarkMode=()=>{document.documentElement.setAttribute("data-theme","dark"),null!==document.querySelector('meta[name="theme-color"]')&&document.querySelector('meta[name="theme-color"]').setAttribute("content","#0d0d0d")},e.activateLightMode=()=>{document.documentElement.setAttribute("data-theme","light"),null!==document.querySelector('meta[name="theme-color"]')&&document.querySelector('meta[name="theme-color"]').setAttribute("content","#ffffff")};const t=saveToLocal.get("theme");"dark"===t?activateDarkMode():"light"===t&&activateLightMode();const o=saveToLocal.get("aside-status");void 0!==o&&("hide"===o?document.documentElement.classList.add("hide-aside"):document.documentElement.classList.remove("hide-aside"));/iPad|iPhone|iPod|Macintosh/.test(navigator.userAgent)&&document.documentElement.classList.add("apple")})(window)</script><meta name="generator" content="Hexo 6.3.0"><link rel="alternate" href="/atom.xml" title="tinsir888s hjemmeside" type="application/atom+xml">
</head><body><div id="web_bg"></div><div id="sidebar"><div id="menu-mask"></div><div id="sidebar-menus"><div class="avatar-img is-center"><img src="/img/favicon.png" onerror='onerror=null,src="/img/friend_404.gif"' alt="avatar"></div><div class="sidebar-site-data site-data is-center"><a href="/archives/"><div class="headline">Articles</div><div class="length-num">305</div></a><a href="/tags/"><div class="headline">Tags</div><div class="length-num">74</div></a><a href="/categories/"><div class="headline">Categories</div><div class="length-num">32</div></a></div><hr class="custom-hr"><div class="menus_items"><div class="menus_item"><a class="site-page" href="/"><i class="fa-fw fas fa-home"></i><span> 首页</span></a></div><div class="menus_item"><a class="site-page" href="/archives/"><i class="fa-fw fas fa-archive"></i><span> 时间轴</span></a></div><div class="menus_item"><a class="site-page" href="/tags/"><i class="fa-fw fas fa-tags"></i><span> 标签</span></a></div><div class="menus_item"><a class="site-page" href="/categories/"><i class="fa-fw fas fa-folder-open"></i><span> 分类</span></a></div><div class="menus_item"><a class="site-page" href="/link/"><i class="fa-fw fas fa-link"></i><span> 友链</span></a></div><div class="menus_item"><a class="site-page group" href="javascript:void(0);" rel="external nofollow noreferrer"><i class="fa-fw fa-regular fa-handshake"></i><span> 接力</span><i class="fas fa-chevron-down"></i></a><ul class="menus_item_child"><li><a class="site-page child" target="_blank" rel="noopener external nofollow noreferrer" href="https://www.travellings.cn/go.html"><i class="fa-fw fas fa-subway"></i><span> 开往</span></a></li><li><a class="site-page child" target="_blank" rel="noopener external nofollow noreferrer" href="https://travel.moe/go?travel=on"><i class="fa-fw fas fa-rocket"></i><span> 异次元</span></a></li></ul></div><div class="menus_item"><a class="site-page" href="/about/"><i class="fa-fw fas fa-heart"></i><span> 关于</span></a></div></div></div></div><div class="page" id="body-wrap"><header class="full_page" id="page-header" style="background-image:url(/img/doorobear1.jpg)"><nav id="nav"><span id="blog-info"><a href="/" title="tinsir888s hjemmeside"><span class="site-name">tinsir888s hjemmeside</span></a></span><div id="menus"><div id="search-button"><a class="site-page social-icon search" href="javascript:void(0);" rel="external nofollow noreferrer"><i class="fas fa-search fa-fw"></i><span> Search</span></a></div><div class="menus_items"><div class="menus_item"><a class="site-page" href="/"><i class="fa-fw fas fa-home"></i><span> 首页</span></a></div><div class="menus_item"><a class="site-page" href="/archives/"><i class="fa-fw fas fa-archive"></i><span> 时间轴</span></a></div><div class="menus_item"><a class="site-page" href="/tags/"><i class="fa-fw fas fa-tags"></i><span> 标签</span></a></div><div class="menus_item"><a class="site-page" href="/categories/"><i class="fa-fw fas fa-folder-open"></i><span> 分类</span></a></div><div class="menus_item"><a class="site-page" href="/link/"><i class="fa-fw fas fa-link"></i><span> 友链</span></a></div><div class="menus_item"><a class="site-page group" href="javascript:void(0);" rel="external nofollow noreferrer"><i class="fa-fw fa-regular fa-handshake"></i><span> 接力</span><i class="fas fa-chevron-down"></i></a><ul class="menus_item_child"><li><a class="site-page child" target="_blank" rel="noopener external nofollow noreferrer" href="https://www.travellings.cn/go.html"><i class="fa-fw fas fa-subway"></i><span> 开往</span></a></li><li><a class="site-page child" target="_blank" rel="noopener external nofollow noreferrer" href="https://travel.moe/go?travel=on"><i class="fa-fw fas fa-rocket"></i><span> 异次元</span></a></li></ul></div><div class="menus_item"><a class="site-page" href="/about/"><i class="fa-fw fas fa-heart"></i><span> 关于</span></a></div></div><div id="toggle-menu"><a class="site-page" href="javascript:void(0);" rel="external nofollow noreferrer"><i class="fas fa-bars fa-fw"></i></a></div></div></nav><div id="site-info"><h1 id="site-title">tinsir888s hjemmeside</h1><div id="site-subtitle"><span id="subtitle"></span></div><div id="site_social_icons"><a class="social-icon" href="https://github.com/tinsir888" rel="external nofollow noreferrer" target="_blank" title="Github"><i class="fab fa-github"></i></a><a class="social-icon" href="mailto:smalltalk.odin@protonmail.com" rel="external nofollow noreferrer" target="_blank" title="Email"><i class="fas fa-envelope"></i></a><a class="social-icon" href="/atom.xml" target="_blank" title="RSS"><i class="fas fa-rss"></i></a></div></div><div id="scroll-down"><i class="fas fa-angle-down scroll-down-effects"></i></div></header><main class="layout" id="content-inner"><div class="recent-posts" id="recent-posts"><div class="recent-post-item"><div class="post_cover left"><a href="/posts/d81e7e66.html" title="丹麦皇冠——学生工体验（更新中）"><img class="post-bg" src="/img/doorobear2.jpg" onerror='this.onerror=null,this.src="/img/404.jpg"' alt="丹麦皇冠——学生工体验（更新中）"></a></div><div class="recent-post-info"><a class="article-title" href="/posts/d81e7e66.html" title="丹麦皇冠——学生工体验（更新中）"><i class="fas fa-thumbtack sticky"></i>丹麦皇冠——学生工体验（更新中）</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">Created</span><time datetime="2024-11-27T23:00:00.000Z" title="Created 2024-11-28 00:00:00">2024-11-28</time></span><span class="article-meta"><span class="article-meta-separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E5%B7%A5%E4%BD%9C/">工作</a></span></div><div class="content">从 2024 年 5 月到 2025 年 5 月，我在丹麦皇冠 (Danish Crown) 兰讷斯 (Randers) 总部的 Global IT 数据科学小组度过了一段充满成长与趣味的学生工时光。这份工作是如何得来的？详情可见 这篇博文。而本文，我想聊聊那些琐碎却生动的片段，它们拼凑出属于这一年的独特记忆。 初入丹麦皇冠 从奥胡斯搭乘 118 路公交车，一个小时的旅程就将我带到丹麦皇冠位于兰讷斯郊区的总部。这里没有城市的喧嚣，只有大片草坪与蓝天交织成画。远远望去，三栋建筑安静地伫立在广阔的绿野中，仿佛与自然融为一体。初夏的阳光透过窗子洒进办公室，办公桌上的笔记本与屏幕在光影间相映成趣，而窗外，树影婆娑，像是一幅宁静的风景画。 初到公司的那一天，我在前台完成了拍照与入职手续。小组领导弗朗西斯亲自迎接我。他是个来自西班牙的小个子壮汉，阳光而热情，据我推测，或许是加泰罗尼亚人。接下来的安排显得体贴又随意：他带我去了早餐室，边享用美食边与团队其他成员熟络起来。 早餐室里，敏捷开发的第一次站会随即展开。我所在的小组堪称国际化：有波兰的菲利普，乌克兰的伊戈尔，还有丹麦的克里斯蒂安。他们个 ...</div></div></div><div class="recent-post-item"><div class="recent-post-info no-cover"><a class="article-title" href="/posts/fc8a9ea4.html" title="23 Fall CS/AI 留学申请记录（已完结）"><i class="fas fa-thumbtack sticky"></i>23 Fall CS/AI 留学申请记录（已完结）</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">Created</span><time datetime="2022-11-21T23:00:00.000Z" title="Created 2022-11-22 00:00:00">2022-11-22</time></span><span class="article-meta"><span class="article-meta-separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E7%95%99%E5%AD%A6%E7%94%B3%E8%AF%B7/">留学申请</a></span></div><div class="content">大一大二还有比较多「继续在国内保研/考研」的想法😢。我下定决心要出国的时候，已经是大三了。这有点晚了。 留学国家选择 比起英美加港新，我选择了小众一点的 🇩🇪 🇦🇹 和北欧（ 🇸🇪、🇫🇮 和 🇩🇰，🇳🇴 的学校只能 gap，不考虑）。 显然，是想躺平的（如果以后能留）。按现在的行情，想多赚马内，只有去米国。 个人情况 均分：中等水平 外语水平：雅思成绩只能说刚好够申请，具体说出来挺丢人 科研：无 实习：一段，在华为 ICT 计算产品线实习，具体搞的是 CV 项目经历：严格来说没有，只能用课程大作业（比如编译原理大作业啥的）嗯编 竞赛：ACM-ICPC 两块铜牌（不过感觉这玩意对申请没太大帮助） 总的来说，个人情况并不出彩。 语言 德语从大二开始断断续续的学着，学得很不好。因此不管申请哪个国家都只有申请英授。 英语大二的时候简单学了一下雅思。当时也是一波三折的，第一次暑假在家那边约了机考，结果我迟到了；第二次约南开大学八里台校区纸笔考，结果被取消；第三次就是 2022 年 1 月份，我 1 月 7 日回家，结果天津疫情突然爆发。被拉去隔离 14 ...</div></div></div><div class="recent-post-item"><div class="post_cover left"><a href="/posts/78cb6bc4.html" title="针对硕士申请的留德人员审核（Akademische Prüfstelle）全过程记录"><img class="post-bg" src="/img/aps.png" onerror='this.onerror=null,this.src="/img/404.jpg"' alt="针对硕士申请的留德人员审核（Akademische Prüfstelle）全过程记录"></a></div><div class="recent-post-info"><a class="article-title" href="/posts/78cb6bc4.html" title="针对硕士申请的留德人员审核（Akademische Prüfstelle）全过程记录"><i class="fas fa-thumbtack sticky"></i>针对硕士申请的留德人员审核（Akademische Prüfstelle）全过程记录</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">Created</span><time datetime="2022-10-15T22:00:00.000Z" title="Created 2022-10-16 00:00:00">2022-10-16</time></span><span class="article-meta"><span class="article-meta-separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E7%95%99%E5%AD%A6%E7%94%B3%E8%AF%B7/">留学申请</a></span></div><div class="content">参加 留德人员审核（德语：Akademische Prüfstelle，简称：APS）的流水账。 需要 APS 审核的国家：🇩🇪 🇦🇹 🇧🇪 提交材料 首先是准备材料。 材料清单 以 官网最新的文件 为准，作为高校在读生，我需要提交： 在线注册证明（贴证件照、签名） 审核费用（2500元）的汇款单复印件 身份证正反两面复印件 护照复印件（非必须） 小学毕业证复印件 初中毕业证复印件 高中毕业证翻译公证件 大学录取花名册中英双语公证件 在读证明中英双语密封件 在读成绩单中英双语密封件 语言水平证明（雅思、托福、德福等） 好事多磨 以前的毕业证和身份证件 最好在第六学期的暑假结束就准备好这些东西。 高中毕业证要！翻！译！和！公！证！ 成绩单和在读证明的密封 因为按 审核部要求，申请硕士需要拥有完整的六学期本科成绩单。我第六学期有一门课（感知技术与应用）的考试被延到第七学期开学，因此需返校参加考试并尽快打印中英双语成绩单和中英双语在读证明（打印地点：津南校区业务西楼自助打印厅，每人每学期可免费打印五份）。使用品牌文化店里卖的小信封密封即可。 密封盖章地点：津南校区 ...</div></div></div><div class="recent-post-item"><div class="post_cover right"><a href="/posts/9415313b.html" title="算法和计算复杂度 17 LLL Algorithm"><img class="post-bg" src="/img/AUtacc.jpg" onerror='this.onerror=null,this.src="/img/404.jpg"' alt="算法和计算复杂度 17 LLL Algorithm"></a></div><div class="recent-post-info"><a class="article-title" href="/posts/9415313b.html" title="算法和计算复杂度 17 LLL Algorithm">算法和计算复杂度 17 LLL Algorithm</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">Created</span><time datetime="2024-12-10T23:00:00.000Z" title="Created 2024-12-11 00:00:00">2024-12-11</time></span><span class="article-meta"><span class="article-meta-separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/AUDatalogi/">AUDatalogi</a><i class="fas fa-angle-right article-meta-link"></i><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/AUDatalogi/%E7%AE%97%E6%B3%95%E5%92%8C%E8%AE%A1%E7%AE%97%E5%A4%8D%E6%9D%82%E5%BA%A6/">算法和计算复杂度</a></span></div><div class="content">这课终于上完了。上得真挺难受😭 Lecture notes by Rothvoss, University of Washington Lattices Lattices are integral combinations of linearly independent vectors: {∑i=1kλibi∣λ1,⋯ ,λk∈Z}\left\{\sum_{i=1}^k\lambda_i\mathbf b_i\vert\lambda_1,\cdots,\lambda_k\in\Z\right\} {i=1∑kλibi∣λ1,⋯,λk∈Z} where b1,⋯ ,bk∈Rn\mathbf b_1,\cdots,\mathbf b_k\in\R^nb1,⋯,bk∈Rn are linearly independent vectors. Another equivalent definition: a lattice is a discrete subgroup of Rn\R^nRn. If k=nk=nk=n the lattice has full rank. Wi ...</div></div></div><div class="recent-post-item"><div class="post_cover left"><a href="/posts/d70a04e3.html" title="丹麦语 DU 3.3 14 Bliv klar til 3.3-testen"><img class="post-bg" src="/img/dansk-du33.jpg" onerror='this.onerror=null,this.src="/img/404.jpg"' alt="丹麦语 DU 3.3 14 Bliv klar til 3.3-testen"></a></div><div class="recent-post-info"><a class="article-title" href="/posts/d70a04e3.html" title="丹麦语 DU 3.3 14 Bliv klar til 3.3-testen">丹麦语 DU 3.3 14 Bliv klar til 3.3-testen</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">Created</span><time datetime="2024-12-07T11:36:00.000Z" title="Created 2024-12-07 12:36:00">2024-12-07</time></span><span class="article-meta"><span class="article-meta-separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E8%AF%AD%E8%A8%80%E5%AD%A6%E4%B9%A0/">语言学习</a><i class="fas fa-angle-right article-meta-link"></i><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E8%AF%AD%E8%A8%80%E5%AD%A6%E4%B9%A0/%E4%B8%B9%E9%BA%A6%E8%AF%AD%E5%AD%A6%E4%B9%A0%E7%AC%94%E8%AE%B0/">丹麦语学习笔记</a></span></div><div class="content">3.3 模块考试只包含阅读和写作 考完模块三之后，暂停一学期。看之后的安排，如果继续在丹麦，就继续学模块四、五，争取考过 Prøve i Dansk 3。 写作部分 Skrivning 要写两篇短文 应用文写作 二选一：求职信 Jobansøgning 或者 Opslag 启事 Jobansøgning 写清楚 Hvem du er Hvad du har arbejdet med før Hvorfor du søger jobbet Opslag 写清楚 det, du vil sælge, efterlyse eller købe det, du ønsker eller kan tilbyde eller det, du vil informere om 注意形容词词尾变化 邮件写作 30 分钟，至少 90 词 看清楚要求，使用恰当得体的语气 阅读部分 Læsning 一共 4 个 opgaver 信息搜索题 5 分钟 先看问题，看清楚疑问词，再快速从图表中搜索答案 使用短回答 KORT SVAR 句子匹配题 给出一篇段文章，将一些句子挖空，从候选句子中 ...</div></div></div><div class="recent-post-item"><div class="post_cover right"><a href="/posts/c6a52f83.html" title="丹麦语 DU 3.3 13 Smalltalk i hverdags- og arbejdsliv"><img class="post-bg" src="/img/dansk-du33.jpg" onerror='this.onerror=null,this.src="/img/404.jpg"' alt="丹麦语 DU 3.3 13 Smalltalk i hverdags- og arbejdsliv"></a></div><div class="recent-post-info"><a class="article-title" href="/posts/c6a52f83.html" title="丹麦语 DU 3.3 13 Smalltalk i hverdags- og arbejdsliv">丹麦语 DU 3.3 13 Smalltalk i hverdags- og arbejdsliv</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">Created</span><time datetime="2024-11-26T16:34:23.000Z" title="Created 2024-11-26 17:34:23">2024-11-26</time></span><span class="article-meta"><span class="article-meta-separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E8%AF%AD%E8%A8%80%E5%AD%A6%E4%B9%A0/">语言学习</a><i class="fas fa-angle-right article-meta-link"></i><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E8%AF%AD%E8%A8%80%E5%AD%A6%E4%B9%A0/%E4%B8%B9%E9%BA%A6%E8%AF%AD%E5%AD%A6%E4%B9%A0%E7%AC%94%E8%AE%B0/">丹麦语学习笔记</a></span></div><div class="content">Smalltalk i hverdagen smalltalk eller på dansk småsnak 闲聊 banal -t, -e | -ere, -est 平凡的，平庸的，简单的 overfladisk -, -e 表面的，浅层的 begivenhed -en, -er, -erne 事件 Smalltalk med fremmede Mange mennesker har svært ved at finde på, hvad de skal sige til mennesker, de møder for første gang. Udlændinge siger tit, at danskerne ikke er lette at komme i kontakt med, og at de ikke præsenterer dem, de kender, for hinanden. De oplever tit at stå helt alene til en fest, uden nogen taler til dem. I Danmark forventes ...</div></div></div><div class="recent-post-item"><div class="post_cover left"><a href="/posts/198e9682.html" title="Fair AI/ML 7 The Existence of Core for Max Distance Loss"><img class="post-bg" src="/img/AUFairAI.jpg" onerror='this.onerror=null,this.src="/img/404.jpg"' alt="Fair AI/ML 7 The Existence of Core for Max Distance Loss"></a></div><div class="recent-post-info"><a class="article-title" href="/posts/198e9682.html" title="Fair AI/ML 7 The Existence of Core for Max Distance Loss">Fair AI/ML 7 The Existence of Core for Max Distance Loss</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">Created</span><time datetime="2024-11-21T23:00:00.000Z" title="Created 2024-11-22 00:00:00">2024-11-22</time></span><span class="article-meta"><span class="article-meta-separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/AUDatalogi/">AUDatalogi</a><i class="fas fa-angle-right article-meta-link"></i><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/AUDatalogi/%E7%AE%97%E6%B3%95%E5%8D%9A%E5%BC%88%E8%AE%BA/">算法博弈论</a><i class="fas fa-angle-right article-meta-link"></i><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/AUDatalogi/%E7%AE%97%E6%B3%95%E5%8D%9A%E5%BC%88%E8%AE%BA/AI-ML-%E5%85%AC%E5%B9%B3%E6%80%A7/">AI/ML 公平性</a></span></div><div class="content">The Existence of Core Is the core empty? In the paper, we have proved that Greedy Capture computes 222-core in O(kn)O(kn)O(kn) time for maximum distance loss. ❓Is the 222 the lower bound for code? Special Case: Binary Distance Value Consider a graph G=(V,E)G=(V,E)G=(V,E), where for every pair i,j∈Vi,j\in Vi,j∈V, (i,j)∈E(i,j)\in E(i,j)∈E if dist(i,j)=1dist(i,j)=1dist(i,j)=1, else dist(i,j)=2dist(i,j)=2dist(i,j)=2. If there exist a graph such that no matter how we assign the clusters, there alwa ...</div></div></div><div class="recent-post-item"><div class="post_cover right"><a href="/posts/4f31c6f5.html" title="算法和计算复杂度 16 Fast Fourier Transform"><img class="post-bg" src="/img/AUtacc.jpg" onerror='this.onerror=null,this.src="/img/404.jpg"' alt="算法和计算复杂度 16 Fast Fourier Transform"></a></div><div class="recent-post-info"><a class="article-title" href="/posts/4f31c6f5.html" title="算法和计算复杂度 16 Fast Fourier Transform">算法和计算复杂度 16 Fast Fourier Transform</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">Created</span><time datetime="2024-11-19T23:00:00.000Z" title="Created 2024-11-20 00:00:00">2024-11-20</time></span><span class="article-meta"><span class="article-meta-separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/AUDatalogi/">AUDatalogi</a><i class="fas fa-angle-right article-meta-link"></i><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/AUDatalogi/%E7%AE%97%E6%B3%95%E5%92%8C%E8%AE%A1%E7%AE%97%E5%A4%8D%E6%9D%82%E5%BA%A6/">算法和计算复杂度</a></span></div><div class="content">Algebraic Structure GF(pm)GF(p^m)GF(pm): Galois field of order pmp^mpm, ppp is prime. 伽罗瓦域是一个包含加法和乘法的代数结构，满足加法和乘法的交换律、结合律、分配律，每个元素都有逆元。 Zn\Z_nZn: Integers modulo n≥1n\ge1n≥1. Mm,n(R)M_{m,n}(R)Mm,n(R): mmm by nnn matrices over a ring RRR. 这个玩意是一个矩阵，只是其中每一个元素都来自环。乘法通常不满足交换律。 Mn(R)M_n(R)Mn(R): Mn,n(R)M_{n,n}(R)Mn,n(R). The Discrete Fourier Transform 数 字 信 号 处 理 The key to fast multiplication of integers and polynomials is the discrete Fourier transform. Roots of Unity e2πni=cos2πn+isin2π ...</div></div></div><div class="recent-post-item"><div class="post_cover left"><a href="/posts/35531497.html" title="丹麦语 DU 3.3 12 Jobansøgning og arbejdsmarked"><img class="post-bg" src="/img/dansk-du33.jpg" onerror='this.onerror=null,this.src="/img/404.jpg"' alt="丹麦语 DU 3.3 12 Jobansøgning og arbejdsmarked"></a></div><div class="recent-post-info"><a class="article-title" href="/posts/35531497.html" title="丹麦语 DU 3.3 12 Jobansøgning og arbejdsmarked">丹麦语 DU 3.3 12 Jobansøgning og arbejdsmarked</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">Created</span><time datetime="2024-11-18T13:52:01.000Z" title="Created 2024-11-18 14:52:01">2024-11-18</time></span><span class="article-meta"><span class="article-meta-separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E8%AF%AD%E8%A8%80%E5%AD%A6%E4%B9%A0/">语言学习</a><i class="fas fa-angle-right article-meta-link"></i><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E8%AF%AD%E8%A8%80%E5%AD%A6%E4%B9%A0/%E4%B8%B9%E9%BA%A6%E8%AF%AD%E5%AD%A6%E4%B9%A0%E7%AC%94%E8%AE%B0/">丹麦语学习笔记</a></span></div><div class="content">Tekstsammenhæng i jobansøgninger På dansk har vi mulighed for at variere sætningsspidserne. Dvs. at mange andre led en subjektet kan stå først i sætningen. For eks. Jeg vil gerne bruge min fritid på at hjælpe andre. Jeg kan samtidig selv få mulighed for at træne mit dansk. Min fritid vil jeg gerne bruge på at hjælpe andre. Samtidig kan jeg selv få mulighed for at træne mit dansk. Tekst 2. har bedre sammenhængen. 不要老是写主谓宾的句子，这样太无聊了。需要变换一下语序，为了强调把其他成分放到第一位，然后动词第二位。 Den danske model forforstå ...</div></div></div><div class="recent-post-item"><div class="post_cover right"><a href="/posts/3bc55ba9.html" title="算法和计算复杂度 15 Fine-grained and Parameterized Complexity"><img class="post-bg" src="/img/AUtacc.jpg" onerror='this.onerror=null,this.src="/img/404.jpg"' alt="算法和计算复杂度 15 Fine-grained and Parameterized Complexity"></a></div><div class="recent-post-info"><a class="article-title" href="/posts/3bc55ba9.html" title="算法和计算复杂度 15 Fine-grained and Parameterized Complexity">算法和计算复杂度 15 Fine-grained and Parameterized Complexity</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">Created</span><time datetime="2024-11-13T23:00:00.000Z" title="Created 2024-11-14 00:00:00">2024-11-14</time></span><span class="article-meta"><span class="article-meta-separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/AUDatalogi/">AUDatalogi</a><i class="fas fa-angle-right article-meta-link"></i><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/AUDatalogi/%E7%AE%97%E6%B3%95%E5%92%8C%E8%AE%A1%E7%AE%97%E5%A4%8D%E6%9D%82%E5%BA%A6/">算法和计算复杂度</a></span></div><div class="content">Fine-grained Complexity Vassilevska Williams, “On some fine-grained questions in algorithms and complexity” (original paper), pages 1-9. Mimic NPNPNP-completeness, 3 Hypothesis SETH Recap Strong Exponential Time Hypothesis (SETH). For every ϵ>0\epsilon\gt0ϵ>0 there exists an integer k≥3k\ge3k≥3 s.t. CNF−SATCNF-SATCNF−SAT on formulas with clause size at most kkk and nnn variables can not be solved in O(2(1−ϵ)n)O(2^{(1-\epsilon)n})O(2(1−ϵ)n) time even by a randomized algorithm. 3-SUM 3-S ...</div></div></div><nav id="pagination"><div class="pagination"><span class="page-number current">1</span><a class="page-number" href="/page/2/#content-inner">2</a><span class="space">…</span><a class="page-number" href="/page/31/#content-inner">31</a><a class="extend next" rel="next" href="/page/2/#content-inner"><i class="fas fa-chevron-right fa-fw"></i></a></div></nav></div><div class="aside-content" id="aside-content"><div class="card-widget card-info"><div class="is-center"><div class="avatar-img"><img src="/img/favicon.png" onerror='this.onerror=null,this.src="/img/friend_404.gif"' alt="avatar"></div><div class="author-info__name">tinsir888</div><div class="author-info__description">Elysium :-)</div></div><div class="card-info-data site-data is-center"><a href="/archives/"><div class="headline">Articles</div><div class="length-num">305</div></a><a href="/tags/"><div class="headline">Tags</div><div class="length-num">74</div></a><a href="/categories/"><div class="headline">Categories</div><div class="length-num">32</div></a></div><a id="card-info-btn" target="_blank" rel="noopener external nofollow noreferrer" href="https://www.github.com/tinsir888"><i class="fab fa-github"></i><span>Follow Me</span></a><div class="card-info-social-icons is-center"><a class="social-icon" href="https://github.com/tinsir888" rel="external nofollow noreferrer" target="_blank" title="Github"><i class="fab fa-github"></i></a><a class="social-icon" href="mailto:smalltalk.odin@protonmail.com" rel="external nofollow noreferrer" target="_blank" title="Email"><i class="fas fa-envelope"></i></a><a class="social-icon" href="/atom.xml" target="_blank" title="RSS"><i class="fas fa-rss"></i></a></div></div><div class="card-widget card-announcement"><div class="item-headline"><i class="fas fa-bullhorn fa-shake"></i><span>Announcement</span></div><div class="announcement_content">Ηλύσια Πεδία ;-)</div></div><div class="sticky_layout"><div class="card-widget card-recent-post"><div class="item-headline"><i class="fas fa-history"></i><span>Recent Post</span></div><div class="aside-list"><div class="aside-list-item"><a class="thumbnail" href="/posts/9415313b.html" title="算法和计算复杂度 17 LLL Algorithm"><img src="/img/AUtacc.jpg" onerror='this.onerror=null,this.src="/img/404.jpg"' alt="算法和计算复杂度 17 LLL Algorithm"></a><div class="content"><a class="title" href="/posts/9415313b.html" title="算法和计算复杂度 17 LLL Algorithm">算法和计算复杂度 17 LLL Algorithm</a><time datetime="2024-12-10T23:00:00.000Z" title="Created 2024-12-11 00:00:00">2024-12-11</time></div></div><div class="aside-list-item"><a class="thumbnail" href="/posts/d70a04e3.html" title="丹麦语 DU 3.3 14 Bliv klar til 3.3-testen"><img src="/img/dansk-du33.jpg" onerror='this.onerror=null,this.src="/img/404.jpg"' alt="丹麦语 DU 3.3 14 Bliv klar til 3.3-testen"></a><div class="content"><a class="title" href="/posts/d70a04e3.html" title="丹麦语 DU 3.3 14 Bliv klar til 3.3-testen">丹麦语 DU 3.3 14 Bliv klar til 3.3-testen</a><time datetime="2024-12-07T11:36:00.000Z" title="Created 2024-12-07 12:36:00">2024-12-07</time></div></div><div class="aside-list-item"><a class="thumbnail" href="/posts/d81e7e66.html" title="丹麦皇冠——学生工体验（更新中）"><img src="/img/doorobear2.jpg" onerror='this.onerror=null,this.src="/img/404.jpg"' alt="丹麦皇冠——学生工体验（更新中）"></a><div class="content"><a class="title" href="/posts/d81e7e66.html" title="丹麦皇冠——学生工体验（更新中）">丹麦皇冠——学生工体验（更新中）</a><time datetime="2024-11-27T23:00:00.000Z" title="Created 2024-11-28 00:00:00">2024-11-28</time></div></div><div class="aside-list-item"><a class="thumbnail" href="/posts/c6a52f83.html" title="丹麦语 DU 3.3 13 Smalltalk i hverdags- og arbejdsliv"><img src="/img/dansk-du33.jpg" onerror='this.onerror=null,this.src="/img/404.jpg"' alt="丹麦语 DU 3.3 13 Smalltalk i hverdags- og arbejdsliv"></a><div class="content"><a class="title" href="/posts/c6a52f83.html" title="丹麦语 DU 3.3 13 Smalltalk i hverdags- og arbejdsliv">丹麦语 DU 3.3 13 Smalltalk i hverdags- og arbejdsliv</a><time datetime="2024-11-26T16:34:23.000Z" title="Created 2024-11-26 17:34:23">2024-11-26</time></div></div><div class="aside-list-item"><a class="thumbnail" href="/posts/198e9682.html" title="Fair AI/ML 7 The Existence of Core for Max Distance Loss"><img src="/img/AUFairAI.jpg" onerror='this.onerror=null,this.src="/img/404.jpg"' alt="Fair AI/ML 7 The Existence of Core for Max Distance Loss"></a><div class="content"><a class="title" href="/posts/198e9682.html" title="Fair AI/ML 7 The Existence of Core for Max Distance Loss">Fair AI/ML 7 The Existence of Core for Max Distance Loss</a><time datetime="2024-11-21T23:00:00.000Z" title="Created 2024-11-22 00:00:00">2024-11-22</time></div></div></div></div><div class="card-widget card-categories"><div class="item-headline"><i class="fas fa-folder-open"></i> <span>Categories</span> <a class="card-more-btn" href="/categories/" title="View More"><i class="fas fa-angle-right"></i></a></div><ul class="card-category-list" id="aside-cat-list"><li class="card-category-list-item"><a class="card-category-list-link" href="/categories/AUDatalogi/"><span class="card-category-list-name">AUDatalogi</span><span class="card-category-list-count">105</span></a><ul class="card-category-list child"><li class="card-category-list-item"><a class="card-category-list-link" href="/categories/AUDatalogi/%E6%95%B0%E6%8D%AE%E6%8C%96%E6%8E%98/"><span class="card-category-list-name">数据挖掘</span><span class="card-category-list-count">17</span></a><ul class="card-category-list child"><li class="card-category-list-item"><a class="card-category-list-link" href="/categories/AUDatalogi/%E6%95%B0%E6%8D%AE%E6%8C%96%E6%8E%98/%E7%9F%A5%E8%AF%86%E5%9B%BE%E8%B0%B1%E5%8F%AF%E9%9D%A0%E6%80%A7%E8%A1%A1%E9%87%8F/"><span class="card-category-list-name">知识图谱可靠性衡量</span><span class="card-category-list-count">4</span></a></li></ul></li><li class="card-category-list-item"><a class="card-category-list-link" href="/categories/AUDatalogi/%E7%AE%97%E6%B3%95%E5%8D%9A%E5%BC%88%E8%AE%BA/"><span class="card-category-list-name">算法博弈论</span><span class="card-category-list-count">31</span></a><ul class="card-category-list child"><li class="card-category-list-item"><a class="card-category-list-link" href="/categories/AUDatalogi/%E7%AE%97%E6%B3%95%E5%8D%9A%E5%BC%88%E8%AE%BA/AI-ML-%E5%85%AC%E5%B9%B3%E6%80%A7/"><span class="card-category-list-name">AI/ML 公平性</span><span class="card-category-list-count">8</span></a></li><li class="card-category-list-item"><a class="card-category-list-link" href="/categories/AUDatalogi/%E7%AE%97%E6%B3%95%E5%8D%9A%E5%BC%88%E8%AE%BA/%E5%85%AC%E5%B9%B3%E5%88%86%E9%85%8D%E5%8D%9A%E5%BC%88/"><span class="card-category-list-name">公平分配博弈</span><span class="card-category-list-count">9</span></a></li></ul></li><li class="card-category-list-item"><a class="card-category-list-link" href="/categories/AUDatalogi/%E7%AE%97%E6%B3%95%E5%92%8C%E8%AE%A1%E7%AE%97%E5%A4%8D%E6%9D%82%E5%BA%A6/"><span class="card-category-list-name">算法和计算复杂度</span><span class="card-category-list-count">17</span></a></li><li class="card-category-list-item"><a class="card-category-list-link" href="/categories/AUDatalogi/%E8%AE%A1%E7%AE%97%E5%87%A0%E4%BD%95/"><span class="card-category-list-name">计算几何</span><span class="card-category-list-count">13</span></a></li></ul></li></ul></div><div class="card-widget card-tags"><div class="item-headline"><i class="fas fa-tags"></i><span>Tags</span></div><div class="card-tag-cloud"><a href="/tags/%E5%AE%9E%E4%B9%A0%E7%BB%8F%E5%8E%86/" style="font-size:1.18em;color:#712f7a">实习经历</a><a href="/tags/%E4%B8%B9%E9%BA%A6/" style="font-size:1.22em;color:#20104e">丹麦</a><a href="/tags/%E5%8D%8E%E4%B8%BA/" style="font-size:1.15em;color:#1b6f27">华为</a><a href="/tags/LCA/" style="font-size:1.15em;color:#4a8f79">LCA</a><a href="/tags/Codeforces/" style="font-size:1.18em;color:#60c788">Codeforces</a><a href="/tags/%E5%AE%9E%E7%94%A8%E5%B7%A5%E5%85%B7/" style="font-size:1.15em;color:#349192">实用工具</a><a href="/tags/PDF/" style="font-size:1.15em;color:#9fb1ae">PDF</a><a href="/tags/%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F/" style="font-size:1.2em;color:#0a4a56">操作系统</a><a href="/tags/%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%B3%BB%E7%BB%9F%E8%AE%BE%E8%AE%A1/" style="font-size:1.17em;color:#12422a">计算机系统设计</a><a href="/tags/%E8%AE%A1%E7%AE%97%E6%9C%BA%E4%BD%93%E7%B3%BB%E7%BB%93%E6%9E%84/" style="font-size:1.35em;color:#4e1e4a">计算机体系结构</a><a href="/tags/RISC-V/" style="font-size:1.17em;color:#23618b">RISC-V</a><a href="/tags/NEMU/" style="font-size:1.17em;color:#c88813">NEMU</a><a href="/tags/%E6%95%B0%E5%AD%97%E7%94%B5%E8%B7%AF/" style="font-size:1.18em;color:#284d8d">数字电路</a><a href="/tags/%E6%97%A5%E5%B8%B8%E8%AE%B0%E5%BD%95/" style="font-size:1.15em;color:#159564">日常记录</a><a href="/tags/%E5%A5%A5%E5%9C%B0%E5%88%A9/" style="font-size:1.2em;color:#6b7f36">奥地利</a><a href="/tags/%E7%95%99%E5%AD%A6/" style="font-size:1.43em;color:#c89217">留学</a><a href="/tags/%E5%8C%97%E6%AC%A7/" style="font-size:1.22em;color:#c39968">北欧</a><a href="/tags/%E7%91%9E%E5%85%B8/" style="font-size:1.18em;color:#191f5c">瑞典</a><a href="/tags/%E8%8A%AC%E5%85%B0/" style="font-size:1.18em;color:#7031ba">芬兰</a><a href="/tags/%E5%BE%B7%E5%9B%BD/" style="font-size:1.42em;color:#79a8c2">德国</a><a href="/tags/%E7%AC%94%E8%AE%B0/" style="font-size:1.45em;color:#47714d">笔记</a><a href="/tags/%E7%AE%97%E6%B3%95%E5%8D%9A%E5%BC%88%E8%AE%BA/" style="font-size:1.4em;color:#4e7b13">算法博弈论</a><a href="/tags/%E8%AE%A1%E7%AE%97%E5%87%A0%E4%BD%95/" style="font-size:1.32em;color:#be58c2">计算几何</a><a href="/tags/%E7%AE%97%E6%B3%95/" style="font-size:1.38em;color:#c3872a">算法</a><a href="/tags/%E8%AE%A1%E7%AE%97%E5%A4%8D%E6%9D%82%E5%BA%A6/" style="font-size:1.37em;color:#119139">计算复杂度</a><a href="/tags/%E8%AE%A1%E7%AE%97%E6%9C%BA%E8%A7%86%E8%A7%89/" style="font-size:1.32em;color:#9d535d">计算机视觉</a><a href="/tags/%E6%95%B0%E6%8D%AE%E6%8C%96%E6%8E%98/" style="font-size:1.37em;color:#837649">数据挖掘</a><a href="/tags/%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD/" style="font-size:1.3em;color:#008c4f">人工智能</a><a href="/tags/%E7%9F%A5%E8%AF%86%E5%9B%BE%E8%B0%B1/" style="font-size:1.2em;color:#4b0002">知识图谱</a><a href="/tags/%E8%AE%BA%E6%96%87%E9%98%85%E8%AF%BB/" style="font-size:1.15em;color:#4d12bd">论文阅读</a><a href="/tags/%E9%9A%8F%E6%9C%BA%E7%AE%97%E6%B3%95/" style="font-size:1.33em;color:#a5b246">随机算法</a><a href="/tags/%E6%99%BA%E8%83%BD%E8%AE%A1%E7%AE%97%E7%B3%BB%E7%BB%9F/" style="font-size:1.27em;color:#bc2725">智能计算系统</a><a href="/tags/%E6%B1%87%E7%BC%96/" style="font-size:1.28em;color:#735d03">汇编</a><a href="/tags/%E9%80%86%E5%90%91/" style="font-size:1.25em;color:#25c62d">逆向</a><a href="/tags/%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%BD%91%E7%BB%9C/" style="font-size:1.38em;color:#27949a">计算机网络</a><a href="/tags/%E6%95%B0%E6%8D%AE%E5%BA%93%E7%B3%BB%E7%BB%9F/" style="font-size:1.17em;color:#16b1b1">数据库系统</a><a href="/tags/%E6%84%9F%E7%9F%A5%E6%8A%80%E6%9C%AF/" style="font-size:1.22em;color:#ac3460">感知技术</a><a href="/tags/%E4%BC%A0%E6%84%9F%E5%99%A8/" style="font-size:1.22em;color:#a2a43a">传感器</a><a href="/tags/%E7%89%A9%E7%90%86/" style="font-size:1.23em;color:#1b494d">物理</a><a href="/tags/%E6%95%B0%E5%AD%97%E4%BF%A1%E5%8F%B7%E5%A4%84%E7%90%86/" style="font-size:1.27em;color:#bca9b9">数字信号处理</a></div></div><div class="card-widget card-archives"><div class="item-headline"><i class="fas fa-archive"></i><span>Archives</span><a class="card-more-btn" href="/archives/" title="View More"> <i class="fas fa-angle-right"></i></a></div><ul class="card-archive-list"><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2024/12/"><span class="card-archive-list-date">December 2024</span><span class="card-archive-list-count">2</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2024/11/"><span class="card-archive-list-date">November 2024</span><span class="card-archive-list-count">13</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2024/10/"><span class="card-archive-list-date">October 2024</span><span class="card-archive-list-count">11</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2024/09/"><span class="card-archive-list-date">September 2024</span><span class="card-archive-list-count">9</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2024/08/"><span class="card-archive-list-date">August 2024</span><span class="card-archive-list-count">5</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2024/07/"><span class="card-archive-list-date">July 2024</span><span class="card-archive-list-count">7</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2024/06/"><span class="card-archive-list-date">June 2024</span><span class="card-archive-list-count">1</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2024/05/"><span class="card-archive-list-date">May 2024</span><span class="card-archive-list-count">5</span></a></li></ul></div><div class="card-widget card-webinfo"><div class="item-headline"><i class="fas fa-chart-line"></i><span>Info</span></div><div class="webinfo"><div class="webinfo-item"><div class="item-name">Article :</div><div class="item-count">305</div></div><div class="webinfo-item"><div class="item-name">Total Count :</div><div class="item-count">570.4k</div></div><div class="webinfo-item"><div class="item-name">UV :</div><div class="item-count" id="busuanzi_value_site_uv"><i class="fa-solid fa-spinner fa-spin"></i></div></div><div class="webinfo-item"><div class="item-name">PV :</div><div class="item-count" id="busuanzi_value_site_pv"><i class="fa-solid fa-spinner fa-spin"></i></div></div><div class="webinfo-item"><div class="item-name">Last Update :</div><div class="item-count" id="last-push-date" data-lastpushdate="2025-01-12T16:42:42.245Z"><i class="fa-solid fa-spinner fa-spin"></i></div></div></div></div></div></div></main><footer id="footer" style="background-image:url(/img/doorobear1.jpg)"><div id="footer-wrap"><div class="copyright">©2020 - 2025 By tinsir888</div><div class="framework-info"><span>Framework </span><a target="_blank" rel="noopener external nofollow noreferrer" href="https://hexo.io">Hexo</a><span class="footer-separator">|</span><span>Theme </span><a target="_blank" rel="noopener external nofollow noreferrer" href="https://github.com/jerryc127/hexo-theme-butterfly">Butterfly</a><span class="footer-separator">|</span><span> </span><a href="https://icp.gov.moe/?keyword=20248537" rel="external nofollow noreferrer" target="_blank"><img src="https://icp.gov.moe/images/ico64.png" alt="icon" width="16" height="16" style="vertical-align:middle;margin-right:5px">萌ICP备20248537号</a></div></div></footer></div><div id="rightside"><div id="rightside-config-hide"><button id="darkmode" type="button" title="Toggle Between Light And Dark Mode"><i class="fas fa-adjust"></i></button><button id="hide-aside-btn" type="button" title="Toggle between Single-column and Double-column"><i class="fas fa-arrows-alt-h"></i></button></div><div id="rightside-config-show"><button id="rightside-config" type="button" title="Setting"><i class="fas fa-cog fa-spin"></i></button><button id="go-up" type="button" title="Back To Top"><span class="scroll-percent"></span><i class="fas fa-arrow-up"></i></button></div></div><div><script src="/js/utils.js"></script><script src="/js/main.js"></script><script src="https://cdn.jsdelivr.net/npm/@fancyapps/ui/dist/fancybox/fancybox.umd.min.js"></script><div class="js-pjax"><script>window.typedJSFn={init:t=>{window.typed=new Typed("#subtitle",Object.assign({strings:t,startDelay:300,typeSpeed:150,loop:!0,backSpeed:50},null))},run:t=>{"function"==typeof Typed?t():getScript("https://cdn.jsdelivr.net/npm/typed.js/dist/typed.umd.min.js").then(t)}}</script><script>function subtitleType(){typedJSFn.init(["Welcome to my blog!","Wilkommen auf meinem Blog!","Velkommen til min blog!","歡迎來到我的博客！","Benvenuti nel mio blog!","欢迎来到我的博客！","Bienvenue sur mon blog !","私のブログへようこそ！","Bem-vindo ao meu blog!","Добро пожаловать в мой блог!","¡Bienvenidos a mi blog!","내 블로그에 오신 것을 환영합니다!","Καλώς ήρθατε στο ιστολόγιό μου!"])}typedJSFn.run(subtitleType)</script><script>(()=>{const e=document.querySelectorAll("#article-container .mermaid-wrap");if(0===e.length)return;const t=()=>{window.loadMermaid=!0;const t="dark"===document.documentElement.getAttribute("data-theme")?"dark":"default";Array.from(e).forEach((e,n)=>{const d=e.firstElementChild,r="mermaid-"+n,a="%%{init:{ 'theme':'"+t+"'}}%%\n"+d.textContent,i=mermaid.render(r,a);var m;"string"==typeof i?(m=i,d.insertAdjacentHTML("afterend",m)):i.then(({svg:e})=>{d.insertAdjacentHTML("afterend",e)})})},n=()=>{window.loadMermaid?t():getScript("https://cdn.jsdelivr.net/npm/mermaid/dist/mermaid.min.js").then(t)};btf.addGlobalFn("themeChange",t,"mermaid"),window.pjax?n():document.addEventListener("DOMContentLoaded",n)})()</script></div><canvas class="fireworks" mobile="false"></canvas><script src="https://cdn.jsdelivr.net/npm/butterfly-extsrc/dist/fireworks.min.js"></script><script defer id="fluttering_ribbon" mobile="false" src="https://cdn.jsdelivr.net/npm/butterfly-extsrc/dist/canvas-fluttering-ribbon.min.js"></script><script src="https://cdn.jsdelivr.net/npm/butterfly-extsrc/dist/activate-power-mode.min.js"></script><script>POWERMODE.colorful=!0,POWERMODE.shake=!0,POWERMODE.mobile=!1,document.body.addEventListener("input",POWERMODE)</script><script async data-pjax src="//busuanzi.ibruce.info/busuanzi/2.3/busuanzi.pure.mini.js"></script><div id="local-search"><div class="search-dialog"><nav class="search-nav"><span class="search-dialog-title">Search</span><span id="loading-status"></span><button class="search-close-button"><i class="fas fa-times"></i></button></nav><div class="is-center" id="loading-database"><i class="fas fa-spinner fa-pulse"></i><span> Loading the Database</span></div><div class="search-wrap"><div id="local-search-input"><div class="local-search-box"><input class="local-search-box--input" placeholder="Search for Posts" type="text"></div></div><hr><div id="local-search-results"></div><div id="local-search-stats-wrap"></div></div></div><div id="search-mask"></div><script src="/js/search/local-search.js"></script></div></div></body></html>