<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Computer Science on Yukari's Blog</title><link>https://yukar.icu/column/computer-science/</link><description>Recent content in Computer Science on Yukari's Blog</description><generator>Hugo</generator><language>zh-cn</language><lastBuildDate>Tue, 28 Jul 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://yukar.icu/column/computer-science/index.xml" rel="self" type="application/rss+xml"/><item><title>Operating System</title><link>https://yukar.icu/posts/cs/operatingsystem/</link><pubDate>Tue, 28 Jul 2026 00:00:00 +0000</pubDate><guid>https://yukar.icu/posts/cs/operatingsystem/</guid><description>Architecture and core mechanisms of Operating Systems.</description></item><item><title>Operating System</title><link>https://yukar.icu/posts/cs/computerorganization/</link><pubDate>Mon, 27 Jul 2026 00:00:00 +0000</pubDate><guid>https://yukar.icu/posts/cs/computerorganization/</guid><description>Architecture of Operating System.</description></item><item><title>Computer Network: Some Topics</title><link>https://yukar.icu/posts/cs/5layerarchitecture/</link><pubDate>Thu, 23 Jul 2026 00:00:00 +0000</pubDate><guid>https://yukar.icu/posts/cs/5layerarchitecture/</guid><description>Architecture of Computer Network.</description></item><item><title>Data Structure: Mathematical Perspective</title><link>https://yukar.icu/posts/cs/mathofdatastructure/</link><pubDate>Wed, 22 Jul 2026 00:00:00 +0000</pubDate><guid>https://yukar.icu/posts/cs/mathofdatastructure/</guid><description>&lt;h2 id="stack--catalan-number"&gt;Stack &amp;amp; Catalan Number&lt;/h2&gt;
&lt;h2 id="string"&gt;String&lt;/h2&gt;
&lt;h2 id="tree"&gt;Tree&lt;/h2&gt;
&lt;p&gt;For a tree of $N$ nodes and $n_d$ nodes of degree $d$, it holds that
&lt;/p&gt;
$$N = \sum^{D}_{d=0}n_d=\sum^D_{d=0} n_d d+1 = E+1,$$&lt;p&gt;
where $E$ is the number of edges and $D$ is the maximum degree of the tree. Then the number of leaves $n_0$ is given by
&lt;/p&gt;
$$n_0 = 1 + \sum^D_{d=1} n_d(d-1),$$&lt;p&gt;
and in a forest, the number of trees $T$ is given by
&lt;/p&gt;</description></item><item><title>Package Management: Introduction</title><link>https://yukar.icu/posts/cs/packagemanagement/</link><pubDate>Tue, 21 Jul 2026 00:00:00 +0000</pubDate><guid>https://yukar.icu/posts/cs/packagemanagement/</guid><description>&lt;p&gt;A &lt;strong&gt;package manager&lt;/strong&gt; automates the lifecycle of software dependencies: fetch, install, upgrade, configure, and remove. At scale, it answers the question:&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;Given a set of packages, each with version constraints on its own dependencies, does there exist a consistent assignment of versions such that every constraint is satisfied?&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;This is, at heart, a constraint-satisfaction problem — and different package managers attack it with different algorithms, trade-offs, and scopes of responsibility. This article surveys the landscape, unpacks the resolution mechanisms, and provides a decision framework for choosing the right tool.&lt;/p&gt;</description></item><item><title>Virtual Environment: Practical Guide(To be Continued)</title><link>https://yukar.icu/posts/cs/virtualenvironment/</link><pubDate>Tue, 21 Jul 2026 00:00:00 +0000</pubDate><guid>https://yukar.icu/posts/cs/virtualenvironment/</guid><description>&lt;p&gt;A &lt;strong&gt;virtual environment&lt;/strong&gt; is an isolated, self-contained workspace that decouples a project&amp;rsquo;s dependencies, runtime, and configuration from the host system and from other projects. The core tension it resolves is:&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;&lt;em&gt;Project A and Project B may require different versions of the same dependency, but the host OS allows only one version to be installed globally.&lt;/em&gt;&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;Different tools address this at different layers of the stack:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;Docker&lt;/strong&gt; at the OS/kernel level,&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Conda&lt;/strong&gt; at the userland binary level,&lt;/li&gt;
&lt;li&gt;&lt;code&gt;uv venv&lt;/code&gt; at the Python interpreter level.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;This article will introduce each tool with their design philosophy, logical structure, implementation mechanism, and practical usage examples. It will also provide a comparative summary, debugging strategies for version conflicts and VSCode integration tips.&lt;/p&gt;</description></item><item><title>Computer Network: Note</title><link>https://yukar.icu/posts/cs/computernetwork/</link><pubDate>Mon, 20 Jul 2026 00:00:00 +0000</pubDate><guid>https://yukar.icu/posts/cs/computernetwork/</guid><description>&lt;p&gt;A network is&lt;/p&gt;
$$\text{Network}=\text{Nodes}+\text{Links}+\text{Protocols},$$&lt;p&gt;logical 逻辑上（transparent）&lt;/p&gt;
&lt;p&gt;physical 实现&lt;/p&gt;
&lt;hr&gt;
&lt;p&gt;Remember that
&lt;/p&gt;
$$\text{Computer Network}=\text{Protocol Stack}+\text{Addressing}+\text{Routing},$$&lt;p&gt;
base on which we build the Internet to connect everything.&lt;/p&gt;
&lt;h1 id="architecture--layering"&gt;Architecture &amp;amp; Layering&lt;/h1&gt;
&lt;p&gt;The &lt;strong&gt;network architecture&lt;/strong&gt;, equivalently, the &lt;strong&gt;protocol stack&lt;/strong&gt;, organizes communication into layers, each providing services to the layer above while hiding implementation details from the layer below.&lt;/p&gt;
&lt;p&gt;A simple example is the &lt;strong&gt;OSI model&lt;/strong&gt;, which partitions the communication process into seven layers:
&lt;/p&gt;
$$\text{Physical}\to\text{Data Link}\to\text{Network}\to\text{Transport}\to\text{Session}\to\text{Presentation}\to\text{Application}.$$&lt;p&gt;
The OSI model provides a conceptual framework; it does not define specific protocols. Now consider the &lt;strong&gt;TCP/IP model&lt;/strong&gt;, which condenses these into four layers:
&lt;/p&gt;</description></item><item><title>Data Structure: Note</title><link>https://yukar.icu/posts/cs/datastructure/</link><pubDate>Mon, 20 Jul 2026 00:00:00 +0000</pubDate><guid>https://yukar.icu/posts/cs/datastructure/</guid><description>&lt;p&gt;Remember that
&lt;/p&gt;
$$\text{Data Structure}=\text{Organization}+\text{Storage}+\text{Operation},$$&lt;p&gt;
base on which we develop algorithms to solve problems.&lt;/p&gt;
&lt;h1 id="organization--logical-structure"&gt;Organization &amp;amp; Logical Structure&lt;/h1&gt;
&lt;p&gt;The &lt;strong&gt;Organization&lt;/strong&gt;, equivalently, the &lt;strong&gt;logical structure&lt;/strong&gt; of data, is the intrinsic property of data, which determines the relationship between data elements and the operations on them, and it is independent from the storage.&lt;/p&gt;
&lt;p&gt;A simple example is the hash table, which realizes the mapping
&lt;/p&gt;
$$f:\text{key} \mapsto \text{value}$$&lt;p&gt;
by storing entries at locations $\{\text{Hash}(\text{key})\}$. The hash function provides only a storage structure; it does not impose any logical relationship between elements. Now consider the case where keys are taken from $([n])$ and values from a given data type
&lt;/p&gt;</description></item><item><title>Computer Networking — Chapter 1: Computer Networks and the Internet</title><link>https://yukar.icu/posts/networking/computer-networking-ch1/</link><pubDate>Sat, 27 Jun 2026 00:00:00 +0000</pubDate><guid>https://yukar.icu/posts/networking/computer-networking-ch1/</guid><description>Notes on Chapter 1 of Computer Networking: A Top-Down Approach (7th Edition). Covers the Internet overview, network edge, network core, delay/loss/throughput, protocol layers, and network security.</description></item><item><title>Computer Networking — Chapter 2: Application Layer</title><link>https://yukar.icu/posts/networking/computer-networking-ch2/</link><pubDate>Sat, 27 Jun 2026 00:00:00 +0000</pubDate><guid>https://yukar.icu/posts/networking/computer-networking-ch2/</guid><description>Notes on Chapter 2 of Computer Networking: A Top-Down Approach (7th Edition). Covers HTTP, email, DNS, P2P, CDN, video streaming, and socket programming.</description></item><item><title>Computer Networking — Chapter 3: Transport Layer</title><link>https://yukar.icu/posts/networking/computer-networking-ch3/</link><pubDate>Sat, 27 Jun 2026 00:00:00 +0000</pubDate><guid>https://yukar.icu/posts/networking/computer-networking-ch3/</guid><description>Notes on Chapter 3 of Computer Networking: A Top-Down Approach (7th Edition). Covers transport-layer services, UDP, reliable data transfer, TCP, and congestion control.</description></item><item><title>Computer Networking — Chapter 4: The Network Layer: Data Plane</title><link>https://yukar.icu/posts/networking/computer-networking-ch4/</link><pubDate>Sat, 27 Jun 2026 00:00:00 +0000</pubDate><guid>https://yukar.icu/posts/networking/computer-networking-ch4/</guid><description>Notes on Chapter 4 of Computer Networking: A Top-Down Approach (7th Edition). Covers network layer data plane functions: forwarding, router architecture, IP protocol, addressing, NAT, IPv6, and SDN generalized forwarding.</description></item><item><title>Computer Networking — Chapter 5: The Network Layer: Control Plane</title><link>https://yukar.icu/posts/networking/computer-networking-ch5/</link><pubDate>Sat, 27 Jun 2026 00:00:00 +0000</pubDate><guid>https://yukar.icu/posts/networking/computer-networking-ch5/</guid><description>Notes on Chapter 5 of Computer Networking: A Top-Down Approach (7th Edition). Covers routing algorithms, OSPF, BGP, SDN control plane, ICMP, and SNMP.</description></item><item><title>Computer Networking — Chapter 6: The Link Layer and LANs</title><link>https://yukar.icu/posts/networking/computer-networking-ch6/</link><pubDate>Sat, 27 Jun 2026 00:00:00 +0000</pubDate><guid>https://yukar.icu/posts/networking/computer-networking-ch6/</guid><description>Notes on Chapter 6 of Computer Networking: A Top-Down Approach (7th Edition). Covers link-layer services, error detection, multiple access protocols, Ethernet, switches, VLANs, MPLS, data center networking.</description></item><item><title>Computer Networking — Chapter 7: Wireless and Mobile Networks</title><link>https://yukar.icu/posts/networking/computer-networking-ch7/</link><pubDate>Sat, 27 Jun 2026 00:00:00 +0000</pubDate><guid>https://yukar.icu/posts/networking/computer-networking-ch7/</guid><description>Notes on Chapter 7 of Computer Networking: A Top-Down Approach (7th Edition). Covers wireless links, WiFi (802.11), cellular networks, mobility management, and Mobile IP.</description></item><item><title>Computer Networking — Chapter 8: Security in Computer Networks</title><link>https://yukar.icu/posts/networking/computer-networking-ch8/</link><pubDate>Sat, 27 Jun 2026 00:00:00 +0000</pubDate><guid>https://yukar.icu/posts/networking/computer-networking-ch8/</guid><description>Notes on Chapter 8 of Computer Networking: A Top-Down Approach (7th Edition). Covers cryptography, message integrity, authentication, SSL, IPsec, wireless security, and firewalls.</description></item><item><title>Computer Networking — Chapter 9: Multimedia Networking</title><link>https://yukar.icu/posts/networking/computer-networking-ch9/</link><pubDate>Sat, 27 Jun 2026 00:00:00 +0000</pubDate><guid>https://yukar.icu/posts/networking/computer-networking-ch9/</guid><description>Notes on Chapter 9 of Computer Networking: A Top-Down Approach (7th Edition). Covers multimedia applications, streaming video, VoIP, RTP, SIP, Diffserv, Intserv, and RSVP.</description></item></channel></rss>