repo
stringlengths 26
115
| file
stringlengths 54
212
| language
stringclasses 2
values | license
stringclasses 16
values | content
stringlengths 19
1.07M
|
|---|---|---|---|---|
https://github.com/Area-53-Robotics/53E-Notebook-Over-Under-2023-2024 | https://raw.githubusercontent.com/Area-53-Robotics/53E-Notebook-Over-Under-2023-2024/giga-notebook/entries/intake-rebuild/brainstorm.typ | typst | Creative Commons Attribution Share Alike 4.0 International | #import "/packages.typ": notebookinator
#import notebookinator: *
#import themes.radial.components: *
#show: create-body-entry.with(
title: "Brainstorm: Intake Rebuild",
type: "brainstorm",
date: datetime(year: 2024, month: 2, day: 16),
author: "<NAME>",
witness: "Violet Ridge",
)
= Choices
Once we identified what we wanted out of our redesign, we came up with some
options to choose from.
#grid(
columns: (2fr, 3fr),
gutter: 20pt, //
[
== No Bracing
This option is very similar to one of our earlier intake iterations. It just
consists of two pieces of c-channel, with an axle in the middle.
#pro-con(
pros: [
- Very easy to build
],
cons: [
- All of the stress will be put onto the intake's axle, increasing friction
],
)
],
image("./no-bracing.svg"),
[
== High Strength Axle Bracing
This option is the same as the first, but it has a high strength axle providing
structural support.
#pro-con(
pros: [
- Extremely rigid
],
cons: [
- Its very difficult to drill holes in a high strength axle accurately.
],
)
],
image("./hs-axle-bracing.svg"),
[
== 3-channel Bracing
This option swaps the high strength axle out for a piece of 3-channel.
#pro-con(pros: [
- Easy to build
], cons: [
- Not as rigid as a high strength axle
])
],
image("./c-channel-bracing.svg"),
)
|
https://github.com/LeBulldoge/resume | https://raw.githubusercontent.com/LeBulldoge/resume/main/resume.typ | typst | #set page(
margin: (
x: 1.5cm,
y: 1cm,
),
footer: [
#set text(8pt)
#show link: underline
_Made with #link("https://typst.app")[typst]_
#h(1fr)
_This resume is on_
#link("http://github.com/LeBulldoge/resume")[
#box[#image("assets/github-142.svg", width: 6pt)]_github!_
]
],
fill: rgb("fbfdf9")
)
#set text(font: "Times New Roman", size: 12pt, fill: rgb("191c1b"))
#set par(linebreaks: "optimized")
#let surface_1 = rgb("#dbe5df")
#let on_surface_text = rgb("#404944")
#let sub_heading(body) = {
set text(16pt)
set align(center)
heading(level: 2)[
#body
]
}
#let cell(icon, body) = {
set text(10pt, fill: on_surface_text)
set align(center)
rect(
inset: 6pt,
fill: surface_1,
width: 100%,
radius: 6pt,
stack(
dir: ltr,
spacing: 5%,
image("assets/" + icon, width: 8pt),
text[#body]
)
)
}
#align(center)[
#text(30pt)[
#block[
#smallcaps[
= <NAME>
]
]
]
]
#grid(
columns: (1fr, 1fr, 1fr, 1fr),
gutter: 3pt,
cell("mail.svg")[
#link("mailto:<EMAIL>")
],
cell("phone-call.svg")[
#link("tel:+1 236-464-2186")
],
cell("home.svg")[
Victoria, BC, Canada
],
cell("github-142.svg")[
#link("https://github.com/LeBulldoge")[
GitHub.com/LeBulldoge
]
]
)
#line(length: 100%, stroke: (paint: rgb("#bfc9c3"), thickness: 1pt, cap: "round"))
#sub_heading[Experience]
=== Software Engineer
#text(10pt)[System Technologies, Kaliningrad, Russia - Remote#h(1fr)*October 2019 – October 2022*]
#par(justify: true)[
- Engineered a cross platform Android and iOS mobile application using C++, Qt framework, Java, and Objective-C on a 8 person agile team.
- Lead and created a cross platform mobile app installer in Kotlin, reducing the install size by ~100MBs leading to increased usage and engineering velocity due to separating the installer from the core app.
- Worked on an extension engine on top of the Chrome Javascript V8, creating wrappers and APIs to help facilitate frontend development helping unblock critical client specific needs.
- Utilized TDD and helped fill in any test coverage gaps, while also refactoring untestable code leading to a unit test coverage of ~98% from nearly ~50% coverage years prior.
- Refactored our tests to run asynchronously leading to a test runtime performance improvement from over 90 seconds down to 10, greatly increasing developer velocity.
]
=== System Administrator
#text(10pt)[Kindergarten “Zvezdochka”, Slobodskoy, Russia#h(1fr)*January 2014 – March 2015*]
#par(justify: true)[
- Managed and configured the company website to help provide file hosting and content distribution.
- Provided technical support to employees ranging from OS problems to hardware support.
- Installed and built company hardware such as computers and printers, distributed to employees.
]
#let project(repo, body) = {
link("https://github.com/LeBulldoge/" + repo)[
#heading(level: 3)[
#body
#h(1fr)
#box[
#image("assets/github-142.svg", width: 8pt)
]
]]
}
#let card(title, body) = {
set text(fill: on_surface_text)
rect(
inset: 8pt,
fill: surface_1,
width: 100%,
height: 100%,
radius: 6pt,
stack(
spacing: 5pt,
title,
line(length: 100%, stroke: (paint: rgb("#bfc9c3"), thickness: 1pt, cap: "round")),
text(11pt, body),
))
}
#sub_heading[Projects]
#par(justify: true)[
#grid(
columns: (1fr, 1fr),
rows: (70pt, 54pt),
gutter: 6pt,
card(project("N-Body-simulation")[OpenGL N-Body Problem Visualization])[
OpenGL visualization of the n-body problem in C++ utilizing the Barnes-Hut algorithm to compute interactions between bodies.
],
card(project("task-manager")[Task Manager])[
A task management application, written to learn Typescript and web development. Utilizes frameworks such as Next.js, tRPC, Prisma, Tailwind and Zod.
],
card(project("labee")[Labee])[
A file labeling tool written in go, utilizing sqlite to manage files via labels/tags.
],
card(project("gungus")[Gungus])[
A discord bot, written in go, which (currently) allows creation of polls, achieving persistence via sqlite.
],
)]
#sub_heading[Education]
=== Specialist Degree in Software Development
#text(10pt)[College of Pedagogics and Social Relations, Slobodskoy, Russia#h(1fr)*September 2015 – October 2019*]
#sub_heading[Skills]
#grid(
columns: (1fr, 1fr),
gutter: 8pt,
[
=== Languages & Frameworks
#set text(10pt)
C++, Java, Kotlin, Golang, SQL, Qt, Android, Objective-C, Typescript, React, Node.js, Next.js, Python, C\#
],
[
=== Tools, Technologies & Skills
#set text(10pt)
Git, Docker, CMake, Systems Design & Architecture, CI, Azure, Android Studio, CLI
],
)
|
|
https://github.com/typst/packages | https://raw.githubusercontent.com/typst/packages/main/packages/preview/fh-joanneum-iit-thesis/1.1.0/template/chapters/5-concept.typ | typst | Apache License 2.0 | #import "global.typ": *
= Concept
#lorem(30)
#todo([ Describe an overall concept of a solution, which could possibly solve a given problem. Design a novel solution and visualise the architecture and relevant (data) flows. Compare and relate your approach to possible alternatives and argue why and in which way(s) the suggested solution(s) will be better. ])
|
https://github.com/zenor0/simple-neat-typst-cv | https://raw.githubusercontent.com/zenor0/simple-neat-typst-cv/master/cv/lib.typ | typst | MIT License | #import "templates/cv.typ": cv-conf
#import "utils/blocks.typ": *
#import "utils/icons.typ": *
|
https://github.com/typst/packages | https://raw.githubusercontent.com/typst/packages/main/packages/preview/unichar/0.1.0/ucd/block-10100.typ | typst | Apache License 2.0 | #let data = (
("AEGEAN WORD SEPARATOR LINE", "Po", 0),
("AEGEAN WORD SEPARATOR DOT", "Po", 0),
("AEGEAN CHECK MARK", "Po", 0),
(),
(),
(),
(),
("AEGEAN NUMBER ONE", "No", 0),
("AEGEAN NUMBER TWO", "No", 0),
("AEGEAN NUMBER THREE", "No", 0),
("AEGEAN NUMBER FOUR", "No", 0),
("AEGEAN NUMBER FIVE", "No", 0),
("AEGEAN NUMBER SIX", "No", 0),
("AEGEAN NUMBER SEVEN", "No", 0),
("AEGEAN NUMBER EIGHT", "No", 0),
("AEGEAN NUMBER NINE", "No", 0),
("AEGEAN NUMBER TEN", "No", 0),
("AEGEAN NUMBER TWENTY", "No", 0),
("AEGEAN NUMBER THIRTY", "No", 0),
("AEGEAN NUMBER FORTY", "No", 0),
("AEGEAN NUMBER FIFTY", "No", 0),
("AEGEAN NUMBER SIXTY", "No", 0),
("AEGEAN NUMBER SEVENTY", "No", 0),
("AEGEAN NUMBER EIGHTY", "No", 0),
("AEGEAN NUMBER NINETY", "No", 0),
("AEGEAN NUMBER ONE HUNDRED", "No", 0),
("AEGEAN NUMBER TWO HUNDRED", "No", 0),
("AEGEAN NUMBER THREE HUNDRED", "No", 0),
("AEGEAN NUMBER FOUR HUNDRED", "No", 0),
("AEGEAN NUMBER FIVE HUNDRED", "No", 0),
("AEGEAN NUMBER SIX HUNDRED", "No", 0),
("AEGEAN NUMBER SEVEN HUNDRED", "No", 0),
("AEGEAN NUMBER EIGHT HUNDRED", "No", 0),
("AEGEAN NUMBER NINE HUNDRED", "No", 0),
("AEGEAN NUMBER ONE THOUSAND", "No", 0),
("AEGEAN NUMBER TWO THOUSAND", "No", 0),
("AEGEAN NUMBER THREE THOUSAND", "No", 0),
("AEGEAN NUMBER FOUR THOUSAND", "No", 0),
("AEGEAN NUMBER FIVE THOUSAND", "No", 0),
("AEGEAN NUMBER SIX THOUSAND", "No", 0),
("AEGEAN NUMBER SEVEN THOUSAND", "No", 0),
("AEGEAN NUMBER EIGHT THOUSAND", "No", 0),
("AEGEAN NUMBER NINE THOUSAND", "No", 0),
("AEGEAN NUMBER TEN THOUSAND", "No", 0),
("AEGEAN NUMBER TWENTY THOUSAND", "No", 0),
("AEGEAN NUMBER THIRTY THOUSAND", "No", 0),
("AEGEAN NUMBER FORTY THOUSAND", "No", 0),
("AEGEAN NUMBER FIFTY THOUSAND", "No", 0),
("AEGEAN NUMBER SIXTY THOUSAND", "No", 0),
("AEGEAN NUMBER SEVENTY THOUSAND", "No", 0),
("AEGEAN NUMBER EIGHTY THOUSAND", "No", 0),
("AEGEAN NUMBER NINETY THOUSAND", "No", 0),
(),
(),
(),
("AEGEAN WEIGHT BASE UNIT", "So", 0),
("AEGEAN WEIGHT FIRST SUBUNIT", "So", 0),
("AEGEAN WEIGHT SECOND SUBUNIT", "So", 0),
("AEGEAN WEIGHT THIRD SUBUNIT", "So", 0),
("AEGEAN WEIGHT FOURTH SUBUNIT", "So", 0),
("AEGEAN DRY MEASURE FIRST SUBUNIT", "So", 0),
("AEGEAN LIQUID MEASURE FIRST SUBUNIT", "So", 0),
("AEGEAN MEASURE SECOND SUBUNIT", "So", 0),
("AEGEAN MEASURE THIRD SUBUNIT", "So", 0),
)
|
https://github.com/ivaquero/book-control | https://raw.githubusercontent.com/ivaquero/book-control/main/09-控制器设计.typ | typst | #import "@local/scibook:0.1.0": *
#show: doc => conf(
title: "控制器设计",
author: ("ivaquero"),
header-cap: "现代控制理论",
footer-cap: "github@ivaquero",
outline-on: false,
doc,
)
= 基本要求
<基本要求>
== 可控性
<可控性>
对闭环 LTI 系统（离散型）
$ 𝒙_(k + 1) = 𝑨 𝒙_k + 𝑩 𝒖_k $
可得
$
𝒙_n = mat(delim: "[", 𝑩, 𝑨 𝑩, ⋯, 𝑨^(n-1) 𝑩)
mat(delim: "[", u_(n-1); u_(n - 2); ⋮; u_0) = 𝑪 𝒐⋅𝒖
$
#theorem("可控性（controbility）")[
可控的充要条件是，控制矩阵$𝑪 𝒐$满秩。
]
#tip[
可控指点对点的可控。
]
== 稳定性
对开环 LTI 系统
$ dot(𝒙) = 𝑨 𝒙 $
令$λ = a + b i$为$𝑨$的特征值，有
- 若 Lyapunov 稳定，则$a≤0, b=0$
- 若渐近稳定，则$a < 0, b=0$
- 若$b≠0$则
- 必有共轭
- $b i$必引入振动
#tip[
简单说，$λ$决定收敛速度，若$∃ λ > 0$，则系统不稳定。
]
#theorem("Lyapunov 稳定性")[
原点（起始点）稳定，当且仅当
$ ∀t_0, ∀ɛ > 0, ∃δ(t_0, ɛ): |x(t_0)| < δ(t_0, ɛ) ⇒ ∀t ≥ t_0 med |x(t)| < ɛ $
]
#theorem("渐近稳定性")[
原点（起始点）渐近稳定，当且仅当其是一个稳定平衡点，同时
$ ∃ δ(t_0) > 0: quad norm(x(t_0)) < δ(t_0) ⇒ lim_(t → ∞) norm(x(t)) = 0 $
]
对闭环 LTI 系统
$ dot(𝒙) = 𝑨 𝒙 + 𝑩 𝒖 $
若$𝒖 = -k 𝒙$，则
$ dot(𝒙) = (𝑨 - 𝑩 k)𝒙 = 𝑨_("cl") 𝒙 $
此时，可通过调整$k$来调整$𝑨_("cl")$的特征值，从而控制系统的稳定性。
对传递函数
$ G(s) = frac(N(s), D(s)) = frac(∑_(i=1)^m (s - z_i), ∑_(j=1)^n (s - p_j)) $
- $N(s) = 0$时，$s_1 = z_1, z_2 = z_2, …$，称零点（zeros）
- $D(s) = 0$时，$s_1 = p_1, s_2 = p_2, …$，称极点（poles）
#tip[
BIBO 问题：输入有界（bounded input），则输出有界（bounded output）。
]
设
- $N(s) = 1$
- $D(s) = (s - p_1)(s - p_2)$
则输出
$
X(s) = 1⋅G(s) = frac(C_1, (s - p_1)) + frac(C_2, (s - p_2)) \
⇓ \
X(t) = ℒ^(-1)[X(s)] = C_1e^(p_1t) + C_2e^(p_2t)
$
对极点在复平面绘图，有如下结论
#figure(
image("images/model/signal-poles-zeros.png", width: 60%),
caption: "复平面的极点",
supplement: "图",
)
== 抽样要求
- 服从 Nyquist-Shannon 抽样定理
- (读取 + 计算 + 输出) 的总耗时 < 1 个周期
#theorem("Nyquist-Shannon 抽样定理")[
抽样有效性（重建原信号）需满足
抽样频率 ≥ 被采信号最高频率 × 2
]
#tip[
实际使用中，会选取 5～10 倍的频率进行抽样
]
对离散信号，通常使用保持器（hold）来保证其信号连续性
- 零阶保持：使输入在一个周期内不变
= 基于频率响应
如下闭环控制系统，其中
#block(
height: 3em,
columns(3)[
- $R(s)$：参考信号
- $C(s)$：控制器
- $G(s)$：系统传递函数
- $D(s)$：扰动函数
- $N(s)$：噪声函数
- $X(s)$：输出
],
)
#figure(
image("images/block/design-freq.drawio.png", width: 40%),
caption: "带有扰动和噪声的闭环控制系统",
supplement: [图],
)
可得
$
[R(s) -(X(s) + N(s))] C(s) G(s) + D(s) &= X(s)
$
整理得
$
underbrace(frac(C(s) G(s), 1 + C(s) G(s)), T(s)) (R(s) - N(s)) + underbrace(frac(1, 1 + C(s) G(s)), S(s)) D(s) = X(s)
$
这里，$S(s)$称灵敏度传递函数，$T(s)$称补偿灵敏度传递函数。
假设参考输入频率为$ω_R$，振幅为$M_R$；噪声频率为$ω_N$，振幅为$M_N$，扰动频率为$ω_D$，振幅为$M_D$，可得3个输入值
$
T(s) R(s) = |T(j ω_R)| M_R \
T(s) D(s) = |T(j ω_N)| M_N \
S(s) D(s) = |S(j ω_D)| M_D
$
我们的目标为使上述3个输出值分别趋近于，$M_R$、$0$、$0$，于是有
$
M_X = M_R
$
此时，3个振幅响应值如下
$
|T(j ω_R)| = 1 \
|T(j ω_N)| = 0 \
|S(j ω_D)| = 0
$
实际使用中，$ω_R$往往为低频常数，而来自传感器的$ω_N$往往为高频常数。此时，将$T(s)$设计为一个低通滤波器，即可解决噪声问题。对于扰动，需要做如下考虑。
由
$ T(s) = frac(C(s) G(s), 1 + C(s) G(s)) $
又假设$C(s) G(s) = a + b j$，可知
$
|T(j ω)| = frac(sqrt(a^2 + b^2), sqrt((1 + a)^2 + b^2)) ≤ 1
$
由灵敏度传递函数
$
S(j ω) = frac(1, 1 + C(s) G(s)) = frac(1, 1 + a + b j)
$
其振幅响应为
$
|S(j ω)| = frac(1, sqrt((1 + a)^2 + b^2)) ≤ 1
$
显然，$|T(j ω)|^2 + |S(j ω)|^2 ≈ 1$，即两者此消彼长。又因在实际使用中，$ω_D$往往也较小，这时可以需要设计$S(s)$为高通滤波器。也就是说，需要设计$C(s) G(s)$，使其在低频区幅度响应大，在高频区幅度响应小。
|
|
https://github.com/lkndl/typst-bioinfo-thesis | https://raw.githubusercontent.com/lkndl/typst-bioinfo-thesis/main/modules/template.typ | typst |
#import "styles.typ": *
// #import "headers.typ": *
#import "footers.typ": *
#import "figures.typ": *
#import "front-matter.typ": *
#import "back-matter.typ": *
#import "@preview/hydra:0.3.0": hydra
// These are the fields you can or
// should pass to the template function
#let default-args = arguments(
author: "nobody",
lang: "en",
title: none,
short-title: none,
translated-title: none,
date: datetime.today(),
degree: "bachelor",
german-abstract: [],
english-abstract: [],
supervisors: (),
advisors: (),
bibliography-file: none,
flavour: "info",
numbering-depth: 2,
pagination-align: "outside",
)
#let doc(..passed-args, body) = {
// merge into a single option namespace
let args = default-args.named() + passed-args.named()
if args.lang not in ("en", "de") {
panic([This template is set up for English "en" or German "de". If you want to use a different language, it's easiest to change all "de"-dependant code to your language, then delete/change this block. Maybe you want to make a pull request?])
}
if args.flavour not in ("info", "bioinfo") {
panic([Don't know this flavour: #flavour. If you did that on purpose, build an "#{args.flavour}-covers.typ" module that implements a "cover-page" and "title-page", then delete/change this block.])
}
if args.degree not in ("bachelor", "master") {
panic([This template is meant for "bachelor" or "master" theses. You passed #args.degree and that might turn out weird somewhere! Delete/change this block once you checked.])
}
args.Degree = [#box([#upper(args.degree.at(0))#args.degree.slice(1)])]
////////////////////////////////////////////////
// document setup
set document(
author: args.author,
title: args.short-title)
set page(
paper: "a4",
margin: (bottom: 3cm, rest: 2.5cm),
)
set text(
font: "Helvetica Neue",
size: 12pt,
lang: args.lang,
)
set par(justify: true, leading: .88em)
set block(above: 8pt, below: 24pt)
// define the `code` font style
show raw: set text(..raw-style)
// sans-serif and equal-width font for math
show math.equation: set text(font: "Fira Math")
show: heading-styles.with(args.lang, args.numbering-depth)
show: caption-styles.with(supplement-position: "left")
// show: header-styles
////////////////////////////////////////////////
// actual document content starts here
// The front matter:
make-cover(args)
set page(numbering: "i", footer: [])
make-title(args)
set page(footer: get-pagination(args.pagination-align))
declare-page(args)
abstract(
args.german-abstract, args.english-abstract)
// totally optional:
// acknowledgements(args.lang, [Thanks everyone!], title: "thx")
table-of-contents(args.lang, simple: true)
////////////////////////////////////////////////
// some more main body setup
set page(
header: locate(loc => {
if calc.even(loc.page()) {
// this is overkill; for demonstration
emph[#hydra(1, loc: loc)#h(1fr)#args.author #sym.dot #args.short-title]
} else {
emph[#h(1fr)#hydra(2, loc: loc)]
}
}),
// footer: get-pagination(args.pagination-align)
)
// the intro maybe should start on a right-hand side, but in any case the right-hand pages must be "odd"!
pagebreak(to: "odd")
//empty-page()
set page(numbering: "1")
counter(page).update(1)
// *now* fix the show rule to require a pagebreak before any new chapter, until https://github.com/typst/typst/issues/2841 is resolved
show heading.where(level: 1): it => pagebreak(weak: true) + headingspaced(it)
// The main content
body
////////////////////////////////////////////////
// The back matter
// pagebreak(to: "odd") now won't work! until https://github.com/typst/typst/issues/2841 is resolved just fix it by inserting an empty page
// empty-page()
// continue the front matter page counter
set page(numbering: "i")
continue-page-counter-from(<toc-end>, shift: none)
references(bibliography-file: args.bibliography-file, lang: args.lang)
list-of-figures(args.lang)
list-of-tables(args.lang)
} |
|
https://github.com/LDemetrios/Typst4k | https://raw.githubusercontent.com/LDemetrios/Typst4k/master/src/test/resources/suite/layout/grid/rtl.typ | typst | // Test RTL grid.
--- list-rtl ---
#set text(dir: rtl)
- מימין לשמאל
--- grid-rtl ---
#set text(dir: rtl)
#table(columns: 2)[A][B][C][D]
--- grid-rtl-colspan ---
// Test interaction between RTL and colspans
#set text(dir: rtl)
#grid(
columns: 4,
fill: (x, y) => if calc.odd(x + y) { blue.lighten(50%) } else { blue.lighten(10%) },
inset: 5pt,
align: center,
grid.cell(colspan: 4)[*Full Header*],
grid.cell(colspan: 2, fill: orange)[*Half*],
grid.cell(colspan: 2, fill: orange.darken(10%))[*Half*],
[*A*], [*B*], [*C*], [*D*],
[1], [2], [3], [4],
[5], grid.cell(colspan: 3, fill: orange.darken(10%))[6],
grid.cell(colspan: 2, fill: orange)[7], [8], [9],
[10], grid.cell(colspan: 2, fill: orange.darken(10%))[11], [12]
)
#grid(
columns: 4,
fill: (x, y) => if calc.odd(x + y) { blue.lighten(50%) } else { blue.lighten(10%) },
inset: 5pt,
align: center,
gutter: 3pt,
grid.cell(colspan: 4)[*Full Header*],
grid.cell(colspan: 2, fill: orange)[*Half*],
grid.cell(colspan: 2, fill: orange.darken(10%))[*Half*],
[*A*], [*B*], [*C*], [*D*],
[1], [2], [3], [4],
[5], grid.cell(colspan: 3, fill: orange.darken(10%))[6],
grid.cell(colspan: 2, fill: orange)[7], [8], [9],
[10], grid.cell(colspan: 2, fill: orange.darken(10%))[11], [12]
)
--- grid-rtl-colspan-stroke ---
#set text(dir: rtl)
#table(
columns: 4,
fill: (x, y) => if calc.odd(x + y) { blue.lighten(50%) } else { blue.lighten(10%) },
inset: 5pt,
align: center,
table.cell(colspan: 4)[*Full Header*],
table.cell(colspan: 2, fill: orange)[*Half*],
table.cell(colspan: 2, fill: orange.darken(10%))[*Half*],
[*A*], [*B*], [*C*], [*D*],
[1], [2], [3], [4],
[5], table.cell(colspan: 3, fill: orange.darken(10%))[6],
table.cell(colspan: 2, fill: orange)[7], [8], [9],
[10], table.cell(colspan: 2, fill: orange.darken(10%))[11], [12]
)
#table(
columns: 4,
fill: (x, y) => if calc.odd(x + y) { blue.lighten(50%) } else { blue.lighten(10%) },
inset: 5pt,
align: center,
gutter: 3pt,
table.cell(colspan: 4)[*Full Header*],
table.cell(colspan: 2, fill: orange)[*Half*],
table.cell(colspan: 2, fill: orange.darken(10%))[*Half*],
[*A*], [*B*], [*C*], [*D*],
[1], [2], [3], [4],
[5], table.cell(colspan: 3, fill: orange.darken(10%))[6],
table.cell(colspan: 2, fill: orange)[7], [8], [9],
[10], table.cell(colspan: 2, fill: orange.darken(10%))[11], [12]
)
--- grid-rtl-multiple-regions ---
// Test multiple regions
#set page(height: 5em)
#set text(dir: rtl)
#grid(
stroke: red,
fill: aqua,
columns: 4,
[a], [b], [c], [d],
[a], grid.cell(colspan: 2)[e, f, g, h, i], [f],
[e], [g], grid.cell(colspan: 2)[eee\ e\ e\ e],
grid.cell(colspan: 4)[eeee e e e]
)
--- grid-rtl-vline-position ---
// Test left and right for vlines in RTL
#set text(dir: rtl)
#grid(
columns: 3,
inset: 5pt,
grid.vline(stroke: red, position: left), grid.vline(stroke: green, position: right), [a],
grid.vline(stroke: red, position: left), grid.vline(stroke: 2pt, position: right), [b],
grid.vline(stroke: red, position: left), grid.vline(stroke: 2pt, position: right), [c],
grid.vline(stroke: aqua, position: right)
)
#grid(
columns: 3,
inset: 5pt,
gutter: 3pt,
grid.vline(stroke: green, position: left), grid.vline(stroke: red, position: right), [a],
grid.vline(stroke: blue, position: left), grid.vline(stroke: red, position: right), [b],
grid.vline(stroke: blue, position: left), grid.vline(stroke: red, position: right), [c],
grid.vline(stroke: 2pt, position: right)
)
#grid(
columns: 3,
inset: 5pt,
grid.vline(stroke: green, position: start), grid.vline(stroke: red, position: end), [a],
grid.vline(stroke: 2pt, position: start), grid.vline(stroke: red, position: end), [b],
grid.vline(stroke: 2pt, position: start), grid.vline(stroke: red, position: end), [c],
grid.vline(stroke: 2pt, position: start)
)
#grid(
columns: 3,
inset: 5pt,
gutter: 3pt,
grid.vline(stroke: green, position: start), grid.vline(stroke: red, position: end), [a],
grid.vline(stroke: blue, position: start), grid.vline(stroke: red, position: end), [b],
grid.vline(stroke: blue, position: start), grid.vline(stroke: red, position: end), [c],
grid.vline(stroke: 2pt, position: start)
)
--- grid-rtl-vline-out-of-bounds ---
// Error: 3:8-3:34 cannot place vertical line at the 'end' position of the end border (x = 1)
// Hint: 3:8-3:34 set the line's position to 'start' or place it at a smaller 'x' index
#set text(dir: rtl)
#grid(
[a], grid.vline(position: left)
)
--- grid-rtl-complex ---
#set text(dir: rtl)
#grid(
columns: 4,
fill: (x, y) => if calc.odd(x + y) { blue.lighten(50%) } else { blue.lighten(10%) },
inset: 5pt,
align: center,
grid.cell(rowspan: 2, fill: orange)[*Left*],
[Right A], [Right A], [Right A],
[Right B], grid.cell(colspan: 2, rowspan: 2, fill: orange.darken(10%))[B Wide],
[Left A], [Left A],
[Left B], [Left B], grid.cell(colspan: 2, rowspan: 3, fill: orange)[Wide and Long]
)
#table(
columns: 4,
fill: (x, y) => if calc.odd(x + y) { blue.lighten(50%) } else { blue.lighten(10%) },
inset: 5pt,
align: center,
gutter: 3pt,
table.cell(rowspan: 2, fill: orange)[*Left*],
[Right A], [Right A], [Right A],
[Right B], table.cell(colspan: 2, rowspan: 2, fill: orange.darken(10%))[B Wide],
[Left A], [Left A],
[Left B], [Left B], table.cell(colspan: 2, rowspan: 3, fill: orange)[Wide and Long]
)
--- grid-rtl-rowspan ---
#set page(height: 10em)
#set text(dir: rtl)
#table(
columns: 2,
rows: (auto, auto, 3em),
row-gutter: 1em,
fill: red,
[a], table.cell(rowspan: 3, block(width: 50%, height: 10em, fill: orange) + place(bottom)[*ZD*]),
[e],
[f]
)
--- grid-rtl-header ---
// Headers
#set page(height: 15em)
#set text(dir: rtl)
#table(
columns: 5,
align: center + horizon,
table.header(
table.cell(colspan: 5)[*Cool Zone*],
table.cell(stroke: red)[*N1*], table.cell(stroke: aqua)[*N2*], [*D1*], [*D2*], [*Etc*],
table.hline(start: 2, end: 3, stroke: yellow)
),
..range(0, 10).map(i => ([\##i], table.cell(stroke: green)[123], table.cell(stroke: blue)[456], [789], [?], table.hline(start: 4, end: 5, stroke: red))).flatten()
)
|
|
https://github.com/OrangeX4/typst-sympy-calculator.typ | https://raw.githubusercontent.com/OrangeX4/typst-sympy-calculator.typ/main/README.md | markdown | MIT License | # typst-sympy-calculator.typ
```typst
#import "typst-sympy-calculator.typ": *
// set variances
#let a = 1
#let b = $a + 1$
// define accents
#let acc(x) = math.accent(x, math.grave)
// define operators
#let add = math.op("add")
#let f = math.op("f")
// define symbols
#let xy = math.italic("xy")
#let mail = symbol("🖂", ("stamped", "🖃"),)
#let hidden(content) = {}
// matrix
#let cmat(..args) = {
let mat = if (type(args.pos().at(0)) != "array") { (args.pos(),) } else { args.pos() }
let mat_t = ()
for j in range(mat.at(0).len()) {
mat_t.push(())
for i in range(mat.len()) {
mat_t.at(j).push(mat.at(i).at(j))
}
}
math.mat(..mat_t)
}
#let derivative(expr, var) = $(dif)/(dif var) expr$
```
"typst-calculator":
```typst-calculator
@func_mat()
def convert_cmat(matrix):
return sympy.Matrix(matrix).T
@func()
def convert_derivative(expr, var):
return sympy.Derivative(expr, var)
```
There are decorators: `operator, relation_op, additive_op, mp_op, postfix_op, reduce_op, func, func_mat, constant`
|
https://github.com/andymeneely/examify.typst | https://raw.githubusercontent.com/andymeneely/examify.typst/master/README.md | markdown | MIT License | # `exam` Typst Package
A collection of methods to help you build exams!
* Keep a catalog of your questions in separate files!
* Add up the points automatically using `#points()` and `total_points()`!
* Count your questions automatically with `#num_questions()`!
* Do `#fill_in_blank()` questions, with answer key
* A regular `#blank()` for names and stuff
* A `#correct(content)` method to highlight multiple choice
* A `#solution()` box that's blank on the student version and shows your solution in the answer key
* Build your answer key by adding a `<show_solutions>` label.
* A `#choices()` block for numbered lists
* Questions don't break across pages because of `#question[]`!
* Questions take up the same amount of space as their solutions, so your page numbers remain the same when grading!
* A workflow that has worked for actual college exams for over a decade!
Inspired by LaTeX's `exam.cls` template and [tutor](https://github.com/rangerjo/tutor)
# Installation
TBD...
# Usage
## Quick Example
```typst
#import "@local/exam:0.1.0": *
= Final Exam, #total_points() points and #num_questions() questions
<show_solutions> //comment out for student version
Name: #blank(4cm)
#question[
#points(2)
Hello, #fill_in_blank(3cm, [world!])
]
#question[
#points(3)
Speak friend and enter.
#solution(height: 0.5cm, [melloch])
]
#question[
#points(2)
#choices[
+ #correct[Right]
+ Wrong
]
]
```
This example lives in [examples/quick](examples/quick).
## Full Example
We recommend a file structure that looks like this.
```
├── example_exam.typ
├── example_exam_solutions.typ
└── questions
├── .gitignore
├── hello_world.typ
└── lorem_ipsum.typ
```
Your solutions file should just `include` your main file, and include the `<show_solutions>` label. Like this:
```typst
#include "example_exam.typ"
<show_solutions>
```
And then your main file looks something like:
```
#import "@local/exam:0.1.0": *
#import "./questions/hello_world.typ" as hello_world
#hello_world
```
This allows you to **automatically build two PDFs** without a build system.
This example lives in [examples/full](examples/full).
# API
* `blank(len)` - draws a horizontal line for writing an answer
* `choices(content)` - numbered lists in this method are separated a little and numbered like `"A."`
* `correct(content)` - places a rectangle around the content when solutions are on. Useful for multiple choice questions.
* `cover_sheet(content)` - centered content, headings are bold
* `fill_in_blank(len, answer_content)` - draws a horizontal line for writing an answer, or with solutions enabled, shows the answer
* `num_questions()` - counts the total number of `question()` calls in the entire document.
* `points(num)` - assign points to a question and renders the string, with pluralization. The `total_points()` adds up all instances of these throughout the document
* `question(content)` - Separate numbering from headings. Group all your content for a given question here and it won't break across pages (i.e. include solutions and blanks).
* `showing_solutions(location)` - (internal use) Returns boolean of whether or not solutions are enabled
* `sub_points(num)` - renders the string, with pluralization(and does nothing else). Has no impact on `points()` and `total_points()`.
* `sub_question(content)` - Restarts numbering within the question, and indents a little.
* `total_points()` - adds up all `points()` calls in the entire document.
# Is this actually useful?
Yes! I'm a college professor and I've used the `exam.cls` pacakge for over a decade now on hundreds and hundreds of paper exams. I have a massive library of questions, and I just include each file as needed for the exams - much like the "full" example above.
This approach works beautifully for a variety of reasons:
* I have my questions in one place so I can correct and improve them.
* I can have comments in the question file about how the question went (e.g. `// Fall 2023: a lot of people missed this!`)
* Being text-friendly I can put it all in version control
* It looks nice and professional.
The only problem is that I'm so very very sick of LaTeX. So now I'm trying out Typst!
# Known Issues
* This package is not guaranteed to get you tenure
* You'll need to actually know the answers to the questions you ask |
https://github.com/piepert/philodidaktik-hro-phf-ifp | https://raw.githubusercontent.com/piepert/philodidaktik-hro-phf-ifp/main/src/parts/ephid/descartes/denkendes_ding.typ | typst | Other | #import "/src/template.typ": *
#let med(page) = en[Vgl. <NAME>: AT VII. S. #page.]
== Der Mensch als denkendes Ding
Im #ix("cogito-Argument") stellt #ix("Descartes", "<NAME>") fest, dass er selbst notwendigerweise ist, solange er den Satz "Ich bin, ich existiere." ausspricht oder denkt. Darauffolgend wird untersucht, was denn nun dieses Ding sei, dass diesen Gedanken fasst. Dazu geht #ix("Descartes", "<NAME>") auch hier radikal vor: alles, was täuschen könnte, wie seine Kleidung und seine körperliche Gestalt, werden auch hier vernachlässigt.#med[26 f] Was er feststellt ist, dass das Denken nicht von ihm, dem Denker, getrennt werden kann.#med[27] Also stellt Descartes fest: "Aber was bin ich also? Ein denkendes Ding."#en[<NAME>: AT VII. S. 28.]
#set par(justify: false)
#grid(columns: (10%, 45%, 45%).map(e => e - 1.5em),
row-gutter: 1em,
column-gutter: 1.5em,
strong[Stufe], strong[Thema im Rahmenplan], strong[Thema bei Descartes],
[5], align(center + horizon)[/], align(center + horizon)[/],
[6], [
- *Der Leib*: Wie nehme ich meinen Leib wahr?#en[Vgl. @MBWKMV1996_RP56[S. 23]]
- *Der Leib*: Wo sind die Gedanken?#en[Vgl. @MBWKMV1996_RP56[S. 23]]
], [
- Gehört mein Körper zu mir? Machen mich seine Erfahrungen aus? -- der Mensch als Lebewesen vs. der Mensch als denkendes Ding
],
[7], [
- *Denken und Sprache:* Können Tiere denken?#en[Vgl. @MBWKMV2002_RP710[S 23]]
], [
- Das denken ist dem Mensch eigentümlich. Die Sprache auch? Können nur Lebwesen denken, die auch sprechen können?
],
[8/9], [
- *Ich-Identität:* Was kann ich überhaupt von mir wissen?#en[Vgl. @MBWKMV2002_RP710[S. 27]]
], [
- Wie hilfreich ist Descartes Feststellung, dass ich ein denkendes Ding bin? Was sagt das über mich aus? Vernachlässigt man die Problematik des Fremdpsychischen, was sagt es dann über alle Menschen aus?
],
[10], [
- *Vorstellungen vom Weiterleben nach dem Tod:* Welche Vorstellungen verbergen sich hinter dem Begriff "Seele"?#en[Vgl. @MBWKMV2002_RP710[S. 39]]
], [
- Wie ähnlich und kontrastierend ist Descartes Vorstellung von sich selbst und dem Begriff "Seele"?
],
[11/12], [
- *Subjekt:* Differenzierung des Begriffsfeldes Subjekt und Gesellschaft#en[Vgl. @MBWKMV2019_RP1112[S. 26]]
], [
- Abgrenzung der Außenwelt vom Selbst; Was gehört zu mir?
],
[], [
- *Erkenntnis:* dialektische Auseinandersetzung mit Thesen zur menschlichen Erkenntnis, Rationalismus#en[Vgl. @MBWKMV2019_RP1112[S. 12]]
], [
- Denken und Vernunft als reine Methode der Erkenntnis
]) |
https://github.com/gaetanserre/Typst-templates | https://raw.githubusercontent.com/gaetanserre/Typst-templates/main/paper/1.0.0/paper.typ | typst | /*
* Created in 2023 by <NAME>
*/
// Utils functions
#let TODO(it) = {
text(fill: red, weight: "extrabold", [TODO #it])
}
#let link_note(url, text) = {
link(url)[#text] + footnote(link(url))
}
/***********************************MATHS ENVIRONMENT*********************************************/
/*************************************************************************************************/
#let heading_count = counter(heading)
#let math_block(supplement, name, it, lb, stroke_color, eq_numbering) = {
let counter = counter(supplement)
counter.step()
let body = {
set math.equation(numbering: eq_numbering)
if name == none {
[*#supplement #counter.display().* ] + it
} else {
[*#supplement #counter.display() * (#emph(name)). ] + it
}
}
let fig = figure(
rect(
width:100%,
stroke: ("left": 1pt+stroke_color, "rest": none),
fill: rgb("#eeeeee"),
inset: (bottom: 10pt, rest: 5pt),
align(left, body)
),
caption: none,
kind: supplement,
supplement: supplement,
)
if lb != none [
#fig
#label(lb)
] else [
#fig
]
}
// Math blocks
#let lemma(name, it, label: none, eq_numbering: none) = math_block("Lemma", name, it, label, rgb("#b287a3"), eq_numbering)
#let proposition(name, it, label: none, eq_numbering: none) = math_block("Proposition", name, it, label, rgb("#b1255d"), eq_numbering)
#let theorem(name, it, label: none, eq_numbering: none) = math_block("Theorem", name, it, label, rgb("#5f072a"), eq_numbering)
#let corollary(name, it, label: none, eq_numbering: none) = math_block("Corollary", name, it, label, rgb("#ffc300"), eq_numbering)
#let definition(name, it, label: none, eq_numbering: none) = math_block("Definition", name, it, label, rgb("#bfb1c1"), eq_numbering)
#let remark(name, it, label: none, eq_numbering: none) = math_block("Remark", name, it, label, rgb("#8380b6"), eq_numbering)
#let example(it, label: none, eq_numbering: none) = math_block("Example", none, it, label, rgb("#9bc4cb"), eq_numbering)
#let proof(it) = {
block(
width: 90%,
align(left, [_Proof._ $space$] + it + align(right, text()[$qed$]))
)
}
/*********************************ALGORITHM ENVIRONMENT*******************************************/
/*************************************************************************************************/
#let code_block(
identifier: none,
comment: none,
content: [],
has_stroke: true,
inset: 1em
) = {
if comment == none {
identifier
} else {
[#identifier #box(width: 1fr, repeat(" ")) #text(fill: rgb("#6c6c6c"), style: "italic", comment)]
}
block(width: auto, above: 0.5em, below:0.5em, {
let stroke = ("left": 1pt, "rest": none)
if not has_stroke {
stroke = none
}
rect(
stroke: stroke,
outset: -0.1em,
inset: (right: 0em, rest: inset),
)[#content]
})
}
#let for_loop(
variable: "i",
start: "1",
end: "n",
comment: none,
content: [],
) = {
code_block(identifier: [*for* #variable $=$ #start *to* #end *do*], comment: comment, content: content)
[*end for*]
}
#let while_loop(
condition: "x",
comment: none,
content: [],
) = {
code_block(identifier: [*while* #condition *do*], comment: comment, content: content)
[*end while*]
}
#let if_block(
condition: "x",
comment: none,
content: [],
else_comment: none,
else_content: none,
) = {
code_block(identifier: [*if* #condition *then*], comment: comment, content: content)
if else_content != none {
code_block(identifier: [*else*], comment: else_comment, content: else_content)
}
[*end if*]
}
#let comment(content) = {
[#box(width: 1fr, repeat(" ")) #text(fill: rgb("#6c6c6c"), style: "italic", content)]
}
#let keyword(
keyword,
fill: black,
weight: "regular",
style: none
) = {
if style == none {
text(fill: fill, weight: weight, keyword)
} else {
style(keyword)
}
}
#let Return = keyword([return], weight: "bold")
#let Break = keyword([break], weight: "bold")
#let Continue = keyword([continue], weight: "bold")
#let algorithm(
name: none,
input: none,
output: none,
content: []
) = {
align(center,
block(width: auto, {
align(left, {
counter("algorithm").step()
//show line: set block(above: 0.4em, below: 0.4em)
set par(first-line-indent: 0em)
box(width: 1fr, line(length: 100%, stroke: {1.5pt + black})) + [ \ ]
[*Algorithm #counter("algorithm").display():* #smallcaps(name) \ ]
box(width: 1fr, line(length: 100%, stroke: {1pt + black})) + [ \ ]
if input != none {
[*Input:*]
align(center, block(width: 95%, above: 0.5em, below: 0.5em, align(left, input)))
}
if output != none {
[*Output:*]
align(center, block(width: 95%, above: 0.5em, below: 0.5em, align(left, output)))
}
if output != none or input != none {
box(width: 1fr, line(length: 100%, stroke: {1pt + black})) + [ \ ]
}
[#content \ ]
box(width: 1fr, line(length: 100%, stroke: {1pt + black}))
})
})
)
}
/*********************************LANGUAGE ENVIRONMENT*******************************************/
/*************************************************************************************************/
/***LEAN***/
// #let lean_font(cont) = text(font: "FiraCode Nerd Font", size: 9pt, cont)
#let lean_block(it) = {
/* set par(first-line-indent: 0em)
show par: set block(spacing: 0em)
set text(font: "FiraCode Nerd Font", size: 9pt)
let reg_comment = regex(`(\/-[^-/]*-\/)|(--.*)`.text)
let comment_matches = cont.matches(reg_comment)
let cont_without_comments = cont.split(reg_comment)
let print_comment(comment) = {
set par(first-line-indent: 0em)
show regex("[^\*]\*[^\*]+\*(\n | [^\*])"): set text(style: "italic", fill: black)
show regex("`.+`"): set text(fill: rgb("#ad7fa8"))
show regex("\*\*[^\*]+\*\*"): set text(weight: "bold", fill: black)
text(fill: rgb("#6a737d"), comment)
}
let print_code(code) = {
set par(first-line-indent: 0em)
show regex("(lemma|theorem|by|sorry|have|def|let|noncomputable|variable|with|example|fun|at|show|class|instance|where)(\s|$)"): set text(fill: rgb("#8b3fef"))
show regex("Type"): set text(fill: rgb("#8b3fef"))
show regex("(lemma|theorem|def|class)\s\w+"): set text(fill: rgb("#3475f5"))
show regex("\(|\[|\{|\}|\]|\)"): set text(fill: rgb("#d4244a"))
code
}
let n_comment = 0
let n_char = 0
let final_content = []
for i in range(cont_without_comments.len()) {
while (comment_matches.len() > n_comment and (comment_matches.at(n_comment).start == n_char or comment_matches.at(n_comment).start == 1)) {
final_content += print_comment(comment_matches.at(n_comment).text)
n_char += comment_matches.at(n_comment).text.len()
n_comment += 1
}
final_content += print_code(cont_without_comments.at(i))
n_char += cont_without_comments.at(i).len()
}
if (comment_matches.len() > n_comment) {
final_content += print_comment(comment_matches.at(n_comment).text)
} */
block(
width:100%,
stroke: ("left": 1pt+rgb("#d73a4a"), "rest": none),
fill: rgb("#eeeeee"),
inset: (bottom: 0.7em, rest: 0.5em),
align(left, raw(lang: "lean4", it))
)
}
#let config(
title: none,
subtitle: none,
header: none,
authors: none,
supervision: none,
abstract: none,
keywords: (),
first_page_nb: true,
logo: none,
doc,
) = {
// Odd-switching header function
let header_loc = none
if header != none {
header_loc = context {
let page_nb = counter(page).at(here()).at(0)
if page_nb == 1 {
none
} else if calc.rem(page_nb, 2) == 1 {
align(right, header)
} else {
if authors == none {
align(left, "<NAME>")
} else if authors.len() > 1 {
align(left, authors.at(0).name + " et al.")
} else {
align(left, authors.at(0).name)
}
}
}
}
let page_nb = {
if first_page_nb {
"1"
} else {
(..nums) => {
let nb = nums.pos().map(str).at(0)
if nb == "1" {
none
} else {
nb
}
}
}
}
// Set rules
set page(
paper: "a4",
header: header_loc,
numbering: page_nb,
background: context {
let page_nb = counter(page).at(here()).at(0)
if page_nb == 1 and logo != none {
logo
} else {
none
}
}
)
set par(justify: true, first-line-indent: 1em)
set text(font: "New Computer Modern")
set heading(numbering: (..nums) => {
nums.pos().map(str).join(".")
})
set math.equation(numbering: "(1)")
set cite(style: "chicago-author-date")
set terms(indent: 1em)
set list(marker: ("--", $arrow.r.curve$))
set enum(indent: 1em)
// Reference style
set ref(supplement: it => {
let fig = it.func()
if fig == math.equation {
text(fill: black, "Eq.")
}
else if fig == figure {
text(fill: black, it.supplement)
}
})
set outline(indent: true, fill: repeat([.$space$]))
set raw(theme: "catppuccin_latte.thTheme", syntaxes: "lean4.sublime-syntax")
// Show rules
show ref: set text(fill: rgb("#ff0000"))
show footnote: set text(fill: rgb("#ff0000"))
show link: set text(fill: rgb("#7209b7"))
show cite: set text(fill: rgb("#4361ee"))
show math.equation: set text(font: "New Computer Modern Math")
show raw: set text(font: "FiraCode Nerd Font")
// Algorithm & Lean figure
show figure: fig => {
if fig.kind == "algorithm" {
fig.body
} else if fig.kind == "leancode" {
counter(fig.kind).step()
fig.body + align(center, [#fig.supplement #counter(fig.kind).display(): #fig.caption])
} else {
fig
}
}
show heading: it => {
if it.body == [Bibliography] or it.body == [Contents] {
[#it.body \ \ ]
} else {
let heading_nb = counter(heading).display()
if it.level == 1 {
[\ \ #heading_nb $space$ #it.body\ \ ]
} else {
[\ #heading_nb $space$ #it.body\ ]
}
}
}
// Title & subtitle
align(center, {
text(16pt)[#title]
if subtitle != none {
text(14pt)[ \ #emph(subtitle)]
}
})
// Authors
if authors == none {
align(center, text(14pt)[
<NAME> \
<NAME> - ENS Paris-Saclay \
#text(font: "CMU Typewriter Text")[
#link("mailto:<EMAIL>")
]
])
} else {
for author in authors {
align(center, text(14pt)[
#author.name \
#author.affiliation \
#text(font: "CMU Typewriter Text")[
#link("mailto:" + author.email)
]
])
}
}
if supervision != none {
align(center,[
#supervision
])
}
// Abstract
let width_box_abstract = 80%
if abstract != none {
align(center, text()[*Abstract*])
align(center,
box(width:width_box_abstract,
align(left, text(size: 10pt)[
#abstract
])
)
)
}
// Keywords
align(center, box(width:width_box_abstract,
align(left, {
set text(size: 10pt)
if keywords.len() > 0 {
[*Keywords: *]
let last_keyword = keywords.pop()
for keyword in keywords {
[#keyword] + [; ]
}
[#last_keyword.]
}
})
))
doc
}
|
|
https://github.com/typst/packages | https://raw.githubusercontent.com/typst/packages/main/packages/preview/chronos/0.1.0/src/consts.typ | typst | Apache License 2.0 | #let Y-SPACE = 10
#let PAR-SPACE = 10
#let COMMENT-PAD = 8
#let LIFELINE-W = 10
#let CREATE-OFFSET = 15
#let DEFAULT-SLANT = 10
#let CROSS-TIP-SIZE = 4
#let CIRCLE-TIP-RADIUS = 3
#let SYM-GAP = 5
#let PAR-PAD = (5pt, 3pt)
#let ACTOR-WIDTH = 20
#let BOUNDARY-HEIGHT = 20
#let CONTROL-HEIGHT = 20
#let ENTITY-HEIGHT = 20
#let DATABASE-WIDTH = 24
#let COLLECTIONS-PAD = (5pt, 3pt)
#let COLLECTIONS-DX = 3
#let COLLECTIONS-DY = 3
#let QUEUE-PAD = (5pt, 3pt)
#let NOTE-PAD = (6, 3)
#let NOTE-CORNER-SIZE = 6
#let NOTE-GAP = 3
#let NOTE-HEX-PAD = (6, 8)
#let COL-DESTRUCTION = rgb("#A80238")
#let COL-GRP-NAME = rgb("#EEEEEE")
#let COL-SEP-NAME = rgb("#EEEEEE")
#let COL-NOTE = rgb("#FEFFDD") |
https://github.com/ScaleXY/pp03-laravel-typst | https://raw.githubusercontent.com/ScaleXY/pp03-laravel-typst/main/README.md | markdown | MIT License | # Laravel package to use typst
[](https://packagist.org/packages/scalexy/laravel-typst)
[](https://github.com/scalexy/laravel-typst/actions?query=workflow%3Arun-tests+branch%3Amain)
[](https://github.com/scalexy/laravel-typst/actions?query=workflow%3A"Fix+PHP+code+style+issues"+branch%3Amain)
[](https://packagist.org/packages/scalexy/laravel-typst)
This is where your description should go. Limit it to a paragraph or two. Consider adding a small example.
## Support us
[<img src="https://github-ads.s3.eu-central-1.amazonaws.com/laravel-typst.jpg?t=1" width="419px" />](https://spatie.be/github-ad-click/laravel-typst)
We invest a lot of resources into creating [best in class open source packages](https://spatie.be/open-source). You can support us by [buying one of our paid products](https://spatie.be/open-source/support-us).
We highly appreciate you sending us a postcard from your hometown, mentioning which of our package(s) you are using. You'll find our address on [our contact page](https://spatie.be/about-us). We publish all received postcards on [our virtual postcard wall](https://spatie.be/open-source/postcards).
## Installation
You can install the package via composer:
```bash
composer require scalexy/laravel-typst
```
You can publish and run the migrations with:
```bash
php artisan vendor:publish --tag="laravel-typst-migrations"
php artisan migrate
```
You can publish the config file with:
```bash
php artisan vendor:publish --tag="laravel-typst-config"
```
This is the contents of the published config file:
```php
return [
];
```
Optionally, you can publish the views using
```bash
php artisan vendor:publish --tag="laravel-typst-views"
```
## Usage
```php
$laravelTypst = new ScaleXY\LaravelTypst();
echo $laravelTypst->echoPhrase('Hello, ScaleXY!');
```
## Testing
```bash
composer test
```
## Changelog
Please see [CHANGELOG](CHANGELOG.md) for more information on what has changed recently.
## Contributing
Please see [CONTRIBUTING](CONTRIBUTING.md) for details.
## Security Vulnerabilities
Please review [our security policy](../../security/policy) on how to report security vulnerabilities.
## Credits
- [<NAME>](https://github.com/Athuli7)
- [All Contributors](../../contributors)
## License
The MIT License (MIT). Please see [License File](LICENSE.md) for more information.
|
https://github.com/typst/packages | https://raw.githubusercontent.com/typst/packages/main/packages/preview/salsa-dip/0.1.0/lib.typ | typst | Apache License 2.0 | #let pin-number-text(settings, s) = align(center + horizon, text(settings.pin-number-size)[#s])
#let pin-label-text(settings, s) = text(settings.pin-label-size)[#s]
#let pin-num-left(settings, s) = align(center, rotate(90deg, reflow: true)[#pin-number-text(settings, s)])
#let pin-num-right(settings, s) = align(center, rotate(-90deg, reflow: true)[#pin-number-text(settings, s)])
#let order(settings, lst) = if settings.side == left { lst } else { lst.rev() }
#let for-numbering(settings, v) = if settings.include-number { (v,) } else { () }
#let render-number(settings, index) = align(horizon, if settings.side == left {pin-num-left(settings, index + 1)} else {pin-num-right(settings, index + 1)})
#let pin-number-size(settings) = if settings.include-number { settings.pin-number-size + settings.pin-number-margin } else { 0in }
#let pin(settings, index, label) = box(
width: settings.width, height: settings.height,
)[
#grid(
inset: if settings.include-number { 0in } else { settings.pin-number-margin },
columns: order(settings, (for-numbering(settings, pin-number-size(settings)) + (settings.width - pin-number-size(settings),))),
rows: (settings.height),
..order(settings, (for-numbering(settings, render-number(settings, index)) +
(align(horizon + settings.side, pin-label-text(settings, label)),)))
)
]
#let default-settings(settings, side, width) = (
width: width/2,
height: settings.at("pin-spacing", default: 0.1in),
side: side,
include-number: settings.at("include-number", default: true),
pin-number-margin: settings.at("pin-number-margin", default: 0.5pt),
pin-number-size: settings.at("pin-number-size", default: 2pt),
pin-label-size: settings.at("pin-label-size", default: 3pt))
#let dip-chip-label(count, width, labeling, chip-label, settings: ("": 0)) = rect(inset: 0in, stroke: 0.2pt,
box(width: width, height: settings.at("vertical-margin", default: 0.04in) + count / 2 * settings.at("pin-spacing", default: 0.1in))[
#align(horizon,
grid(
gutter: 0in,
// stroke: 0.2pt + rgb(red),
columns: (width/2, 0in, width/2),
rows: (auto),
grid(
gutter: 0in,
rows: (settings.at("pin-spacing", default: 0.1in),),
..range(int(count/2)).map(v => pin(default-settings(settings, left, width), v, labeling.at(v, default: "")))
),
align(horizon, rotate(-90deg, align(center, text(settings.at("chip-label-size", default: 3pt))[#chip-label]))),
grid(
gutter: 0in,
rows: (settings.at("pin-spacing", default: 0.1in),),
..range(int(count/2), count).map(v => pin(default-settings(settings, right, width), v, labeling.at(v, default: ""))).rev()
)
))
]
)
|
https://github.com/kiwiyou/algorithm-lecture | https://raw.githubusercontent.com/kiwiyou/algorithm-lecture/main/basic/04-search.typ | typst | #import "@preview/cetz:0.1.2"
#import "@preview/algorithmic:0.1.0"
#import "../slide.typ"
#show: slide.style
#show link: slide.link
#show footnote.entry: slide.footnote
#let algorithm(..args) = text(font: ("linux libertine", "Pretendard"), size: 17pt)[#algorithmic.algorithm(..args)]
#let func(body) = text(font: ("linux libertine", "Pretendard"))[#smallcaps[#body]]
#align(horizon + center)[
= 알고리즘 기초 세미나
04: 탐색
#text(size: 0.8em)[
연세대학교 전우제#super[kiwiyou] \
2024.05.23.r1
]
]
#slide.slide[탐색][
- 자료구조에서 자료의 위치를 찾는 것
- 자료구조 내 모든 원소를 보는 전략: $cal(O)(N)$
- 특히 선형 자료구조의 경우는 *선형 탐색*
]
#slide.slide[이분 탐색][
- *정렬된* 선형 자료구조에서 빠르게 탐색
- 찾으려는 원소 $x$와 모든 원소 $a_i$에 대해서 셋 중 하나가 성립
- $x < a_i$
- $x = a_i$
- $x > a_i$
- $x != a_i$라면 찾으려는 자료 $a_j$는 $j < i$와 $j > i$ 둘 중 하나
- 찾는 구간을 반씩 줄일 수 있음
- $2^f(N) >= N$에서, $f(N) = cal(O)(log_2 N) = cal(O)(log N)$
#pagebreak()
#algorithm({
import algorithmic: *
Function([Binary-Search], args: ($A$, $x$), {
Assign[$l$][0]
Assign[$r$][#FnI[len][$A$]]
While(
cond: $l < r$, {
Assign[$m$][#FnI[midpoint][$l$, $r$]]
If(
cond: $A[m] < x$,
Assign[$l$][$m + 1$]
)
ElseIf(
cond: $A[m] = x$,
Return[$m$]
)
Else(
Assign[$r$][$m$]
)
}
)
})
})
- `while` 안에서 변하지 않는 속성(불변량) 찾기
#pagebreak()
- 빈출 유형
- 배열의 정렬 상태를 유지하면서 주어진 값 $x$가 삽입될 수 있는 위치 찾기
- $x$ 이상/이하/초과/미만의 최소/최대 원소 찾기
- 헷갈리지 않으려면 이후에 나올 일반화 부분 참고
- $x$가 배열 $A$에 존재할 것이라는 보장이 없음
#pagebreak()
#h(0pt)
#algorithm({
import algorithmic: *
Function([Binary-Search], args: ($A$, $x$), {
Assign[$l$][0]
Assign[$r$][#FnI[len][$A$]]
While(
cond: $l < r$, {
Assign[$m$][#FnI[midpoint][$l$, $r$]]
If(
cond: $A[m] < x$,
Assign[$l$][$m + 1$]
)
Else(
Assign[$r$][$m$]
)
}
)
Cmt[$l = r$]
Return[$l$]
})
})
- 무한루프를 피할 수 있을까?
]
#slide.slide[이분 탐색의 일반화][
- 값을 찾는 구간이 `true`와 `false`로만 이루어진 대형 배열이라고 생각하기
- `true` `true` ... `true` `false` `false` ... `false` 에서 첫 `false`의 위치를 찾음
#align(center + horizon)[
#cetz.canvas({
import cetz.draw: *
rect((0, 0), (1.5 * 4, 1.5), stroke: none, fill: rgb(0%, 100%, 0%, 20%))
rect((1.5 * 4, 0), (1.5 * 10, 1.5), stroke: none, fill: rgb(100%, 0%, 0%, 20%))
grid((0, 0), (1.5 * 10, 1.5), step: 1.5)
line((1.5 * 4.5, -1.5), (1.5 * 4.5, -0.5), mark: (end: ">"))
})
]
#pagebreak()
#h(0pt)
#algorithm({
import algorithmic: *
Function([Partition-Point], args: ($f$, $min$, $max$), {
Assign[$l$][$min$]
Assign[$r$][$max$]
While(
cond: $l < r$, {
Assign[$m$][#FnI[midpoint][$l$, $r$]]
If(
cond: $f(m)$,
Assign[$l$][$m + 1$]
)
Else(
Assign[$r$][$m$]
)
}
)
Cmt[$l = r$]
Return[$l$]
})
})
]
#slide.slide[과제][
- #slide.problem("26258", "다중 일차 함수")
- #slide.problem("27968", "사사의 사차원 사탕 봉지")
- #slide.problem("28103", "대회 상품 정하기")
]
#slide.slide[매개 변수 탐색][
- 조건을 만족하는 최솟값을 구하는 문제
- 최솟값으로 접근해가는 방법이 명확하게 떠오르지 않을 때
- 답이 단조성\*을 띨 때 사용 가능
- 답을 변수 $x$로 두고 조건을 만족하는지 / 만족하지 않는지로 이분 탐색
- 조건 판정에 $cal(O)(f(N))$ 시간이 걸릴 때 $cal(O)(f(N) log X)$ 시간
]
#slide.slide[과제][
- #slide.problem("15810", "풍선 공장")
- #slide.problem("2805", "나무 자르기")
- #slide.problem("27977", "킥보드로 등교하기")
]
|
|
https://github.com/MrLadas/resume | https://raw.githubusercontent.com/MrLadas/resume/main/src/resume.typ | typst | #import "template.typ": *
#show: doc => conf(
doc,
)
== Skills
#chiline()
#skills_block(
("Penetration Testing", "Incident Response", "Cloud Security","Infrastructure Automation", "Container Orchestration","Python")
)
== Education
#chiline()
#degree(
"The University of Tulsa",
"Bachelor of Science in Cyber Security",
"Expected May 2025"
)
== Professional Experience
#chiline()
#entry(
"IBM X-Force Red",
"Hacker Intern",
"May-August 2024",
(
"Shadowed experienced testers on web application and internal penetration tests",
"Participated in comprehensive training covering network, web application, cryptography, container, social engineering, and mobile application testing",
"Conducted research on penetration test data, contributing to the development of internal tooling. Presented findings to IBM executives."
)
)
#entry(
"OneOK",
"Security Analyst",
"Aug 2023 - May 2024",
(
"Conducted monitoring and response to potential security events, assisting in the revision of processes to enhance efficiency.",
"Assisted cross-training Security Operations Center personnel on security tools and response procedures.",
"Contributed to the development of documentation for tools and procedures."
)
)
#entry(
"<NAME>",
"Cyber Security Intern",
"May 2023 - Aug 2023",
(
"Assisted planning SIEM migration project resulting in an actionable implementation plan.",
"Assessed security baseline of Microsoft 365 implementation and provided remediation guidance.",
"Developed new and revised existing documentation to facilitate team utilization of security tool sets."
)
)
#entry(
"University of Tulsa IT Security",
"Security Operations Center Analyst",
"Mar 2022 - May 2024",
(
"Monitored university systems and applications for security threats to protect users and university confidential data.",
"Assist in the deployment and evaluation of security tooling.",
"Perform vulnerability scans and vulnerability assessments to identify risks."
)
)
#entry(
"United States Marine Corps",
"Sergeant, Combat Engineer Squad Leader",
"Aug 2014 - Dec 2021",
(
"Lead construction operations in Syria.",
"Managed teams of diverse skill sets and technical backgrounds to ensure projects were finished on time and within resource restrictions.",
"Advised senior leaders as a subject matter expert, on the deployment of specialized assets."
)
)
#pagebreak(weak: true)
== Certifications
#chiline()
#cert(
(
"CompTIA Security+",
"AWS Certified Cloud Practitioner",
"MS Azure Fundamentals"
)
)
== Extracurricular
#chiline()
#entry(
"Root66Tulsa Cyber Clubs",
"President/Member",
"Jan 2022 - Present",
(
"Organized and led weekly meetings, workshops, and events tailored to the development of cybersecurity skills.",
"Coordinated filling competition teams and training for competitions."
)
)
#entry(
"TU Capture The Flag",
"Infrastructure Lead",
"August 2022 - Present",
(
"Developed and maintained the competition infrastructure, which included a Kubernetes Cluster, basic CI/CD pipeline, and multiple insecure by design applications.",
"Coordinated with contributors to develop and deploy challenges for the competition."
)
)
#entry(
"Collegiate Penetration Testing Competition",
"Team Captain / Member",
"August 2022 - Present",
(
"This competition consists of an internal network penetration test on a simulated corporate environment. This includes the delivery of a professional report and presentation to Board Members.",
"Coordinated team training, logistics, and engagements.",
"Lead physical, social engineering, cloud, and internal network assessments."
)
)
#entry(
"Collegiate Cyber Defense Competition",
"Team Member/ Infrastructure Lead",
"Jan 2023 - Present",
(
"This competition consists of the defense and reconfiguration of a poorly secured network, while facilitating common business interjections, while defending against an active red team.",
"Maintained and developed practice infrastructure for the team to train on.",
"Assisted in the development of team playbooks and procedures."
)
) |
|
https://github.com/mem-courses/linear-algebra | https://raw.githubusercontent.com/mem-courses/linear-algebra/main/homework/linear-algebra-homework5.typ | typst | #import "../template.typ": *
#show: project.with(
title: "Linear Algebra Homework #5",
authors: (
(name: "<NAME> (#95)", email: "<EMAIL>", phone: "3230104585"),
),
date: "October 23, 2023",
)
= P66 习题三 3
#prob[
设矩阵 $display(bold(A) = mat(lambda,1,1;0,lambda-1,0;1,1,lambda)\,sp bold(b) = mat(a;1;1))$．已知线性方程组 $bold(A X) = bold(b)$ 存在两个不同的解．
(1) 求 $lambda$、$a$．\
(2) 求线性方程组 $bold(A X) = bold(b)$ 的通解．
]
#set math.mat(delim: "|")
$
|bold(A)|
= 1/lambda mat(lambda,1,1;0,lambda-1,0;lambda,lambda,lambda^2)
= 1/lambda mat(lambda,1,1;0,lambda-1,0;0,lambda-1,lambda^2-1)
= 1/lambda mat(lambda,1,1;0,lambda-1,0;0,0,lambda^2-1)
= (lambda+1)(lambda-1)^2
$
#set math.mat(delim: "(")
由于线性方程组存在两个不同的解，故根据 Cramer 法则，$bold(A)$ 不能为可逆矩阵，即 $|bold(A)| = 0$．故 $lambda in {1,-1}$．
考虑线性方程组 $bold(A X) = bold(b)$ 的系数矩阵的增广矩阵：
$
mat(bold(A), bold(b))
-> mat(lambda,1,1,a;0,lambda-1,0,1;lambda,lambda,lambda^2,lambda)
-> mat(lambda,1,1,a;0,lambda-1,0,1;0,0,lambda^2-1,lambda-a-1)
$
代入得 $lambda=1$ 时无解；$lambda=-1$ 时解得 $a=-2$．同时可得 $bold(A X) = bold(b)$ 的通解为：
$ cases(
display(x_1 = t + 3/2),
display(x_2 = -1/2),
display(x_3 = t),
) quad quad (t in RR) $
= P67 习题三 6
#prob[
设矩阵 $ bold(A) = mat(1,-1,-1;2,a,1;-1,1,a),quad bold(B) = mat(2,2;1,a;-a-1,-2) $ 问当 $a$ 为何值时，方程 $bold(A X) = bold(B)$ 无解，有唯一解，有无穷多个解？在有解时，求解此方程．
]
考虑对增广矩阵 $display(mat(bold(A),bold(B)))$ 应用初等行变换：
$ mat(bold(A), bold(B)) -> mat(
1,-1,-1,2,2;
2,a,1,1,a;
-1,1,a,-a-1,-2;
) -> mat(
1,-1,-1,2,2;
0,a+2,3,-3,a-4;
0,0,a-1,1-a,0;
) $
根据 Cramer 法则，$|bold(A)| != 0$ 时方程组有唯一解，此时 $a!=1$ 且 $a!=-2$，可解得：
$ bold(X) = mat(1,display((3a)/(a+2));0,display((a-4)/(a+2));-1,0) $
接着讨论无解或无穷多解的情况．
当 $a=1$ 时，有无穷多解，通解为 $display(bold(X) = mat(1,1;-t-1,-1;t,0)) quad (t in RR)$．
当 $a=-2$ 时，无解．
= P67 习题三 7
#prob[
设 $n$ 元线性方程组 $bold(A X) = bold(b)$，其中 $ bold(A) = mat(2a,1;a^2,2a,1;,a^2,2a,1;,,dots.down,dots.down,dots.down;,,,a^2,2a,1;,,,,a^2,2a),quad bold(X) = mat(x_1;x_2;dots.v;x_n),quad bold(b) = mat(1;0;dots.v;0) $
(1) 证明行列式 $|bold(A)| = (n+1)a^n$；
]
当 $n=1$ 和 $n=2$ 时，可代入验证 $|bold(A_n)| = (n+1) a^n$ 成立．
当 $n>=3$ 时，有
$
|bold(A_n)| &= 2a (-1)^(n+n) |bold(A_(n-1))| + (-1)^(n+n-1) (-1)^(n-1+n-1) a^2 |bold(A_(n-2))|\
&= 2a |bold(A_(n-1))| - a^2 |bold(A_(n-2))|
$
代入得
$
"左式" &= (n+1) a^n\
"右式" &= 2a (n+1-1) a^(n-1) - a^2 (n+1-2) a^(n-2)\
&= a^n (2n - (n-1)) = (n+1) a^n\
==> "左式" &= "右式"
$
故原命题得证．
#prob[(2) 问当 $a$ 为何值时，该方程组有唯一解，并求 $x_1$；]
有 $bold(A X) = bold(b)$，则根据 Cramer 法则，当且仅当 $bold(A)$ 可逆 $<==> |bold(A)| != 0 <==> a!=0$ 时，该线性方程组有唯一解．此时 $bold(X) = bold(A^(-1) b)$．此时，
$ x_1 = |bold(A_1)|/(|bold(A)|) = ((-1)^(1+1) (n-1+1) a^(n-1))/((n+1) a^n) = n/a(n+1) $
#prob[(3) 问当 $a$ 为何值时，该方程组有无穷多个解，并求通解．]
由第 (2) 问得，只可能 $a=0$．代入可知确有无穷多个解，且通解为：
$ cases(x_1&=t,x_2&=1,x_3&=0,x_4&=0,&dots.c,x_n&=0) quad quad (t in RR) $
= P67 习题三 9
#prob[设 $bold(A) in PP^(n times n)$，证明：如果对 $PP^(n times 1)$ 中的所有矩阵 $bold(X)$ 都有 $bold(A X) = bold(O)$，那么 $bold(A) = bold(O)$．]
假设 $bold(A) != bold(O)$，那么一定存在 $a_(i,j) != 0$，我们只需要令 $x_(j,1) = 1$ 且 $forall t != j,sp x_(t,1)=0$．那么 $(bold(A X))_(i,1) = a_(i,j) != 0$，此时 $bold(A X) != bold(O)$．与题设矛盾，故应有 $bold(A) = bold(O)$ 恒成立．
= P67 习题三 10
#prob[设 $bold(e)_(i j) in PP^(m times n)$ 表示第 $i$ 行和第 $j$ 列交叉位置元素为 $1$，其余元素均为零的矩阵．若 $bold(A) in PP^(n times m),sp bold(B) in PP^(m times n)$，请计算 $bold(A e)_(i j)$ 以及 $bold(e)_(i j)bold(B)$．]
令 $bold(C) = bold(A e_(i,j))$，那么 $c_(x,y) = sum_(k=1)^n a_(x,k) [k=i][y=j] = a_(x,i)[y=j]$．即 $bold(C)$ 是第 $j$ 列等于 $bold(A)$ 的第 $i$ 列，且其余位置全部为 $0$ 的矩阵．
令 $bold(D) = bold(e_(i,j) B)$，那么 $d_(x,y) = sum_(k=1)^n b_(k,y) [x=i][k=j] = b_(j,y)[x=i]$．即 $bold(D)$ 是第 $j$ 行等于 $bold(B)$ 的第 $i$ 行，且其余位置全部为 $0$ 的矩阵．
= P67 习题三 12(1)
#prob[求所有与矩阵 $bold(A) = display(mat(0,1,0,dots.c,0,0;0,0,1,dots.c,0,0;0,0,0,dots.c,0,0;dots.v,dots.v,dots.v,,dots.v,dots.v;0,0,0,dots.c,0,1;0,0,0,dots.c,0,0))_(n times n)$ 可交换的矩阵．]
设可交换的矩阵为 $bold(X)$，即解 $bold(A X) = bold(X A)$．显然 $bold(X) in PP^(n times n)$．
$
(bold(A X))_(i,j) = sum_(k=1)^n a_(i,k) x_(k,j) = cases(x_(i+1,j)\,quad& i<n, 0\,quad& i=n)\
(bold(X A))_(i,j) = sum_(k=1)^n x_(i,k) a_(k,j) = cases(x_(i,j-1)\,quad& j>1, 0\,quad& j=1)\
$
故 $forall 1<=i<n, 1<j<=n$，有 $x_(i+1,j) = x_(i,j-1)$ 恒成立时可交换．即满足每一条沿着主对角线方向的数字全相同的 $n$ 阶方阵 $bold(X)$ 都是与 $bold(A)$ 可交换的矩阵．
= P67 习题三 12(2)
#prob[设 $bold(B)$ 是一个对角线上元素互不相同的对角矩阵，求所有与矩阵 $bold(B)$ 可交换的矩阵．]
设可交换的矩阵为 $bold(X)$，即解 $bold(B X) = bold(X B)$．
$
(bold(B X))_(i,j) = sum_(k=1)^n b_(i,k) x_(k,i) = b_(i,i) x_(i,j)\
(bold(X B))_(i,j) = sum_(k=1)^n x_(i,k) b_(k,j) = x_(i,j) b_(j,j)\
$
应有 $forall 1<=i,j<=n$，$(bold(B X))_(i,j) = (bold(X B))_(i,j) <==> b_(i,i) x_(i,j) = b_(j,j) x_(i,j)$．由于 $bold(B)$ 是一个对角线上元素互不相同的对角矩阵，所以当 $i!=j$ 时，必须有 $x_(i,j)=0$；当 $i=j$ 时，$x_(i,j)$ 无论取何值都满足．所以可以与 $bold(B)$ 交换的所有矩阵应是对角矩阵．
= P68 习题三 14(4)
#prob[计算矩阵的幂：$ mat(1,-1,-1,-1;-1,1,-1,-1;-1,-1,1,-1;-1,-1,-1,1)^n $]
我们用 $bold(F_(x,y))$ 表示满足 $(bold(F_(x,y)))_(i,j) = display(cases(x\,quad& i=j,y\,quad& i!=j))$ 的 $m$ 阶矩阵．其中 $m=4$．题目中我们有 $bold(A)=bold(F_(1,-1))$．考虑 $bold(F_(x,y)) times bold(A)$，我们有：
$
x' = sum_(k=1)^4 (bold(F_(x,y)))_(i,k) bold(A)_(k,i) = x-3y\
y' = sum_(k=1)^4 (bold(F_(x,y)))_(i,k) bold(A)_(k,j) = -x-y\
$
考虑
$
mat(x_n;y_n)
= mat(1,-3;-1,-1)^(n-1) mat(1;-1)
= cases(
display(mat(4^((n-1)/2);-4^((n-1)/2))) \,quad& n mod 2 = 1,
display(mat(4^(n/2);0)) \,quad& n mod 2 = 0,
)
$
代入到原命题中，我们有：
$
mat(1,-1,-1,-1;-1,1,-1,-1;-1,-1,1,-1;-1,-1,-1,1)^n = cases(
display(mat(4^((n-1)/2),-4^((n-1)/2),-4^((n-1)/2),-4^((n-1)/2);-4^((n-1)/2),4^((n-1)/2),-4^((n-1)/2),-4^((n-1)/2);-4^((n-1)/2),-4^((n-1)/2),4^((n-1)/2),-4^((n-1)/2);-4^((n-1)/2),-4^((n-1)/2),-4^((n-1)/2),4^((n-1)/2)))\,quad& n mod 2 = 1,
display(mat(4^(n/2),0,0,0;0,4^(n/2),0,0;0,0,4^(n/2),0;0,0,0,4^(n/2)))\,quad& n mod 2 = 0,
)
$
= P68 习题三 17
#prob[
称 $n$ 阶矩阵 $bold(A)$ 的主对角线上所有元素之和为该矩阵的 *迹*，记为 $tr(bold(A))$．证明：
(1) $forall bold(A) in PP^(m times n),sp forall bold(B) in PP^(n times m)$，均有 $tr(bold(A B)) = tr(bold(B A))$．
]
$
tr(bold(A B))
= sum_(i=1)^m sum_(j=1)^n a_(i,j) dot b_(j,i)
= sum_(j=1)^m sum_(i=1)^n a_(j,i) dot b_(i,j)
= sum_(i=1)^n sum_(j=1)^m b_(i,j) dot a_(j,i)
= tr(bold(B A))
$
#prob[(2) 不存在 $n$ 阶矩阵 $bold(A),bold(B)$ 使得 $bold(A B) - bold(B A) = bold(E)$ 成立．]
对于 $n$ 阶方阵 $bold(A),bold(B)$，有 $tr(bold(A)+bold(B)) = sum_(i=1)^n (a_(i,i) + b_(i,i)) = tr(bold(A)) + tr(bold(B))$．
反证法，假设存在矩阵 $bold(A),bold(B)$ 使等式成立，那么有 $bold(A B) = bold(B A) + bold(E)$，则应有
$ tr(bold(A B)) = tr(bold(B A)) + tr(bold(E)) = tr(bold(B A)) + n > tr(bold(B A)) $
与第一问得到的 $tr(bold(A B)) = tr(bold(B A))$ 矛盾．故假设不成立，这样的矩阵不存在．
= P68 习题三 20
#prob[设线性方程组 $bold(A X) = bold(b)$ 的系数矩阵 $bold(A)$ 的秩等于矩阵 $bold(B) = display(mat(bold(A),bold(b);bold(b)^T,0))$ 的秩，证明该线性方程组有解．]
$r(bold(A)) = r(bold(B)) = r display(mat(bold(A),bold(b);bold(b)^T,0)) = r(display(mat(bold(A),bold(b);bold(b)^T,0))^T) = r display(mat(bold(A)^T,bold(b);bold(b)^T,0))$．
说明行向量 $display(mat(bold(b)^T,0))$ 可以被前 $n$ 个行向量 $display(mat(bold(a_i), b_i))$ 线性表示．即存在一组 $bold(x) = display(mat(x_1,x_2,dots.c,x_n))$ 满足：
$ cases(
a_(11)x_1 + a_(12) x_2 + dots.c + a_(1 n)x_n &&= b_1,
a_(21)x_1 + a_(22) x_2 + dots.c + a_(2 n)x_n &&= b_2,
&&dots.c,
a_(n 1)x_1 + a_(n 2) x_2 + dots.c + a_(n n)x_n &&= b_n,
b_1 x_1 + b_2 x_2 + dots.c b_n x_n &&= 0,
) $
只看前 $n$ 个线性方程构成的线性方程组，就是 $bold(A X) = bold(b)$ 所对应的线性方程组．故原命题得证．
= P68 习题三 21
#prob[如果 $bold(A)^T = bold(A)$，那么称 $bold(A)$ 为 *对称矩阵*．证明：若 $bold(A)$ 实对称且 $bold(A)^2 = bold(O)$，则 $bold(A) = bold(O)$．]
$
bold(A) = bold(O)
<==> forall 1<=i,j<=n,sp sum_(k=1)^n a_(i,k) a_(k,j) = 0
==> forall 1<=i<=n,sp sum_(k=1)^n a_(i,k)^2 = 0
$
由于 $forall x in RR,sp x^2>=0$，取到等号当且仅当 $x=0$．所以当且仅当 $forall 1<=i,k<=n, a_(i,k) = 0$ 时等式成立．即 $bold(A) = bold(O)$．
= P69 习题三 24
#prob[
如果 $bold(A)^T = -bold(A)$，那么称 $bold(A)$ 为 *反对称矩阵*．证明：
(1) 如果 $bold(A) = (a_(i j))_(n times n)$，那么 $forall 1<=i,j<=n$，均有 $a_(i j) = - a_(j i)$ 成立；
]
$ bold(A)^T = -bold(A) <==> forall 1<=i,j<=n,sp a_(j i) = -a_(i j) <==> forall 1<=i,j<=n,sp a_(i,j) = -a_(j,i) $
所以命题得证．
#prob[(2) 如果 $bold(A) = (a_(i j))_(n times n)$，那么 $forall 1<=i<=n$，均有 $a_(i i) = 0$ 成立；]
根据 (1)，$forall 1<=i<=n$，$a_(i i)=-a_(i i)$，当且仅当 $a_(i,i) = 0$ 时成立，原命题得证．
#prob[(3) 矩阵 $bold(A) pm bold(B)$ 都是反对称矩阵；]
$(bold(A)+bold(B))_(i,j) = a_(i,j) + b_(i,j) = -a_(j,i) - b_(j,i) = -(bold(A)+bold(B))_(j,i) ==> (bold(A) + bold(B))^T = -(bold(A) + bold(B)) ==> bold(A) + bold(B)$ 是反对称矩阵．
$(bold(A)-bold(B))_(i,j) = a_(i,j) - b_(i,j) = -a_(j,i) + b_(j,i) = -(bold(A)-bold(B))_(j,i) ==> (bold(A) - bold(B))^T = -(bold(A) - bold(B)) ==> bold(A) - bold(B)$ 是反对称矩阵．
#prob[(4) $forall k in PP$，矩阵 $k bold(A)$ 都是反对称矩阵；]
$ forall k in PP,sp (k bold(A))^T = k bold(A)^T = k (- bold(A)) = -(k bold(A)) $
所以 $k bold(A)$ 也是反对称矩阵．
#prob[(5) 矩阵 $bold(A B)$ 是对称矩阵当且仅当 $bold(A B) = bold(B A)$；]
$
bold(A B) = (bold(A B))^T
&<==> forall 1<=i,j<=n,sp sum_(k=1)^n a_(i,k) b_(k,j) = sum_(k=1)^n a_(j,k) b_(k,i)\
&<==> forall 1<=i,j<=n,sp sum_(k=1)^n a_(i,k) b_(k,j) = sum_(k=1)^n (-a_(k,j)) (-b_(i,k)) = sum_(k=1)^n b_(i,k) a_(k,j)\
&<==> bold(A B) = bold(B A)
$
#prob[(6) 矩阵 $bold(A B) - bold(B A)$ 是反对称矩阵．]
$
(bold(A B) - bold(B A))_(i,j)
&= sum_(k=1)^n (a_(i,k) b_(k,j) - b_(i,k) a_(k,j))\
&= sum_(k=1)^n (a_(k,i) b_(j,k) - b_(k,i) a_(j,k))\
&= sum_(k=1)^n -(a_(j,k) b_(k,i) - b_(j,k) a_(k,i))\
&= -(bold(A B) - bold(B A))_(j,i)
$
所以有 $(bold(A B) - bold(B A))^T = -(bold(A B) - bold(B A))$，即 $bold(A B) - bold(B A)$ 是反对称矩阵．
= P69 习题三 25
#prob[
对任意一个方阵 $bold(A)$，证明：
(1) 矩阵 $bold(A) + bold(A)^T$ 是对称矩阵；
]
设 $bold(B) = bold(A) + bold(A)^T$，要使 $b_(i,j) = b_(j,i) <==> a_(i,j) + a_(j,i) = a_(j,i) + a_(i,j)$，显然成立．
#prob[(2) 矩阵 $bold(A) - bold(A)^T$ 是反对称矩阵；]
设 $bold(B) = bold(A) - bold(A)^T$，要使 $b_(i,j) = -b_(j,i) <==> a_(i,j) - a_(j,i) = -(a_(j,i) - a_(i,j))$，显然成立．
#prob[(3) 矩阵 $bold(A)$ 是一个对称矩阵与一个反对称矩阵的和．]
取 $bold(X) = display(frac(bold(A) + bold(A)^T, 2))$，$bold(Y) = display(frac(bold(A) - bold(A)^T, 2))$．根据前两问所证明，$bold(X)$ 是对称矩阵，$bold(Y)$ 是反对称矩阵．且有 $bold(A) = bold(X) + bold(Y)$．故原命题得证．
= P69 习题三 26
#prob[
判断下列命题是否成立：
(1) 若矩阵乘积 $bold(A B) in PP^(m times n)$，则矩阵 $bold(A)$ 有 $m$ 行；
]
正确；说明 $exists k in NN_+$，有 $bold(A) in PP^(m times k)$ 且 $bold(B) in PP^(k times n)$，故矩阵 $bold(A)$ 有 $m$ 行．
#prob[(2) 设 $bold(A),sp bold(B)$ 是两个 $n$ 阶矩阵，则 $|bold(A B)| = |bold(B A)|$；]
正确；$|bold(A B)| = |bold(A)| dot |bold(B)| = |bold(B)| dot |bold(A)| = |bold(B A)|$，得证．
#prob[(3) 设 $bold(A) in PP^(m times n),sp bold(B) in PP^(n times m)$，则 $|bold(A B)| = |bold(B A)|$；]
错误；设 $bold(A) = display(mat(1,2)),sp bold(B) = display(mat(3;4))$，那么有 $bold(A B) = display(mat(11)),sp bold(B A) = display(mat(3, 6; 4, 8))$，显然 $|bold(A B)| = 11 != 0 = |bold(B A)|$．
#prob[(4) 对任意的三阶矩阵 $bold(A)$ 和任意一个数 $lambda$，都有 $(lambda bold(E_3)) bold(A) = bold(A) (lambda bold(E_3))$；]
正确；$(lambda bold(E_3)) bold(A) = lambda (bold(E_3 A)) = lambda bold(A) = lambda bold(A E_3) = bold(A) (lambda bold(E_3))$．
#prob[(5) 如果矩阵 $bold(A),sp bold(B),sp bold(C)$ 满足 $bold(A B) = bold(A C)$ 且 $bold(A) != bold(O)$，那么 $bold(B) = bold(C)$；]
错误；取 $bold(A) = display(mat(1,0;0,0)), bold(B) = display(mat(1;2)), bold(C) = display(mat(1;3))$．那么 $bold(A B) = display(mat(1;0)) = bold(A C)$，但 $bold(B) != bold(C)$．实际上，当 $bold(A)$ 为可逆矩阵时此命题成立．
#prob[(6) 如果对两个不同的数 $a,b$，矩阵 $bold(A)$ 满足 $a bold(A) = b bold(A)$，那么 $bold(A) = bold(O)$；]
正确；反证法，设 $bold(A)$ 不是零矩阵，则一定存在 $a_(i j) != 0$．根据 $a bold(A) = b bold(A)$，应有 $a dot a_(i j) = b dot a_(i j)$，显然矛盾．故 $bold(A) = bold(O)$．
#prob[(7) 设 $bold(A)$ 是一个方阵，$m,n$ 是两个正整数，则 $bold(A)^m bold(A)^n = bold(A)^n bold(A)^m$；]
正确；因为矩阵乘法满足结合律．
#prob[(8) 对角矩阵都是对称矩阵；]
正确；对角矩阵一定是方阵．那么对于 $1<=i,j<=n$：
- 当 $i=j$ 时，$a_(i,j) = a_(j,i)$ 是同一个数，显然成立；
- 当 $i!=j$ 时，$a_(i,j) = a_(j,i) = 0$，也成立．
所以原命题得证．
#prob[(9) 零矩阵都是对称矩阵；]
正确；设 $n,m in NN_+$ 且 $m!=n$，则对于 $O in PP^(m times n)$，有 $O^T in PP^(n times m)$，两者显然不相等．
#prob[(10) 若矩阵乘积 $bold(A B)$ 是方阵，则矩阵 $bold(A),bold(B)$ 也都是方阵．]
错误；设 $n,m in NN_+$ 且 $m!=n$，满足 $bold(A) in PP^(n times m)$ 且 $bold(B) in PP^(m times n)$，则 $bold(A B) in PP^(n times n)$ 为方阵而 $bold(A)$ 和 $bold(B)$ 均不是方阵． |
|
https://github.com/jomaway/typst-linguify | https://raw.githubusercontent.com/jomaway/typst-linguify/main/README.md | markdown | MIT License | # Typst-linguify
Load strings for different languages easily. This can be useful if you create a package or template for multilingual usage.
## Usage
The usage depends if you are using it inside a package or a template or in your own document.
### For end users and own templates
You can use linguify global database.
Example:
```typst
#import "@preview/linguify:0.4.0": *
#let lang_data = toml("lang.toml")
#set-database(lang_data);
#set text(lang: "de")
#linguify("abstract") // Shows "Zusammenfassung" in the document.
```
The `lang.toml` musst look like this:
```toml
[conf]
default-lang = "en"
[lang.en]
title = "A simple linguify example"
abstract = "Abstract"
[lang.de]
title = "Ein einfaches Linguify Beispiel"
abstract = "Zusammenfassung"
```
### Inside a package
So that multiple packages can use linguify simultaneously, they should contain their own database. A linguify database is just a dictionary with a certain structure. (See database structure.)
Recommend is to store the database in a separate file like `lang.toml` and load it inside the document. And specify it in each `linguify()` function call.
Example:
```typ
#import "@preview/linguify:0.4.0": *
#let database = toml("lang.toml")
#linguify("key", from: database, default: "key")
```
## Features
- Use a `toml` or other file to load strings for different languages. You need to pass a typst dictionary which follows the structure of the shown toml file.
- Specify a **default-lang**. If none is specified it will default to `en`
- **Fallback** to the default-lang if a key is not found for a certain language.
- [Fluent](https://projectfluent.org) support
|
https://github.com/kotfind/hse-se-2-notes | https://raw.githubusercontent.com/kotfind/hse-se-2-notes/master/edu/lectures/2024-09-11.typ | typst | = Кризис российской аспирантуры
Самая недоисследованная область образования
== Нормативные рамки
Аспирантура после высшего образования (после бакалавриата и магистратуры, иногда
сразу после бакалавриата)
Аспирантура и PhD частично связаны
Часть про PhD --- не про образование
=== В России
Аспиранты учатся:
- в университетах (90% студентов)
- в научных организациях, институтах РАН (10% студентов)
3 (social science) или 4 (math, chemistry, ...) года
Платка/ бюджет/ целевая
Процесс обучения:
- образовательная компонента (ВУЗ определяет сам)
- научная компонента (подготовка статей, диссертаций)
Ученые степени вручает:
- ВАК (высшая аттестационная комиссия)
- ВУЗы, получившие разрешение от ВАК --- требования более высокие, чем у ВАКа
== История аспирантуры в России
- "Научная" аспирантура (до 2012-2013)
- ПослеВУЗовское профессиональное образование
- Требования о публикации в журналах
- "Образовательная" аспирантура (до 2021-2022)
- Аспирантура становится 3-ий уровнем высшего образования
- Завершение аспирантуры и защита диссертации --- разные вещи
- Появляются неВАКовские степени
- Концентрация аспирантуры в небольшом числе ВУЗов
- "Гибридная" аспирантура
- ФГОС $->$ ФГТ: менее строгие требования к аспирантским программам
- Тренд: автономизация ВУЗов в аспирантских программах
== Мировые тренды
Зачем аспирантура?
- Раньше: дорога в академическую карьеру
- Теперь: разные цели. Например, для подготовки высококвалифицированных специалистов
Массовизация: число людей за несколько лет: x7 -- x8
Дифференциация модельной подготовки: аспиранты стали очень разнородными $->$
адаптация аспирантский программ
Раньше была модель наставничества: студент взаимодействует почти только с
научруком
Структуризация образования:
- Контрольные точки (студент пишет отчет о прогрессе)
- Появляются больше разных курсов
- Ответ на массовизацию
Аспирантура переходит от кафедральной системе (студент взаимодействует с 3-4
людьми) к системе аспирантских школ (студент взаимодействует с кучей человек)
Развитие доказательного подхода в развитии аспирантуры: развитие аспирантуры
определяется исследованиями
== Отличия российской аспирантуры
- Очень короткая
- Только исследовательски ориентированная
- Очень узконаправленная (степени очень конкретные)
Прием и выпуск сократились в 2 раза за 10 лет. Сильно сократилось количество
сдачи диссертаций в срок. Возможные причины:
- Падение престижа образования
- Ужесточение требований
~25% выпускников аспирантуры через какой-то период защищают диссертацию:
== Основные проблемы
- Недостаток финансирования
- Слабость академической поддержки
- Диссертационная наука
- Низкие компетенции на входе
=== Недостаток финансирования
#figure(
caption: "Источники финансирования",
table(
columns: 2,
table.header[*Источник*][*Доля аспирантов*],
[Гос стипендия], [60%],
[Гранты], [15%],
[Иная стипендия], [11%],
[Нет источников], [37%],
)
)
#figure(
caption: "Аспиранты работают",
table(
columns: 2,
table.header[*Доля аспирантов*][*Работают на \_ местах*],
[66%], [1],
[27%], [2],
[7%], [3+],
)
)
Только у 36% работа по профилю
Только у 13% работают там же, где и учатся
=== Слабость академической поддержки
15% научруков пренебрегают обязанностями
40% научруков тратят меньше 5 часов в месяц на аспирантов
#figure(
caption: "Иные источники поддержки",
table(
columns: 2,
[Преподаватели той же организации], [45%],
[Руководитель подразделения], [28%],
[Другие аспиранты], [21%],
[Административные сотрудники], [17%],
[Преподы других организаций], [16%],
[Никто], [32%]
)
)
=== Проблемы диссертационной науки
Реальная наука и диссертационная --- очень различается
=== Низкие компетенции на входе
Большинство не имеет исследовательского опыта
ЕТМА (Единый Трек Магистратура-Аспирантура)
Разрывы образовательных программ между аспирантурой и магистратурой:
перехлесты и пропуски образовательных программ
=== Неэффективность отбора
Негибкие и неудачные критерии отбора
У многих не академические цели поступления в аспирантуру:
- для получения отсрочки
- для места в общежития
- для продвижения по карьерной лестнице
- для получения диплома
У 24% аспирантов несоответствие ожиданий от аспирантуры и реальности (феномен
"мисметча")
== Что делать?
На федеральном уровне:
- Системы длинных грантов
- Дополнительные стимулов для научруков
- Организация треков "магистратура -- аспирантура"
- Развитие программ с индустриальными партнерством
На ВУЗовском уровне:
- Проектный разворот: включение аспирантов в большие научные проекты
- Комплексная поддержка аспирантов, не только одним научруком
- Магистратура - Аспирантура
- Трансформация моделей набора
== Завершение
Аспиранты интересны для исследования тк они есть переходный этап между
студентами и работающим людьми
|
|
https://github.com/cnaak/blindex.typ | https://raw.githubusercontent.com/cnaak/blindex.typ/main/test/test-02-sorting.typ | typst | MIT License | #set page(paper: "a6")
#import "lib.typ": *
As it is written:
#bQuot([*11* The word of the LORD came to me saying, “What do you see,
Jeremiah?” And I said, “I see a rod of an almond tree.” *12* Then the LORD said to me, “You have
seen well, for I am watching over My word to perform it.”], "Jer", "en-3", [1.11,12], "NASB95",
label("2012-LXX-SBB"), fill: false)
#pagebreak()
Also, David says: #iQuot([The LORD is my shepherd, I shall not want.], "Psa", "en-3", [23.1],
"NASB95", label("2012-LXX-SBB")).
#pagebreak()
Moreover,
#bQuot([*1* Then the inhabitants of Jerusalem made Ahaziah, his youngest son, king in his place,
for the band of men who came with the Arabs to the camp had slain all the older sons. So Ahaziah
the son of Jehoram king of Judah began to reign. *3* He also walked in the ways of the house of
Ahab, for his mother was his counselor to do wickedly. *4* He did evil in the sight of the LORD
like the house of Ahab, for they were his counselors after the death of his father, to his
destruction.], "2Ch", "en-3", [22.1,3--4], "NASB95", label("2012-LXX-SBB"), fill: true)
#pagebreak()
Furthermore, #bQuot([There sprang from these a sinful offshoot, Antiochus Epiphanes, son of King
Antiochus, once a hostage at Rome. He became king in the one hundred and thirty-seventh year of
the kingdom of the Greeks.], "1Ma", "en-3", [1.10], "USCCB", label("2012-LXX-SBB"), fill: false,
quotes: true)
#pagebreak()
Finally, #bQuot([but these have been written so that you may believe that Jesus is the Christ,
the Son of God; and that believing you may have life in His name.], "Jhn", "en-3", [20.31],
"NASB95", label("2012-LXX-SBB"), fill: true, fill-below: true)
#{
//import "./books.typ": bSort
for ordering in bSort.keys() {
pagebreak()
align(center)[= Biblical Index
"#ordering" book ordering (excluding missing ones)]
mkIndex(cols: 1, sorting-tradition: ordering, exclude-missing: true)
}
}
#pagebreak()
#bibliography("test-01-readme.yml")
|
https://github.com/ClazyChen/Table-Tennis-Rankings | https://raw.githubusercontent.com/ClazyChen/Table-Tennis-Rankings/main/introduction_CN.typ | typst | #set text(font: ("Times New Roman", "NSimSun"))
= 乒乓球排名计算
#v(1em)
#h(2em)
众所周知，ITTF在2018年1月1日开始修改了乒乓球国际排名规则。该规则已经推出就受到了各方的争议，因为该规则的计算方法过于复杂，而且不符合常理。在该规则下，参与更多比赛的运动员可以得到更多的积分，而不是更加优秀的运动员。一些运动员为了保持世界排名不得不参加大量的比赛，而没有机会休息，这加剧了伤病的风险。此外，运动员的世界排名无法反映其真实水平。ITTF修改后的国际排名，排名高的一方战胜排名低的一方的概率大约仅为66%。
#h(2em)本项目通过对ITTF公开在官网上的数据进行分析，采用ELO算法进行积分计算，并针对乒乓球运动的特殊性，使用了如下修正：
+ 根据比赛层次改变系数（参见表1）。该系数为本人估算，没有依据。
#figure(
caption: "比赛层次系数表",
table(
columns: 3,
[比赛层次], [比赛类型], [修正系数],
[1], [奥运会], [2.5],
[2], [世锦赛], [2],
[3], [世界杯], [1.6],
[4], [总决赛], [1.4],
[5], [冠军赛\\大满贯赛\\T2钻石赛], [1.2],
[6], [球星挑战赛\\巡回赛白金站], [1.1],
[7], [挑战赛\\巡回赛], [1.0],
[8], [支线赛\\洲际运动会\\洲际锦标赛], [0.8],
[9], [奥运资格赛\\区域运动会\\区域锦标赛], [0.5]
)
)
除奥运会外，其他赛事的资格赛有额外的 0.8 系数。
#v(1em)
+ 根据比分改变系数（参见表2）。该数据为二项分布假设检验的结果。
#figure(
caption: "比分系数表",
table(
columns: 5,
[胜者\\败者], [0], [1], [2], [3],
[4], [31/32], [57/64], [99/128], [163/256],
[3], [15/16], [13/16], [21/32], [],
[2], [7/8], [11/16], [], [],
[1], [3/4], [], [], []
)
)
#v(1em)
+ 中心回归修正。由于乒乓球运动员的比赛频繁，所以不加修正的情况下，顶级运动员的ELO积分会无限上升，而在他们退役之前就算出现连败，也无法将其ELO积分降低到实际水平。因此增加了一项修正：运动员的积分越高，其取胜时积分上升的速度越低（Logistic分布），落败时积分下降的速度越高。该修正与对手的ELO积分情况无关。
#v(1em)
+ 生面孔修正。初次参加国际比赛的小将。在ELO系统中，新人运动员总是从1500的初始积分向上打。对于高水平运动员来说，会较长期地处在积分低于实际排名的状态。因此当新人战胜ELO积分较高的对手时，可以按比例地接近对手的积分，而不仅仅是获得ELO算法提供的积分。随着运动员参赛场次的增加，这项修正会指数衰减。
#v(1em)
+ 统治力修正。顶级运动员往往会获得一个很高的积分，输掉一些场次对他们的影响比较低。为了更好地衡量顶级运动员的统治力，当高积分的运动员输给了积分很低的运动员时，扣减的积分将更多。当运动员长期不参加比赛时，这项修正会进一步增加。
#v(1em)
#h(2em)上述修正在实验中被证明是有效的。
我进行的实验统计了2018年1月1日到2023年12月10日之间的比赛。只有在ITTF成年组赛事中至少进行过5场比赛的运动员才纳入统计。统计包含22,253场女子单打和27,334场男子单打。
经过修正之后的国际排名，排名高的运动员对排名低的运动员的胜率约为75%（女子单打 76.28%，男子单打 73.91%）。相对于ITTF的66%有显著提升。
#v(1em)
单打排名在1年没有参加ITTF赛事之后被隐藏。
上述设定可能会造成一些已经退役的运动员仍然出现在排名中。由于无法确定是否退役，对于满足以下两个条件的运动员以灰色标注：
+ 从1年前开始，没有参加过 ITTF 赛事。
+ 排名时间之后的 1年内，没有参加过 ITTF 赛事。
#v(1em)
本模型缺少对双打的修正，因此得到的双打排名没有实际意义，预测成功率较低（女子双打68.56%，混合双打66.75%，男子双打65.81%，虽然大概还是比ITTF排名有意义）。所以，本仓库不提供双打排名。
#v(3em)
截止 2024年2月25日（釜山世锦赛结束）的世界排名见本文件附表。完整的前128名排名见本仓库中的MS-latest_CN.typ和WS-latest_CN.typ。
#v(3em)
过往的世界排名（每月一次，从2004年1月开始，每月1日进行统计） 可以在本仓库中找到，每个排名女子单打和男子单打的前128名。在较早期的排名中，由于ELO积分尚未足够收敛，所以排名可能会有较大的波动。
由于本人知识有限，大部分的运动员名字没有汉化。汉化表可以在本仓库中找到。
国家/地区发生变化的运动员，本人难以追溯其变化时间，所有表格均显示为最后一次参加ITTF比赛时代表的国家/地区。
#v(3em)
致谢：ITTF/WTT，Python，Typst。
特别致谢：Coach EmRatThich。该用户提出的模型为我的模型提供了灵感。
#pagebreak()
#set text(font: ("Courier New", "NSimSun"))
#figure(
caption: "Women's Singles (1 - 32)",
table(
columns: 4,
[排名], [运动员], [国家/地区], [积分],
[1], [孙颖莎], [CHN], [3841],
[2], [陈梦], [CHN], [3581],
[3], [王曼昱], [CHN], [3567],
[4], [早田希娜], [JPN], [3482],
[5], [陈幸同], [CHN], [3466],
[6], [王艺迪], [CHN], [3441],
[7], [平野美宇], [JPN], [3404],
[8], [郑怡静], [TPE], [3403],
[9], [何卓佳], [CHN], [3372],
[10], [伊藤美诚], [JPN], [3356],
[11], [钱天一], [CHN], [3356],
[12], [张瑞], [CHN], [3339],
[13], [木原美悠], [JPN], [3333],
[14], [田志希], [KOR], [3321],
[15], [蒯曼], [CHN], [3318],
[16], [范思琦], [CHN], [3314],
[17], [伯纳黛特 斯佐科斯], [ROU], [3312],
[18], [张本美和], [JPN], [3309],
[19], [石川佳纯], [JPN], [3266],
[20], [妮娜 米特兰姆], [GER], [3264],
[21], [石洵瑶], [CHN], [3264],
[22], [韩莹], [GER], [3250],
[23], [刘炜珊], [CHN], [3239],
[24], [陈熠], [CHN], [3232],
[25], [杨晓欣], [MON], [3222],
[26], [小盐遥菜], [JPN], [3219],
[27], [长崎美柚], [JPN], [3193],
[28], [阿德里安娜 迪亚兹], [PUR], [3187],
[29], [朱芊曦], [KOR], [3161],
[30], [森樱], [JPN], [3160],
[31], [索菲亚 波尔卡诺娃], [AUT], [3152],
[32], [安藤南], [JPN], [3149],
)
)#pagebreak()
#figure(
caption: "Men's Singles (1 - 32)",
table(
columns: 4,
[排名], [运动员], [国家/地区], [积分],
[1], [王楚钦], [CHN], [3754],
[2], [樊振东], [CHN], [3735],
[3], [马龙], [CHN], [3546],
[4], [梁靖崑], [CHN], [3520],
[5], [菲利克斯 勒布伦], [FRA], [3516],
[6], [林高远], [CHN], [3512],
[7], [林昀儒], [TPE], [3450],
[8], [张本智和], [JPN], [3405],
[9], [张禹珍], [KOR], [3395],
[10], [林诗栋], [CHN], [3393],
[11], [周启豪], [CHN], [3370],
[12], [雨果 卡尔德拉诺], [BRA], [3366],
[13], [蒂姆 波尔], [GER], [3339],
[14], [田中佑汰], [JPN], [3333],
[15], [户上隼辅], [JPN], [3328],
[16], [李尚洙], [KOR], [3314],
[17], [邱党], [GER], [3313],
[18], [林钟勋], [KOR], [3311],
[19], [达科 约奇克], [SLO], [3306],
[20], [马克斯 弗雷塔斯], [POR], [3305],
[21], [特鲁斯 莫雷加德], [SWE], [3304],
[22], [基里尔 格拉西缅科], [KAZ], [3281],
[23], [黄镇廷], [HKG], [3258],
[24], [向鹏], [CHN], [3251],
[25], [乔纳森 格罗斯], [DEN], [3249],
[26], [迪米特里 奥恰洛夫], [GER], [3248],
[27], [松岛辉空], [JPN], [3247],
[28], [孙闻], [CHN], [3247],
[29], [斯蒂芬 门格尔], [GER], [3225],
[30], [西蒙 高兹], [FRA], [3219],
[31], [吴晙诚], [KOR], [3214],
[32], [刘丁硕], [CHN], [3212],
)
) |
|
https://github.com/AlbanFALCOZ/MY_CV | https://raw.githubusercontent.com/AlbanFALCOZ/MY_CV/main/French_CV/main.typ | typst | #import "setup.typ": *
#import "@preview/cades:0.3.0": qr-code
#set text(font: "PT Sans")
#main(
[
#profile(
name: "<NAME>",
)
#profile_section("Contact ")
#show_contacts(
(
(
icon: "user",
text: "21 ans",
),
(
icon: "envelope",
solid: true,
text: "<EMAIL>",
),
(
icon: "phone",
solid: true,
text: link("tel:+33 7 85 27 11 40")[+33 7 85 27 11 40],
),
(
icon: "github",
text: link("https://github.com/AlbanFALCOZ")[Alban FALCOZ],
),
(
icon: "home",
solid: true,
text: "22 rue du château \n06510 Gattières, France",
),
(
icon: "car",
text: "Permis B"
),
)
)
#profile_section("Langues ")
#show_langues(
(
(
flag: "images/France.png",
text: text(top-edge: 5mm,"Langue maternelle"),
),
(
flag: "images/England.png",
text: text("Bonne compréhension écrite et oral (Niveau TOEIC C1)"),
),
(
flag: "images/Japan.png",
text: text(top-edge: 5mm,"Notions"),
),
)
)
#profile_section("Langages ")
#v(1mm)
- HTML / CSS / Javascript (Angular)
- Java
- Rust
- Python (numpy, tensorflow, pygame)
- C
- SQL (PostgreSQL)
#profile_section("CV numérique ")
#text(size: 11pt,"Pour accéder à mon CV crée avec Typst en version numérique :")
#align(center,qr-code("https://github.com/AlbanFALCOZ/CV", width: 3cm))
],
[
#align(center,text(size: 19pt, style: "italic", "Recherche d'un stage en informatique de \n4 mois à l'étranger de mai 2024 à août 2024"))
#align(left,text(size: 11pt,"Étudiant en ingénierie informatique, j'aime créer durant mon temps libre des projets informatiques afin de toujours apprendre de nouvelles choses et faire des randonnées avec ma famille pour profiter de la nature."))
#body_section("Formation")
#school_period(
period: [
#text("Sept 2023 - Aujourd'hui")
],
title: "Ingénieur informatique",
school_name: "Polytech Nice Sophia : "+text(style: "italic", "Les Templiers"),
addtional_note: "2ème année",
)
#school_period(
period: [
#text("Sept 2021 - \nJuin 2023")
],
title: "Cycle préparatoire PeiP",
school_name: "Polytech Nice Sophia : "+text(style: "italic", "Les Lucioles"),
addtional_note: "Classé 67 sur 1750",
)
#school_period(
period: [
#text("Sept 2018 - Juillet 2021")
],
title: "Baccalauréat général : ",
description: "Mention très bien",
school_name: "<NAME>",
addtional_note: "Spécialité Mathématiques et Informatique",
)
#body_section("Expérience professionnelle")
#period_item(
period: [
Juillet 2022 -
],
title: "Stage d'un mois à l'Institut de Physique de Nice",
adress: "Institut de Physique de Nice",
body: "Lors de ce stage, j'ai aidé à la création et à la mise en place d'un réseau de neurones afin d'analyser le déplacement d'un signal."
)
#period_item(
period: [
Juin 2019 -
],
title: "Stage de 2 semaines chez les pompiers",
adress: "Caserne des pompiers",
body: "Ce stage m'a permit de comprendre l'importance du travail d'équipe lors des situations critiques."
)
#body_section("Projets informatiques")
#school_project(
period: [
Mars 2024 - \
Juin 2024
],
title: "Le site web Harmonikids",
lien: "https://github.com/AlbanFALCOZ/Harmonikids",
body: "Harmonikids est un site de quiz destinés aux enfants atteints d'autisme. Le site est accueillant et bienveillant envers eux, et a été réalisé grâce au framework Angular, ce qui m'a permis de me familiariser avec le front-end et de découvrir comment le back-end fonctionne."
)
#school_project(
period: [
Mai 2024 - \
Juin 2024
],
title: "Compilateur réalisé en Python ",
lien: "https://github.com/AlbanFALCOZ/Compiler-flo",
body: "Ce projet compile le langage Flo, un langage que nous avons créé, en utilisant la bibliothèque Sly de Python pour convertir le code en instructions ARMv7. Il m'a permis de comprendre comment un compilateur effectue l'analyse lexicale et syntaxique pour générer des instructions d'assemblage."
)
#school_project(
period: [
Dec 2023 - \
Fev 2024
],
title: "Le jeu de société Citadelles",
lien: "https://github.com/AlbanFALCOZ/Citadelles",
body: "Le projet implémente en Java le jeu de société Citadelle, où les joueurs incarnent des personnages afin d'accumuler des richesses dans leur cité en construisant des quartiers. Il y a différents bots qui adoptent des stratégies différentes pour gagner."
)
]
) |
|
https://github.com/AntoineCorbel/typst | https://raw.githubusercontent.com/AntoineCorbel/typst/main/template.typ | typst | // The project function defines how your document looks.
// It takes your content and some metadata and formats it.
// Go ahead and customize it to your liking!
#let project(title: "", authors: (), date: none, body) = {
// Set the document's basic properties.
set document(author: authors.map(a => a.name), title: title)
set page(
margin: (left: 20mm, right: 20mm, top: 25mm, bottom: 25mm),
numbering: "1",
number-align: center,
)
set text(font: "New Computer Modern", lang: "fr")
show math.equation: set text(weight: 400)
// Title row.
align(center)[
#block(text(weight: 700, 1.75em, title))
#v(1em, weak: true)
#date
]
// Author information.
pad(
top: 0.5em,
bottom: 0.5em,
x: 2em,
grid(
columns: (1fr,) * calc.min(3, authors.len()),
gutter: 1em,
..authors.map(author => align(center)[
*#author.name* \
#author.email
]),
),
)
// Main body.
set par(justify: true)
set figure(gap: 4mm) // gap between fig and caption
//set par(first-line-indent: .) // indenting 1st paragraph line
// add vertical space below heading
show heading: it => {
it.body
v(1em)
}
body
} |
|
https://github.com/Lucascf11/PRE | https://raw.githubusercontent.com/Lucascf11/PRE/main/Avaliacoes/AV2/main.typ | typst | #import "@preview/klaro-ifsc-sj:0.1.0": report
#show: doc => report(
title: "Prova 2 de PRE",
subtitle: "Variáveis aleatórias conjuntamente distribuídas e Distribuição Condicional",
// Se apenas um autor colocar , no final para indicar que é um array
authors: ("<NAME>",),
date: "15 de Abril de 2024",
doc,
)
#set text(20pt)
= ENUNCIADO
#set text(16pt)
\
Sejam U1, U2 e U3 $~$ Unif ({0,1,2}) variáveis aleatórias sorteadas independementemente. Sejam
$ X = U_1 + U_2 + U_3, $
$ Y= U_1+U_2-U_3, $
(a) Determine a PMF conjunta de X e Y\
(b) Determine e esboce as PMFs marginais de X e Y\
(c) Determine e esboce as PMFs condicionais de X dado que $Y=y$, para dois valores de $y epsilon S_y$ à sua escolha.
#pagebreak()
#set text(20pt)
= RESOLUÇÃO
#set text(18pt)
== Determinando a PMF conjunta
#set text(16pt)
Para que possamos descobrir a PMF conjunta entre duas variáveis aleatórias, primeiro precisamos de uma tabela com todos os resultados possíveis dos experimentos probabilísticos. Em seguida somam-se as probabilidades de X e Y assumirem conjuntamente um valor e faz-se a tabela da PMF conjunta de X e Y.
\
=== Tabela dos resultados
Os valores de X e Y foram dados pelas equações presentes no enunciado. Como as variáveis aleatórias U1, U2 e U3 assumem valores inteiros contidos no intervalo de 0 a 2 de maneira uniforme, a probabilidade é dada por $1/3 times 1/3 times 1/3=(1/3)^3=1/27$ em todas as linhas da tabela
#table(
columns: (auto,auto,auto,auto,auto,auto),
inset:10pt,
align: center,
table.header(
table.cell(
align: center,
colspan: 6,
[*Tabela dos resultados*],
),
[*U1*],[*U2*],[*U3*],[*X*],[*Y*],[*Pr*],
table.hline(y:0),
table.hline(y:1),
table.hline(y:2),
table.hline(y:29),
table.vline(x:0),
table.vline(x:3),
table.vline(x:5),
table.vline(x:6),
),
stroke: none,
[0],[0],[0],[0],[0],[1/27],
[0],[0],[1],[1],[-1],[1/27],
[0],[0],[2],[2],[-2],[1/27],
[0],[1],[0],[1],[1],[1/27],
[0],[1],[1],[2],[0],[1/27],
[0],[1],[2],[3],[-1],[1/27],
[0],[2],[0],[2],[2],[1/27],
[0],[2],[1],[3],[1],[1/27],
[0],[2],[2],[4],[0],[1/27],
[1],[0],[0],[1],[1],[1/27],
[1],[0],[1],[2],[0],[1/27],
[1],[0],[2],[3],[-1],[1/27],
[1],[1],[0],[2],[2],[1/27],
[1],[1],[1],[3],[1],[1/27],
[1],[1],[2],[4],[0],[1/27],
[1],[2],[0],[3],[3],[1/27],
[1],[2],[1],[4],[2],[1/27],
[1],[2],[2],[5],[1],[1/27],
[2],[0],[0],[2],[2],[1/27],
[2],[0],[1],[3],[1],[1/27],
[2],[0],[2],[4],[0],[1/27],
[2],[1],[0],[3],[3],[1/27],
[2],[1],[1],[4],[2],[1/27],
[2],[1],[2],[5],[1],[1/27],
[2],[2],[0],[4],[4],[1/27],
[2],[2],[1],[5],[3],[1/27],
[2],[2],[2],[6],[2],[1/27],
)
=== Tabela da PMF conjunta de X e Y
Agora, com base na tabela onde todos os resultados do experimento probabilístico estão contidos, podemos fazer a PMF conjunta de X,Y para cada valor que as variáveis aleatórias podem assumir.
\
Analisando a tabela anterior, podemos listar os valores que X e Y podem assumir.
$X = ({0,1,2,3,4,5,6})$ e $Y = ({-2,1,0,1,2,3,4})$. Dadas essas constatações, a PMF conjunta para cada valor de X e Y é dada pela tabela abaixo:
\
#table(
inset: 10pt,
align: center,
columns: (auto,auto,auto,auto,auto,auto,auto,auto),
table.header(
table.cell(
align: center,
colspan: 8,
[*P#sub[X,Y] (x,y)*]
),
table.hline(y: 0),
table.hline(y: 1),
table.hline(y: 2),
table.hline(y: 9),
table.vline(x: 0),
table.vline(x: 1),
table.vline(x: 2),
table.vline(x: 3),
table.vline(x: 4),
table.vline(x: 5),
table.vline(x: 6),
table.vline(x: 7),
table.vline(x: 8),
[],[y = -2],[y = -1],[y = 0],[y = 1],[y = 2],[y = 3],[y = 4],
),
stroke: none,
[x = 0],[0],[0],[1/27],[0],[0],[0],[0],
[x = 1],[0],[1/27],[0],[2/27],[0],[0],[0],
[x = 2],[1/27],[0],[2/27],[0],[3/27],[0],[0],
[x = 3],[0],[2/27],[0],[3/27],[0],[2/27],[0],
[x = 4],[0],[0],[3/27],[0],[2/27],[0],[1/27],
[x = 5],[0],[0],[0],[2/27],[0],[1/27],[0],
[x = 6],[0],[0],[0],[0],[1/27],[0],[0],
)
#set text(18pt)
#pagebreak()
== Determinando e esboçando as PMFs marginais de X e Y
#set text(16pt)
Para determinarmos as PMFs marginais das variáveis X e Y, precisamos utilizar a definição dadas nas equações abaixo:
$ P_(X)(x) = sum_(y epsilon S_Y) P_(X,Y)(x,y) $
$ P_(Y)(y) = sum_(x epsilon S_X) P_(X,Y)(x,y) $
Desse modo, percebemos que, para encontrar as marginais de X, basta somar os valores contidos na linha em que se quer encontrar $P_X (x)$ e os valores contidos na coluna em que se quer encontrar $P_Y (y)$. Dadas essas constatações, podemos partir para a determinação das PMFs marginais de X e Y:
\
=== Determinando PMFs marginais
Primeiramente realizamos a determinação das PMFs marginais para X através da definição:
- $P_X (x = 0) = 1/27$
- $P_X (x = 1) = 1/27 plus 2/27 = 3/27 = 1/9$
- $P_X (x = 2) = 1/27 plus 2/27 plus 3/27 = 6/27 = 2/9$
- $P_X (x = 3) = 2/27 plus plus 3/27 plus 2/27 = 7/27$
- $P_X (x = 4) = 3/27 plus 2/27 plus 1/27 = 6/27 = 2/9$
- $P_X (x = 5) = 2/27 plus 1/27 = 3/27 = 1/9$
- $P_X (x = 6) = 1/27$
Em seguida realizamos o mesmo procedimento para determinarmos as PMFs de Y:
- $P_Y (y = minus 2) = 1/27$
- $P_Y (y = minus 1) = 1/27 plus 2/27 = 3/27 = 1/9$
- $P_Y (y = 0) = 1/27 plus 2/27 plus 3/27 = 6/27 = 2/9$
- $P_Y (y = 1) = 2/27 plus 3/27 plus 2/27 = 7/27$
- $P_Y (y = 2) = 3/27 plus 2/27 plus 1/27 = 6/27 = 2/9$
- $P_Y (y = 3) = 2/27 + 1/27 = 3/27 = 1/9$
- $P_Y (y = 4) = 1/27$
E finalmente, temos a tabela contendo as PMFs conjuntas de X e Y e as marginais de cada variável aleatória para cada valor que a própria pode assumir:
#table(
inset: 7pt,
align: center,
columns: (auto,auto,auto,auto,auto,auto,auto,auto,auto),
table.header(
table.cell(
align: center,
colspan: 9,
[*P#sub[X,Y] (x,y)*]
),
table.hline(y: 0),
table.hline(y: 1),
table.hline(y: 2),
table.hline(y: 9),
table.hline(y: 10),
table.vline(x: 0),
table.vline(x: 1),
table.vline(x: 2),
table.vline(x: 3),
table.vline(x: 4),
table.vline(x: 5),
table.vline(x: 6),
table.vline(x: 7),
table.vline(x: 8),
table.vline(x: 9),
[],[y = -2],[y = -1],[y = 0],[y = 1],[y = 2],[y = 3],[y = 4],[P#sub[X] (x)]
),
stroke: none,
[x = 0],[0],[0],[1/27],[0],[0],[0],[0],[1/27],
[x = 1],[0],[1/27],[0],[2/27],[0],[0],[0],[1/9],
[x = 2],[1/27],[0],[2/27],[0],[3/27],[0],[0],[2/9],
[x = 3],[0],[2/27],[0],[3/27],[0],[2/27],[0],[7/27],
[x = 4],[0],[0],[3/27],[0],[2/27],[0],[1/27],[2/9],
[x = 5],[0],[0],[0],[2/27],[0],[1/27],[0],[1/9],
[x = 6],[0],[0],[0],[0],[1/27],[0],[0],[1/27],
[P#sub[Y] (y)],[1/27],[1/9],[2/9],[7/27],[2/9],[1/9],[1/27],[1],
)
=== Esboçando as PMFs marginais para X e Y
#figure(
image("figures/PMF_de_X.png"),
caption: "PMF marginal de X",
supplement: [Figura]
)
#figure(
image("figures/PMF_de_Y.png"),
caption: "PMF marginal de Y",
supplement: [Figura]
)
#set text(18pt)
#pagebreak()
== Determinando e esboçando $P_X (X|Y = y)$
#set text(16pt)
=== Determinando $P_X (X|Y = y)$
Para determinarmos o valor de X dado que Y=y, podemos utilizar a definição da PMF Condicional, onde:
$ P_X (X|Y = y) = (P_(X,Y) (x,y))/(P_Y (y)), $
Definida apenas se $P_Y (y) eq.not 0$.
\
\
Para demosntração, iremos escolher os valores y = -2 e y = 4. Portanto, temos que:
$P_X (X|Y = -2) = (P_(X,Y) (x,-2))/(P_Y (-2)) $ e
$P_X (X|Y = 4) = (P_(X,Y) (x,4))/(P_Y (4)) $
\
desse modo, já podemos aplicar as respectivas fórmulas para cada X e, logo após, fazer a tabela com os resultados:
\
\
Primeiramente começamos aplicando para Y = -2:
- $P_X (0|Y = -2) = 0 $
- $P_X (1|Y = -2) = 0 $
- $P_X (2|Y = -2) = 1$
- $P_X (3|Y = -2) = 0$
- $P_X (4|Y = -2) = 0 $
- $P_X (5|Y = -2) = 0 $
- $P_X (6|Y = -2) = 0 $,
\
Depois repetimos o mesmo procedimento para Y = 4:
- $P_X (0|Y = 4) = 0 $
- $P_X (1|Y = 4) = 0 $
- $P_X (2|Y = 4) = 0$
- $P_X (3|Y = 4) = 0$
- $P_X (4|Y = 4) = 1 $
- $P_X (5|Y = 4) = 0 $
- $P_X (6|Y = 4) = 0 $,
Por fim, após determinarmos os valores para cada X dado que Y ocorreu em -2 ou em 4, podemos partir para a tabela:
#table(
inset: 7pt,
align: center,
columns: (auto,auto,auto,auto,auto,auto,auto,auto),
table.header(
[],[x = 0],[x = 1],[x = 2],[x = 3],[x = 4],[x = 5],[x = 6],
table.hline(y:0),
table.hline(y:1),
table.hline(y: 3),
table.vline(x: 0),
table.vline(x: 1),
table.vline(x: 8)
),
stroke: none,
[$P_X (X|Y = -2)$],[0],[0],[1],[0],[0],[0],[0],
[$P_X (X|Y = 4)$],[0],[0],[0],[0],[1],[0],[0],
)
=== Esboçando $P_X (X|Y = y)$
#figure(
image("figures/PMF_Condicional_de_X_dado_que_Y_2.png",width: 100%),
caption: "PMF de Px(X|Y= - 2)",
supplement: [Figura]
)
#figure(
image("figures/PMF_Condicional_de_X_dado_que_Y_4.png",width: 100%),
caption: "PMF de Px(X|Y= 4)",
supplement: [Figura]
) |
|
https://github.com/Otto-AA/definitely-not-tuw-thesis | https://raw.githubusercontent.com/Otto-AA/definitely-not-tuw-thesis/main/src/frontpage.typ | typst | MIT No Attribution | #import "translations/translations.typ": translate
#import "utils.typ": name-with-titles
#let signature = person => [
#line(length: 90%, stroke: 0.5pt)
#person.at("name", default: "")
]
#let frontpage(
font,
author,
advisor,
assistants,
reviewers,
show-curriculum,
date,
) = {
text(font: font)[
#place(dx: -40pt, dy: -20pt)[
#box(height: 32pt)[
#image("graphics/Logo-schwarz.png", alt: "Logo TU Wien Informatics")
]
]
#v(6em)
#align(center)[
#show par: set block(spacing: 1.5em)
#box(width: 100%, height: 7.5em)[
#place(bottom)[
#box(width: 100%, height: 100%)[
// TODO: spacing between title and subtitle is not good
#text(translate("title"), size: 2.5em, weight: "bold")
#text(translate("subtitle"), size: 1.5em, weight: "bold")
]
]
]
#v(2em)
#upper(text(translate("thesis-type"), size: 1.4em))
#translate("submitted-to")
#text(translate("academic-title"), size: 1.4em, weight: "bold")
#if show-curriculum [
#translate("in-study")
#text(translate("curriculum"), size: 1.2em, weight: "bold")
]
#translate("submitted-by")
#show par: set block(spacing: 0.6em)
#text(name-with-titles(author), size: 1.2em, weight: "bold")
#translate("student-number") #author.at("student-number", default: "")
]
#v(3em)
#align(left)[
#translate("at-faculty")
#translate("at-TU")
#[
#show par: set block(spacing: 0.5em)
#translate("advisor"): #name-with-titles(advisor)
#if assistants.len() > 0 [
#translate("assistance"): #name-with-titles(assistants.at(0))
#for assistant in assistants.slice(1) [
// there's probably a better way than hiding this
#hide[#translate("assistance"): ]#name-with-titles(assistant)
]
]
]
]
#if reviewers.len() > 0 {
let signatures = reviewers.map(signature)
while signatures.len() < 3 {
signatures.insert(0, [])
}
v(3em)
[#translate("dissertation-reviewed-by"):]
v(3em)
grid(columns: (1fr, 1fr, 1fr), align: center, ..signatures)
}
#place(
bottom + center,
dy: 3em,
)[
#set line(stroke: 0.5pt)
#grid(
columns: (1fr, 1fr, 1fr),
rows: (auto, auto),
align: (left, center, center),
row-gutter: 4em,
[#translate("vienna"), #date.display("[day].[month].[year]") #v(2em)],
signature(author),
signature(advisor),
grid.cell(colspan: 3)[
#align(center)[
#show par: set block(spacing: 0.5em)
#line(length: 100%)
#translate("TU")
#translate("TU-postal") $dot$ #translate("TU-address") $dot$ #translate("TU-tel") $dot$ #translate("TU-web")
]
],
)
]
]
} |
https://github.com/typst/packages | https://raw.githubusercontent.com/typst/packages/main/packages/preview/unichar/0.1.0/ucd/block-10840.typ | typst | Apache License 2.0 | #let data = (
("IMPERIAL ARAMAIC LETTER ALEPH", "Lo", 0),
("IMPERIAL ARAMAIC LETTER BETH", "Lo", 0),
("IMPERIAL ARAMAIC LETTER GIMEL", "Lo", 0),
("IMPERIAL ARAMAIC LETTER DALETH", "Lo", 0),
("IMPERIAL ARAMAIC LETTER HE", "Lo", 0),
("IMPERIAL ARAMAIC LETTER WAW", "Lo", 0),
("IMPERIAL ARAMAIC LETTER ZAYIN", "Lo", 0),
("IMPERIAL ARAMAIC LETTER HETH", "Lo", 0),
("IMPERIAL ARAMAIC LETTER TETH", "Lo", 0),
("IMPERIAL ARAMAIC LETTER YODH", "Lo", 0),
("IMPERIAL ARAMAIC LETTER KAPH", "Lo", 0),
("IMPERIAL ARAMAIC LETTER LAMEDH", "Lo", 0),
("IMPERIAL ARAMAIC LETTER MEM", "Lo", 0),
("IMPERIAL ARAMAIC LETTER NUN", "Lo", 0),
("IMPERIAL ARAMAIC LETTER SAMEKH", "Lo", 0),
("IMPERIAL ARAMAIC LETTER AYIN", "Lo", 0),
("IMPERIAL ARAMAIC LETTER PE", "Lo", 0),
("IMPERIAL ARAMAIC LETTER SADHE", "Lo", 0),
("IMPERIAL ARAMAIC LETTER QOPH", "Lo", 0),
("IMPERIAL ARAMAIC LETTER RESH", "Lo", 0),
("IMPERIAL ARAMAIC LETTER SHIN", "Lo", 0),
("IMPERIAL ARAMAIC LETTER TAW", "Lo", 0),
(),
("IMPERIAL ARAMAIC SECTION SIGN", "Po", 0),
("IMPERIAL ARAMAIC NUMBER ONE", "No", 0),
("IMPERIAL ARAMAIC NUMBER TWO", "No", 0),
("IMPERIAL ARAMAIC NUMBER THREE", "No", 0),
("IMPERIAL ARAMAIC NUMBER TEN", "No", 0),
("IMPERIAL ARAMAIC NUMBER TWENTY", "No", 0),
("IMPERIAL ARAMAIC NUMBER ONE HUNDRED", "No", 0),
("IMPERIAL ARAMAIC NUMBER ONE THOUSAND", "No", 0),
("IMPERIAL ARAMAIC NUMBER TEN THOUSAND", "No", 0),
)
|
https://github.com/frectonz/the-pg-book | https://raw.githubusercontent.com/frectonz/the-pg-book/main/book/158.%20know.html.typ | typst | know.html
How You Know
December 2014I've read Villehardouin's chronicle of the Fourth Crusade at least
two times, maybe three. And yet if I had to write down everything
I remember from it, I doubt it would amount to much more than a
page. Multiply this times several hundred, and I get an uneasy
feeling when I look at my bookshelves. What use is it to read all
these books if I remember so little from them?A few months ago, as I was reading <NAME>'s excellent
biography of Hilbert, I figured out if not the answer to this
question, at least something that made me feel better about it.
She writes:
Hilbert had no patience with mathematical lectures which filled
the students with facts but did not teach them how to frame a
problem and solve it. He often used to tell them that "a perfect
formulation of a problem is already half its solution."
That has always seemed to me an important point, and I was even
more convinced of it after hearing it confirmed by Hilbert.But how had I come to believe in this idea in the first place? A
combination of my own experience and other things I'd read. None
of which I could at that moment remember! And eventually I'd forget
that Hilbert had confirmed it too. But my increased belief in the
importance of this idea would remain something I'd learned from
this book, even after I'd forgotten I'd learned it.Reading and experience train your model of the world. And even if
you forget the experience or what you read, its effect on your model
of the world persists. Your mind is like a compiled program you've
lost the source of. It works, but you don't know why.The place to look for what I learned from Villehardouin's chronicle
is not what I remember from it, but my mental models of the crusades,
Venice, medieval culture, siege warfare, and so on. Which doesn't
mean I couldn't have read more attentively, but at least the harvest
of reading is not so miserably small as it might seem.This is one of those things that seem obvious in retrospect. But
it was a surprise to me and presumably would be to anyone else who
felt uneasy about (apparently) forgetting so much they'd read.Realizing it does more than make you feel a little better about
forgetting, though. There are specific implications.For example, reading and experience are usually "compiled" at the
time they happen, using the state of your brain at that time. The
same book would get compiled differently at different points in
your life. Which means it is very much worth reading important
books multiple times. I always used to feel some misgivings about
rereading books. I unconsciously lumped reading together with work
like carpentry, where having to do something again is a sign you
did it wrong the first time. Whereas now the phrase "already read"
seems almost ill-formed.Intriguingly, this implication isn't limited to books. Technology
will increasingly make it possible to relive our experiences. When
people do that today it's usually to enjoy them again (e.g. when
looking at pictures of a trip) or to find the origin of some bug in
their compiled code (e.g. when <NAME> succeeded in remembering
the childhood trauma that prevented him from singing). But as
technologies for recording and playing back your life improve, it
may become common for people to relive experiences without any goal
in mind, simply to learn from them again as one might when rereading
a book.Eventually we may be able not just to play back experiences but
also to index and even edit them. So although not knowing how you
know things may seem part of being human, it may not be.
Thanks to <NAME>, <NAME>, and <NAME> for reading
drafts of this.Japanese Translation
|
|
https://github.com/ds26gte/adoc2typ | https://raw.githubusercontent.com/ds26gte/adoc2typ/main/typstrc.typ | typst | // created 2023-03-24
// last modified 2023-11-10
// to use, at head of document, have
//
// #import "/typstrc.typ": *
//
// #show: prose
//
// (above assumes typstrc.typ is in ~, and $TYPST_ROOT is ~
// this file is autoincluded when adoc2typ is used to convert an AsciiDoc adoc file to
// its Typst equivalent
#let prose(doc) = {
set par(justify: true, first-line-indent: 2em)
set block(spacing: 9pt)
// set text(font: "New Computer Modern")
// set text(font: "baskervald adf std")
doc
}
// #medbreak for thought break
#let medbreak = v(2em, weak: true)
|
|
https://github.com/camryntwaddle/resume | https://raw.githubusercontent.com/camryntwaddle/resume/main/light-cv/cv-en.typ | typst | #import "@preview/light-cv:0.1.0": *
#set par(justify: true, hanging-indent: 6pt, first-line-indent: 6pt)
#show: cv
#let icons = (
phone: image("media/phone_icon.svg", width: 0pt),
homepage: image("media/phone_icon.svg", width: 0pt),
linkedin: image("media/icons8-linkedin.svg", width: 0pt),
github: image("media/icons8-github.svg", width: 0pt),
xing: fa-xing(),
mail: image("media/icons8-gmail.svg", width: 0pt)
)
#header(
full-name: [<NAME>],
job-title: [Bachelor of Informatics Hons Student],
socials: (
(
icon: icons.github,
text: text(fill: rgb("#007fad"), font: "Roboto")[GitHub],
link: "https://github.com/camryntwaddle"
),
(
icon: icons.linkedin,
text: text(rgb("#007fad"), font: "Roboto")[LinkedIn],
link: "www.linkedin.com/in/camryn-twaddle-958a79262"
),
(
icon: icons.mail,
text: text(rgb("#007fad"), font: "Roboto")[074 204 1361],
link: "tel://0742041361"
),
(
icon: icons.mail,
text: text(rgb("#007fad"), font: "Roboto")[<EMAIL>],
link: "mailto://<EMAIL>"
)
),
profile-picture: image("media/avatar.jpeg")
)
#section("About") \
#v(3pt)
#text(font: "Source Sans Pro", weight: "extrabold", fill: black)[ I am a dedicated and driven honours student at Stellenbosch University, pursuing a Bachelor of Informatics Honours degree. I graduated with a BCom in Management Science with a focal area in Information Systems Management, and have acquired skills in system design, programming, and data analysis. I minored in financial management and have skills in financial interpretation. During university, I have earned awards for top academic performance and development projects, as well as received a membership in the Golden Key Honour Society. I enjoy new opportunities and am eager to further my skills and knowledge through learning and professional development.]
#text("")
#section("Experience")
#entry(
title: text(font: "Source Sans Pro", weight: "extrabold")[Software Developer Intern],
company-or-university: "Advance Guidance",
date: text(font: "Source Sans Pro", weight: "bold")[Jun 2024 - Jul 2024],
location: "",
logo: image("media/AG-icon.png"),
description: list(
text(font: "Source Sans Pro", weight: "extrabold")[Helped create a python package designed to streamline the data science model development process.],
text(font: "Source Sans Pro", weight: "extrabold")[The package aims to simplify model development steps such as, data processing, feature extraction, data profiling, model training and using the model.],
text(font: "Source Sans Pro", weight: "extrabold")[As an intern, I focused on creating data profiling for the features and generating SHAP graphs based on the model.],
text(font: "Source Sans Pro", weight: "extrabold")[The package had to be able to interact with AWS S3 and file system data sources, as well as data read in using PySpark and ],
)
)
#entry(
title: text(font: "Source Sans Pro", weight: "extrabold")[Teaching Assistant],
company-or-university: "Stellenbosch Univerity",
date: text(font: "Source Sans Pro", weight: "bold")[Feb 2024 - June 2024],
location: "",
logo: image("media/stellies.png"),
description: list(
text(font: "Source Sans Pro", weight: "extrabold")[Supported students during practical sessions and guided them in the solution of prescribed practical submissions.],
text(font: "Source Sans Pro", weight: "extrabold")[Conducting formative assessments and marking of summative assessments with training.],
text(font: "Source Sans Pro", weight: "extrabold")[Supporting lecturer with invigilating tests.],
text(font: "Source Sans Pro", weight: "extrabold")[Module administration: managing practical attendance, replying to student queries, and mark management.],
text(font: "Source Sans Pro", weight: "extrabold")[Assisted the lecturer with supplementary classes for the undergraduates.]
)
)
#entry(
title: text(font: "Source Sans Pro", weight: "extrabold")[Data Analyst Intern],
company-or-university: "Advance Guidance",
date: text(font: "Source Sans Pro", weight: "bold")[Nov 2022 - Jan 2023],
location: "",
logo: image("media/AG-icon.png"),
description: list(
text(font: "Source Sans Pro", weight: "extrabold")[Created a client dashboard using Python Dash, pandas and ggplot to provide insightful graphs. Styled the graphs to match the client's defined style requirements.],
text(font: "Source Sans Pro", weight: "extrabold")[Cleaned and formatted data using notebooks in Visual Studio Code.],
text(font: "Source Sans Pro", weight: "extrabold")[Worked with AWS data storage, git through GitLab and Python packages.],
text(font: "Source Sans Pro", weight: "extrabold")[Attended client meetings.],
)
)
#v(1pt)
#section("Education")
#entry(
title: text(font: "Source Sans Pro", weight: "extrabold")[Bachelor of Informatics Honours],
company-or-university: "Stellenbosch University",
date: text(font: "Source Sans Pro", weight: "bold")[2024 [Expected]],
location: "",
logo: image("media/stellies.png"),
description: list(
text(font: "Source Sans Pro", weight: "extrabold")[Research Project: Exploratory Social Media Data Analysis. Involves collecting social media data, cleaning the data and running various analyses. Languages used for this will be Python and SQL.],
text(font: "Source Sans Pro", weight: "extrabold")[Conducted comprehensive statistical and data analysis using R. This included data cleaning, visualisation, machine learning (linear regression, clustering and classification), and text analysis (topic modelling and sentiment analysis).],
text(font: "Source Sans Pro", weight: "extrabold")[Designed wireframes and prototypes using Figma, focusing on interface, user experience and user journeys.],
text(font: "Source Sans Pro", weight: "extrabold")[Reviewed and presented on various information systems research frameworks and theories. ]
)
)
#pagebreak()
#entry(
title: text(font: "Source Sans Pro", weight: "extrabold")[Bachelor of Commerce in Management Science],
company-or-university: "Stellenbosch University",
date: text(font: "Source Sans Pro", weight: "bold")[2020 - 2023],
location: "",
logo: image("media/stellies.png"),
description: list(
text(font: "Source Sans Pro", weight: "extrabold")[Focal area in Information Systems Management. Developed skills in various programming languages, database theory and design, and systems theory.],
text(font: "Source Sans Pro", weight: "extrabold")[Minor in financial management and business analytics. Developed financial analysis skills through calculating and interpreting key financial indicators. Utilised Power BI for data visualisation and created interactive reports and dashboards.],
text(font: "Source Sans Pro", weight: "extrabold")[Final year average: 74%],
text(font: "Source Sans Pro", weight: "extrabold")[Received awards for top third year information systems student and top -development group project]
)
)
#section("Skills & Interests")
#skill(
category: text(font: "Source Sans Pro", weight: "extrabold")[Languages],
skills: ("Python", "R", "SQL", "HTML & CSS", "React & React Admin", "Javascript")
)
#skill(
category: text(font: "Source Sans Pro", weight: "extrabold")[Programmes],
skills: ("Visual Studio Code", "RStudio","PowerBI", "Visual Paradigm", "GitHub", "GitLab","Figma")
)
#skill(
category: text(font: "Source Sans Pro", weight: "extrabold")[Other skills],
skills: ("UML modelling", "Financial analysis", "Financial interpretation")
)
#skill(
category: text(font: "Source Sans Pro", weight: "extrabold")[Interests],
skills: ("Reading", "Organising and planning", "Web design", "Data analytics")
)
#section("References") \
#v(2pt)
#text(font: "Source Sans Pro", weight: "extrabold", size: 12pt)[<NAME> \ ]
#text(font: "Source Sans Pro", weight: "bold", size: 10pt)[Honours lecturer and research supervisor \ ]
#text(font: "Source Sans Pro", size: 11pt)[`<EMAIL>` \ ]
#v(1pt)
#text(font: "Source Sans Pro", weight: "extrabold", size: 12pt)[<NAME> \ ]
#text(font: "Source Sans Pro", weight: "bold", size: 10pt)[Junior data analyst and internship supervisor \ ]
#text(font: "Source Sans Pro", size: 11pt)[`<EMAIL>` \ ]
|
|
https://github.com/pauladam94/ENS-Rennes-Typst-Slides-Template | https://raw.githubusercontent.com/pauladam94/ENS-Rennes-Typst-Slides-Template/main/main.typ | typst | #import "slides.typ": *
#let test = 5
#show: slides.with(
title: "Big Nice And Long Title",
short-title : "Short Title",
subtitle: "sub title",
authors: "Author Jean <NAME>",
short-authors: "Author <NAME>.",
// date: datetime.today(),
date: "5th May 1789",
color-accentuation : (
eastern,
blue,
teal,
navy
),
)
#set text(font: "Fira Code", size: 18pt)
#set list(marker: ([->], [--]))
#slide(type: "title")
#slide(type: "outline")
#section("What is Ground ?")
#slide(title: "What is Ground?")[
Everithing in one slide
- First Point
- Second Point
- Third Point
]
#slide(title: "What is Ground?")[
One Slide after an another
][
- First Point
][
- Second Point
][
- Third Point
]
|
|
https://github.com/DieracDelta/presentations | https://raw.githubusercontent.com/DieracDelta/presentations/master/polylux/book/src/dynamic/obo-lbl.md | markdown | # More sophisticated piecewise revealing
## `#one-by-one`
`#pause` may be considered syntactically a bit surprising by some although (or
because) it is very convenient to use.
If you prefer to signal the grouping of content appearing together syntactically
by using scopes, you can use `#one-by-one`:
```typ
{{#include one-by-one.typ:6}}
```
resulting in
If we still want to uncover certain elements one after the other but starting
on a later subslide, we can use the optional `start` argument of `#one-by-one`:
```typ
{{#include one-by-one-start.typ:6}}
```
resulting in
This optional `start` argument exists for all functions displayed on this page.
## `#line-by-line`
`#one-by-one` is especially useful for arbitrary contents that you want to display
in that manner.
Sometimes, it produces a bit too much syntactical noise again with
all the brackets between content, though.
That is especially true if each piece fits into a single line, as for example
for a simple bullet list.
Instead of
```typ
#one-by-one[
- first
][
- second
][
- third
]
```
you can also write
```typ
{{#include line-by-line.typ:6:10}}
```
resulting in
The content provided as an argument to `#line-by-line` is parsed as a `sequence`
by Typst with one element per line (hence the name of this function).
We then simply iterate over that `sequence` as if it were given to `#one-by-one`.
## `#list-one-by-one`
What if you want a more customized bullet list, though?
The code above produces a tight list, for example, and maybe you do not want that.
All your needs are covered by the `#list-one-by-one` function:
```typ
{{#include list-one-by-one.typ:6}}
```
resulting in
As you can see, you can provide any arguments that the
[`list`](https://typst.app/docs/reference/layout/list/) function accepts.
## `#enum-one-by-one`
Analogously, there is the same thing for enums, accepting the same arguments as
[`enum`](https://typst.app/docs/reference/layout/enum/):
```typ
{{#include enum-one-by-one.typ:6}}
```
resulting in
## `#terms-one-by-one`
And finally we have a function to produce a
[term list](https://typst.app/docs/reference/layout/terms/):
```typ
{{#include terms-one-by-one.typ:6}}
```
resulting in
**Note** that `#list-one-by-one` and `#enum-one-by-one` expect only the body of
the individual items while you need to provide an actual term item (using the
`/ term: description` syntax) to `#terms-one-by-one`.
Also, you will realise that the bullet markers, the numbers, and the terms in
the lists, enums, and term lists are not hidden for technical reasons, respectively.
You can truly consider this either a bug or a feature...
(This could be "fixed" for enums and term lists, so file an issue on GitHub if
this bothers you a lot!)
|
|
https://github.com/elipousson/typstdoc | https://raw.githubusercontent.com/elipousson/typstdoc/main/_extensions/typstdoc/typst-show.typ | typst | Creative Commons Zero v1.0 Universal | #show: typstdoc.with(
// Document attributes
$if(title)$
title: "$title$",
$endif$
$if(by-author)$
authors: (
$for(by-author)$
$if(it.name.literal)$
( name: "$it.name.literal$",
affiliation: [$for(it.affiliations)$$it.name$$sep$, $endfor$],
email: [$it.email$] ),
$endif$
$endfor$
),
$endif$
// TODO: Add support for keywords
// $if(keywords)$
// keywords: ($for(keywords)$$keyword$$sep$,$endfor$),
// $endif$
$if(date)$
date: [$date$],
$endif$
$if(lang)$
lang: "$lang$",
$endif$
$if(region)$
region: "$region$",
$endif$
$if(abstract)$
abstract: [$abstract$],
$endif$
$if(abstract-label)$
abstract-label: "$abstract-label$",
$endif$
// Page layout, fill, and numbering
$if(papersize)$
paper: "$papersize$",
$endif$
$if(margin)$
margin: ($for(margin/pairs)$$margin.key$: $margin.value$,$endfor$),
$endif$
$if(flipped)$
flipped: $flipped$,
$endif$
cols: $if(columns)$$columns$$else$1$endif$, // Columns
$if(gutter)$
gutter: $gutter$,
$endif$
$if(fill)$
fill: "$fill$",
$endif$
$if(page-numbering)$
page-numbering: "$page-numbering$",
$endif$
$if(page-number-align)$
page-number-align: $page-number-align$,
$endif$
// Typography
$if(mainfont)$
font: ("$mainfont$",),
$endif$
$if(monofont)$
monofont: ("$monofont$"),
$endif$
$if(fontsize)$
fontsize: $fontsize$,
$endif$
$if(fontweight)$
fontweight: $fontweight$,
$endif$
$if(fontfill)$
fontfill: "$fontfill$",
$endif$
$if(slashed-zero)$
slashed-zero: $slashed-zero$,
$endif$
// Body text typography
$if(justify)$
justify: $justify$,
$endif$
$if(linebreaks)$
linebreaks: "$linebreaks$",
$endif$
$if(first-line-indent)$
first-line-indent: $first-line-indent$,
$endif$
$if(hanging-indent)$
hanging-indent: $hanging-indent$,
$endif$
$if(leading)$
leading: $leading$,
$endif$
$if(spacing)$
spacing: $spacing$,
$endif$
// Title typography
$if(title-font)$
title-font: ("$title-font$"),
$else$
title-font: ("$mainfont$"),
$endif$
$if(title-fontfill)$
title-fontfill: "$title-fontfill$",
$endif$
$if(title-align)$
title-align: $title-align$,
$endif$
$if(title-fontsize)$
title-fontsize: $title-fontsize$,
$endif$
$if(title-inset)$
title-inset: $title-inset$,
$endif$
$if(title-weight)$
title-weight: "$title-weight$",
$endif$
// Section numbering
$if(section-numbering)$
sectionnumbering: "$section-numbering$",
$endif$
$if(heading-font)$
heading-font: ("$heading-font$"),
$endif$
$if(heading-fontfill)$
heading-fontfill: "$heading-fontfill$",
$endif$
$if(heading-fontsize)$
heading-fontsize: $heading-fontsize$,
$endif$
// Table of contents
$if(toc)$
toc: $toc$,
$endif$
$if(toc-title)$
toc_title: [$toc-title$],
$endif$
$if(toc-indent)$
toc_indent: $toc-indent$,
$endif$
toc_depth: $toc-depth$,
// List of figures
$if(lof)$
lof: $lof$,
$endif$
$if(lof-title)$
lof_title: [$lof-title$],
$endif$
// List of tables
$if(lot)$
lot: $lot$,
$endif$
$if(lot-title)$
lot_title: [$lot-title$],
$endif$
// Header and footer
$if(header)$
header: [$header$],
$endif$
$if(header-fontfill)$
header-fontfill: "$header-fontfill$",
$endif$
$if(header-fontsize)$
header-fontsize: $header-fontsize$,
$endif$
$if(header-align)$
header-align: [$header-align$],
$endif$
$if(header-ascent)$
header-ascent: $header-ascent$,
$endif$
$if(footer)$
footer: [$footer$],
$endif$
$if(footer-fontfill)$
footer-fontfill: "$footer-fontfill$",
$endif$
$if(footer-fontsize)$
footer-fontsize: $footer-fontsize$,
$endif$
$if(footer-align)$
footer-align: [$footer-align$],
$endif$
$if(footer-descent)$
footer-descent: $footer-descent$,
$endif$
// List numbering and indent
$if(list-numbering)$
list-numbering: "$list-numbering$",
$endif$
$if(list-indent)$
list-indent: $list-indent$,
$endif$
$if(list-body-indent)$
list-body-indent: $list-body-indent$,
$endif$
// List tight and list spacing
// $if(list-tight)$
// list-tight: $list-tight$,
// $endif$
// $if(list-spacing)$
// list-spacing: $list-spacing$,
// $endif$
// Bibliography
$if(bibliography)$
bibliography-file: "$bibliography$",
$endif$
$if(blockquote-fontsize)$
blockquote-fontsize: $blockquote-fontsize$
$endif$
)
|
https://github.com/Quaternijkon/notebook | https://raw.githubusercontent.com/Quaternijkon/notebook/main/content/数据结构与算法/.chapter-算法/数学/整数反转.typ | typst | #import "../../../../lib.typ":*
=== #Title(
title: [整数反转],
reflink: "https://leetcode.cn/problems/reverse-integer/description/",
level: 2,
)<整数反转>
#note(
title: [
整数反转
],
description: [
给你一个 32 位的有符号整数 x ，返回将 x 中的数字部分反转后的结果。
如果反转后整数超过 32 位的有符号整数的范围 $[−2^31, 2^31 − 1]$ ，就返回 0。
假设环境不允许存储 64 位整数（有符号或无符号）。
],
examples: ([
输入：x = 123
输出：321
],[
输入：x = -123
输出：-321
],[
输入：x = 120
输出：21
],[
输入：x = 0
输出：0
]
),
tips: [
$−2^31 <= x <= 2^31 − 1$
],
solutions: (
( name:[数学],
text:[
],code:[
```cpp
class Solution {
public:
int reverse(int x) {
int res = 0;
while (x != 0) {
if (res < INT_MIN / 10 || res > INT_MAX / 10) {
return 0;
}
res = res * 10 + x % 10;
x /= 10;
}
return res;
}
};
```
]),
),
gain:none,
)
|
|
https://github.com/AlbanFALCOZ/MY_CV | https://raw.githubusercontent.com/AlbanFALCOZ/MY_CV/main/French_CV/setup.typ | typst | #import "@preview/fontawesome:0.2.1": *
#let headercolor = gray
#let pblue = rgb("#0395DE")
#let gray80 = rgb("#333333") // \color{black!80}
#let sidecolor = rgb("#E7E7E7")
#let mainblue = rgb("#0E5484")
#let maingray = rgb("#B9B9B9")
#let fontSize = (
tiny: 5pt,
scriptsize: 7pt,
footnotesize: 8pt,
small: 9pt,
normalsize: 10pt,
large: 13pt,
Large: 14pt,
LARGE: 17pt,
huge: 20pt,
Huge: 25pt,
)
#let main(
pages: 1,
left,
right,
) = {
set page(
margin: (
left: 0cm,
right: 0cm,
top: 0cm,
bottom: 0cm,
)
)
grid(
columns: (35%, 65%),
rows: auto,
// column-gutter: 1em,
block(
fill: sidecolor,
height: pages * 100%,
pad(
top: 1cm,
rest: 0.5cm,
left
)
),
block(
height: auto,
pad(
top: 0.7cm,
rest: 0.5cm,
right,
),
),
)
}
#let profile(
name: "",
internship: "",
) = {
text(fill: pblue, size: fontSize.Huge, name) //
align(center, image("images/skills.png", width: 80%))
}
#let profile_section(title) = {
v(3mm)
align(left)[
#text(size: fontSize.huge, fill: gray80)[#title]
#box(width: 1fr, baseline: -0.5em, line(length: 100%, stroke: gray80))
]
}
#let progress(score) = {
box(rect(
height: 1em,
width: score * 100%,
fill: mainblue,
))
box(rect(
height: 1em,
width: (1 - score) * 100%,
fill: maingray,
))
}
/*
interest item is dictionary
(
interest: "AI",
score: 0.6 // 1.0 based percentage
)
*/
#let show_interests(interests) = {
set text(size: fontSize.large, fill: gray80)
for interest in interests {
text(interest.interest)
linebreak()
progress(interest.score)
}
}
#let show_contacts(contacts) = {
let c = ()
for contact in contacts {
c.push(fa-icon(contact.icon, solid: contact.at("solid", default: false), fill: pblue))
c.push(contact.text)
}
grid(
columns: (auto, auto),
column-gutter: 1em,
row-gutter: 1em,
..c
)
}
#let show_langues(langues) = {
let c = ()
for langue in langues {
c.push(align(center, image(langue.flag, width: 100%)))
c.push(text(langue.text))
}
grid(
columns: (12%, 78%),
column-gutter: 1em,
row-gutter: 1em,
..c
)
}
#let body_section(slice:0, title) = {
set text(size: fontSize.LARGE)
block[
#strong()[
#text(fill: gradient.linear(rgb("#5B86E5"),rgb("#36D1DC")), title)
]
]
}
/*
#1 period, like From - To
#2 title
#3 note, basic note
#4 addtional_note
#5 body: the main body
*/
#let period_item(
period: "",
title: "",
adress: "",
body: ""
) = {
grid(
columns: (20%, 80%),
block([
#period
#if adress.len() > 0 {
text("\n")
fa-icon("map-marker")
text(size: 9pt, style: "italic"," " +adress+"\n")
}]),
par([
#block()[
#strong(text(size: 12pt,title))
]
#text(size: 10pt,body)
])
)
}
#let school_period(
period: "",
title: "",
description: "",
school_name: "",
addtional_note: "",
) = {
grid(
columns: (20%, 80%),
block([
#text(period)
]),
par([
#strong(title)#text(description)
#text(top-edge: 3mm,"\n"+school_name)
#text("\n"+addtional_note, style: "italic")
]),
)
}
#let school_project(
period: "",
title: "",
lien: "",
body: "",
) = {
grid(
columns: (20%, 80%),
block([
#period
#text("\n")
#link(lien)[
#fa-icon(size: 20pt, fill: blue,"github")
]
]),
par([
#block()[
#strong(text(size: 12pt,title))
]
#text(size: 10pt,body)
])
)
} |
|
https://github.com/Myriad-Dreamin/tinymist | https://raw.githubusercontent.com/Myriad-Dreamin/tinymist/main/crates/tinymist-query/src/fixtures/call_info/builtin.typ | typst | Apache License 2.0 | #(/* position after */ calc.sin(1)) |
https://github.com/dark-flames/resume | https://raw.githubusercontent.com/dark-flames/resume/main/data/skill.typ | typst | MIT License | #import "../libs.typ": *
#import "../chicv.typ": *
#let skillList(env) = (
(
title: "Programming Languages",
cv-content: true,
content: [
Not limited to any specific language, especially experienced in Agda, C/C++, Haskell, PHP, Python, Rust, comfortable with Coq, Java, JavaScript, OCaml, TypeScript.
]
),
(
title: "Type Theory",
cv-content: true,
content: [familiar with various dependent type theories and their semantics, and have experience with formal verification.]
),
(
title: "Compiler",
cv-content: true,
content: [understand various compiler architectures, familiar with compiler frontend, especially in type checking. Also have experience in parser generator and DSL design.]
),
(
title: "Web Development",
cv-content: true,
content: cv-and-others(
env,
[
*7 years* of experience in full-stack web development, proficient in backend development, databases, and DevOps practices.
], [
*7 years* of experience in full-stack web development:
- _Backend_: proficient in various backend frameworks in PHP, Python, and Rust, including Symfony, Laravel, Django, and Actix. Familiar with message queues and asynchronous programming. Also experienced in backend framework design.
- _Frontend_: experienced with Vue.
- _Database_: knowledgeable in MySQL, PostgreSQL, Redis, and Elasticsearch with a strong background in database design and optimization.
- _DevOps_: skilled in Docker, proficient in CI/CD practices, and experienced with cloud services.
]
)
),
(
title: "Development Tools",
cv-content: false,
content: [can adapt to any editors/OSs, usually use JetBrains IDEs and VSCode under Ubuntu, familiar with git and docker, and have experience with team collaboration tools like GitHub and Slack.]
),
(
title: "Languages",
cv-content: true,
content: [Chinese: native, English: advanced, Japanese: intermediate]
),
)
#let skill(env) = {
multiLang(env, en: [== Skills], ja: [== 技能])
if(is-cv(env)) {
skillList(env).filter(s => s.cv-content)
} else {
skillList(env)
}.map(s => {
[- *#s.title:* #s.content]
}).join()
}
|
https://github.com/Shuenhoy/modern-zju-thesis | https://raw.githubusercontent.com/Shuenhoy/modern-zju-thesis/master/pages/graduate-title-zh.typ | typst | MIT License | #import "../utils/fonts.typ": 字号, 字体
#import "../utils/datetime-display.typ": datetime-display
#import "../utils/twoside.typ": *
#let graduate-title-zh(
info: (:),
// 其他参数
stroke-width: 0.5pt,
row-gutter: 11.5pt,
degree: "硕士",
) = {
if type(info.submit-date) == datetime {
info.submit-date = datetime-display(info.submit-date)
}
context {
twoside-pagebreak
counter(page).update(0)
v(-40pt)
set grid(
row-gutter: row-gutter,
rows: 1em,
stroke: (x, y) => (
bottom: if x == 1 {
stroke-width
} else {
none
},
),
)
set align(center)
v(20pt)
block(
width: 80%,
[
#set text(size: 字号.小二, weight: "bold")
#grid(
columns: (1fr),
align: (center),
stroke: (bottom: stroke-width),
info.title.first(),
..info.title.slice(1),
grid.cell(stroke: none)[], grid.cell(stroke: none)[],
)
],
)
v(-40pt)
[#image("../assets/zju-emblem.svg", width: page.width * 0.15)<mzt:no-header-footer>]
block(
width: 60%,
[
#set text(size: 字号.三号, weight: "bold")
#grid(
columns: (auto, 0.8fr),
align: (start, center),
"论文作者签名：", [],
grid.cell(stroke: none)[], grid.cell(stroke: none)[],
"指导教师签名：", [],
grid.cell(stroke: none)[], grid.cell(stroke: none)[],
)
],
)
block(
width: 70%,
[
#set text(size: 字号.四号)
#grid(
columns: (auto, 1fr),
align: (end, center),
"论文评阅人1：", info.reviewer.at(0) ,
..info.reviewer.enumerate(start: 0).slice(1).map(v => ([评阅人#(v.at(0)+1)：], v.at(1))).flatten(),
grid.cell(stroke: none)[], grid.cell(stroke: none)[],
"答辩委员会主席 ：", info.committe.at(0) ,
..info.committe.enumerate(start: 0).slice(1).map(v => ([委员#(v.at(0))：], v.at(1))).flatten(),
grid.cell(stroke: none)[], grid.cell(stroke: none)[],
)
#align(right)[
#grid(
columns: (auto, 10em),
align: (start, center),
"答辩日期：", info.defense-date.at(0),
)
]
],
)
}
twoside-emptypage
} |
https://github.com/Treeniks/bachelor-thesis-isabelle-vscode | https://raw.githubusercontent.com/Treeniks/bachelor-thesis-isabelle-vscode/master/utils/isabelle.typ | typst | #let isabelle(body) = {
show raw: set text(font: "Isabelle DejaVu Sans Mono", size: 10pt)
set text(font: "Isabelle DejaVu Sans Mono", size: 10pt)
box(
radius: 2pt,
inset: (x: 3pt),
outset: (y: 3pt),
fill: luma(235),
body,
)
}
#let vscode = box[Isabelle/VSCode]
#let jedit = box[Isabelle/jEdit]
#let isar = box[Isabelle/Isar]
#let scala = box[Isabelle/Scala]
#let ml = box[Isabelle/ML]
#let utf8isa = box[UTF-8-Isabelle]
#let utf8 = box[UTF-8]
|
|
https://github.com/ilsubyeega/circuits-dalaby | https://raw.githubusercontent.com/ilsubyeega/circuits-dalaby/master/Type%201/2/mod.typ | typst | #include "13.typ"
#include "14.typ"
#include "19.typ"
#include "28.typ"
#include "35.typ"
#include "41.typ"
#include "46.typ" |
|
https://github.com/typst/packages | https://raw.githubusercontent.com/typst/packages/main/packages/preview/quick-sip/0.1.0/template/main.typ | typst | Apache License 2.0 | #import "@preview/quick-sip:0.1.0": *
#show: QRH.with(title: "Title")
#section("Section title")[
#step("Switch", "Action")
//.. Rest of section goes here
] |
https://github.com/HKFoggyU/hkust-thesis-typst | https://raw.githubusercontent.com/HKFoggyU/hkust-thesis-typst/main/hkust-thesis/utils/constants.typ | typst | LaTeX Project Public License v1.3c | #let linespacing = 1.07em
#let pagemargin = 25mm
#let abstract-linespacing = 0.49em
// fonts
#let font-names = (
main: "Times New Roman",
toc: "Times New Roman",
title: "Times New Roman",
)
#let font-sizes = (
main: 12pt,
title: 16pt,
toc: 12pt,
) |
https://github.com/RandomcodeDev/FalseKing-Design | https://raw.githubusercontent.com/RandomcodeDev/FalseKing-Design/main/engine/engine.typ | typst | #set heading(numbering: "1.")
#show link: underline
#align(center, text(30pt)[*Чифир (Chifir) Engine*])
#align(center, text(20pt)[By <NAME>])
#outline()
#pagebreak()
#include("intro.typ")
#pagebreak()
#include("components.typ")
#pagebreak()
#include("platforms.typ")
#pagebreak()
#include("libraries.typ")
#pagebreak()
#include("tools.typ")
#pagebreak()
#include("scene.typ")
#pagebreak()
#include("renderer.typ")
#pagebreak()
|
|
https://github.com/RandomcodeDev/FalseKing-Design | https://raw.githubusercontent.com/RandomcodeDev/FalseKing-Design/main/game/platforms.typ | typst | = Platforms
The engine will support at least Windows and Linux. All desktop platforms will use Steam, all others will use the platform's official store.
#table(
columns: 3,
[*Platform*], [*Toolchain*], [*Graphics API(s)*],
[Windows], [MSVC, GDK], [DirectX 12, Vulkan, OpenGL],
[Linux], [LLVM], [Vulkan, OpenGL],
[Xbox Series X|S], [MSVC, GDKX], [DirectX 12],
[PlayStation 5], [LLVM, PS5 SDK], [GNM],
[Nintendo Switch/Switch 2], [LLVM, Switch SDK], [Vulkan]
)
|
|
https://github.com/Pablo-Gonzalez-Calderon/showybox-package | https://raw.githubusercontent.com/Pablo-Gonzalez-Calderon/showybox-package/main/showy.typ | typst | MIT License | /*
* ShowyBox - A package for Typst
* <NAME> and Showybox Contributors (c) 2023-2024
*
* Main Contributors:
* - <NAME> (<https://github.com/jneug>)
*
* showy.typ -- The package's main file containing the
* public and (more) useful functions
*
* This file is under the MIT license. For more
* information see LICENSE on the package's main folder.
*/
/*
* Import functions
*/
#import "lib/func.typ": *
#import "lib/sections.typ": *
#import "lib/shadows.typ": *
#import "lib/id.typ": *
#import "lib/pre-rendering.typ": *
/*
* Function: showybox()
*
* Description: Creates a showybox
*
*/
#let showybox(
frame: (:),
title-style: (:),
boxed-style: (:),
body-style: (:),
footer-style: (:),
sep: (:),
shadow: none,
width: 100%,
breakable: false,
/* align: none, / collides with align-function */
/* spacing, above, and below are by default what's set for all `block`s */
title: "",
footer: "",
..body,
) = {
/*
* Complete and store all the dictionary-like-properties inside a
* single dictionary. This will improve readability and avoids to
* constantly have a default option while accessing
*/
let props = (
frame: (
title-color: frame.at("title-color", default: black),
body-color: frame.at("body-color", default: white),
border-color: frame.at("border-color", default: black),
footer-color: frame.at("footer-color", default: luma(220)),
inset: frame.at("inset", default: (x: 1em, y: .65em)),
radius: frame.at("radius", default: 5pt),
thickness: frame.at("thickness", default: 1pt),
dash: frame.at("dash", default: "solid"),
),
title-style: (
color: title-style.at("color", default: white),
weight: title-style.at("weight", default: "regular"),
align: title-style.at("align", default: left),
sep-thickness: title-style.at("sep-thickness", default: 1pt),
boxed-style: if title-style.at("boxed-style", default: none) != none and type(title-style.at("boxed-style", default: none)) == dictionary {
(
anchor: (
y: title-style.boxed-style.at("anchor", default: (:)).at("y", default: horizon),
x: title-style.boxed-style.at("anchor", default: (:)).at("x", default: left),
),
offset: (
x: title-style.boxed-style.at("offset", default: (:)).at("x", default: 0pt),
y: title-style.boxed-style.at("offset", default: (:)).at("y", default: 0pt),
),
radius: title-style.boxed-style.at("radius", default: 5pt),
)
} else {
none
},
),
body-style: (
color: body-style.at("color", default: black),
align: body-style.at("align", default: left),
),
footer-style: (
color: footer-style.at("color", default: luma(85)),
weight: footer-style.at("weight", default: "regular"),
align: footer-style.at("align", default: left),
sep-thickness: footer-style.at("sep-thickness", default: 1pt),
),
sep: (
thickness: sep.at("thickness", default: 1pt),
dash: sep.at("dash", default: "solid"),
gutter: sep.at("gutter", default: 0.65em),
),
shadow: if shadow != none {
if type(shadow.at("offset", default: 4pt)) != dictionary {
(offset: (
x: shadow.at("offset", default: 4pt),
y: shadow.at("offset", default: 4pt),
), color: shadow.at("color", default: luma(128)))
} else {
(offset: (
x: shadow.at("offset").at("x", default: 4pt),
y: shadow.at("offset").at("y", default: 4pt),
), color: shadow.at("color", default: luma(128)))
}
} else {
none
},
breakable: breakable,
width: width,
title: title,
)
// Add title, body and footer inset (if present)
for section-inset in ("title-inset", "body-inset", "footer-inset") {
let value = frame.at(section-inset, default: none)
if value != none {
props.frame.insert(section-inset, value)
}
}
_showy-id.step()
context {
let id = str(_showy-id.get().first())
/*
* Update title height in state.
*
* NOTE: Although a `place` and `hide` are used in the pre-render
* function, for avoiding nesting components inside unaccesible
* containers, we must call this function inside another `place`.
*/
if title != "" and props.title-style.boxed-style != none {
place(top, showy-pre-render-title(props, id))
}
/*
* Alignment wrapper
*/
let alignprops = (:)
for prop in ("spacing", "above", "below") {
if prop in body.named() {
alignprops.insert(prop, body.named().at(prop))
}
}
let alignwrap(content) = block(
..alignprops,
breakable: breakable,
width: 100%,
if "align" in body.named() and body.named().align != none {
align(body.named().align, content)
} else {
content
},
)
let showyblock = context {
let my-state = state("showybox-" + id, 0pt)
// /*
// * Decide wheter add a page break or not, based on the remaining
// * space in the page. For calculating it, we substract the page
// * margin to the page size. Later, we estimate a minimum size of
// * the showybox, adding the frame thickness, the frame inset,
// * and the size of 1 line of text.
// */
// let abs-margin = if page.margin == auto {
// let small-side = calc.min(page.height, page.width)
// (2.5/21) * small-side // According to docs, this is the 'auto' margin
// } else {
// margin.at("y", default: margin.at("top", default: margin.rest))
// }
// let remaining = 0pt
// let to-use = 0pt
// remaining = page.height - location.position(here()).y - abs-margin
// to-use += text.size.to-absolute()
// if type(props.frame.thickness) == dictionary {
// to-use += props.frame.thickness.at("y", default: props.frame.thickness.at("top", default: props.frame.inset.at("rest", default: .65em))).to-absolute()
// to-use += props.frame.thickness.at("y", default: props.frame.thickness.at("bottom", default: props.frame.inset.at("rest", default: .65em))).to-absolute()
// } else {
// to-use += 2*props.frame.thickness
// }
// if type(props.frame.inset) == dictionary {
// to-use += 4*props.frame.inset.at("y", default: props.frame.inset.at("top", default: props.frame.inset.at("rest", default: .65em))).to-absolute()
// } else {
// to-use += 4*props.frame.inset.to-absolute()
// }
// // Since we cannot add a pagebreak directly, add the to-use space,
// // which would be greater than the remaining space.
// if remaining - to-use <= 0pt {
// v(to-use)
// }
if title != "" and props.title-style.boxed-style != none {
if props.title-style.boxed-style.anchor.y == bottom {
v(my-state.final())
} else if props.title-style.boxed-style.anchor.y == horizon {
v(my-state.final() / 2)
} // Otherwise don't add extra space
// Add the boxed-title shadow before rendering the body
if props.shadow != none {
showy-boxed-title-shadow(props, id)
}
}
block(
width: if props.shadow == none {
width
} else {
100%
},
fill: props.frame.body-color,
radius: props.frame.radius,
inset: 0pt,
spacing: 0pt,
breakable: breakable,
stroke: showy-stroke(props.frame),
)[
/*
* Title of the showybox
*/
#if title != "" and props.title-style.boxed-style == none {
showy-title(props)
} else if title != "" and props.title-style.boxed-style != none {
if props.title-style.boxed-style.anchor.y == top {
v(my-state.final())
} else if props.title-style.boxed-style.anchor.y == horizon {
v(my-state.final() / 2)
}
place(
top + props.title-style.boxed-style.anchor.x,
dx: props.title-style.boxed-style.offset.x,
dy: props.title-style.boxed-style.offset.y + if props.title-style.boxed-style.anchor.y == bottom {
-my-state.final()
} else if props.title-style.boxed-style.anchor.y == horizon {
-my-state.final() / 2
},
block(spacing: 0pt, inset: (x: 1em), showy-title(props)),
)
}
/*
* Body of the showybox
*/
#showy-body(props, ..body)
/*
* Footer of the showybox
*/
#if footer != "" {
showy-footer(props, footer)
}
]
}
alignwrap(showy-shadow(props, showyblock, id))
}
} |
https://github.com/hei-templates/hevs-typsttemplate-thesis | https://raw.githubusercontent.com/hei-templates/hevs-typsttemplate-thesis/main/00-templates/page-title-thesis.typ | typst | MIT License | //
// Description: Title page for the thesis template
// Author : <NAME>
//
#import "../00-templates/helpers.typ": *
#let page-title-thesis(
title: none,
date: (),
school: (),
author: (),
professor: (),
expert:(),
icons: (
topleft: none,
topright: none,
bottomleft: none,
bottomright: none,
),
) = {
table(
stroke:none,
columns: (50%, 50%),
align: (x, y) => (left, right).at(x),
[#if icons.topleft != none {[#image(icons.topleft, width:6cm)]} else {[]}],
[#if icons.topright != none {[#image(icons.topright, width:4cm)]} else {[]}],
)
v(1fr)
align(center, [#text(size:larger, "Degree Programme")])
v(1em)
align(center, [#text(size:larger, school.orientation)])
v(1em)
align(center, [#text(size:large, [Major #school.specialisation])])
v(2em)
align(center, [#text(size:huge, [*BACHELOR'S THESIS*])])
v(1em)
align(center, [#text(size:huge, [*DIPLOMA #date.year*])])
v(1em)
align(center, [#text(size:large, [#author.name])])
v(2em)
titlebox(
title: title,
)
[
#v(2em)
Professor \
#professor.name, #link("mailto:professor.email")[#professor.email]
\ \
Expert \
#expert.name, #link("mailto:expert.email")[#expert.email]
\ \
_Submission date of the report_ \
#date.submission
#v(1fr)
]
table(
stroke:none,
columns: (50%, 50%),
align: (x, y) => (left+horizon, right+horizon).at(x),
[#if icons.bottomleft != none {[#image(icons.bottomleft, width:4cm)]} else {[]}],
[#if icons.bottomright != none {[#image(icons.bottomright, width:1.5cm)]} else {[]}],
)
} |
https://github.com/giZoes/justsit-thesis-typst-template | https://raw.githubusercontent.com/giZoes/justsit-thesis-typst-template/main/resources/pages/bachelor-abstract.typ | typst | MIT License | #import "../utils/style.typ": 字号, 字体
#import "../utils/indent.typ": fake-par
#import "../utils/invisible-heading.typ": invisible-heading
// 本科生中文摘要页
#let bachelor-abstract(
// documentclass 传入的参数
anonymous: false,
twoside: false,
fonts: (:),
info: (:),
// 其他参数
display-header:true,
keywords: (),
outline-title: "中文摘要",
outlined: false,
anonymous-info-keys: ("author", "supervisor", "supervisor-ii"),
leading: 1.28em,
spacing: 1.28em,
body,
) = {
// 1. 默认参数
fonts = 字体 + fonts
info = info
// 4. 正式渲染
pagebreak(weak: true, to: if twoside { "odd" })
set page(
header: {
grid(
columns: (1fr), align: center,
[#text(font: fonts.宋体, size: 字号.五号, baseline: -4pt)[江苏科技大学苏州理工学院毕业设计（论文）]],
[#line(length: 100%, stroke: 0.5pt)]
)
}
)
[
#set text(font: fonts.宋体, size: 字号.小四)
#set par(leading: leading, justify: true)
#show par: set block(spacing: spacing)
// 标记一个不可见的标题用于目录生成
// #invisible-heading(level: 1, outlined: outlined, outline-title)
#align(center)[
#set text(size: 字号.三号, font: 字体.黑体)
= #text(weight: "medium")[摘 要]
#v(1em)
]
#[
#set par(first-line-indent: 2em)
#fake-par
#body
]
#v(1em)
#text(font: 字体.黑体, weight: "medium")[关键词：]#(("",)+ keywords.intersperse("；")).sum()
]
} |
https://github.com/WalrusGumboot/Typst-documents | https://raw.githubusercontent.com/WalrusGumboot/Typst-documents/main/aca/subdir/groepen.typ | typst | #import "../template.typ": *
#show: doc.with(
title: "Groepen",
course: "Algebraïsche structuren"
)
= Definitie
Def. Een _groep_ is een verzameling $V$ gecombineerd met een binaire bewerking $ast$ waarvoor de volgende voorwaarden gelden:
+ De bewerking is _gesloten_: $forall a, b in V: a ast b in V$
+ De bewerking is _associatief_: $forall a, b, c in V: (a ast b) ast c = a ast (b ast c)$
+ Er bestaat een _neutraal element_: $exists e in V: forall a in V: a ast e = e ast a = a$
+ Elk element heeft een _invers element_: $forall a in V: exists a^(-1) in V: a ast a^(-1) = e$
Not. $(V, ast)$
Vb. $(NN, +)$
== Abelse groepen
Def. Een _abelse groep_ is een groep waarvoor bovendien geldt dat de binaire bewerking _commutatief_ is. Het hierboven gegeven voorbeeld is ook een abelse groep. |
|
https://github.com/Pegacraft/typst-plotting | https://raw.githubusercontent.com/Pegacraft/typst-plotting/master/plotst/util/classify.typ | typst | MIT License | #import "util.typ": *
//-----------------
//THIS FILE CONTAINS EVERYTHING TO CLASSIFY DATA
//-----------------
/// This function is used to compare the data in the classifying process. In most cases you can leave it be. \
/// If you want a different ordinality, you can overwrite this function. \ \
/// === Return specification
/// - -1 if `val1 < val2` \
/// - 1 if `val1 > val2` \
/// - 0 if `val1 == val2` \ \
#let compare(val1, val2) = {
return if val1 < val2 {-1} else if val1 > val2 {1} else {0}
}
/// This is the constructor function for a single `class` used to classify data. \
/// Right now, this is only used for `histograms`.
/// - lower_lim (integer): The lower limit of the class. (Inclusive)
/// - upper_lim (integer): The upper limit of the class. (Exclusive)
#let class(lower_lim, upper_lim) = {
return (
lower_lim: lower_lim,
upper_lim: upper_lim,
data: ()
)
}
/// Generates a number of classes similarly how `axis` fills the `values` parameter on its own. It splits the area from `start` to `end` into the with `amount` specified amount of classes.\
/// Right now, this is only used for `historams`.\
/// *Example:* \
/// ```js let classes = class_generator(10000, 50000, 4)``` \ \
/// This will result in creating the following classes: `(10000 - 20000, 20000 - 30000, 30000 - 40000, 40000 - 50000, 50000 - 100000)`. \ \
/// - start (integer): The lower limit of the first generated class.
/// - end (integer): The upper limit of the last generated class.
/// - amount (integer): How many classes should be generated.
#let class_generator(start, end, amount) = {
let step = int((end - start) / amount)
let classes = ()
for value in range(start, end, step: step) {
classes.push(class(value, value + step))
}
return classes
}
/// Classifies the provided data into the given classes. This has to be done to create a `histogram`.
/// - data (array): The data you want to classify (needs to be comparable by the compare function). It's either an `array` of single values or an `array` of `tuples` looking like this: `(amount, value)`.
/// - classes (array): An array of classes the data should be mapped to (`lower_limit` and `uper_limit` need to be comparable).
/// - compare (function): The method used for comparing. Most of the time this doesn't need to be changed. If you want to use a different compare function, look at the specification for it (_see:_ `compare(val1, val2)`).
#let classify(data, classes, compare: compare) = {
let data = transform_data_full(data)
let classes = if "lower_lim" in classes {(classes,)} else {classes}
for (idx, class) in classes.enumerate() {
for value in data {
if compare(value, class.lower_lim) >= 0 and compare(value, class.upper_lim) <= -1 {
class.data.push(value)
}
}
classes.at(idx) = class
}
return if classes.len() == 1 {classes.at(0)} else {classes}
} |
https://github.com/darkMatter781x/OverUnderNotebook | https://raw.githubusercontent.com/darkMatter781x/OverUnderNotebook/main/entries/lift/lift.typ | typst | #import "/packages.typ": notebookinator, gentle-clues
#import notebookinator: *
#import themes.radial.components: *
#import gentle-clues: *
#import "/util.typ": qrlink
#show: create-body-entry.with(
title: "Lift State Machine",
type: "program",
date: datetime(year: 2024, month: 3, day: 7),
author: "<NAME>",
)
#grid(
columns: 2,
[
= The Problem
Our lift is unique in that if something goes wrong in code, it may cause
irreparable damage to the lift. This is due to our use of two different
solenoids, pneumatic valves which can be opened and closed with code, to control
the retraction and expansion of the lift.
If both solenoids are ever on, it is likely that the high pressure on both sides
of the piston would cause the pistons to break. This is a very dire outcome as
we lack any replacement pistons.
To prevent any such situation is critical that the code be designed carefully
and thoughtfully.
],
// https://excalidraw.com/#json=5tTmPjl8nvGiVHXY5FSPx,VjuV-gwW6WdZQqIxjrqF6g
figure(image("./schematic.svg"), caption: "Diagram of lift input and output"),
)
#grid(
columns: 2,
// https://excalidraw.com/#json=E5oITFqHUf3MkGYk6sDaI,mgigMblr2EqmSkHtE6R-og
figure(
image("./state-machine.svg", height: 50%),
caption: "State Diagram of lift",
),
[
= The Solution
To satisfy these constraints we decided to use a state machine. A state machine
is essentially something that does a different thing depending on what state it
is in. In our case, the state machine will be in one of three states:
`retracted`, `extended`, or `idle`.
State machines also have a concept of state transitions, in our case that is the
driver's button presses. When the driver presses the button, the state machine
will transition to a new state. For example, if the lift is currently retracted
and the driver presses the up button, the state machine will transition to the
`extended` state.
= The Code
In the code below, we define a class `LiftArmStateMachine` which has three
states:
- `IDLE`
- `RETRACTING`
- `EXTENDING`
Then we define the methods `retract`, `release`, and `extend` which change the
state. Finally, we define the `update` method which runs every 10ms and changes
the state of the solenoids to match that of the state machine.
],
)
#par(
)[
#set align(center)
#grid(
columns: 3,
figure(
qrlink(
"https://github.com/meisZWFLZ/OverUnder781X/blob/master/src/subsystems/lift.cpp",
width: 10em,
),
caption: "lift.cpp",
),
figure(
qrlink(
"https://github.com/meisZWFLZ/OverUnder781X/blob/master/include/lift.h",
width: 10em,
),
caption: "lift.h",
),
figure(
qrlink(
"https://github.com/meisZWFLZ/OverUnder781X/blob/ee42206c2cbc1b4a4e523d76857823313b6e9964/src/main.cpp#L409C1-L437C6",
width: 10em,
),
caption: "driver control code",
),
)
]
```cpp
// include/lift.h
#pragma once
#include "pros/adi.hpp"
class LiftArmStateMachine {
public:
// our possible states
enum STATE { IDLE, RETRACTING, EXTENDING };
// initializes state machine object and gives the machine the solenoids
LiftArmStateMachine(pros::ADIDigitalOut* retract,
pros::ADIDigitalOut* extend);
// retrieve the current state of the state machine
STATE getState() const;
// state changes
// set the state to retracting
void retract();
// set the state to idle
void release();
// set the state to extending
void extend();
// run every 10 ms
void update();
// these members cannot be accessed from outside the class
private:
// the solenoids
pros::ADIDigitalOut* retractPiston;
pros::ADIDigitalOut* extendPiston;
// the current state
STATE state = IDLE;
};
``` ```cpp
// src/subsystems/lift.cpp
// construct the lift arm state machine
LiftArmStateMachine::LiftArmStateMachine(pros::ADIDigitalOut* retract,
pros::ADIDigitalOut* extend)
: retractPiston(retract), extendPiston(extend) {
this->retractPiston->set_value(false);
this->extendPiston->set_value(false);
};
// run every 10 ms
void LiftArmStateMachine::update() {
switch (this->state) {
// when in the idle state:
case IDLE:
// set both to false (ie: close the valves)
this->retractPiston->set_value(false);
this->extendPiston->set_value(false);
break;
// when in the retracting state:
case RETRACTING:
// only set retractPiston to true (ie: only open the retract valve)
this->retractPiston->set_value(true);
this->extendPiston->set_value(false);
break;
// when in the extended state:
case EXTENDING:
// only set extendPiston to true (ie: only open the expand valve)
this->retractPiston->set_value(false);
this->extendPiston->set_value(true);
break;
}
}
// extend the pistons
void LiftArmStateMachine::extend() { this->state = EXTENDING; }
// retract the pistons
void LiftArmStateMachine::retract() { this->state = RETRACTING; }
// stop sending air to the pistons
void LiftArmStateMachine::release() { this->state = IDLE; }
// get the current state of the lift arm state machine
LiftArmStateMachine::STATE LiftArmStateMachine::getState() const {
return this->state;
}
```
This code handles our state transitions in driver mode://typstfmt::off
```cpp
// excerpt from driver control code in main.cpp:
// if up is pressed
if (!up && prevUp) {
switch (Robot::Subsystems::lift->getState()) {
// if the current state is retracting, then stop retracting
case LiftArmStateMachine::STATE::RETRACTING:
Robot::Subsystems::lift->release();
break;
// if the current state is idle, then extend the lift
case LiftArmStateMachine::STATE::IDLE:
Robot::Subsystems::lift->extend();
break;
// if the current state is extending the do nothing
case LiftArmStateMachine::STATE::EXTENDING: break;
}
}
// if down is pressed
if (!down && prevDown) {
switch (Robot::Subsystems::lift->getState()) {
// if the current state is retracting, then do nothing
case LiftArmStateMachine::STATE::RETRACTING: break;
// if the current state is idle, then retract the lift
case LiftArmStateMachine::STATE::IDLE:
Robot::Subsystems::lift->retract();
break;
// if the current state is extending, then stop extending
case LiftArmStateMachine::STATE::EXTENDING:
Robot::Subsystems::lift->release();
break;
}
}
```
//typstfmt::on |
|
https://github.com/darkMatter781x/OverUnderNotebook | https://raw.githubusercontent.com/darkMatter781x/OverUnderNotebook/main/entries/odom/odom.typ | typst | #import "/packages.typ": notebookinator, gentle-clues
#import notebookinator: *
#import themes.radial.components: *
#import gentle-clues: *
#import "/util.typ": qrlink
#show: create-body-entry.with(
title: "Concept: Odometry",
type: "concept",
date: datetime(year: 2024, month: 1, day: 15),
author: "<NAME>",
)
= Odometry
Odometry is just a fancy term referring to tracking the position of the robot
relative to the field using a suite of sensors. Tracking wheels are typically
un-powered wheels, to which sensors, that record rotation of an axle, are
attached.
== Calculation
Tracking wheels can be used to record the movement in the direction that they
track, so if you have a tracking wheel orientated vertically and another
horizontally, then you can calculate the position of the robot, assuming the
robot never turns. Sadly the robot turns, and thus we need a third sensor. The
easiest way to do this is with an Inertial Measurement Unit (IMU) which is
capable of measuring the heading of the robot.
If we can measure the change in x and y relative to the robot rapidly (~10ms),
we can then rotate this vector by the current heading and add it to the robot's
previous position. And voila, you know the robot's position!
#info[
This is a simplification of the complex math behind odometry. For example, we
assume that the tracking wheels are centered, which can be the case but most
often is not. You can also use two parallel tracking wheels to measure the
robot's heading if you prefer. If you'd like to learn some more, check out this
pdf:
#set align(center)
#qrlink(
"http://thepilons.ca/wp-content/uploads/2018/10/Tracking.pdf",
width: 30mm,
)
]
|
|
https://github.com/MDLC01/unichar | https://raw.githubusercontent.com/MDLC01/unichar/main/src/lib.typ | typst | MIT License | /// Create a `codepoint` object.
///
/// You can convert a to content `codepoint` using its `show` field:
/// ```example
/// #codepoint("¤").show
/// ```
#let codepoint(code) = {
if type(code) != int {
code = str.to-unicode(code)
}
import "ucd/index.typ"
let (block-data, character-data, aliases) = index.get-data(code)
let it = (
code: code,
id: {
let id = upper(str(code, base: 16))
while id.len() < 4 {
id = "0" + id
}
id
},
name: character-data.at(0, default: none),
general-category: character-data.at(1, default: none),
canonical-combining-class: character-data.at(2, default: none),
math-class: character-data.at(3, default: none),
block: if block-data != none {
(
name: block-data.at(0),
start: block-data.at(1),
size: block-data.at(2),
)
},
aliases: (
corrections: aliases.at(0),
controls: aliases.at(1),
alternates: aliases.at(2),
figments: aliases.at(3),
abbreviations: aliases.at(4),
)
)
(
..it,
"show": {
raw("U+" + it.id)
sym.space.nobreak
if it.name == none {
"<unused>"
} else if it.name.starts-with("<") {
it.name
} else {
// The character appears bigger without increasing line height.
text(size: 1.2em, top-edge: "x-height", str.from-unicode(it.code))
sym.space
smallcaps(lower(it.name))
}
},
)
}
|
https://github.com/Hithereland/whu-typst-template | https://raw.githubusercontent.com/Hithereland/whu-typst-template/main/sample.typ | typst | #import "template/template.typ": thesis, tlt, indent, acknowledgement, appendix, algorithm-table, setup-algorithm-table
#import "@preview/algorithmic:0.1.0"
#import algorithmic: algorithm
// Magic code for fake bold
// reference: https://github.com/typst/typst/issues/394#issuecomment-1987055478
#show text.where(weight: "bold").or(strong): it => {
show regex("\p{script=Han}"): set text(stroke: 0.025em)
it
}
#let (
doc, cover, declaration, front-matter, abstract-zh, abstract-en, outline-page, main-matter
) = thesis(
title: "这是标题×",
author: "<NAME>",
student-id: "2020123456789",
major: "哲 学",
school: "哲学学院",
supervisor: "<NAME>",
date: "二 〇 二 四 年 六 月",
)
#show: doc
#cover()
#declaration(
author_signature_path: "/assets/whu.png",
mentor_signature_path: "/assets/whu.png"
)
#show: front-matter
#abstract-zh(
keywords: ("赤壁", "江月", "水與月", "逝者如斯")
)[
壬戌之秋，七月既望，蘇子與客泛舟遊於赤壁之下。清風徐來，水波不興，舉酒屬客，誦明月之詩，歌窈窕之章。少焉，月出於東山之上，徘徊於斗牛之間，白露橫江，水光接天；縱一葦之所如，凌萬頃之茫然。浩浩乎如馮虛御風，而不知其所止；飄飄乎如遺世獨立，羽化而登仙。
於是飲酒樂甚，扣舷而歌之。歌曰：「桂棹兮蘭槳，擊空明兮泝流光。渺渺兮予懷，望美人兮天一方。」客有吹洞簫者，倚歌而和之，其聲嗚嗚然，如怨如慕，如泣如訴，餘音嫋嫋，不絕如縷。舞幽壑之潛蛟，泣孤舟之嫠婦。
蘇子愀然，正襟危坐，而問客曰：「何為其然也？」
客曰：「『月明星稀，烏鵲南飛』，此非曹孟德之詩乎？西望夏口，東望武昌，山川相繆，鬱乎蒼蒼，此非孟德之困於周郎者乎？方其破荊州，下江陵，順流而東也，舳艫千里，旌旗蔽空，釃酒臨江，橫槊賦詩，固一世之雄也，而今安在哉？況吾與子，漁樵於江渚之上，侶魚蝦而友麋鹿；駕一葉之扁舟，擧匏樽以相屬。寄蜉蝣於天地，渺滄海之一粟，哀吾生之須臾，羨長江之無窮。挾飛仙以遨遊，抱眀月而長終。知不可乎驟得，託遺響於悲風。
蘇子曰：「客亦知夫水與月乎？逝者如斯，而未嘗往也；盈虛者如彼，而卒莫消長也，蓋將自其變者而觀之，則天地曾不能以一瞬；自其不變者而觀之，則物與我皆無盡也，而又何羨乎？且夫天地之間，物各有主，苟非吾之所有，雖一毫而莫取。惟江上之清風，與山間之明月，耳得之而為聲，目遇之而成色，取之無禁，用之不竭，是造物者之無盡藏也，而吾與子之所共適。」
客喜而笑，洗盞更酌。肴核既盡，杯盤狼籍，相與枕藉乎舟中，不知東方之既白。
]
#pagebreak()
#abstract-en(
keywords: ("Red Cliffs", "Moon", "Water and moon", "Transience of life")
)[
In the autumn of the year Renxu, beyond the full moon of the seventh month, Master Su and his companion embarked on a boating excursion below the Red Cliffs. A gentle breeze wafted toward them, the water remained undisturbed, and raising their cups to their guest, they recited poems of the bright moon and sang of refined and elegant beauty. Shortly thereafter, the moon ascended above the eastern mountains, weaving through the constellation of the Ox, while a silver dew blanketed the river, merging water with sky. Adventuring as far as a single reed could take them, they found themselves amidst an expanse of vague remoteness—vast and boundless as if riding the wind without knowing their destination; floating, as if transcending this world in solitude, on the verge of becoming celestial beings.
Thus, with great enjoyment from the wine, they tapped the boat's sides and sang. Their song went, "With an oar of cassia and a paddle of orchid, we strike the luminous void, trailing light in our wake. My feelings vast and distant, I gaze upon a beauty, in a corner of the sky." One of the guests played a bamboo flute, harmonizing with the singing, and the sound resonated mournfully—infused with longing and yearning, like tears and pleadings, its lingering notes twisted and turned, endless as a thread. It aroused the hidden dragons of the secluded gorges and echoed the weeping of an abandoned woman in a solitary boat.
Master Su became pensive, straightened his robe, sat upright, and asked the guest, "Why is it so?"
The guest replied, "Isn't it said in the poetry of Cao Mengde, 'The moon is bright, the stars are sparse, the crows and magpies fly southward'? Looking west, one imagines Xia Kou; gazing east, one sees Wuchang. With landscape so intermingled, how lush and luxuriant it appears. Are these places not where Mengde once found himself trapped by Zhou Yu? As he broke through Jingzhou and captured Jiangling, advancing downstream towards the east, his warships stretched a thousand li, and his banners veiled the heavens. He indulged in wine by the river, laying down his halberd to compose poetry, truly a hero of his time. Yet now, where does he stand? Moreover, you and I, as mere fishermen and woodcutters on the river's islets, befriending fish and shrimp, companions of deer and does; navigating a tiny skiff, sharing cups made of gourd. We are but mayflies in the immense universe, a mere grain in the boundless ocean, bemoaning the transience of life, yet envying the endless flow of the great river. We long to ride with the flying immortals on their wanderings, embrace the bright moon for eternity. Knowing such things cannot be hastily grasped, we entrust our lingering echoes to the sorrowful wind."
<NAME> replied, "Does the guest also understand the nature of water and the moon? The past is like this—never returning; the cycles of waxing and waning, forever without end. If one observes from the perspective of change, then even heaven and earth cannot last for a moment; but seen from the aspect of the unchanging, then everything, including ourselves, is boundless. Why then should we feel envy? Besides, between heaven and earth, every entity has its master—if it is not mine, not even a tiny speck should be taken. But the refreshing breeze over the river and the clear moon between the hills, these are heard by the ear and become sound, are met by the eye and become color, can be taken without prohibition and used without depletion. They are the inexhaustible treasury of the Creator, and hence, are what you and I can both freely enjoy."
Pleased, the guest laughed, cleaned the cups, and poured another round of drinks. As the snacks were consumed and the dishes and cups became disordered, they laid down together in the boat, unaware that dawn was already whitening the east.
]
#pagebreak()
#outline-page()
#pagebreak()
#show: main-matter
#show: setup-algorithm-table
= 绪论
== 无穷小量
=== 描述
*无穷小量*（英语：Infinitesimal）或称“不可分量”是数学分析中的一个概念，用以严格地定义诸如“最终会消失的量” @gomperz1901greek、“绝对值比任何正数都要小的量”等非正式描述。在经典的微积分或数学分析中，无穷小量通常它以函数、序列等形式出现。
=== 定义
一个序列 $a = (a_n)_(n in NN)$ 若满足如下性质：
对任意的预先给定的正实数 $epsilon > 0$，存在正整数 $N$ 使得:
$ abs(a_k) < epsilon $
在 $k > N$ 时必定成立；或用极限符号把上述性质简记为@eqt:infinitesimal-limit：
$ lim_(x -> infinity) a_n = 0 $ <infinitesimal-limit>
则序列 $a$ 被称为 $n -> infinity$ 时的无穷小量。
=== 历史
无穷小量对应英语的*Infinitesimals*#footnote()[此词源于十七世纪的现代拉丁语新造词_infinitesimus_,本来是指一个序列的“第无穷个”元素]，用于表达一种极其微小的对象，人们根本无从看见它们或者量度它们。在日常生活中，_Infinitesimal_作为形容词可以指“非常小”，但不一定是“无穷的小”。而中文的“无穷小量”仅是技术用语。
“无穷小的量”这个概念最初在埃利亚学派有所讨论。柏克莱指出这种无穷小量的特性“既不是有限量，也不是无限小，又不是零”。而阿基米德在他的《机械原理方法论》(The Method of Mechanical Theorems) 初次提出过一种和无穷量有关的逻辑上严密的叙述#footnote[阿基米德著《机械原理方法论》；见阿基米德羊皮书]。不过在古希腊的数学系统里，实数并没有独立的存在地位，而是用几何上的长度来表示：$1$ 是代表某条线段的规定长度，用来给出测量所需的长度单位，数的加减法用线段的延长和截短来表示。阿基米德所说的是：对任意两个长度不等（无论长度相差多少）的线段，在长线段里不断截去短线段的长度，在有限次之后就不能再截下去，因为那些短线段长度的“和”超过了原本较长的那一条。如果把线段长度理解成数的话，则反映了实数集的阿基米德性质：没有任何实数 $x$ 可以满足条件 $abs(x) > 1, abs(x) > 1+1, abs(x) > 1+1+1$ ……，也就是说，无穷大的实数并不存在。尽管如此，阿基米德还是把无穷大量和无穷小量用于启发式的论证中，但在完整的数学证明里则拒绝使用它们，而致力于使用“穷竭法”, 类似于现在的“$ε-δ$语言”。
牛顿和莱布尼兹发展微积分学时使用过无穷小量，但这样的不严格使用引来一些批评者的攻击。贝克莱主教就是其中之一#footnote[乔治·贝克莱《分析者》（The Analyst; 或者“向异端数学家发表的演说”）]。尽管数学家、科学家、工程师等不断使用无穷小量来得到正确的结果，微积分却一直到后半十九世纪才等到了更严谨的，使用了$ε-δ$语言和集合论描述的形式，这项工作由奥古斯丁·路易·柯西，伯纳德·波尔查诺、卡尔·魏尔施特拉斯、格奥尔格·康托尔、理查德·戴德金等人完成。随着数学的发展及康托、戴德金、魏尔施特拉斯等人及他们的追随者的探索，他们的哲学家好友伯特兰·罗素、鲁道夫·卡尔纳普等人认为无穷小事实上是伪概念；但同时，赫尔曼·科恩等新康德主义者希望能找到一个保留无穷小的逻辑系统 @mormann2013infinitesimals。在二十世纪，无穷小量才得到了严格的处理，成为一种“数”。以上任何一种处理办法都不是错误的——如果正确地使用的话#footnote[不严格的处理办法，一般来讲要求使用者具有更正确的数学直觉。]。
在一份 HPM（数学史与数学教学，History and Pedagogy of Mathematics）的研究中 @Bagni2009HISTORYOC，对无穷小量在一些数学家眼里的认识（@tbl:no-poor-small-in-math-home-eye）有一个总结：
#figure(
tlt(
columns: 3,
table.header[*人物*][*年代*][*对无穷小量的观点，或处理方法*],
[欧几里得等古希腊数学家],[公元前300年],[穷竭法：他们相信用间接法才能使面积问题获得严格证明。],
[卡瓦列里（<NAME>）],[1598-1647],[把无穷小量的办法推进了一步(见祖暅原理)。],
[沃利斯（<NAME>）],[1616-1703],[他对极限的定义“含有正确的想法，但用词不严谨”。],
[莱布尼兹],[1646-1716],[其算法很成功，但“对概念不太确定”。他对于“消失中的量”的立场是复杂的，而且随时间而变。],
[欧拉],[1707-1783],[获得了很多重要结果，但不考虑真正无穷小量带来的困难。其观点受十七世纪典型的科学思维框架影响。],
[达朗贝尔（<NAME>）],[1717-1783],[拒绝承认“消失中的量”。他给出过极限的定义，但措辞不明确。],
[拉格朗日],[1736-1813],[也拒绝承认无穷小量，企图把微积分归结为代数。],
[柯西],[1789-1857],[其写下的定义至今依然通用，由当时可以使用的数学语言写成。]
),
caption: figure.caption(
position: top,
[无穷小量在一些数学家眼里的认识]
)
) <no-poor-small-in-math-home-eye>
#indent 就目前所知，在十九世纪以前没有任何形式上定义好的数学概念是直接把无穷小量当作“正常”的数来处理的，但很多想法其实已经出现。微积分的奠基人——牛顿、莱布尼兹、欧拉，以及很多其他人——以一种不严格的方式使用无穷小量，却也能得到正确而深刻的结果（类似地，实数在当时也没有正式的定义）。
==== 关键字
- 穷竭法
- 无穷乘积
- 牛顿的流数法
- 莱布尼兹的“$upright(d) x$”记号
- 欧拉对级数的处理
- 一致收敛
- 严格的极限概念
- 非标准分析
#pagebreak()
= 论 Typst 的图表公式使用方法
== 一个图
很大的武汉大学的图图 @gomperz1901greek @Bagni2009HISTORYOC 被放在了@fig:whu-img
#figure(
image("assets/whu.png", height: 10%),
caption: "我好想做武汉大学的狗啊"
) <whu-img>
== 一段代码
学了四年不会写代码，我全力谢罪，但即便如此，@lst:some-cpp-code 仍然是我竭尽全力的作品。
#figure(
```cpp
#include <iostream>
using namespace std;
int mian() {
return 0;
}
```,
caption: [一段 C++ 代#cite(<Bagni2009HISTORYOC>)码]
) <some-cpp-code>
#indent 这优美的代码，是多么的动人！
这难道不能称之为绝世佳作吗！
@dragon-heading[以下小节]或者也可以说@dragon-heading[小节 114.514 ]（实际上并不是114.514）展示了一张图片。这句话将帮助你在文章中以自定义的文本引用各种各样的东西，仅需提供一个标签。
== 龙 <dragon-heading>
@fig:dragon 展现了一条龙。请欣赏龙。
#figure(
image("/assets/dragon.jpg", width: 80%),
caption: [龙]
) <dragon>
#indent 龙是好的！
请务必欣赏 @fig:dragon 中的龙。
== 伪代码
@algorithm-1 或者说@algorithm-1[算法 1 ]展示了一段伪代码。
#algorithm-table(
caption: [QuickSort],
[#v(-0.8em)
*input:* An _Array_ to be sorted
#v(0.3em)
*output:* Sorted _Array_
#v(-1em)
#algorithm({
import algorithmic: *
Procedure("Quicksort", args: ([_Array_], ), {
If(cond: [_Array_ .length $>$ 1], {
State[choose a _pivot_]
While(cond: [there are items left in _Array_], {
If(cond: [_item_ $<$ _pivot_], {
[put _item_ into _subarray1_]
})
Else({
[put _item_ into _subarray2_]
})
})
State[#smallcaps([Quicksort]) (_subarray1_)]
State[#smallcaps([Quicksort]) (_subarray2_)]
})
State[_Array_ $<-$ _subarray1_ + _pivot_ + _subarray2_]
Return[_Array_]
})
})]
) <algorithm-1>
#pagebreak()
#bibliography(("bib/bib_sample.bib"), style: "gb-7714-2005-numeric")
#acknowledgement()[
行文至此，落笔之处，我的大学生活即将画上句号。文章难作路难行，在我撰写论文的过程中，我遇到了许多困难和挑战，也得到了许多人的帮助和支持。在这里，我要向所有帮助过我的人表示衷心的感谢。
首先，我要感谢我的导师大老板#footnote[请填上您老板的名字]。感谢您在我整个论文写作过程中的悉心指导和耐心解答。您的专业知识和丰富经验对我的论文研究起到了至关重要的作用。从论文的选题、研究方法的选择到论文的撰写和修改，您都给予了我宝贵的建议和指导。没有您的支持和鼓励，我不可能完成这篇论文。您不仅是我的导师，更是我的榜样，您的敬业精神和治学态度将一直激励着我不断追求卓越。
其次，我还要感谢摸鱼学院#footnote[请填上您的学院的名称]的各位老师和同学们。感谢你们在我学习和生活中给予的帮助和支持。你们的教导和启发让我不断进步，你们的陪伴和鼓励让我感受到了集体的温暖和力量。
同时，我还要感谢我的家人和朋友们。感谢你们在我求学路上一直以来的支持和鼓励。你们的关爱和理解让我有了勇气和信心追逐自己的梦想。
最后，我要感谢所有在我论文研究过程中给予过帮助的人们。感谢你们为我提供的数据、资料、意见建议和@lst:some-cpp-code，让我能够更加深入地了解我的研究课题。
在这里，我向所有帮助过我的人们表示最诚挚的感谢。你们的支持和帮助是我前进的动力，也是我不断追求卓越的勇气。未来的日子里，我会继续努力，不断提高自己，不辜负你们的期望和信任。
]
#appendix()[親愛的客戶#footnote[嗷嗷嗷]：
感謝閣下使用天星銀行有限公司（「本行」或「我們」）的銀行服務。
因可疑識別代號警示第二期第一批計劃（「計劃」）的實施時間已從2024年3月31日推遲至2024年6月30日，為響應該計劃的實施而將於2024年3月29日生效的對“使用虛擬銀行服務的條款及細則“進行更新而添加的第三部分8.10（A）條款現進行撤銷。同時，對“私隱政策“第11條“直接促銷中個人資料的使用”的修訂也會被撤銷。
故請不需理會本行於2024年2月28日發出的“就更新使用虛擬銀行服務的條款及細則致客戶通知“。後期如有更新，會另行再作通知。
對於由此造成的任何不便，我們深表歉意。如有疑問，請立即致電（852）3718 1818 與我們聯絡。
天星銀行有限公司
天星銀行有限公司不會以電郵要求客戶提供個人資料，如戶口號碼、用戶名稱、密碼或一次性密碼等。如客戶收到此等要求或並非指定的收件人，請刪去有關電郵及立即致電 3718 1818 聯絡本行。請參閱天星銀行網頁上之《私隱政策》及網上及理財保安措施。
注意：請勿於電郵內透露您的戶口資料或信用卡號碼。
我們在保密方面有嚴格的保安準則及程序，防止您的個人資料在未經授權下被使用。滙豐絕對不會以電郵或其他方式要求核實個人資料，包括用戶名稱，密碼或賬戶號碼。如您接到這些要求，請致電2233 3000。
此電郵提示所載的資料乃保密，並可在法律上享有特權。倘若您不是指定的收件人，您不可複製、轉發、公開或使用此信息的任何部份。倘若您錯誤地收到此信息，請刪去此信息及在您系統中的所有其副本，並立即致電上述有關熱線通知我們。
經互聯網傳送的電郵信息，不保證準時、完全安全、不含錯誤或電腦病毒。寄件者不會承擔所引致任何錯誤或遺漏的責任。
]
|
|
https://github.com/LDemetrios/Typst4k | https://raw.githubusercontent.com/LDemetrios/Typst4k/master/src/test/resources/suite/math/delimited.typ | typst | // Test delimiter matching and scaling.
--- math-lr-matching ---
// Test automatic matching.
#set page(width:122pt)
$ (a) + {b/2} + abs(a)/2 + (b) $
$f(x/2) < zeta(c^2 + abs(a + b/2))$
--- math-lr-unmatched ---
// Test unmatched.
$[1,2[ = [1,2) != zeta\(x/2\) $
--- math-lr-call ---
// Test manual matching.
$ [|a/b|] != lr(|]a/b|]) != [a/b) $
$ lr(| ]1,2\[ + 1/2|) $
--- math-lr-fences ---
// Test fence confusion.
$ |x + |y| + z/a| \
lr(|x + |y| + z/a|) $
--- math-lr-symbol-unmatched ---
// Test that symbols aren't matched automatically.
$ bracket.l a/b bracket.r
= lr(bracket.l a/b bracket.r) $
--- math-lr-half ---
// Test half LRs.
$ lr(a/b\]) = a = lr(\{a/b) $
--- math-lr-size ---
// Test manual scaling.
$ lr(]sum_(x=1)^n x], size: #70%)
< lr((1, 2), size: #200%) $
--- math-lr-shorthands ---
// Test predefined delimiter pairings.
$floor(x/2), ceil(x/2), abs(x), norm(x)$
--- math-lr-color ---
// Test colored delimiters
$ lr(
text("(", fill: #green) a/b
text(")", fill: #blue)
) $
--- math-lr-mid ---
// Test middle functions
$ { x mid(|) sum_(i=1)^oo phi_i (x) < 1 } \
{ integral |dot|
mid(bar.v.double)
floor(hat(I) mid(slash) { dot mid(|) dot } mid(|) I/n) } $
--- math-lr-mid-size ---
// Test mid when lr size is set.
#set page(width: auto)
$ lr({ A mid(|) integral }) quad
lr(size: #1em, { A mid(|) integral }) quad
lr(size: #(1em+20%), { A mid(|) integral }) \
lr(] A mid(|) integral ]) quad
lr(size: #1em, ] A mid(|) integral ]) quad
lr(size: #(1em+20%), ] A mid(|) integral ]) \
lr(( A mid(|) integral ]) quad
lr(size: #1em, ( A mid(|) integral ]) quad
lr(size: #(1em+20%), ( A mid(|) integral ]) $
--- math-lr-mid-size-nested-equation ---
// Test mid size when lr size is set, when nested in an equation.
#set page(width: auto)
#let body = ${ A mid(|) integral }$
$ lr(body) quad
lr(size: #1em, body) quad
lr(size: #(1em+20%), body) $
--- math-lr-unbalanced ---
// Test unbalanced delimiters.
$ 1/(2 (x) $
$ 1_(2 y (x) () $
$ 1/(2 y (x) (2(3)) $
--- math-lr-weak-spacing ---
// Test ignoring weak spacing immediately after the opening
// and immediately before the closing.
$ [#h(1em, weak: true)A(dif x, f(x) dif x)sum#h(1em, weak: true)] $
--- math-lr-nested ---
// Test nested lr calls.
#let body1 = math.lr($|$, size: 4em)
#let body2 = $lr(|, size: #4em)$
$lr(|, size: #2em)$
$lr(lr(|, size: #4em), size: #50%)$
$lr(body1, size: #50%)$
$lr(body2, size: #50%)$
--- issue-4188-lr-corner-brackets ---
// Test positioning of U+231C to U+231F
$⌜a⌟⌞b⌝$ = $⌜$$a$$⌟$$⌞$$b$$⌝$
|
|
https://github.com/stuxf/basic-typst-resume-template | https://raw.githubusercontent.com/stuxf/basic-typst-resume-template/main/template/main.typ | typst | The Unlicense | #import "@preview/basic-resume:0.1.3": *
// Put your personal information here, replacing mine
#let name = "<NAME>"
#let location = "San Diego, CA"
#let email = "<EMAIL>"
#let github = "github.com/stuxf"
#let linkedin = "linkedin.com/in/stuxf"
#let phone = "+1 (xxx) xxx-xxxx"
#let personal-site = "stuxf.dev"
#show: resume.with(
author: name,
// All the lines below are optional.
// For example, if you want to to hide your phone number:
// feel free to comment those lines out and they will not show.
location: location,
email: email,
github: github,
linkedin: linkedin,
phone: phone,
personal-site: personal-site,
accent-color: "#26428b",
font: "New Computer Modern",
)
/*
* Lines that start with == are formatted into section headings
* You can use the specific formatting functions if needed
* The following formatting functions are listed below
* #edu(dates: "", degree: "", gpa: "", institution: "", location: "")
* #work(company: "", dates: "", location: "", title: "")
* #project(dates: "", name: "", role: "", url: "")
* #extracurriculars(activity: "", dates: "")
* There are also the following generic functions that don't apply any formatting
* #generic-two-by-two(top-left: "", top-right: "", bottom-left: "", bottom-right: "")
* #generic-one-by-two(left: "", right: "")
*/
== Education
#edu(
institution: "Harvey Mudd College",
location: "Claremont, CA",
dates: dates-helper(start-date: "Aug 2023", end-date: "May 2027"),
degree: "Bachelor's of Science, Computer Science and Mathematics",
)
- Cumulative GPA: 4.0\/4.0 | Dean's List, <NAME> Merit Scholarship, National Merit Scholarship
- Relevant Coursework: Data Structures, Program Development, Microprocessors, Abstract Algebra I: Groups and Rings, Linear Algebra, Discrete Mathematics, Multivariable & Single Variable Calculus, Principles and Practice of Comp Sci
== Work Experience
#work(
title: "Subatomic Shepherd and Caffeine Connoisseur",
location: "Atomville, CA",
company: "Microscopic Circus, Schrodinger's University",
dates: dates-helper(start-date: "May 2024", end-date: "Present"),
)
- Played God with tiny molecules, making them dance to uncover the secrets of the universe
- Convinced high-performance computers to work overtime without unions, reducing simulation time by 50%
- Wowed a room full of nerds with pretty pictures of invisible things and imaginary findings
#work(
title: "AI Wrangler and Code Ninja",
location: "Silicon Mirage, CA",
company: "Organic Stupidity Startup",
dates: dates-helper(start-date: "Dec 2023", end-date: "Mar 2024"),
)
- Taught robots to predict when (and how much!) humans will empty their wallets at the doctor's office
- Developed HIPAA-compliant digital signatures, because doctors' handwriting wasn't illegible enough already
- Turned spaghetti code into a gourmet dish, making other interns drool with envy
#work(
title: "Digital Playground Architect",
location: "The Cloud",
company: "Pixels & Profit Interactive",
dates: dates-helper(start-date: "Jun 2020", end-date: "May 2023"),
)
- Scaled user base from 10 to 2000+, accidentally becoming a small wealthy nation in the process
- Crafted Bash scripts so clever they occasionally made other engineers weep with joy
- Automated support responses, reducing human interaction to a level that would make introverts proud
- Built a documentation site that actually got read, breaking the ancient RTFM curse
#work(
title: "Code Conjurer Intern",
location: "Silicon Suburb, CA",
company: "Bits & Bytes Consulting",
dates: dates-helper(start-date: "Jun 2022", end-date: "Aug 2022"),
)
- Developed a cross-platform mobile app that turned every user into a potential paparazzi
- Led a security overhaul, heroically saving the company from the menace of "password123"
== Projects
#project(
role: "Maintainer",
name: "Hyperschedule",
dates: dates-helper(start-date: "Nov 2023", end-date: "Present"),
url: "hyperschedule.io",
)
- Maintain open-source scheduler used by 7000+ users at the Claremont Consortium with TypesScript, React and MongoDB
- Manage PR reviews, bug fixes, and coordinate with college for releasing scheduling data and over \$1500 of yearly funding
- Ensure 99.99% uptime during peak loads of 1M daily requests during course registration through redundant servers
== Extracurricular Activities
#extracurriculars(
activity: "Capture The Flag Competitions",
dates: dates-helper(start-date: "Jan 2021", end-date: "Present"),
)
- Founder of Les Amateurs (#link("https://amateurs.team")[amateurs.team]), currently ranked \#4 US, \#33 global on CTFTime (2023: \#4 US, \#42 global)
- Organized AmateursCTF 2023 and 2024, with 1000+ teams solving at least one challenge and \$2000+ in cash prizes
- Scaled infrastructure using GCP, Digital Ocean with Kubernetes and Docker; deployed custom software on fly.io
- Qualified for DEFCON CTF 32 and CSAW CTF 2023, two of the most prestigious cybersecurity competitions globally
// #extracurriculars(
// activity: "Science Olympiad Volunteering",
// dates: "Sep 2023 --- Present"
// )
// - Volunteer and write tests for tournaments, including LA Regionals and SoCal State \@ Caltech
== Skills and Awards
- *Programming Languages*: JavaScript, Python, C/C++, HTML/CSS, Java, Bash, R, Flutter, Dart
- *Technologies*: React, Astro, Svelte, Tailwind CSS, Git, UNIX, Docker, Caddy, NGINX, Google Cloud Platform
- *Awards*: 1st CorCTF 2024 (\$1337), 3rd PicoCTF 2023 (\$1000), 1st BCACTF 2023 (\$500)
- *Interests*: Classical Literature, Creative Writing, Tetris |
https://github.com/luiswirth/numpde-slides | https://raw.githubusercontent.com/luiswirth/numpde-slides/main/src/week02.typ | typst | #import "setup.typ": *
#show: this-template
#let pathemph(a, b) = [
#text(fill: white.darken(60%))[#a]#b
]
#titleslide("02")
#pagebreak()
#githubref
= Big picture of NumPDE
The name of this course is a little big of a misnomer.
Numerical Methods for Partial Differential Equations.
A more appropriate name would be
Numerical Methods for Continuum Models with Local Interactions
- We are not directly interested in PDEs, they just happen to be
a good way of formulating our problems.
- But there is a more important formulation for us: Weak formulations.
We want to mathmatically model real world problems.
In particular we are studying continuum models (with local interactions).
This means our
#pagebreak()
- Configuration space (uncountably) infinite dimensional.
(Infinitly many variables)
- Function space
$
hat(V)_S
:=
{ u: [a,b] -> RR "continuous" | u(a) = u_a, u(b) = u_b }
=
{ u in C^0([a, b], RR) | u(a) = u_a, u(b) = u_b }
$
$
hat(V)_M = { u in C^0(clos(Omega), RR) | restr(u)_(diff Omega) = g }
$
These spaces are not vector spaces but affine spaces, so shifted vector spaces.
They don't have a zero vector.
$
hat(V) = V_0 + v_0
$
#pagebreak()
Equilibrium problem can be converted into energy minimization problem
$
u = arg min_(v in hat(V)) J(v)
$
$
J_S(u) := integral_a^b 1/2 sigma(x) abs((diff u)/(diff x) (x))^2 - f(x) u(x) dif x
\
J_M(u) := integral_Omega 1/2 sigma(xv) norm(grad u (xv))^2 - f(xv) u(xv) dif xv
$
For compatibility with energy functionals, we need a further restriction of function spaces.
$
hat(V)_S
:=
{ u C^1_"pw" ([a,b]) | u(a) = u_a, u(b) = u_b }
$
$
hat(V)_M = { u in C^1_"pw" (clos(Omega)) | restr(u)_(diff Omega) = g }
$
#pagebreak()
All the functionals we've seen so far have a common form.
They are all quadratic functionals.
Their canonical form is
$
J(v) = 1/2 a(v,v) - l(v) + c
$
Where $a: V times V -> RR$ is a symmetric bilinear form (linear in both arguments)
$l: V -> RR$ is a linear form and $c in RR$ is a constant.
When the functional is quadratic, we are solving a quadratic minimization problem.
#pagebreak()
Existance and Uniqueness of Minimizers
Positive semi-definite bilinear form
$a(v, v) >= 0 forall v in V_0$
The positive semi-definitness is a necessary condition for the existance of a minimizer.
Image of positive-semi definite.
Positive definite bilinear form
$
a(v, v) > 0
quad forall v in V_0 \\ {0}
$
If the bilinear form is positive definite then any solution (might not exist)
is unique.
#pagebreak()
Energy norm
$
norm(dot)_a : V -> RR, quad
norm(v)_a := a(v, v)^(1/2)
$
Continuity of bilinear and linear form
$
exists C > 0:
quad
abs(l(v)) <= C norm(v)
quad
forall v in V_0
\
exists C > 0:
quad
abs(a(u, v)) <= C norm(u) norm(v)
quad
forall u,v in V_0
$
The continuity of $l$ with respect to the energy norm induced by the bilinear form $a$,
is necessary for the existance of a minimizer.
In other words the linear form $l$ needs to somehow match the bilinear form $a$. It must
be wellbehaved.
#myblock[Linear form $linf(l)$][
*Given*: \
$V$: vector space over $RR$ \
*Definition*:
$
linf(l): V -> RR
\
forall u, v in V
quad
forall alpha, beta in RR
quad
linf(l) (alpha u + beta v) = alpha linf(l) (u) + beta linf(l) (v)
$
]
In finite dimensions actually every linear form is continuous.
And furthermore the symettric positive definite property of the bilinear form
is not only necessary but also sufficent for the existance of a unique minimizer.
In infinite dimensions this however doesn't hold and we have to deal with some weird phenomens.
#pagebreak()
Sobolov spaces.
$
x = arg min_(y in QQ) abs(y^2 - 2)
$
No minimizer $x in QQ$ exists.
For any potential candidate minimizer $x'$ we can find another $x''$ that
makes the expression even smaller.
$QQ$ is not complete. The solution actually lives in $RR$. $QQ$ is the wrong space
to minimize in.
Cauchy Sequence
$
forall epsilon > 0 quad
exists n in NN: quad
norm(v_i - v_j) <= epsilon quad
forall i,j >= n
$
On a real Hilbert space $V_0$ the quadratic minimzation problem with a energy norm has a unique solution.
$
norm(v)_0 = norm(v)_(L^2 (Omega)) := (integral_Omega abs(v(xv))^2 dif xv)^(1/2)
$
$
C^0_"pw" (Omega) subset L^2 (Omega)
$
$
H^1 (Omega)
$
$H^1$-seminorm!
$
abs(v)_(H^1 (Omega)) := integral_Omega abs(grad v(xv))^2 dif xv
$
The space H^1 is defined using it's seminorm.
The energy _norm_ however is the actual H^1 norm. So including the L^2 norm.
L^2 is H^0.
$H^1$ norm
$norm(v)_(H^1 (Omega)) = abs(v)_(H^1 (Omega)) + abs(v)_(L^2 (Omega))$
$
C^1_"pw" subset H^1 (Omega)
$
#pagebreak()
We will be solving our problems on Sobolov spaces.
But we just need to work with the norms of the sobolov space.
In order to check the continuity of bilinear or linear forms on the spaces,
we will make a lot of use of the Cauchy-Schwarz inequality.
$
abs(inner(u, v)) <= sqrt(inner(u, u)) sqrt(inner(v, v)) = norm(u) norm(v)
$
For L^2
$
abs(integral_Omega u(xv) v(xv) dif xv) <= (integral_Omega abs(u(xv))^2 dif xv)^(1/2) (integral_Omega abs(v(xv))^2 dif xv)^(1/2)
$
First Poincaré-Friedrichs inequality
$
norm(u)_0 <= "diam"(Omega) abs(u)_1
$
#pagebreak()
Linear Variational Problems
$
phi_v: RR -> RR \
phi_v (t) = J(u + t v) \
= 1/2 a(u + t v, u + t v) - l(u + t v) + c \
= 1/2 a(u, u) + t a(u, v) + 1/2 t^2 u(v, v) - l(u) - t l(v) + c
\
(dif phi_v)/(dif t)(t)
= a(u, v) + t u(v, v) - l(v)
\
(dif phi_v)/(dif t)(0) = a(u, v) - l(v) = 0
\
a(u, v) = l(v)
$
$
u in hat(V): quad
a(u, v) = l(v)
quad forall in V_0
$
The quadratic minimization prbolem and the lineare variational problem are equivalent.
#pagebreak()
Green's first formula (integration by parts in higher dimensions)
For any $avec(j) in (C^1_"pw" (clos(Omega)))^d$ and $v in C^1_"pw" (clos(Omega))$
$
integral_Omega avec(j) dot grad v dif xv
=
-integral_Omega "div"(avec(j)) v dif xv
+
integral_(diff Omega) avec(j) dot nvec(n) v dif xv
$
Fundamental lemma of calculus of variations in higher dimensions
If $f in L^2 (Omega)$ satisfies
$
integral_Omega f(xv) v(xv) dif xv = 0
quad forall v in C_0^oo (Omega)
$
then $f eq.triple 0$.
|
|
https://github.com/jgm/typst-hs | https://raw.githubusercontent.com/jgm/typst-hs/main/test/typ/compiler/import-07.typ | typst | Other | // Can't import from closures.
#let f(x) = x
// Error: 9-10 cannot import from user-defined functions
#import f: x
|
https://github.com/wiuri/xjtu_bristol | https://raw.githubusercontent.com/wiuri/xjtu_bristol/main/bristol.typ | typst | //==============================================
// University of Bristol theme for Typst slides.
// Based on a previous version of <NAME>'s
// UoB LaTeX Beamer template, found at
// https://github.com/dawbarton/UoB-beamer-theme
// =============================================
#import "slides.typ": *
#let bristol-theme(
color: rgb("#00008b"),
second_color: rgb(200, 22, 30),
font: "Tahoma",
// second_font: "Tahoma",
watermark: "slogn_65transparent.png",
logo: "logo_blue.png",
secondlogo: "second_logo.png"
) = data => {
let title-slide(slide-info, bodies) = {
place(image(watermark, width:100%))
v(5%)
grid(columns: (5%, 1fr, 1fr, 5%),
[],
align(horizon + left)[#image(logo, width:60%)],
align(horizon + right)[#image(secondlogo, width:60%)],
[])
v(-10%)
align(center + horizon)[
#block(
stroke: ( y: 1mm + color ),
inset: .8em,
breakable: false,
[
#text(font: font, 1.5em, color)[*#data.title*] \
#{
if data.subtitle != none {
parbreak()
text(1.2em, color)[#data.subtitle]
}
}
]
)
#v(1em)
#set text(font: font, .8em, color)
#grid(
columns: (1fr,) * calc.min(data.authors.len(), 3),
column-gutter: .375em,
row-gutter: .5em,
..data.authors
)
#v(2pt)
#data.date
]
}
let default(slide-info, bodies) = {
place(image(watermark, width:100%))
let body = none
if bodies.len() == 1 {
body = bodies.first()
} else{
let colwidths = none
let thisgutter = .2em
if "colwidths" in slide-info{
colwidths = slide-info.colwidths
if colwidths.len() != bodies.len(){
panic("Provided colwidths must be of same length as bodies")
}
} else{
colwidths = (1fr,) * bodies.len()
}
if "gutter" in slide-info{
thisgutter = slide-info.gutter
}
// v(1em)
body = grid(
columns: colwidths,
gutter: thisgutter,
..bodies
)
}
let decoration(type, body) = {
let border = 0.6mm + second_color
let strokes = (
header: ( bottom: border ),
footer: ( top: border )
)
let insets = (
header: ( x: .5em, y: .7em ),
footer: ( x: .5em, y: .4em )
)
grid(
columns: (3%, 94%, 3%),
[],
block(
stroke: strokes.at(type),
width: 100%,
inset: insets.at(type),
body
),
[]
)
}
// header
// decoration("header", grid(columns: (1fr, 1fr),
// align(left, image(logo, width:35%)),
// align(
// right,
// grid(
// rows: (.5em, .5em),
// text(color, .7em)[#data.short-title],
// [],
// text(color, .7em)[#section.display()]
// )
// )
// )
// )
if "title" in slide-info {
// header
decoration("header")[
// #heading(level: 2, text(font: font, second_color)[
// #slide-info.title
// #h(1fr)
// #text(font: font, .8em)[#section.display()]
// ])
// text(font: font, second_color)[
// #slide-info.title
// #h(1fr)
// #text(font: font, .8em)[#section.display()]
// ]
// #h(1fr)
#text(font: font, second_color)[#slide-info.title]
#h(1fr)
#text(font: font, second_color, .6em)[#section.display()]
]
// block(
// width: auto,
// fill: rgb(255, 255, 255),
// inset: (x: 4.5%, y: 1.2em),
// breakable: false,
// outset: 0em,
// heading(level: 1, text(color)[#slide-info.title])
// )
}
v(0.6fr)
block(
width: 100%, inset: (x: 2em), breakable: false, outset: 0em,
body
// fill: color,
// text(fill: color)[body]
)
v(2fr)
// footer
decoration("footer")[
#text(font: font, second_color, .6em)[#data.short-authors]
#h(1fr)
#text(second_color, .6em)[#logical-slide.display()]
]
}
let wake-up(slide-info, bodies) = {
if bodies.len() != 1 {
panic("wake up variant of bristol theme only supports one body per slide")
}
let body = bodies.first()
block(
width: 100%, height: 100%, inset: 2em, breakable: false, outset: 0em,
fill: color,
text(size: 1.5em, fill: white, {v(1fr); body; v(1fr)})
)
}
(
"title slide": title-slide, "default": default, "wake up": wake-up,
)
}
#show: slides.with(
authors: ("Author A", "Author B"), short-authors: "Short author",
title: "Title", short-title: "Short title", subtitle: "Subtitle",
date: "Date",
theme: bristol-theme(),
)
#slide(theme-variant: "title slide")
#new-section("section name")
#slide(title: "Slide title")[
A slide
]
// #slide(title: "Two column", gutter: .5em)[
// Column A goes on the left...
// ][
// And column B goes on the right!
// ]
// #slide(title: "Variable column sizes", colwidths: (2fr, 1fr, 3fr))[
// This is a medium-width column
// ][
// This is a rather narrow column
// ][
// This is a quite a wide column
// ]
// #slide(theme-variant: "wake up")[
// Wake up!
// ] |
|
https://github.com/visika/frontespizio-unina | https://raw.githubusercontent.com/visika/frontespizio-unina/main/README.md | markdown | The Unlicense | # frontespizio-unina
Frontespizio per la tesi scritto in Typst
## Come compilare
Eseguire nella riga di comando:
```sh
typst compile frontespizio.typ
```
|
https://github.com/xrarch/books | https://raw.githubusercontent.com/xrarch/books/main/documents/a4xmanual/chapui.typ | typst | #import "@preview/tablex:0.0.6": tablex, cellx, colspanx, rowspanx
= User Interface
The firmware contains both a textual user interface (TUI) and a simple graphical user interface (GUI). The TUI is referred to as the "command monitor", and consists of a simple command interface that supports several commands. The GUI consists of a very simple "boot picker".
== Boot Picker
The boot picker appears at system startup when the firmware detects more than one bootable partition is available, and a display adapter is attached. It provides a simple way for the user to select which partition should be booted.
#set align(center)
#image("bootpicker.png", width: 50%)
_The appearance of the A4X Boot Picker._
#set align(left)
== Command Monitor
The command monitor is available both graphically via an extremely simplistic terminal emulator, and over the serial port. It can be entered graphically via striking ESC at the boot picker, or over Serial Port A by performing a headless boot (i.e. with no displays attached) with either zero or more than one bootable partition installed.
Note that partitions are named in the format *dksXsY*, where *X* is the integer identifier of the disk device, and *Y* is the integer identifier of the partition. If *Y* is 8, such as in *dks0s8*, the entire disk is addressed.
#box([
A list of commands available at the time of writing is provided:
#tablex(
columns: (1fr, 7fr),
cellx([
#set text(fill: white)
#set align(center)
*Command*
], fill: rgb(0,0,0,255)),
cellx([
#set text(fill: white)
#set align(center)
*Function*
], fill: rgb(0,0,0,255)),
[*help*], [Display help text about all commands.],
[*autoboot*], [Boot with default parameters.],
[*reset*], [Reset the system.],
[*nvreset*], [Reset the system NVRAM.],
[*listenv*], [List the NVRAM variables.],
[*setenv*], [[name] [contents] Set an NVRAM variable.],
[*delenv*], [[name] Delete an NVRAM variable.],
[*boot*], [[device (dksNsN)] [args ...] Boot from specified device.],
[*listdisk*], [List all disks, their bootable partitions, and any operating systems installed.],
[*clear*], [Clear the command monitor.]
)
]) |
|
https://github.com/Fabioni/Typst-TUM-Thesis-Template | https://raw.githubusercontent.com/Fabioni/Typst-TUM-Thesis-Template/main/template/Chapter_Introduction.typ | typst | MIT No Attribution | #import "utils.typ": todo
= Introduction <chapter_introduction>
== Motivation
#todo[Write the thesis]
Because I have to @cite_todo. This is a abbreviation @oidc explained in the glossary.
#lorem(100)
#lorem(100)
== Research Gap
As shown in @figure_dummy, this is wonderful. Typst documentation #footnote(link("https://typst.app/docs")) or that way #footnote[Google einfach]. Look at @eq_einstein or write it $E = M C^2$ inline.
#figure(
grid(
columns: 3, // 2 means 2 auto-sized columns
row-gutter: 2mm, // space between columns
[#image("dummy_image.svg", width: 70%)],
[#image("dummy_image.svg", width: 70%)],
[#image("dummy_image.svg", width: 70%)],
[#image("dummy_image.svg", width: 70%)],
[#image("dummy_image.svg", width: 70%)],
[#image("dummy_image.svg", width: 70%)],
),
caption: [
#lorem(10)
]
) <figure_dummy>
#lorem(40)
$
E = M C^2
$ <eq_einstein>
#lorem(60)
#figure(
[#set text(size: 0.8em, hyphenate: false, weight: "medium"); #set par(justify: false)
#let gut(it) = [#text(fill: rgb("006600"))[#it]];
#let mittel(it) = [#text(fill: rgb("333300"))[#it]];
#let schlecht(it) = [#text(fill: rgb("660000"))[#it]];
#table(
columns: (12.2em, 1fr, 1fr, 1fr, 1fr),
rows: 5em,
fill: (col, row) => if row == 0 or col == 0 { luma(240) } else { none },
inset: 5pt,
align: horizon,
[], [*Method A*], [*Method B*], [*Method C*], [*Method D*],
[_property_], [#schlecht[No] #footnote[#lorem(10)] <fntable1>], [#gut[Yes] #footnote[#lorem(10)] <fntable2>], [#gut[Yes] #footnote(<fntable2>)], [#gut[Yes] #footnote(<fntable2>)],
[_memory_], [#schlecht[No] #footnote(<fntable1>)], [#gut[Yes] #footnote(<fntable2>)], [#gut[Yes] #footnote(<fntable2>)], [#gut[Yes] #footnote(<fntable2>)],
[_complexity_], [#gut[Low] #footnote[#lorem(10)] <fntable4>], [#gut[Low] #footnote(<fntable4>)], [#schlecht[High] #footnote(<fntable6>)], [#schlecht[High] #footnote(<fntable6>)],
[_runtime_], [#gut[Low] #footnote(<fntable4>)], [#gut[Low] #footnote(<fntable4>)], [#schlecht[High] #footnote[#lorem(10)] <fntable6>], [#schlecht[High] #footnote(<fntable6>)],
)],
caption: [
#lorem(30)
]
) <table_comparative_overview_uncertainty_categories>
#lorem(50)
$
W_l = cases(
c dot W_l thick \/ thick hat(lambda) #h(2em) & "if" c < hat(lambda) ,
W_l & thick "otherwise")
$
#lorem(30)
$ mat(
r_(1,1),r_(1,1), r_(1,1), t_x;
r_(2,1),r_(2,1), r_(2,1), t_y;
r_(3,1),r_(3,1), r_(3,1), t_z;
0,0,0, 1
) $
#lorem(50) |
https://github.com/VadimYarovoy/Networks2 | https://raw.githubusercontent.com/VadimYarovoy/Networks2/main/lab1/report/main.typ | typst | #import "template.typ": *
#show: project.with(
type: "Практическая работа №1",
subject: "«Сети и телекоммуникации»",
authors: (
(name: "<NAME>.",
group: "5130904/00104",
tutor: "<NAME>."),
),
abstract: none
)
#show raw.where(block: true): block.with(
width: 100%,
fill: luma(240),
inset: 10pt,
radius: 4pt,
stroke: black,
breakable: true
)
#set heading(numbering: "1.1")
#include "typ/questions.typ"
#include "typ/task.typ"
= Вывод
Были использованы и проанализированы базовые сетевые команды и файлы конфигурации. Настроено безопасное подключение по SSH с использованием ключей, а также рассмотрены меры безопасности и различные настройки для улучшения безопасности подключений. Получены практические навыки работы с основными сетевыми инструментами и сервисами.
|
|
https://github.com/ClazyChen/Table-Tennis-Rankings | https://raw.githubusercontent.com/ClazyChen/Table-Tennis-Rankings/main/history/2007/MS-11.typ | typst |
#set text(font: ("Courier New", "NSimSun"))
#figure(
caption: "Men's Singles (1 - 32)",
table(
columns: 4,
[Ranking], [Player], [Country/Region], [Rating],
[1], [WANG Hao], [CHN], [3133],
[2], [WANG Liqin], [CHN], [3019],
[3], [MA Lin], [CHN], [2937],
[4], [CHEN Qi], [CHN], [2855],
[5], [MA Long], [CHN], [2838],
[6], [RYU Seungmin], [KOR], [2835],
[7], [BOLL Timo], [GER], [2779],
[8], [HAO Shuai], [CHN], [2742],
[9], [<NAME>], [BLR], [2715],
[10], [HOU Yingchao], [CHN], [2666],
[11], [JOO Saehyuk], [KOR], [2626],
[12], [LI Ching], [HKG], [2612],
[13], [OH Sangeun], [KOR], [2599],
[14], [GAO Ning], [SGP], [2585],
[15], [PRIMORAC Zoran], [CRO], [2566],
[16], [HE Zhiwen], [ESP], [2552],
[17], [CHUANG Chih-Yuan], [TPE], [2540],
[18], [LI Ping], [QAT], [2510],
[19], [KORBEL Petr], [CZE], [2507],
[20], [QIU Yike], [CHN], [2495],
[21], [<NAME>], [AUT], [2494],
[22], [LEE Jungwoo], [KOR], [2494],
[23], [KREANGA Kalinikos], [GRE], [2486],
[24], [TUGWELL Finn], [DEN], [2480],
[25], [<NAME>], [GER], [2470],
[26], [TANG Peng], [HKG], [2465],
[27], [MIZUTANI Jun], [JPN], [2463],
[28], [<NAME>], [SWE], [2440],
[29], [KO Lai Chak], [HKG], [2432],
[30], [KONG Linghui], [CHN], [2423],
[31], [CHEUNG Yuk], [HKG], [2419],
[32], [<NAME>], [SWE], [2403],
)
)#pagebreak()
#set text(font: ("Courier New", "NSimSun"))
#figure(
caption: "Men's Singles (33 - 64)",
table(
columns: 4,
[Ranking], [Player], [Country/Region], [Rating],
[33], [KAN Yo], [JPN], [2402],
[34], [XU Hui], [CHN], [2398],
[35], [CHIANG Peng-Lung], [TPE], [2396],
[36], [CHEN Weixing], [AUT], [2394],
[37], [<NAME>], [BEL], [2394],
[38], [TAN Ruiwu], [CRO], [2389],
[39], [BOBOCICA Mihai], [ITA], [2385],
[40], [<NAME>], [GER], [2383],
[41], [CHIANG Hung-Chieh], [TPE], [2376],
[42], [SUSS Christian], [GER], [2373],
[43], [<NAME>], [DOM], [2367],
[44], [TAKAKIWA Taku], [JPN], [2363],
[45], [<NAME>], [ROU], [2355],
[46], [<NAME>], [BEL], [2351],
[47], [SMIRNOV Alexey], [RUS], [2349],
[48], [<NAME>], [HKG], [2343],
[49], [<NAME>], [NED], [2342],
[50], [<NAME>], [FRA], [2339],
[51], [<NAME>], [DEN], [2329],
[52], [<NAME>], [SVK], [2327],
[53], [#text(gray, "<NAME>")], [BUL], [2321],
[54], [LUNDQVIST Jens], [SWE], [2314],
[55], [<NAME>], [HKG], [2314],
[56], [<NAME>], [FRA], [2311],
[57], [BLASZCZYK Lucjan], [POL], [2309],
[58], [<NAME>], [KOR], [2307],
[59], [JAKAB Janos], [HUN], [2301],
[60], [HAKANSSON Fredrik], [SWE], [2293],
[61], [ZHANG Chao], [CHN], [2292],
[62], [<NAME>], [ROU], [2292],
[63], [YANG Zi], [SGP], [2289],
[64], [<NAME>], [CRO], [2289],
)
)#pagebreak()
#set text(font: ("Courier New", "NSimSun"))
#figure(
caption: "Men's Singles (65 - 96)",
table(
columns: 4,
[Ranking], [Player], [Country/Region], [Rating],
[65], [<NAME>], [SLO], [2282],
[66], [KISHIKAWA Seiya], [JPN], [2274],
[67], [<NAME>], [NGR], [2274],
[68], [LEGOUT Christophe], [FRA], [2273],
[69], [<NAME>], [GER], [2270],
[70], [WU Chih-Chi], [TPE], [2262],
[71], [<NAME>], [KOR], [2262],
[72], [<NAME>], [JPN], [2260],
[73], [<NAME>], [AUT], [2253],
[74], [<NAME>], [KOR], [2251],
[75], [<NAME>], [CHN], [2248],
[76], [MAZUNOV Dmitry], [RUS], [2243],
[77], [<NAME>], [CRO], [2241],
[78], [<NAME>], [DEN], [2237],
[79], [KEINATH Thomas], [SVK], [2237],
[80], [CHANG Yen-Shu], [TPE], [2235],
[81], [MATSUDAIRA Kenta], [JPN], [2233],
[82], [<NAME>], [BRA], [2233],
[83], [LEE Jungsam], [KOR], [2223],
[84], [<NAME>], [POL], [2217],
[85], [<NAME>], [PRK], [2214],
[86], [<NAME>], [KOR], [2213],
[87], [<NAME>], [ESP], [2213],
[88], [<NAME>], [BLR], [2210],
[89], [<NAME>], [GRE], [2209],
[90], [<NAME>], [KOR], [2207],
[91], [<NAME>], [POL], [2204],
[92], [<NAME>], [ESP], [2200],
[93], [<NAME>], [ARG], [2189],
[94], [<NAME>], [SRB], [2189],
[95], [<NAME>], [JPN], [2188],
[96], [<NAME>], [FRA], [2181],
)
)#pagebreak()
#set text(font: ("Courier New", "NSimSun"))
#figure(
caption: "Men's Singles (97 - 128)",
table(
columns: 4,
[Ranking], [Player], [Country/Region], [Rating],
[97], [KIM Junghoon], [KOR], [2181],
[98], [<NAME>], [IND], [2179],
[99], [<NAME>], [DEN], [2174],
[100], [<NAME>], [PRK], [2173],
[101], [<NAME>], [POR], [2171],
[102], [<NAME>], [RUS], [2168],
[103], [#text(gray, "<NAME>")], [CHN], [2162],
[104], [#text(gray, "<NAME>")], [GER], [2162],
[105], [#text(gray, "<NAME>")], [CHN], [2159],
[106], [GERELL Par], [SWE], [2159],
[107], [<NAME>], [GER], [2159],
[108], [<NAME>], [POR], [2158],
[109], [<NAME>], [RUS], [2158],
[110], [<NAME>], [GER], [2157],
[111], [<NAME>], [HUN], [2155],
[112], [SVENSSON Robert], [SWE], [2148],
[113], [<NAME>], [CZE], [2148],
[114], [<NAME>], [POR], [2148],
[115], [<NAME>], [JPN], [2143],
[116], [YANG Min], [ITA], [2142],
[117], [<NAME>], [GER], [2135],
[118], [<NAME>], [ITA], [2134],
[119], [<NAME>], [POL], [2133],
[120], [WANG Wei], [ESP], [2130],
[121], [DIDUKH Oleksandr], [UKR], [2121],
[122], [<NAME>], [RUS], [2119],
[123], [SKACHKOV Kirill], [RUS], [2117],
[124], [SEREDA Peter], [SVK], [2115],
[125], [<NAME>], [CAN], [2109],
[126], [<NAME>], [KOR], [2108],
[127], [<NAME>], [CZE], [2105],
[128], [#text(gray, "LENGEROV Kostadin")], [AUT], [2103],
)
) |
|
https://github.com/typst/packages | https://raw.githubusercontent.com/typst/packages/main/packages/preview/cetz-venn/0.1.0/src/lib.typ | typst | Apache License 2.0 | #let version = version(0,1,0)
#import "/src/venn.typ": venn2, venn3
|
https://github.com/AliothCancer/phys_display | https://raw.githubusercontent.com/AliothCancer/phys_display/main/project_doc.typ | typst | #import "latest_style.typ": apply_my_style
#apply_my_style(
title: "Physiological Data Analitics display"
)[
= Possible Measurements means
== PPG
Like MAX30102
=== Heart Rate & SPO2
TODO
=== Glicemic Index
Red Blood Cells absorbance depends on the glicemic index. Coupling it with ML model to estimate the glicemic index can be acceptably precise.
Study link:
= Hardware Components
== Power Supply
Options:
+ Little power bank can be just plugged-in to an esp32 via usb.
== Microcontroller
Options:
+ Thinking about an esp32 risc-V because of little size.
== PPG chip sensor
Options:
+ MAX family chip sensor
== Data Transmission Module
Options:
+ Built-in esp32 module
== Display
Options:
+ Web Interface ran by the *SERVER*
+ Wearable mini-display
== Case
To hold all Components
= Data Workflow
== Acquisition
From *SENSORS* to *MICRO*
== Forward Transfer
From *MICRO* to *SERVER*
== Elaboration
From *raw data* to actual *physiological parameter*
== Backward Transfer
From *SERVER* to *MICRO*
== Visualization
From *MICRO* to *DISPLAY*\
or \
From *SERVER* to *webpage* (julia dashboard)
= Programming Languages
== Microcontroller
Based on my language knowledge:
*RUST* or *MICROPYTHON*
I will consider micropython if possible.
== Data Elaboration
*RUST* or *JULIA* or *PYTHON*
I think im gonna choose julia.
= Functioning
*MICRO* will get datas coming from *SENSORS* and will send to *SERVER* through *WIFI* or other protocol.
#show: rest => align(rest, left)
= Problems
+ How to package all the components in an acceptable format size?
+ How to install the ppg sensor in order to not get too noisy signal and to make it comfortable to wear?
] |
|
https://github.com/sofianedjerbi/Resume | https://raw.githubusercontent.com/sofianedjerbi/Resume/main/modules_fr/skills.typ | typst | Apache License 2.0 | #import "../brilliant-CV/template.typ": *
#cvSection("Compétences")
#cvSkill(
type: [Languages],
info: [*Francais* (Native) #hBar() *Englais* (C1) #hBar() *Allemand* (En apprentissage)]
)
#cvSkill(
type: [Cloud Stack],
info: [AWS #hBar() EC2 #hBar() S3 #hBar() Lambda #hBar() Glue #hBar() Redshift #hBar() CloudFormation]
)
#cvSkill(
type: [DevOps Stack],
info: [Databricks #hBar() Spark #hBar() Airflow #hBar() Docker #hBar() Jenkins #hBar() Git #hBar() Terraform]
)
#cvSkill(
type: [Outils],
info: [Python #hBar() PySpark #hBar() SQL #hBar() PostgreSQL #hBar() MySQL #hBar() SQLAlchemy #hBar() Pandas #hBar() FastAPI]
)
|
https://github.com/HiiGHoVuTi/requin | https://raw.githubusercontent.com/HiiGHoVuTi/requin/main/jeux/chip-liar.typ | typst | #import "../lib.typ" : *
On considère un plateau à $k+1$ cases avec $n$ jetons initialement placés sur la case $k$.
=== Déroulement d'une partie
Une partie dure $r in NN$ reprises, et chaque reprise se déroule suivant:
- Le joueur $suit.club$ donne une partie $J$ des jetons en jeu
- Le joueur $suit.diamond$ choisit un ensemble $J^dagger$ de jetons à déplacer parmi ${J, J^c}$
- Tous les jetons de $J^dagger$ sont déplacés vers la gauche
- Si des jetons se retrouvent sur la case $-1$, ils sont exclus du jeu
Si à la fin des $r$ reprises le nombre de jetons est réduit à $0$ ou $1$, alors le joueur $suit.club$ gagne.
Le joueur $suit.diamond$ gagne sinon.
=== Analyse du jeu
#question(0)[Qu'aurait on pu dire si la condition de victoire était "le nombre de jetons est réduit à 0" ?]
#correct[
Le joueur $suit.diamond$ aurait une stratégie gagnante:
- Si plus de deux jetons sont en jeux, choisir n'importe partie stricte des jetons en jeu.
- Si un seul jeton est en jeu, choisir $emptyset$.
]
#question(0)[Donner une valeur de $r$ telle que le joueur $suit.club$ a une stratégie gagnante.]
#correct[
Si $r = (k+1)n$, le joueur $suit.club$ peut forcer son adversaire à déplacer au moins un jeton à chaque coup, déplaçant tous les jetons vers la gauche en moins de $r$ coups.
]
#question(0)[Donner une valeur de $r$ telle que le joueur $suit.diamond$ a une stratégie gagnante.]
#correct[
Si $r = 1$, le joueur $suit.diamond$ peut simplement choisir une partie stricte des jetons en jeu et gagner.
]
#question(1)[Montrer qu'un joueur a toujours une stratégie gagnante.]
#correct[
Le "Chip-Liar game" est un jeu à information parfaite, un des deux joueurs a donc une stratégie gagnante.
On peut le démontrer avec la construction de l'algorithme `minmax`: la racine de l'arbre de jeu finit coloriée en $suit.club$ ou $suit.diamond$.
]
=== Jouer au hasard
Considérons que $suit.diamond$ joue au hasard, choisissant $J$ ou $J^c$ avec une probabilité $p=1/2$ à chaque reprise.
#question(1)[Exprimer l'espérance du nombre de jetons restants à la fin d'une partie.]
#correct[
Peu importe comment $suit.club$ joue, la moitié des jetons seront déplacés vers la gauche en moyenne à chaque tour.
Si on note $j_i$ une variable aléatoire entière décrivant la position du $i$-ème jeton à la fin de la partie, $ PP(j_i = k - m) = binom(r, m) p^m (1-p)^(r-m) = binom(r, m) 2^(-r) $
$ PP(j_i >= 0) = sum_(m=0)^k PP(j_i = k-m) $
Ainsi, comme $EE(j_i "est sur le terrain") = PP(j_i >= 0)$ et $EE("nombre de jetons") = sum EE(j_i)$,
$ EE("nombre de jetons") = sum_(i=0)^k sum_(m = 0)^n binom(r, m) 2^(-r) = 2^(-r) n sum_(i=0)^k binom(r, m) $
]
=== Jouer très mal
On suppose désormais $ sum_(i=0)^k binom(r, i) > 2^r/n $
#question(2)[Montrer que le joueur $suit.diamond$ a une stratégie gagnante.]
#correct[
De la question précédente et de l'hypothèse on déduit directement que si $suit.diamond$ joue au hasard, $EE("nombre de jetons") > 1$.
Par le lemme décrit dans @meth-proba[] il existe une suite de décisions qui mène à une victoire de $suit.diamond$.
On note que le "peu importe comment $suit.club$ joue" n'amène aucune imprécision au raisonnement. On aurait pu supposer par l'absurde que $suit.club$ avait une stratégie gagnante et affronter celle-ci.
]
|
|
https://github.com/AHaliq/CategoryTheoryReport | https://raw.githubusercontent.com/AHaliq/CategoryTheoryReport/main/chapters/chapter4/optional.typ | typst | #import "../../preamble/lemmas.typ": *
#import "../../preamble/catt.typ": *
#import "@preview/fletcher:0.5.1" as fletcher: diagram, node, edge
|
|
https://github.com/ClazyChen/Table-Tennis-Rankings | https://raw.githubusercontent.com/ClazyChen/Table-Tennis-Rankings/main/history/2005/WS-02.typ | typst |
#set text(font: ("Courier New", "NSimSun"))
#figure(
caption: "Women's Singles (1 - 32)",
table(
columns: 4,
[Ranking], [Player], [Country/Region], [Rating],
[1], [ZHANG Yining], [CHN], [2843],
[2], [GUO Yue], [CHN], [2624],
[3], [NIU Jianfeng], [CHN], [2557],
[4], [WANG Nan], [CHN], [2499],
[5], [GUO Yan], [CHN], [2478],
[6], [KIM Kyungah], [KOR], [2434],
[7], [TIE Yana], [HKG], [2430],
[8], [LI Jiawei], [SGP], [2398],
[9], [LI Xiaoxia], [CHN], [2377],
[10], [BOROS Tamara], [CRO], [2370],
[11], [KIM Hyang Mi], [PRK], [2317],
[12], [BAI Yang], [CHN], [2280],
[13], [#text(gray, "LI Ju")], [CHN], [2277],
[14], [FAN Ying], [CHN], [2277],
[15], [CAO Zhen], [CHN], [2269],
[16], [LIU Jia], [AUT], [2256],
[17], [SUN Beibei], [SGP], [2252],
[18], [UMEMURA Aya], [JPN], [2234],
[19], [LIN Ling], [HKG], [2218],
[20], [LAU Sui Fei], [HKG], [2210],
[21], [PAVLOVICH Viktoria], [BLR], [2204],
[22], [GAO Jun], [USA], [2202],
[23], [FUKUHARA Ai], [JPN], [2192],
[24], [LEE Eunsil], [KOR], [2186],
[25], [ZHANG Rui], [HKG], [2168],
[26], [PENG Luyang], [CHN], [2163],
[27], [FUJINUMA Ai], [JPN], [2147],
[28], [#text(gray, "WANG Tingting")], [CHN], [2139],
[29], [LAY Jian Fang], [AUS], [2136],
[30], [SONG Ah Sim], [HKG], [2130],
[31], [STEFF Mihaela], [ROU], [2127],
[32], [TOTH Krisztina], [HUN], [2117],
)
)#pagebreak()
#set text(font: ("Courier New", "NSimSun"))
#figure(
caption: "Women's Singles (33 - 64)",
table(
columns: 4,
[Ranking], [Player], [Country/Region], [Rating],
[33], [ZHANG Xueling], [SGP], [2114],
[34], [POTA Georgina], [HUN], [2099],
[35], [TAN Wenling], [ITA], [2087],
[36], [#text(gray, "KIM Hyon Hui")], [PRK], [2085],
[37], [DVORAK Galia], [ESP], [2085],
[38], [LANG Kristin], [GER], [2079],
[39], [LI Nan], [CHN], [2069],
[40], [FAZEKAS Maria], [HUN], [2069],
[41], [JIANG Huajun], [HKG], [2057],
[42], [<NAME>], [GER], [2053],
[43], [<NAME>], [GER], [2049],
[44], [#text(gray, "JING Junhong")], [SGP], [2048],
[45], [SCHOPP Jie], [GER], [2044],
[46], [PASKAUSKIENE Ruta], [LTU], [2034],
[47], [KWAK Bangbang], [KOR], [2033],
[48], [#text(gray, "SUK Eunmi")], [KOR], [2022],
[49], [PALINA Irina], [RUS], [2018],
[50], [HUANG Yi-Hua], [TPE], [2016],
[51], [BADESCU Otilia], [ROU], [2016],
[52], [<NAME>], [NZL], [2015],
[53], [<NAME>], [CHN], [2015],
[54], [STRBIKOVA Renata], [CZE], [2014],
[55], [HIRANO Sayaka], [JPN], [2014],
[56], [CHANG Chenchen], [CHN], [2013],
[57], [<NAME>], [RUS], [2007],
[58], [ZAMFIR Adriana], [ROU], [2004],
[59], [JEON Hyekyung], [KOR], [2004],
[60], [<NAME>], [HUN], [2003],
[61], [KOSTROMINA Tatyana], [BLR], [2001],
[62], [LU Yun-Feng], [TPE], [2000],
[63], [KOMWONG Nanthana], [THA], [1998],
[64], [<NAME>], [GER], [1992],
)
)#pagebreak()
#set text(font: ("Courier New", "NSimSun"))
#figure(
caption: "Women's Singles (65 - 96)",
table(
columns: 4,
[Ranking], [Player], [Country/Region], [Rating],
[65], [<NAME>], [ISR], [1992],
[66], [KIM Bokrae], [KOR], [1992],
[67], [MOLNAR Cornelia], [CRO], [1984],
[68], [<NAME>], [GER], [1984],
[69], [KIM Mi Yong], [PRK], [1984],
[70], [NEGRISOLI Laura], [ITA], [1976],
[71], [<NAME>], [KOR], [1969],
[72], [ODOROVA Eva], [SVK], [1966],
[73], [MOL<NAME>], [HUN], [1964],
[74], [FUJII Hiroko], [JPN], [1958],
[75], [XU Jie], [POL], [1957],
[76], [PAVLOVICH Veronika], [BLR], [1954],
[77], [STEFANOVA Nikoleta], [ITA], [1954],
[78], [XU Yan], [SGP], [1951],
[79], [<NAME>], [SGP], [1951],
[80], [#text(gray, "MELNIK Galina")], [RUS], [1950],
[81], [PAN Chun-Chu], [TPE], [1944],
[82], [MIROU Maria], [GRE], [1936],
[83], [BATORFI Csilla], [HUN], [1924],
[84], [KO Somi], [KOR], [1920],
[85], [<NAME>], [GER], [1920],
[86], [<NAME>], [JPN], [1917],
[87], [<NAME>], [CZE], [1916],
[88], [FADEEVA Oxana], [RUS], [1912],
[89], [<NAME>], [SRB], [1911],
[90], [<NAME>], [CRO], [1909],
[91], [<NAME>], [CZE], [1908],
[92], [<NAME>], [GER], [1906],
[93], [<NAME>], [AUT], [1897],
[94], [<NAME>], [THA], [1895],
[95], [<NAME>], [JPN], [1885],
[96], [<NAME>], [ROU], [1873],
)
)#pagebreak()
#set text(font: ("Courier New", "NSimSun"))
#figure(
caption: "Women's Singles (97 - 128)",
table(
columns: 4,
[Ranking], [Player], [Country/Region], [Rating],
[97], [LOVAS Petra], [HUN], [1871],
[98], [NI Xia Lian], [LUX], [1871],
[99], [SHIOSAKI Yuka], [JPN], [1867],
[100], [<NAME>], [GER], [1864],
[101], [#text(gray, "CADA Petra")], [CAN], [1862],
[102], [KOVTUN Elena], [UKR], [1861],
[103], [<NAME>], [IND], [1860],
[104], [<NAME>], [SRB], [1859],
[105], [#text(gray, "ROUSSY Marie-Christine")], [CAN], [1859],
[106], [<NAME>], [JPN], [1858],
[107], [<NAME>], [CRO], [1857],
[108], [<NAME>], [UKR], [1855],
[109], [PIETKIEWICZ Monika], [POL], [1852],
[110], [<NAME>], [KOR], [1849],
[111], [<NAME>], [USA], [1846],
[112], [<NAME>], [AUT], [1845],
[113], [<NAME>], [BEL], [1844],
[114], [<NAME>], [MAS], [1834],
[115], [<NAME>], [IND], [1826],
[116], [<NAME>], [CRO], [1823],
[117], [<NAME>], [SLO], [1822],
[118], [CICHOCKA Magdalena], [POL], [1820],
[119], [<NAME>], [KOR], [1820],
[120], [TANIGUCHI Naoko], [JPN], [1819],
[121], [#text(gray, "<NAME>")], [KOR], [1815],
[122], [#text(gray, "REGENWETTER Peggy")], [LUX], [1814],
[123], [<NAME>], [HUN], [1812],
[124], [BOLSHAKOVA Natalia], [RUS], [1812],
[125], [MUTLU Nevin], [TUR], [1811],
[126], [<NAME>], [TPE], [1810],
[127], [#text(gray, "LOWER Helen")], [ENG], [1805],
[128], [VACHOVCOVA Alena], [CZE], [1803],
)
) |
|
https://github.com/wj461/operating-system-personal | https://raw.githubusercontent.com/wj461/operating-system-personal/main/HW1/document.typ | typst | #align(center, text(17pt)[
*Operating-system homework\#1*
])
#(text(14pt)[
= Programming problems
])
Kernel: 6.8.1-arch1-1\
gcc (GCC) 13.2.1
= compile
#image("./image/make.png",width: 100%, fit: "contain")
= 2.24
- result
- txt
#image("./image/cp.png",width: 100%)
#image("./image/cp_file.png",width: 100%)
- jpg
#image("./image/cp_img.png",width: 100%)
#image("./image/cp_img_file.png",width: 100%)
= 3.19
- result
#image("./image/time.png",width: 100%)
|
|
https://github.com/matthiasGmayer/typst-math-template | https://raw.githubusercontent.com/matthiasGmayer/typst-math-template/main/common_symbols.typ | typst | #let comp(cont) = $overline(cont)$
#let functionOf = sym.lt.tilde
#let given = $|$
#let PA="PA"
#let XF = $cal(X)$
#let YF = $cal(Y)$
#let ZF = $cal(Z)$
#let WF = $cal(W)$
#let strikethrough = $#h(-0.65em) \/ #h(0.5em)$
#let generates = sym.tack
// #let generatesNot = $generates
// #line(angle: -50deg, start:(-0.93em,0.5em),length:0.88em ,stroke:0.04em)
// #h(-0.34em)$
#let generatesNot = math.op("⊬")
#let history = $cal(H)$
#let perpNot = $perp strikethrough$
#let disintegrates = math.op(sym.times.div)
#let disintegratesNot = $times.div strikethrough$
#let powerset(cont) = $cal(P)(cont)$
#let AS = $cal(A)$
#let BS = $cal(B)$
#let CS = $cal(C)$
#let DS = $cal(D)$
#let borel = $cal(B)$
#let probvec = $cal(v)$
#let probvecs = $cal(V)$
#let one = $bb(1)$
#let distributions = math.op(sym.triangle.t)
#let distributionsF = $distributions^*$
#let nullset = $cal(N)$
#let TS = math.cal("T")
#let id = math.op("id")
#let do= math.op("do")
#let Irr(A) = $I^(#A)$
#let partitions=math.op("part")
#let support=math.op("supp")
#let terms=math.op("terms")
#let var=math.op("var")
#let eval=math.op("eval")
#let pa=math.op("pa")
#let intervenable = math.op(sym.arrow.r.twohead.bar)
#let intervenableNot = math.cancel(intervenable, length:100%,stroke:0.05em)
// #intervenable
// #intervenableNot
#let causeOf= math.op(sym.arrow.r.twohead)
#let xor = math.op(sym.plus.circle)
// #let res(f,c) = f + sym.bar.v + $""_#c$
#let res(f,c) = $#f\|""_#c$
#let funindSymbol = "f"
#let funind = $attach(perp,br:funindSymbol)$
// #let test= $cancel(x)$
#let path = sym.arrow.long.bar
#let upath = sym.arrow.dashed
#let ancestors = math.op(sym.Alpha)
// #generatesNot
#let prime = move(dx: 0.05em, dy: 0.375em, scale("\u{2032}", x:150%,y : 150%))
#let test = symbol("⊬")
#let t = "⊬"
Math: $tack, test$, normal #sym.tack #t
|
|
https://github.com/AxiomOfChoices/Typst | https://raw.githubusercontent.com/AxiomOfChoices/Typst/master/TA/Fall%202023/Math%20314/Midterm/Midterm%20Solutions.typ | typst | #import "../../../../Templates/generic.typ": generic
#import "../../../../Templates/question.typ": question_heading
#import "@preview/metro:0.1.0": unit, units, prefixes
#import "@preview/cetz:0.1.2"
#import units: gram, metre, second
#import prefixes: kilo, centi
#show: doc => generic(title: "Midterm Solutions", name: "<NAME>", question_heading(doc))
#let ve = $epsilon$
= Question 1
== Statement
Consider a physical system in which a rocket's total energy is constant, given by
$ E = 1/2 m v^2 e^(k m v) $
where $m$ is the mass of the rocket, $v$ is its velocity, and $k$ is a constant equal to $4 unit(second/ kilo gram / metre)$.
Assume that at a certain snapshot in time, $t = 0$, we measure the mass of the rocket to be $1 unit(kilo gram)$, its velocity to be $1 unit(metre/second)$ and its acceleration to be $(diff v)/(diff t) |_(t=0) = 5 unit(metre/second^2)$. Determine the rate at which it is losing mass, in other words, what is $(diff m)/(diff t) |_(t=0)$?
#v(10pt)
(a) $-4 unit(kilo gram / second)$
#h(1fr)
(b) $-5 unit(kilo gram / second)$
#h(1fr)
(c) $-6 unit(kilo gram / second)$
#h(1fr)
(d) $-7 unit(kilo gram / second)$
#h(1fr)
(e) None of the above
== Solution
This is an implicit differentiation question since we are solving for the change of one variable when some implicit equation of them holds.
Since $E$ is constant we have that
$
0
&= (diff E)/(diff t) = (diff)/(diff t) 1/2 m v^2 e^(k m v)
\ &= 1/2 v^2 e^(k m v) (diff m)/(diff t)
+ m v e^(k m v) (diff v)/(diff t)
+ 1/2 m v^2 e^(k m v) (k v) (diff m)/(diff t)
+ 1/2 m v^2 e^(k m v) (k m) (diff v)/(diff t)
\ &= (1 + m k v)1/2 v^2 e^(k m v) (diff m)/(diff t)
+ (2 + m k v) 1/2 m v e^(k m v) (diff v)/(diff t)
$
We now have the values at $t = 0$ of all variables here except the one we want to know. We thus get
$
0 &= (1 + 4)1/2 e^(4) (diff m)/(diff t) unit(m^2 / s^2)
+ (2 + 4) 1/2 e^(4) (5) unit(kilo gram m^2 / s^3)
\ &= 5 (diff m)/(diff t) +
30 unit(kilo gram / s)
$
giving us $(diff m)/(diff t) = -6 unit(kilo gram / s)$
= Question 2
== Statement
Consider the region $R = { (x, y) | x^2 + y^2 <= 1 }$. For which of the following functions is the point (0.8, 0.6) an absolute maximum over $R$?
$"(a)" f(x,y) = x^3 - x + y "(b)" f(x,y) = (4x + 3y - 1)^2 "(c)" f(x,y) = e^(x y) "(d)" f(x,y) =\ 4x + 3y "(e) none of the above"$
== Solution
This one was the hardest question for the most students, the key is that the the point is on the boundary of $R$ and so we can immediately use Lagrange multipliers to eliminate some options.
The gradient of the constraint function is easily seen to be $(2x,2y) = (1.6, 1.2)$ and so we need to compute the gradients of the options, these are
$
nabla(x^3 - x + y) &= (3(0.8)^2 - 1, 1) = (1.92, 1) \
nabla((4x + 3y - 1)^2) &= 2(4 dot (0.8) + 3 dot (0.6) - 1) (4,3)= (32, 24) \
nabla(e^(x y)) &= e^(0.8 dot 0.6) (0.6, 0.8) \
nabla(4x + 3y) &= (4,3)
$
We can quickly see that both options (a) and (c) cannot be correct since the gradient is not colinear with $(1.6,1.2)$. Options $(b)$ and $(d)$ are both on the table. We now explicitly use Lagrange multipliers on those two options. Let us first try for (b), this gives us
$ lambda (2x,2y) = 2(4x + 3y - 1)(4, 3) $ which then
gives us
$
lambda x = 16x + 12y - 4, quad
lambda y = 12x + 9 y - 3
$
we can multiply the left equation by 3 and the right equation by 4 and then subtract to get
$
3 lambda x - 4 lambda y = 0
$
and so $(x,y)$ must lie on the line $y = 3/4 x$. Since it must also be on the circle $x^2 + y^2 = 1$ and so that leaves us with the points $(-0.8,-0.6)$ as well as $(0.8, 0.6)$. We notice that the value at $(-0.8,-0.6)$ is $36$ which is higher than the value at $(0.8, 0.6)$ which is $16$ so $(0.8, 0.6)$ this is not true for (b).
#pagebreak(weak: true)
Next we have (d), we get
$ lambda (2x, 2y) = (4,3) $
and so we again have that $(x,y)$ lies on the line $y = 3/4 x$. We then get that the points are again $(-0.8,-0.6)$ and $(0.8, 0.6)$.
But now the value at $(-0.8, -0.6)$ is $-5$ and the value at $(0.8, 0.6)$ is $5$ and so it could be a maximum. All that remains to check is that there are no other critical points in the interior of $R$. But this is immediate from the fact that the gradient $(4,3)$ is never zero and so we get that (d) is the right answer.
= Question 3
== Statement
Consider the triangle $T$ with corners $(0,0), (0,2), (4,0)$ and constant density function $1$. Which point is its center of mass?
#v(10pt)
(a) $(1,2/3)$
#h(1fr)
(b) $(4/3,2/3)$
#h(1fr)
(c) $(4/3,1/2)$
#h(1fr)
(d) $(1,1/2)$
#h(1fr)
(e) None of the above
== Solution
First let us compute the mass of the triangle, we can easily find that the region enclosed by the triangle is given by $T = { (x,y) | 0 <= x <= 4,0 <= y <= 2 - x/2}$
$
integral_0^4 integral_0^(2-x/2) 1 dif y dif x
=
integral_0^4 (2 - x/2) dif x
=
[2x - x^2/4]^4_0
=
8 - 4
=
4
$
Next we want to calculate all the moments of the triangle $T$
$
integral_0^4 integral_0^(2-x/2) x dif y dif x
=
integral_0^4 x(2 - x/2) dif x
=
[x^2 - x^3/6]^4_0 = 16 - 32/3 = 16/3
$
and also
$
integral_0^4 integral_0^(2-x/2) y dif y dif x
&=
integral_0^4 1/2(2 - x/2)^2 dif x
=
integral_0^4 2 - x + x^2/8 dif x
\ &=
[2x - x^2/2 + x^3/24]^4_0 = 8 - 8 + 8/3
= 8 / 3
$
So now we divide to get that the center of mass is $(4/3, 2/3)$.
= Question 4
== Statement
In class we found the following estimate $pi <= integral.double_D e^(x^2+y^2) <= e pi$ where $D$ is the region $D = { (x,y) | x^2 + y^2 <= 1 }$. Compute the exact value of this integral. The answer is
#v(10pt)
(a) $pi (e - 1)$
#h(1fr)
(b) $2e$
#h(1fr)
(c) $(pi e)/2$
#h(1fr)
(d) $2 pi$
#h(1fr)
(e) None of the above
== Solution
We use polar coordinates to compute this integral
$
integral_0^(2 pi) integral_0^1 e^(r^2) r dif r dif theta
=
integral_0^(2 pi) integral_0^1 1/2 e^(u) dif u dif theta
=
integral_0^(2 pi) 1/2 (e - 1) dif u dif theta
=
2 pi 1/2 (e-1) = pi (e-1)
$
and so $a$ is the right answer.
= Question 5
== Statement
Find the dimensions of a rectangular tile with maximal area subject to the constraint that the total perimeter of the tile is $64 unit(centi metre)$. Please show all your work. (Hint: set this question up as a Lagrange multiper problem).
== Solution
Let us consider a rectangular tile with side lengths $x thin unit(centi metre)$ and $y thin unit(centi metre)$. It is clear that the area is given by $x y$ and the perimeter is given by $2x + 2y$. We thus want to maximize $x y$ subject to the constraint that $2x + 2y = 64 unit(centi metre)$. To that end we find the gradient of this constraint, it is clearly given by $(2x,2y)$. The gradient of the function we are trying to optimize is $(y,x)$ we then want
$
(y,x) = lambda (2x,2y)
$
for some $lambda$. We also have the equation $2x + 2y = 64 unit(centi metre)$ and so we can deduce
$
32 unit(centi metre) = y + x = lambda (2x + 2y) = lambda 64 unit(centi metre)
$
and so we must have $lambda = 1/2$ and so we must have $x = y$. Under the constraint $2x + 2y = 64 unit(centi metre)$ we get $x = y = 16 unit(centi metre)$ which has maximimal area $256 unit(centi metre^2)$
= Question 6
== Statement
Let $E$ be the region between the surfaces
$S_1 = { (x,y,z) in RR^3, z = 3 - x^2 - y^2 }$ and $S_2 = { (x,y,z) in RR^3, z = 2x^2 + 2y^2 }$. Sketch the region $E$ and compute its volume. Please show all your work.
== Solution
First we need to sketch the surface, we notice immediately that $S_1$ is a downward pointing paraboloid and $S_2$ is an upward pointing paraboloid, and that both are centered on the $z$ axis. Their intersection is given by the set of points where
$
3 - x^2 - y^2 = 2x^2 + 2y^2 ==> 1 = x^2 + y^2
$
and so is a circle. We can thus try and sketch this region. We should get something like this
#align(center)[#image("../../../../Storage/Paraboloid intersection.png", width: 80%)]
From this sketch we can easily see that to get the volume we want to integrate the difference between the heights of the two paraboloids over the circle $x^2 + y^2 <= 1$.
The top paraboloid in polar coordinates is given by $z = 3 - r^2$ and the bottom one is given by $2r^2$. We thus get that the difference is $3 - 3r^2$. Thus our volume is
$
V = integral_0^(2 pi) integral_0^1 (3 - 3r^2) r dif r dif theta
= integral_0^(2 pi) 3/2 - 3/4 dif theta
= 3/2 pi
$
|
|
https://github.com/NamLe0609/bias-ai-report | https://raw.githubusercontent.com/NamLe0609/bias-ai-report/main/jssb25-bias-ai-report.typ | typst | #import "template.typ": *
#ieee(
title: [ Ethics & Bias in AI Coursework ],
authors: (
(
name: "<NAME>",
email: "jssb25"
),
),
bibliography-file: "refs.yml",
pre_body: include "pre_body.typ",
table: include "table.typ",
post_body: include "post_body.typ",
) |
|
https://github.com/jgm/typst-hs | https://raw.githubusercontent.com/jgm/typst-hs/main/test/typ/compute/foundations-09.typ | typst | Other | // Test failing assertions.
// Error: 11-55 equality assertion failed: 10 and 12 are not equal
#assert.eq(10, 12, message: "10 and 12 are not equal")
|
https://github.com/lucannez64/Notes | https://raw.githubusercontent.com/lucannez64/Notes/master/Physique_Ex_23_11_2023.typ | typst | #import "template.typ": *
// Take a look at the file `template.typ` in the file panel
// to customize this template and discover how it works.
#show: project.with(
title: "Physique Ex 23 11 2023",
authors: (
"<NAME>",
),
date: "10 Août, 2024",
)
#set heading(numbering: "1.1.")
== Ex 5
<ex-5>
+ $arrow(F) = - G frac(M_S m_v, r^2) arrow(u)_(S arrow.r V)$
+ D’après la deuxième loi de newton dans un référentiel galiléen on a:
$ sum (arrow(F)) = m_v arrow(a) $ $ arrow(F) = m_v arrow(a) $
$ - G frac(M_S m_v, r^2) arrow(u)_(S arrow.r V) = m_v arrow(a) $
$ - G M_S / r^2 arrow(u)_(S arrow.r V) = arrow(a) $ Donc le vecteur
accélération est colinéaire au vecteur champ de pesanteur donc il a
pour direction la droite vénus soleil et pour sens de vénus au soleil
et pour valeur
$G M_S / r^2 = frac(6.67 E - 11 times 1.99 E 30, (1.08 E 8)^2) = 1.14 E 4 N$
== Ex 7
<ex-7>
+ La vitesse de P sera plus élevé car la vitesse est inversement
proportionnelle à la racine de la distance entre les centres de masse
de Saturne et du constituant.
+ $T^2 / r^3 = frac(4 p i^2, G M)$ donc
$T = s q r t frac(4 pi^2 r^3, G M)$ Donc la période sera différente
car elle dépend de la distance avec le centre de masse de Saturne
== Ex 11
<ex-11>
+ D’après la troisième loi de kepler $T^2 / a^3 = k$ avec k une
constante donc on peut calculer k pour le satellite de Jupiter
$k = (1.77 times 24 times 3600)^2 / (4.22 E 2)^3 = (7.15 times 24 times 3600)^2 / (1.07 E 3)^3 = 3.11 E 2 s^2 m^(- 3)$
donc pour $r = 6.71 E 2 m$ on a
$T = sqrt(k times a^3) = sqrt(3.11 E 2 times (6.71 E 2)^3) = 3.07 E 5 s = 3.55 j o u r s$
|
|
https://github.com/MrToWy/hsh-thesis | https://raw.githubusercontent.com/MrToWy/hsh-thesis/main/template/Code/code.typ | typst | MIT License | ```ts
console.log('Hello World');
``` |
https://github.com/denizenging/site | https://raw.githubusercontent.com/denizenging/site/master/post/2024/0617/index.en.typ | typst | #import "@local/pub-post:0.0.0": *
#show: template(
time: (17, 36),
title: "The Precious Act of Writing",
description: "I offer my thoughts on sharing and writing",
categories: ("Reflections"),
)
== On Sharing
Writing has been a deeply cherished dream of mine for the past few
years. Not the act of writing, per se, but rather the notion that I can
share the insights and experiences from my humble life, however humble
it may be.
Sharing valuable insights from life is the most virtuous of all acts,
in my opinion. One can gain so much from others' experiences, including
their mistakes. As human beings, we simply aren't capable of making all
the errors out there---some mistakes are not accessible to us. Do you
remember seniors telling you the first heartbreak you experienced wasn't
going to be the last one? They are talking from experience, from their
own mistakes which you weren't able to make at the time.
Reading and learning from the mistakes of others is far more
approachable. However, this does not necessarily mean that we shouldn't
experience any mistakes in life on our own. On the contrary, some
mistakes offer us more beneficial insights if we make them ourselves.
Recall the heartbreak example above. If you weren't emotionally attached
in this instance, you wouldn't appreciate your lover (or the next) as
much as you would otherwise.
One other reason why the act of sharing is truly invaluable relates to
time. Time is the essense of everything, and in the western culture,
it is often thought to be more precious than money is. This view is very
well justified, in my opinion---we all are given one life in this world.
And we could leave life in any moment. No one can assert, with
certainity, that they will live to see another day. For that very
reason, every minute you spend on earth is priceless. And by sharing my
findings and notes, I will benefit you with more time to yourselves.
== On Writing
As rather simplistic primates, who heavily rely on sugar to function, we
often tend to forget things, especically if we are hungry. Jerome
K.~Jerome has a really good quote on this in his _Three Men in a Boat_:
#quote(block: true, attribution: "<NAME>")[
It is very strange, this domination of our intellect by our
digestive organs. We cannot work, we cannot think, unless our
stomach wills so. It dictates to us our emotions, our passions.
]
That is the reason why the act of writing is quite precious to us, as
often brought up by my dear professor and advisor, #[Fırat Başbuğ], to
whom I am really grateful for. In Turkish, we even have a great saying
about this: #tr["Söz uçar, yazı kalır,"] the English equivalent of which
is "The palest ink is stronger than the sharpest memory," which I am
quite found of as well.
One, for sure, could keep a private notebook about one's own
reflections. In my worldview, however, access to education and knowledge
must be made available to anyone free of charge. And that brings us to
the creation of this site. And... here we are.
So, I welcome you, my dear readers and future self to the depths of my
mind, written from the bottom of my generous heart.
|
|
https://github.com/Myriad-Dreamin/typst.ts | https://raw.githubusercontent.com/Myriad-Dreamin/typst.ts/main/packages/typst.node/README.md | markdown | Apache License 2.0 | # `@myriaddreamin/typst-ts-node-compiler`
# Usage
See [Node Library Docs](https://myriad-dreamin.github.io/typst.ts/cookery/guide/all-in-one-node.html).
## Support matrix
### Operating Systems
| | node14 | node16 | node18 |
| ---------------- | ------ | ------ | ------ |
| Windows x64 | ✓ | ✓ | ✓ |
| Windows x32 | ✓ | ✓ | ✓ |
| Windows arm64 | ✓ | ✓ | ✓ |
| macOS x64 | ✓ | ✓ | ✓ |
| macOS arm64 | ✓ | ✓ | ✓ |
| Linux x64 gnu | ✓ | ✓ | ✓ |
| Linux x64 musl | ✓ | ✓ | ✓ |
| Linux arm gnu | ✓ | ✓ | ✓ |
| Linux arm64 gnu | ✓ | ✓ | ✓ |
| Linux arm64 musl | ✓ | ✓ | ✓ |
| Android arm64 | ✓ | ✓ | ✓ |
| Android armv7 | ✓ | ✓ | ✓ |
| FreeBSD x64 | ✓ | ✓ | ✓ |
## Ability
### Build
After `yarn build/npm run build` command, you can see `typst-ts-node-compiler.[darwin|win32|linux].node` file in project root. This is the native addon built from [lib.rs](./src/lib.rs).
### Test
With [ava](https://github.com/avajs/ava), run `yarn test/npm run test` to testing native addon. You can also switch to another testing framework if you want.
### CI
With GitHub Actions, each commit and pull request will be built and tested automatically in [`node@14`, `node@16`, `@node18`] x [`macOS`, `Linux`, `Windows`] matrix. You will never be afraid of the native addon broken in these platforms.
### Release
Release native package is very difficult in old days. Native packages may ask developers who use it to install `build toolchain` like `gcc/llvm`, `node-gyp` or something more.
With `GitHub actions`, we can easily prebuild a `binary` for major platforms. And with `N-API`, we should never be afraid of **ABI Compatible**.
The other problem is how to deliver prebuild `binary` to users. Downloading it in `postinstall` script is a common way that most packages do it right now. The problem with this solution is it introduced many other packages to download binary that has not been used by `runtime codes`. The other problem is some users may not easily download the binary from `GitHub/CDN` if they are behind a private network (But in most cases, they have a private NPM mirror).
In this package, we choose a better way to solve this problem. We release different `npm packages` for different platforms. And add it to `optionalDependencies` before releasing the `Major` package to npm.
`NPM` will choose which native package should download from `registry` automatically. You can see [npm](./npm) dir for details. And you can also run `yarn add @myriaddreamin/typst-ts-node-compiler` to see how it works.
## Develop requirements
- Install the latest `Rust`
- Install `Node.js@10+` which fully supported `Node-API`
- Install `[email protected]`
## Test in local
- yarn
- yarn build
- yarn test
And you will see:
```bash
$ ava --verbose
✔ sync function from native code
✔ sleep function from native code (201ms)
─
2 tests passed
✨ Done in 1.12s.
```
## Release package
Ensure you have set your **NPM_TOKEN** in the `GitHub` project setting.
In `Settings -> Secrets`, add **NPM_TOKEN** into it.
When you want to release the package:
```
npm version [<newversion> | major | minor | patch | premajor | preminor | prepatch | prerelease [--preid=<prerelease-id>] | from-git]
git push
```
GitHub actions will do the rest job for you.
|
https://github.com/lxl66566/my-college-files | https://raw.githubusercontent.com/lxl66566/my-college-files/main/信息科学与工程学院/算法导论/图的应用（大作业）.typ | typst | The Unlicense | #import "../template.typ": *
#show: project.with(
title: "4",
authors: (
"absolutex",
)
)
= 图的应用
== 课程作业要求
本次作业是课程大作业。
请阅读以下整个文档，并补充完成整个文档。注意每一章节的问题部分，有对应分值，请完成。本次作业占课程分数70%。
完成文档后请输出为 pdf 文档，并按照如下方式重命名：姓名-学号-图的应用.pdf
== 图和复杂网络
该作业介绍了数学家经典的网络理论，要么是分析包含几十数百个顶点，可以画在一张纸上从而形成直观印象的网络；要么是讨论不含有限尺度效应，可以精确求解的网络性质。"随机移走一个顶点;会对网络的性能产生什么样的影响？"这个问题对于研究有限规则网络的数学家是有意义的，对于拥有几千万个节点，接方式复杂多样的真实网络而言，或许“随机移走
3％的顶点;会对网络性能产生什么样的影响？”这个问题更有意义。这个尺度的网络，是被物理学家称作“足够大”的网络，对它们的研究，需要使用统计物理的方法。
复杂网络的起源，来源于两篇文章：《"小世界"网络的集体动力学》;（Collective Dynamics of‘Small-World’Networks）和《随机网络中标度的涌现》;（Emergence of Scaling in Random Networks）（Barabāsi 教授）
+ (#strong[Mark 10 points];)
我们考察一个社交网络，它是否是全连通的呢，即每个结点都是相通的呢？请构造算法验证此结论，如果不是全连通的，可以得到所有的连通子图，要求算法尽可能高效，并简要说明算法的复杂度。注意这里和课本提到的“强连通图“的区别。很明显，这个性质对于社交网络是关键的，如果是全连通图，我们认为，信息在此社交网络中的传递是畅通无阻的，而若非如此，则在每个子图中我们都要投放信息（这个信息可能是广告或事其它公告）。
使用深度优先搜索。
- 选择图中的一个节点作为起始节点。
- 使用深度优先搜索遍历图，标记所有可以从起始节点访问到的节点。在此过程中，记录已访问的节点，以避免重复访问。
- 如果所有节点都被访问到，则社交网络是全连通的；否则，存在未被访问的节点，说明社交网络不是全连通的。
- 如果社交网络不是全连通的，对于每个未被访问的节点，重复步骤1-3，直到所有节点都被访问到。
- 时间复杂度：假设有n个节点和m条边，每个节点最多访问一次，每条边最多被访问两次，因此深度优先搜索的时间复杂度为O(n+m)。
#include_code("算法导论/code/final-1.py")
+ (#strong[Mark 20 points];)
正如课上会介绍的，对于社交网络的分析，我们关注如下几个维度：
- 平均路径长度 L 和路径分布;(#strong[Mark 5 points];)，在网络中，两点之间的距离为连接两点的最短路径。网络的平均路径长度指网络中所有节点对的平均距离，它表明网络中节点间的分离程度，反映了网络的全局特性。路径的分布是指所有这些路径符合的统计分布（cdf 或 pdf）。不同的网络结构可赋予 L 不同的含义。如在疾病传播模型中 L 可定义为疾病传播时间。请设计算法，分别针对有权重图和无权重图计算平均路径 L，以及所有路径的分布，给出算法复杂度的说明。
#include_code("算法导论/code/final-2.py")
#figure(
image("static/final-2.png", width:90%)
)
+ 无权重图的平均路径长度 (L) 计算的算法复杂度：
- 时间复杂度：$O(V dot (V + E))$，其中 (V) 为节点数，(E) 为边数。
- 空间复杂度：$O(V + E)$。
+ 无权重图的路径分布计算的算法复杂度：
- 时间复杂度：$O(V dot (V + E))$，其中 (V) 为节点数，(E) 为边数。
- 空间复杂度：$O(V + E)$。
+ 有权重图的平均路径长度 (L) 计算的算法复杂度：
- 时间复杂度：$O(V dot (V + E log V))$，其中 (V) 为节点数，(E) 为边数。
- 空间复杂度：$O(V + E)$。
+ 有权重图的路径分布计算的算法复杂度：
- 时间复杂度：通常为 $O(V dot (V + E log V))$。
- 空间复杂度：$O(V + E)$。
- 聚集系数 C;(#strong[Mark 5 points];)。在网络图中，聚集系数 C 可以是整体聚集系数，也可以是局部聚集系数。这里介绍局部聚集系数的概念。节点的聚集系数是指与该节点相邻的所有节点之间连边的数目占这些相邻节点之间最大可能连边数目的比例。假设结点$v_i$有$k_i$个与之相连的结点，一般来说，对于无向图，这个最大边数等于 $frac(k_i (k_i - 1), 2)$；对于有向图，$k_i$代表了$v_i$的出度，由于每两个顶点之间可以连两条边（不同方向），最大边数等于 $k_i (k_i - 1)$。下图代表了蓝点的聚集系数。蓝点有三个邻接点（白点）。如果三个白点都相互连接（上图），那么蓝点的集聚系数是 $3÷3=1$；如果只有两点之间相连（中图，只有一条边），那么集聚系数是 $1/3$；如果没有两点是相连的，那么集聚系数就是 0。网络的聚集系数则是指网络中所有节点聚集系数的平均值，它表明网络中节点的聚集情况即网络的聚集性，也就是说同一个节点的两个相邻节点仍然是相邻节点的概率有多大，它反映了网络的局部特性。请设计算法，分别针对有向图和无向图的聚集系数 C，给出算法复杂度的说明。
#include_code("算法导论/code/final-3.py")
#figure(
image("static/final-3.png", width:90%)
)
+ 无向图的聚集系数算法复杂度：
- 时间复杂度：$O(V^2)$，其中 (V) 为节点数。
- 空间复杂度：$O(1)$。
+ 有向图的聚集系数算法复杂度：
- 时间复杂度：$O(V^2)$，其中 (V) 为节点数。
- 空间复杂度：$O(1)$。
+ 网络的聚集系数计算算法复杂度：
- 时间复杂度：$O(V^3)$，其中 (V) 为节点数。这是由于对每个节点都需要计算聚集系数，而每个节点的聚集系数的计算复杂度为 $O(V^2)$。
- 空间复杂度：$O(1)$。
- 度及度分布;(#strong[Mark 5 points];)。在网络中，点的度是指与该节点相邻的节点的数目，即连接该节点的边的数目。而网络的度$k$指网络中所有节点度的平均值。度分布 P(k) 指网络中一个任意选择的节点，它的度恰好为 k 的概率。请设计算法，求网络的度和度分布，给出算法复杂度的说明。
#include_code("算法导论/code/final-4.py")
#figure(
image("static/final-4.png", width:60%)
)
- 计算节点的度复杂度：
- 时间复杂度：$O(V + E)$，其中 (V) 为节点数，(E) 为边数。需要遍历图的所有节点和边。
- 计算网络的平均度复杂度：
- 时间复杂度：$O(V)$，取所有节点的度并求平均。
- 计算度分布复杂度：
- 时间复杂度：$O(V)$
- 空间复杂度：$O(V)$
- 介数;(#strong[Mark 5 points];)。包括节点介数和边介数。节点介数指网络中所有最短路径中经过该节点的数量比例，边介数则指网络中所有最短路径中经过该边的数量比例。介数反映了相应的节点或边在整个网络中的作用和影响力。请设计算法，求每个结点和边的介数，给出算法复杂度的说明。
#include_code("算法导论/code/final-5.py")
- 时间复杂度：$O(V (V + E))$，其中 (V) 为节点数，(E) 为边数。对每一对节点进行最短路径计算的复杂度为 $O(V + E)$。
- 空间复杂度：$O(V + E)$，存储最短路径数量和节点介数。
+ (#strong[Mark 20 points];) 在社交网络中，我们有关键意见领袖（Key Opinion Leader，简称 KOL）的概念，也就是我们通常所说的大 V。实际上 KOL 与普遍意义上的“网红”又是有区别的。请查阅相关资料，说明上述哪一种或是哪几种参数能描述 KOL、网红等概念。
1. 度：
- KOL： KOL 在特定领域可能有更高的度，即与其他专业人士、行业内人士有更多的连接。这反映了他们在特定领域内的专业性和影响力。
- 网红： 网红可能有更低的度，可能更多地反映其在社交平台上的广泛关注程度，即与大量粉丝的连接。
2. 平均路径长度：
- KOL： KOL 可能在特定领域内与其他专业人士之间形成相对较短的平均路径，即信息在专业领域内传播相对迅速。
- 网红： 网红的平均路径长度更长，可能更多地反映其与大量粉丝之间形成的连接，即信息在广泛的社交网络中传播。
3. 聚集系数：
- KOL： KOL 可能在特定领域内形成较高的聚集系数，即与其相关的专业人士之间形成紧密的社群。
- 网红： 网红的聚集系数可能较低，更多地反映其在社交平台上形成的粉丝社群，即粉丝之间的连接紧密度。
+ (#strong[Mark 20 points];)网络的稳定性。网络的稳定性，也被直译为网络的鲁棒性（Robutness）。研究的点是，一个网络中去掉什么的点或者边，可以改变网络的连通性。一般说来，针对于现实问题，我们考虑两种情况的网络稳定性：a) 随机攻击，即随机去掉一些边和点，统计平均需要去掉多少边或结点使得网络的连通性发生改变。b) 策略攻击。即针对一个网络，给出一种算法，能够去掉最少的边或点，改变其连通性，统计这个最小值是多少。显然，去掉的点或边越多，网络越稳定。
+ 查阅相关资料，了解典型的复杂网络：随机网、小世界网、无标度网等；
+ 查阅相关资料，了解复杂网络里社团发现（Community Detection）和链路预测 (Link Prediction) 分别是研究什么的。
+ 回答：a) 不同类型的网络稳定性在两种不同的攻击下，稳定性各如何？b) 根据网络的四种度量，以贪婪算法为基础，构建一种策略攻击算法。
a)
- 随机攻击：
- 随机网：稳定性较差，因为随机去掉的节点或边可能直接影响网络的连通性。
- 小世界网：相对稳定，因为大部分节点之间连接较为松散。
- 无标度网：稳定性较差，因为去掉一些边或节点可能导致核心结构受损。
- 策略攻击
- 随机网：相对稳定。由于节点和边的连接是随机的，没有明显的核心结构，选择性地去掉边或节点可能需要较多的步骤才能改变网络的连通性。
- 小世界网：相对稳定。由于小世界网的结构具有高聚类系数和短平均路径长度，攻击一个节点可能不会立即破坏整体的连通性。
- 无标度网：相对不稳定。由于无标度网中存在少量高度连接的核心节点，选择性地去掉这些节点可能会迅速破坏整个网络的连通性。
b)
- 从网络中选择具有最高度的节点、介数最高的节点、聚集系数最高的节点、平均路径长度最高的边，并按顺序进行攻击。
+ (#strong[Mark 20 points];)
复杂网络的局部特征。当前，复杂网络的研究从其稳定性、度的分布等全局特征，进而到了研究细致的局部特征。其中一个重要特征则是共同邻居。共同邻居（CN）被定义为两节点间相同的相邻节点数。对于节点 x、y，它们的邻居节点集合分别为$Gamma (x)$、$Gamma (y)$，则节点 x、y 共同邻居集合为$Gamma (x) sect Gamma (y)$，CN 指标被定义为
$ C N = lr(|Gamma (x) sect Gamma (y)|) $
研究表明，在实际网络中，尤其是传播网络中，两节点间的共同邻居数越大，则其后建立的链接的可能性越大。直观上来说，这是好理解的，比如两个人的共同朋友越多，则次二人后续经共同朋友介绍认识（建立连接）的可能性就越大。
进一步的，我们意识到，度小的共同邻居节点的贡献大于度大的共同邻居节点。例如：在社交网络中，共同关注一个比较冷门话题的两个人之间相连的概率往往会比关注同一热门话题的两个人之间连接的概率高。因此，根据共同邻居节点的度为每个节点赋予一个权重值，这就是Adamic/Adar（AA）指标：
$ A (x , y) = sum_(u in Gamma (x) sect Gamma (y)) frac(1, log lr(|Gamma (u)|)) $
这里$lr(|Gamma (u)|)$代表$u$节点的度。
最后，还有一种度量，称之为 resource allocation (RA) index。该指标认为网络中每个节点都有一定的资源，并将资源平均分配给它的邻居。网络中没有直接相连的两个节点x、y 之间，可从节点 x 传递一些资源到节点 y，在此过程中，节点 x 和 y的共同邻居成为传递媒介。则节点 y 接收到的资源数就定义为节点 x、y的相似度。RA 指标被定义为
$ S (x , y) = sum_(u in Gamma (x) sect Gamma (y)) 1 / lr(|Gamma (u)|) $
请构造一种算法，来计算两两节点间的 CN、AA、RA 三个指标，简要分析一下计算复杂度。
#include_code("算法导论/code/final-6.py")
1. CN指标：计算共同邻居数的复杂度取决于两节点邻居集合的大小，即$O(min(deg(x), deg(y)))$。
2. AA指标 与 RA指标：计算AA指标、RA指标的复杂度取决于共同邻居的数量，复杂度为$O(min(deg(x), deg(y)) * "共同邻居的平均度")$
+ (#strong[Mark 10 points];) 实现具体的算法。采用 NetworkX，根据提供的 Huawei 数据集，完成 2 中各个参数的估算，同时根据小世界、无标度、随机复杂网络的定义，判断这大概是什么网络。建议使用 Jupyter Notebook 完成。可能会用的 Python 库包括 Pandas、Matplotlib、Scipy 和 Numpy。
#include_code("算法导论/code/final-7.py")
== 华为数据集介绍
该数据集是通过抓取社交媒体平台即 Facebook、Twitter 和 Instagram 华为页面收集的。这是一个日常使用社交媒体的人群之间的交流网络。我们采用自然语音处理技术（NLP技术）从帖子中提取正面评论，然后对数据进行预处理。数据集实际上是一个有向无权图的邻接矩阵。
- 华为 Facebook 通信网络是定向和标记的，有 1000 个节点和 250315 条边
- 华为推特通信网被导演和标榜有 1000 个节点和 50153 条边
- 华为 Instagram 通信网被导演和标榜有 1000 个节点和 4933 条边
在实际应用中，如今，华为研发部门正在利用社会化网络分析工具和技术来提升他们的业务地位。华为公司成功的主要原因之一就是他们通过社会化媒体推广自己的产品。社会化媒体分析可以帮助华为公司通过以下方式提高他们的业务水平。
- 发展业务，评估营销活动的影响。
- 做出更好的商业决策，建立一个强大的战略。
- 提高客户体验和满意度，建立品牌知名度。
- 社会化媒体分析帮助华为公司了解他们的目标受众。
- 社交媒体分析可以提高参与度和响应度。
- 社交媒体分析来衡量和提高品牌知名度
- 社交媒体分析可以突出问题和弱点，以发现新趋势，避免品牌危机。
- 社会化媒体分析可以帮助你从竞争对手那里学到东西。
== 致谢
本作业到此就结束了。感谢大家这个学期的选课和支持！ |
https://github.com/liamaxelrod/Resume | https://raw.githubusercontent.com/liamaxelrod/Resume/main/test_typst/tutorial_par.typ | typst | = par
#par(leading: 2em)[
== 1 parameters - (leading: length)
leading: 2em controls the space between lines \
within the document this allows you to control the spacing between lines vertically \
another line to make it more visible
]
#par(justify: false)[
== 2 parameters - (justify: false)
doesn't do anything when it's false
#lorem(50)
]
#par(justify: true)[
== 2 parameters - (justify: true)
_makes all the lines even at the end of the right side of the page!_
#lorem(50)
]
#par(linebreaks: auto)[
== 3 parameters - (linebreak: auto, "simple", "optimized")
I don't know what this does
#lorem(50)
]
#par(first-line-indent: 0.65em)[
== 4 parameters - (first-line-indent: length)
using the length of 0.65em for the intention of this parameter
all paragraphs after the first one or intended
depending on circumstances the first may be indented
]
#par(hanging-indent: 0.65em)[
== 5 parameters - (hanging-indent: length)
index after the first sentence continuously for the paragraph shown within the text
#lorem(30)
]
|
|
https://github.com/Mc-Zen/tidy | https://raw.githubusercontent.com/Mc-Zen/tidy/main/src/show-example.typ | typst | MIT License |
/// Takes given code and both shows it and previews the result of its evaluation.
///
/// The code is by default shown in the language mode `lang: typc` (typst code)
/// if no language has been specified. Code in typst markup lanugage (`lang: typ`)
/// is automatically evaluated in markup mode.
///
/// - code (raw): Raw object holding the example code.
/// - scope (dictionary): Additional definitions to make available for the evaluated
/// example code.
/// - dir (direction): Direction for laying out the code and preview boxes.
/// - preamble (str): Code to prepend to the snippet. This can for example be used to configure imports.
/// - ratio (int): Configures the ratio of the widths of the code and preview boxes.
/// - scale-preview (auto, ratio): How much to rescale the preview. If set to auto, the the preview is scaled to fit the box.
/// - inherited-scope (dictionary): Definitions that are made available to the entire parsed
/// module. This parameter is only used internally.
/// - code-block (function): The code is passed to this function. Use this to customize how the code is shown.
/// - preview-block (function): The preview is passed to this function. Use this to customize how the preview is shown.
/// - col-spacing (length): Spacing between the code and preview boxes.
#let show-example(
code,
scope: (:),
dir: ltr,
preamble: "",
ratio: 1,
scale-preview: auto,
mode: auto,
inherited-scope: (:),
code-block: block,
preview-block: block,
col-spacing: 5pt,
..options
) = {
let lang = if code.has("lang") { code.lang } else { "typc" }
if mode == auto {
if lang == "typ" { mode = "markup" }
else { mode = "code" }
}
if mode == "markup" and not code.has("lang") {
lang = "typ"
}
if code.has("block") and code.block == false {
code = raw(code.text, lang: lang, block: true)
}
let preview = [#eval(preamble + code.text, mode: mode, scope: scope + inherited-scope)]
let preview-outer-padding = 5pt
let preview-inner-padding = 5pt
layout(size => style(styles => {
let code-width
let preview-width
if dir.axis() == "vertical" {
code-width = size.width
preview-width = size.width
} else {
code-width = ratio / (ratio + 1) * size.width - 0.5 * col-spacing
preview-width = size.width - code-width - col-spacing
}
let available-preview-width = preview-width - 2 * (preview-outer-padding + preview-inner-padding)
let preview-size
let scale-preview = scale-preview
if scale-preview == auto {
preview-size = measure(preview, styles)
assert(preview-size.width != 0pt, message: "The code example has a relative width. Please set `scale-preview` to a fixed ratio, e.g., `100%`")
scale-preview = calc.min(1, available-preview-width / preview-size.width) * 100%
} else {
preview-size = measure(block(preview, width: available-preview-width / (scale-preview / 100%)), styles)
}
set par(hanging-indent: 0pt) // this messes up some stuff in case someone sets it
// We first measure this thing (code + preview) to find out which of the two has
// the larger height. Then we can just set the height for both boxes.
let arrangement(width: 100%, height: auto) = block(width: width, inset: 0pt, stack(dir: dir, spacing: col-spacing,
code-block(
width: code-width,
height: height,
inset: 5pt,
{
set text(size: .9em)
set raw(block: true)
code
}
),
preview-block(
height: height, width: preview-width,
inset: preview-outer-padding,
box(
width: 100%,
height: if height == auto {auto} else {height - 2*preview-outer-padding},
fill: white,
inset: preview-inner-padding,
box(
inset: 0pt,
width: preview-size.width * (scale-preview / 100%),
height: preview-size.height * (scale-preview / 100%),
place(scale(
scale-preview,
origin: top + left,
block(preview, height: preview-size.height, width: preview-size.width)
))
)
)
)
))
let height = if dir.axis() == "vertical" { auto }
else { measure(arrangement(width: size.width), styles).height }
arrangement(height: height)
})
)
} |
https://github.com/yhs0602/typst-practice | https://raw.githubusercontent.com/yhs0602/typst-practice/main/hello.typ | typst | = Hello
world
```ocaml
let x = 3 in
let y = 4 in
let z = x + y in
z
```
$ F = G frac(m_1 m_2, r^2) $
=== dsa
adkasmca
asdcaca
- Hello
- world
*Paragraph* world
+ Hello
+ world
#let foo(x) = [I'm #x]
Hello, this is #foo(4).
$ foo(7) + 4 $
#table(
columns: (1fr, auto, auto),
inset: 10pt,
align: horizon,
table.header(
[], [*Area*], [_Population_]
),
$pi$, $3.14$, $7$,
$e$, $2.71$, $3$
)
#par(
$pi$ + "isis"
)
$
vec(1, 2) times mat(3, 4) &= (1 times 3 + 2 times 4, 1 times 4 + 2 times 5) \
&= vec(11, 14)
$
$#sym.RR^2 arrow cal(R) cal(C) cal(Z)$ |
|
https://github.com/DashieTM/ost-5semester | https://raw.githubusercontent.com/DashieTM/ost-5semester/main/blockchain/weeks/week7.typ | typst | #import "../../utils.typ": *
#section("Wallets")
- Hot wallets
- connected to the internet
- more features -> easy sending and recieving of tokens
- cold wallets
- only a key
- does not offer any features ootb
#align(
center,
[#image("../../Screenshots/2023_10_30_02_24_23.png", width: 30%)],
)
#subsection("Hierarchical Deterministic (HD) Wallets")
- most cryptowallets are HD wallets
- based on the BIP32/BIP44 protocol
- BIP32 -> Bitcoin Improvoement Proposal 32:\
introduces the concept of hierarchical deterministic wallets
- BIP 44: adds structure for multiple coin types and accounts
- allows creation of *derived keys from the master seed*
- features
- generation of multiple cryptocurrency addresses
- simplifies management and backup
- each transaction could use a unique address for enhanced privacy -> technically
no tracking
- Master Seed is based on the BIP39 mnemonic phrase
- seed phrase: series of words from a defined list
- essential for wallets backup and restoration
- typically 12 or 24 words
- encoding of 128bit or 256bit
- user experience: many users forget phrase -> they think it is not important ->
wallet lost
#subsubsection("BIP39")
- 256bit encoding, 8bit checksum
- seed extension
- 13th/25th word
- from mnemonic phrase to seed
- PBKDF2 function with mnemonic sentence as password, string "mnemonic" +
passphrase as salt
- example: salt = PBKDF2("wisdom tortiose relief", "mnemonicyourpassphrase",
2048);
- seed can be used for BIP-32
#align(
center,
[#image("../../Screenshots/2023_10_30_02_32_01.png", width: 100%)],
)
#subsubsection("ECC")
#align(
center,
[#image("../../Screenshots/2023_10_30_02_37_40.png", width: 30%)],
)
|
|
https://github.com/Myriad-Dreamin/typst.ts | https://raw.githubusercontent.com/Myriad-Dreamin/typst.ts/main/fuzzers/corpora/meta/heading_02.typ | typst | Apache License 2.0 |
#import "/contrib/templates/std-tests/preset.typ": *
#show: test-page
// Blocks can continue the heading.
= #[This
is
multiline.
]
= This
is not.
|
https://github.com/teamdailypractice/pdf-tools | https://raw.githubusercontent.com/teamdailypractice/pdf-tools/main/typst-pdf/thirukkural-toc/001-toc.typ | typst | #set page("a4")
#set text(
font: "TSCu_SaiIndira",
size: 24pt
)
#set align(center)
பொருளடக்கம்
\
\
#set text(
font: "TSCu_SaiIndira",
size: 20pt
)
#set align(left)
அறத்துப்பால்
#set text(
font: "TSCu_SaiIndira",
size: 16pt
)
#table(
stroke: none,
columns: (1cm, auto),
[1.], [பாயிரவியல்],
[2.], [இல்லறவியல்],
[3.], [துறவறவியல்],
[4.], [ஊழியல்]
)
#set text(
font: "TSCu_SaiIndira",
size: 20pt
)
#set align(left)
பொருட்பால்
#set text(
font: "TSCu_SaiIndira",
size: 16pt
)
#table(
stroke: none,
columns: (1cm, auto),
[1.], [அரசியல்],
[2.], [அமைச்சியல்],
[3.], [அரணியல்],
[4.], [கூழியல்],
[5.], [படையியல்],
[6.], [நட்பியல்],
[7.], [குடியியல்]
)
#set text(
font: "TSCu_SaiIndira",
size: 20pt
)
#set align(left)
இன்பத்துப்பால்
#set text(
font: "TSCu_SaiIndira",
size: 16pt
)
#table(
stroke: none,
columns: (1cm, auto),
[1.], [களவியல்],
[2.], [கற்பியல்]
)
|
|
https://github.com/medraedboukari/Web-Application-with-Genie | https://raw.githubusercontent.com/medraedboukari/Web-Application-with-Genie/main/lab3.typ | typst |
#import "@preview/charged-ieee:0.1.0": ieee
#set page(footer: context [
*ISET BIZERTE*
#h(1fr)
#counter(page).display(
"1/1",
both: true,
)
])
#show: ieee.with(
title: [Lab #3: Web Application with Genie],
authors: (
(
name: "<NAME>",
department: [Dept. of EE (AII21)],
organization: [ISET Bizerte --- Tunisia],
email: "<EMAIL>"
),
(
name: "<NAME>",
department: [Dept. of EE (AII21)],
organization: [ISET Bizerte --- Tunisia],
email: "<EMAIL>"
),
),
index-terms: ("Scientific writing", "Typesetting", "Document creation", "Syntax"),
bibliography: bibliography("refs.bib"),
)
= Introduction
In this Lab we used Genie Framework in julia , Genie is a full-stack MVC web framework that provides a streamlined and efficient workflow for developing modern web applications. It builds on Julia's strengths (high-level, high-performance, dynamic, JIT compiled), exposing a rich API and a powerful toolset for productive web development.
= Exercices
- In the first task we add extra slide that modify the
behaviour of the sine wave graph by adding : *_Phase_ ranging between $-pi$ and $pi$, changes by a step of $pi/100$*
#figure(
image("julia phase.png",width: 100%),
caption: [
Adding the phase function in julia
],
)
#figure(
image("html.png",width: 90%),
caption: [
Adding the phase function in HTML
],
)
- Then in the second task we add the offset function : *Offset varies from $-0.5$ to $1$, by a step of $0.1$*
#figure(
image("julia offset.png",width: 90%),
caption: [
Adding the offset function in Julia
],
)
#figure(
image("html offset.png", width: 90%),
caption: [
Adding the offset function in HTML
],
)
- After that we open the Julia REPL in order to open the web app
#figure(
image("terminal.png", width: 90%),
caption: [
Julia REPL
],
)
- Now , we have the sine wave and we can change every parameter thanks to the graphic interface
#figure(
image("Sinwave.png",width: 90%),
caption: [
Sine Wave
],
)
= Conclusion
In this Lab we have the ability to use Genie Lab in julia to design a mathematical web app
|
|
https://github.com/typst/packages | https://raw.githubusercontent.com/typst/packages/main/packages/preview/unichar/0.1.0/ucd/block-11D60.typ | typst | Apache License 2.0 | #let data = (
("GUNJALA GONDI LETTER A", "Lo", 0),
("GUNJALA GONDI LETTER AA", "Lo", 0),
("GUNJALA GONDI LETTER I", "Lo", 0),
("GUNJALA GONDI LETTER II", "Lo", 0),
("GUNJALA GONDI LETTER U", "Lo", 0),
("GUNJALA GONDI LETTER UU", "Lo", 0),
(),
("GUNJALA GONDI LETTER EE", "Lo", 0),
("GUNJALA GONDI LETTER AI", "Lo", 0),
(),
("GUNJALA GONDI LETTER OO", "Lo", 0),
("GUNJALA GONDI LETTER AU", "Lo", 0),
("GUNJALA GONDI LETTER YA", "Lo", 0),
("GUNJALA GONDI LETTER VA", "Lo", 0),
("GUNJALA GONDI LETTER BA", "Lo", 0),
("GUNJALA GONDI LETTER BHA", "Lo", 0),
("GUNJALA GONDI LETTER MA", "Lo", 0),
("GUNJALA GONDI LETTER KA", "Lo", 0),
("GUNJALA GONDI LETTER KHA", "Lo", 0),
("GUNJALA GONDI LETTER TA", "Lo", 0),
("GUNJALA GONDI LETTER THA", "Lo", 0),
("GUNJALA GONDI LETTER LA", "Lo", 0),
("GUNJALA GONDI LETTER GA", "Lo", 0),
("GUNJALA GONDI LETTER GHA", "Lo", 0),
("GUNJALA GONDI LETTER DA", "Lo", 0),
("GUNJALA GONDI LETTER DHA", "Lo", 0),
("GUNJALA GONDI LETTER NA", "Lo", 0),
("GUNJALA GONDI LETTER CA", "Lo", 0),
("GUNJALA GONDI LETTER CHA", "Lo", 0),
("GUNJALA GONDI LETTER TTA", "Lo", 0),
("GUNJALA GONDI LETTER TTHA", "Lo", 0),
("GUNJALA GONDI LETTER LLA", "Lo", 0),
("GUNJALA GONDI LETTER JA", "Lo", 0),
("GUNJALA GONDI LETTER JHA", "Lo", 0),
("GUNJALA GONDI LETTER DDA", "Lo", 0),
("GUNJALA GONDI LETTER DDHA", "Lo", 0),
("GUNJALA GONDI LETTER NGA", "Lo", 0),
("GUNJALA GONDI LETTER PA", "Lo", 0),
("GUNJALA GONDI LETTER PHA", "Lo", 0),
("GUNJALA GONDI LETTER HA", "Lo", 0),
("GUNJALA GONDI LETTER RA", "Lo", 0),
("GUNJALA GONDI LETTER SA", "Lo", 0),
("GUNJALA GONDI VOWEL SIGN AA", "Mc", 0),
("GUNJALA GONDI VOWEL SIGN I", "Mc", 0),
("GUNJALA GONDI VOWEL SIGN II", "Mc", 0),
("GUNJALA GONDI VOWEL SIGN U", "Mc", 0),
("GUNJALA GONDI VOWEL SIGN UU", "Mc", 0),
(),
("GUNJALA GONDI VOWEL SIGN EE", "Mn", 0),
("GUNJALA GONDI VOWEL SIGN AI", "Mn", 0),
(),
("GUNJALA GONDI VOWEL SIGN OO", "Mc", 0),
("GUNJALA GONDI VOWEL SIGN AU", "Mc", 0),
("GUNJALA GONDI SIGN ANUSVARA", "Mn", 0),
("GUNJALA GONDI SIGN VISARGA", "Mc", 0),
("GUNJALA GONDI VIRAMA", "Mn", 9),
("GUNJALA GONDI OM", "Lo", 0),
(),
(),
(),
(),
(),
(),
(),
("GUNJALA GONDI DIGIT ZERO", "Nd", 0),
("GUNJALA GONDI DIGIT ONE", "Nd", 0),
("GUNJALA GONDI DIGIT TWO", "Nd", 0),
("GUNJALA GONDI DIGIT THREE", "Nd", 0),
("GUNJALA GONDI DIGIT FOUR", "Nd", 0),
("GUNJALA GONDI DIGIT FIVE", "Nd", 0),
("GUNJALA GONDI DIGIT SIX", "Nd", 0),
("GUNJALA GONDI DIGIT SEVEN", "Nd", 0),
("GUNJALA GONDI DIGIT EIGHT", "Nd", 0),
("GUNJALA GONDI DIGIT NINE", "Nd", 0),
)
|
https://github.com/jasmerri/tsumo | https://raw.githubusercontent.com/jasmerri/tsumo/main/README.md | markdown | MIT License | # tsumo
tsumo is a Typst library for typesetting Mahjong tiles.
## Usage
tsumo provides a convenient interface for using MPSZ algebreic notation, a common notation used for describing Riichi Mahjong hands.
It supports the same notational extensions as the `mahjong` package for LaTeX.
```
#import "@local/tsumo:0.1.0"
#tsumo.mahjong("123s 55\"0m X22Xp")
```
|
https://github.com/veilkev/jvvslead | https://raw.githubusercontent.com/veilkev/jvvslead/Typst/files/2_resets.typ | typst | #import "../sys/packages.typ": *
#import "../sys/sys.typ": *
#import "../sys/header.typ": *
#v(150pt, weak: false)
= Main Menu
#set text(10pt)
#important[
The main menu has a 3 by 3 grid (12 options) which plays a vital
part in most front-end lead duties. \
It is extremely crucial that one learns to access this screens.
]
#subhead(head: true, "Main Menu")
#badge-green("From POS")
#menu("MANAGER", "3 (Cash Controller Functions)", "F2", "F2", "CLEAR")
#pin(3)
#pinit-point-from(3, start-dx: 200pt, end-dx: 230pt, start-dy: 20pt, end-dy: 0pt,
offset-dx: 160pt, offset-dy: 20pt)[
*F2* until you see a *flicker* of the screen
]
#set text(8pt)
#move(dx: 370pt, dy: -75pt,
box(inset: 20pt, height: 120pt,
stickybox(
rotation: 20deg,
width: 4cm
)[
You may also press *F3* after
reaching the Cash Control Menu.
However, you will need to sign-in again,
so this is _not_ recommended.
]
))
/* offsets sticky note height */
#v(-100pt)
/* start-dx -> start at (right)
end-dx -> start at (down)
start-dy -> rotate arrow (counter-cw)
end-dy -> rotate arrow (cw)
offset-dx: right (text)
offset-dy: down (text)
*/
#set text(12pt)
= Resets
#set text(10pt)
#note[
Soft boots resets the software components of all devices while the hard boot resets the host (modem)
]
#box(height: 100pt,
columns(2, gutter: 11pt)[
#subhead(head: true, "Soft Boot")
#badge-green("From Main Menu"),
#menu("0", "1", "ENTER")
#subhead(head: true, "Terminal Monitoring")
#badge-green("From Main Menu")
#menu("0", "2", "ENTER")
#colbreak()
#subhead(head: true, "Hard Boot") \
#menu("Shutdown the Host", "or", "Unplug the Cord" )
#colbreak()
])
#v(10pt, weak: false)
|
|
https://github.com/matteopolak/resume | https://raw.githubusercontent.com/matteopolak/resume/main/resume.typ | typst | MIT License | #import "utils.typ": *
#let config = toml("config.toml")
// document setup
#set page(paper: "us-letter", margin: (x: 0.3in, top: 0.3in, bottom: 0.15in))
#set document(
title: config.at("title", default: config.name + "'s Resume"),
author: config.at("author", default: config.name),
keywords: "resume, curriculum vitae, cv, software engineer, developer, programmer"
)
// typography setup
#set text(font: "open sans", weight: "regular", size: 10.5pt, hyphenate: true)
#set par(leading: 0.5em)
#set list(indent: 1em, spacing: 0.65em, tight: false)
// underline all links
#show link: underline
// use better spacing around lines
#show line: it => [
#space()
#it
#space()
]
#let name = text(
size: 35pt,
font: "jersey 10",
weight: "bold",
config.name
)
#let about = [
#config.phone • #config.location \
#link("mailto:" + config.email, config.email) •
#link("https://" + config.website, config.website) •
#link("https://github.com/" + config.github, "github/" + config.github) •
#link("https://linkedin.com/in/" + config.linkedin, "linkedin/" + config.linkedin)
]
#header(text(fill: white, [
#name
#space(h: 1em)
#about
#space(h: 1.5em)
#text(fill: rgb(200, 200, 200), [3#super[rd] year Computer Science student looking for a *January 2025*, 4 or 8-month position])
]))
#space(h: 0.3in)
#section(title: "Education")
*Honours Bachelor of Computer Science*, University of Ottawa, 9.55/10 CGPA
#h(1fr)
_September 2022 --- December 2026_
#section(title: "Technical Skills")
#text(
size: 10pt,
[
*Languages/Libraries*: Rust, TypeScript, Go, Python, C++, C, C\#, Groovy, JavaScript,
Svelte, Vue, React, SvelteKit, Nuxt, Next.js, Flutter, Express.js, Django, Flask, OpenAPI,
Swagger, Protobuf, PyTorch
*Tools*: PostgreSQL, MySQL, MongoDB, Redis, InfluxDB, TimescaleDB,
Gerrit, Skia, Unity, Git, Ansible, AWS,
OpenStack, Docker, Prometheus, Grafana, OpenTelemetry, Telegraf
]
)
#section(title: "Professional Experience")
#job(
title: "Software Engineer",
company: "Ciena",
location: "Ottawa, ON (Remote)",
start: datetime(year: 2023, month: 5, day: 1),
achievements: (
[Created a code ownership and test management solution with *Express.js*, *MongoDB*, and *InfluxDB* (for logging) that improved workflow efficiency and test coverage by 80%, among other improvements.],
[Released a full-stack computing resource booking platform with *Nuxt*, *PostgreSQL*, and *tRPC* that reduced order wait times by 99%+ (from days to minutes).],
[Designed, implemented, tested, deployed, and maintained a *Rust* microservice to categorize errors and assign tickets, improving MTTR (Mean time to repair) by 30%.],
[Migrated a legacy codebase to Python 3.9, fixing numerous bugs and reducing maintenance time by 50%.],
)
)
#job(
title: "STEM Instructor",
company: "RoboEDU",
location: "North York, ON",
start: datetime(year: 2022, month: 6, day: 1),
end: datetime(year: 2022, month: 08, day: 1),
achievements: (
[Developed a curriculum for a *Python* programming course for 100+ students aged 8-12.],
[Instructed students in Python programming, improving their problem-solving skills and computational thinking.],
)
)
#section(title: "Projects")
#project(
title: "3D Game Engine",
github: "matteopolak/ira",
tags: ("Rust", "WGSL", "wgpu", "TCP"),
achievements: (
[Developed a *3D game engine* with a custom rendering engine, supporting 10,000,000+ vertices at 60 FPS.],
[Implemented a lock-free communication layer with *TCP* with a throughput of 1.5 GiB/s.],
[Integrated a physics engine to simulate realistic interactions between 100,000+ objects in real time.],
)
)
#project(
title: "Recipe-sharing Platform",
github: "matteopolak/crave",
tags: ("Svelte", "TypeScript", "PostgreSQL", "tRPC", "Drizzle", "PyTorch"),
achievements: (
[Launched a *recipe-sharing* platform with 100+ users that creates personalized recommendations.],
[Integrated a text embedding model with *PyTorch* and *Flask* to vectorize and rank 100,000 recipes.],
[Designed a user-friendly interface with *DaisyUI* and *TailwindCSS*, improving CTR by 40%.],
)
)
#project(
title: "Image-to-ingredients AI",
github: "matteopolak/grill",
tags: ("PyTorch", "Data Cleaning", "Fine-tuning", "EfficientNet"),
achievements: (
[Trained a *PyTorch* model to predict ingredients from images with 90%+ accuracy.],
[Cleaned and preprocessed a dataset of 1,000,000 images and 15,000 ingredients with *Pandas* (then *Polars*).],
[Fine-tuned an *EfficientNet* model to achieve a 30% improvement in accuracy.],
)
)
#project(
title: "Programming Language",
github: "matteopolak/quasi",
tags: ("Rust", "WebAssembly"),
achievements: (
[Developed a *programming language* with a custom lexer, parser, and interpreter in *Rust*.],
[Compiled the language to *WebAssembly* and integrated it into an interactive web-based layout.],
[Implemented clean error reporting and helpful diagnostics, improving developer experience significantly.],
)
)
#project(
title: "HTTP Client & Server",
github: "matteopolak/basket",
tags: ("Rust", "HTTP/1.1"),
achievements: (
[Created an *HTTP client* and *server* with a custom parser and serializer in *Rust*.],
[Implemented JSON and XML serialization and deserialization, supporting 100,000+ requests per second.],
[Optimized the developer experience with a clean layout and easy configuration options.],
)
)
#project(
title: "Bitcoin Miner",
github: "matteopolak/miner",
tags: ("Rust", "SHA-256", "Proof of Work", "wgpu"),
achievements: (
[Developed a *Bitcoin miner* with a custom SHA-256 implementation in *Rust*.],
[Implemented a proof-of-work algorithm to mine Bitcoin blocks with a hash rate of 1.5 MH/s.],
[Optimized the mining process with a *GPU shader* and parallel processing, achieving a 30% speedup.],
)
)
#project(
title: "Discord Jukebox",
github: "matteopolak/jukebox",
tags: ("TypeScript", "Discord.js", "YouTube API", "Spotify API", "Apple Music API"),
achievements: (
[Created a *Discord bot* that plays music from YouTube, Spotify, and Apple Music in voice channels.],
[Implemented a novel interface with buttons and dropdowns to control playback and audio filtering.],
[Integrated YouTube and Spotify recommendations to suggest songs based on user preferences.],
)
)
#project(
title: "Statistics Service",
github: "statpixel-rs/statpixel",
tags: ("Rust", "PostgreSQL", "Redis", "wgpu"),
achievements: (
[Developed a *statistics service* for Hypixel in *Rust*, used by 1,000+ players daily.],
[Implemented a GPU rendering engine with *wgpu* to generate charts and 3D models of players in real time.],
[Optimized the service with *Redis* as a cache layer, supporting 10,000+ requests per second.],
)
)
#project(
title: "Collaborative Art Board",
github: "matteopolak/noteboard",
tags: ("Svelte", "WebSockets", "Canvas API"),
achievements: (
[Launched a *collaborative art board* with real-time drawing and chat functionality for 100+ users.],
[Implemented a WebSocket server to synchronize drawing events between clients with sub-millisecond latency.],
[Designed a user-friendly interface with *Svelte* and *TailwindCSS*, improving user engagement by 50%.],
)
)
#section(title: "Achievements")
- Open Source Contributor to #link("https://github.com/sveltejs/svelte", "Svelte"), #link("https://github.com/sveltejs/kit", "SvelteKit"), #link("https://github.com/lucia-auth/lucia", "Lucia"), #link("https://github.com/SoftbearStudios/bitcode", "Bitcode"), #link("https://github.com/plotters-rs/plotters", "Plotters"), #link("https://github.com/oven-sh/bun", "Bun")
- 2024 #link("https://hack-the-hill-ii.devpost.com", "Hack the Hill II") Hackathon, 1st
- 2023 #link("https://hack-the-hill.devpost.com", "Hack the Hill") Hackathon,
1st, Best Developer Experience, Best Cybersecurity Project
- 2023 #link("https://all-in-hackathon.devpost.com", "MLH x {all in}") Hackathon, 1st
- 2023 #link("https://maphacks-2.devpost.com", "MapHacks 2") Hackathon,
1st, Best Sustainable Travel Hack
|
https://github.com/DrakeAxelrod/cvss.typ | https://raw.githubusercontent.com/DrakeAxelrod/cvss.typ/main/cvss/0.1.0/src/cvss.typ | typst | MIT License | #let _cvss = plugin("cvss.wasm")
#let score(vec) = float(str(_cvss.score(bytes(vec))))
#let NONE = "None"
#let LOW = "Low"
#let MEDIUM = "Medium"
#let HIGH = "High"
#let CRITICAL = "Critical"
// #let test-string = "CVSS:4.0/AV:A/AC:H/AT:P/PR:L/UI:P/VC:L/VI:L/VA:L/SC:L/SI:L/SA:L/E:A/CR:L/IR:L/AR:L/MAV:N/MAC:L/MAT:N/MPR:N/MUI:N/MVC:H/MVI:H/MVA:H/MSC:L/MSI:L/MSA:L/S:N/AU:N/R:A/V:D/RE:L/U:Clear"
#let re = regex("([A-Za-z]{1,3}):([A-Za-z]{1,11})")
#let verify(vec) = {
if type(vec) != "string" {
panic("Expected a string")
} else {
return vec.starts-with(regex("CVSS:([0-9]+\\.[0-9]+)")) and vec.contains(re)
}
}
#let metrics(s) = {
let result = s.matches(re).fold((:), (acc, it) => {
let (k, v) = it.captures
acc + ((k): v)
})
if result.pairs().len() < 1 {
panic("Failed to parse CVSS metrics check the input string")
} else {
// get version
let version = s.match(regex("CVSS:([0-9]+\\.[0-9]+)"))
if type(version) == "dictionary" {
result = result + (("version"): version.captures.at(0))
}
result
}
}
#let score(vec) = {
let result = str(_cvss.score(bytes(vec)))
.match(regex("([0-9]+\\.[0-9]+)"))
if type(result) == "dictionary" {
float(result.captures.at(0))
} else {
panic("Failed to parse CVSS score check the input string")
}
}
#let severity(vec) = {
let result = str(_cvss.severity(bytes(vec)))
.match(regex("(None|Low|Medium|High|Critical)"))
if type(result) == "dictionary" {
result.captures.at(0)
} else {
panic("Failed to parse CVSS severity check the input string")
}
}
#let parse(vec) = {
let m = metrics(vec)
let s = score(vec)
let sev = severity(vec)
(
metrics: m,
score: s,
severity: sev
)
}
|
https://github.com/SWATEngineering/Docs | https://raw.githubusercontent.com/SWATEngineering/Docs/main/src/2_RTB/VerbaliEsterni/VerbaleEsterno_231221/content.typ | typst | MIT License | #import "meta.typ": inizio_incontro, fine_incontro, luogo_incontro, company
#import "functions.typ": glossary, team
#let participants = csv("participants.csv")
#let participants_company = csv("participants_company.csv")
= Partecipanti
/ Inizio incontro: #inizio_incontro
/ Fine incontro: #fine_incontro
/ Luogo incontro: #luogo_incontro
== Partecipanti di #team
#table(
columns: (3fr, 1fr),
[*Nome*], [*Durata presenza*],
..participants.flatten()
)
== Partecipanti di #emph[#company]
#for member in participants_company.flatten() [
- #member
]
= Sintesi Elaborazione Incontro
/*************************************/
/* INSERIRE SOTTO IL CONTENUTO */
/*************************************/
== Migliorie apportate al PoC
L'incontro si è aperto con la valutazione delle modifiche apportate al PoC; in particolare, il team ha dimostrato l'utilizzo della funzione aggregata "movingAverage" per ottimizzare le query (questo per evitare di far fare operazioni di trasformazioni sui dati a Grafana, ossia al visualization layer), l'aggiunta dei sensori di pioggia e l'aggiunta di descrizioni ai pannelli della dashboard per renderla più facilmente comprensibile. La Proponente ha valutato positivamente le modifiche dimostrate e ha consigliato anche l'implementazione di alcune funzionalità aggiuntive:
- Il filtraggio dei dati: sfrutta le "Grafana variables";
- Tabelle contenenti i dati grezzi dei sensori: contrariamente ai dati aggregati che vengono sfruttati per fare analisi di tipo statistico di business, i dati grezzi vengono utilizzati nel caso in cui si abbia bisogno di visualizzare un singolo evento di interesse; ad esempio, nel caso in cui si visualizzi un allarme all'interno della dashboard, l'anomalia corrispondente sarebbe facilmente rintracciabile all'interno di una delle tabelle contenente i dati grezzi;
- Aggiunta di altre tipologie di sensori per incrementare l'impatto visivo della dashboard.
== Analisi dei Requisiti
Il team ha voluto esprimere un dubbio riguardo all'inclusione di una stima dell'ordine di grandezza dei dati in grado di essere gestiti dal sistema all'interno dell'_Analisi dei Requisiti v1.0_; in risposta, la Proponente ha suggerito di considerarlo come un requisito di performance e di impostarne il valore in seguito ad alcuni test volti a determinare la portata massima dei dati che il sistema è in grado di gestire senza subire rallentamenti o impedimenti visibili (i test dovrebbero durare almeno qualche ora). La Proponente prevede che il sistema sarà in grado di gestire intorno ai 70-80 dati generati al secondo o anche di più.
== Consigli per la presentazione RTB
La Proponente ha infine fornito alcuni consigli per affrontare al meglio la prima revisione RTB:
- Rendere la dashboard più dinamica restringendo l'intervallo temporale di visualizzazione dei dati: in particolare, è stato suggerito di impostare un intervallo di tempo ridotto all'inizio della presentazione per mostrare l'andamento dei dati in ingresso e di allargarlo in seguito;
- Incorporare all'interno della dimostrazione del PoC tutte le componenti dell'architettura: i generatori di dati che pubblicano gli eventi, il flusso di dati che attraversa Kafka, i dati in ingresso in ClickHouse in formato pseudo-tabellare e infine la loro visualizzazione finale in Grafana;
- Motivare la scelta di utilizzare Grafana per un progetto che prevede event-driven visualization: Grafana si basa su un refresh molto rapido dei singoli grafici della dashboard (anche ogni 0.5 secondi), mentre altri strumenti come PowerBI o SuperSet sono impostati su un refresh meno frequente (ogni 10-30 secondi) poiché si concentrano maggiormente sulle aggregazioni e sull'analisi dei dati rispetto alla loro visualizzazione in real time;
- Motivare la scelta di utilizzare ClickHouse per l'elaborazione di dati di tipo time series: nonostante ClickHouse sia un motore OLAP, esso viene spesso utilizzato anche per gestire dati in formato time series in quanto si prestano bene ad operazioni su grandi moli di dati in continuo arrivo da fonti come Kafka e simili. |
https://github.com/soul667/typst | https://raw.githubusercontent.com/soul667/typst/main/PPT/MATLAB/touying/utils/components.typ | typst | #let cell = block.with(width: 100%, height: 100%, above: 0pt, below: 0pt, breakable: false) |
|
https://github.com/Shuenhoy/modern-zju-thesis | https://raw.githubusercontent.com/Shuenhoy/modern-zju-thesis/master/utils/part.typ | typst | MIT License | #import "./fonts.typ": 字号, 字体
#import "./twoside.typ": *
#let part = figure.with(
kind: "part",
// same as heading
numbering: "第一部分",
// this cannot use auto to translate this automatically as headings can, auto also means something different for figures
supplement: "Part",
// empty caption required to be included in outline
caption: []
)
#let part-refs = state("part-refs", ())
#let show-part-ref(s) = {
show ref: it => {
if it.element != none {
// Citing a document element like a figure, not a bib key
// So don't update refs
it
return
}
part-refs.update(old => {
if it.target not in old {
old.push(it.target)
}
old
})
//I think the following is how the reference index should be obtained correctly.
let get_ref_id(loc) = {
//str(part-refs.at(loc).len())
str(part-refs.at(loc).position(x => (x == it.target)) + 1)
}
locate(loc => {
"[" + get_ref_id(loc) + "]"
})
}
s
}
#let new-part-ref() = {
part-ref.update()
}
#let show-part(s) = {
show: show-part-ref
// emulate element function by creating show rule
show figure.where(kind: "part"): it => {
twoside-pagebreak
counter(heading).update(0)
if it.numbering != none {
[
#v(0.1fr)
#set align(center)
#set text(font: 字体.黑体, size: 48pt)
#strong(it.counter.display(it.numbering))<mzt:no-header-footer>
#set text(font: 字体.仿宋, size: 字号.小初)
#strong(it.body)
#v(0.2fr)
]
}
twoside-emptypage
counter(page).update(0)
}
s
}
#let show-outline-with-part(s) = {
show outline.entry: it => {
if it.element.func() == figure {
// we're configuring chapter printing here, effectively recreating the default show impl with slight tweaks
let res = link(it.element.location(),
// we must recreate part of the show rule from above once again
if it.element.numbering != none {
numbering(it.element.numbering, ..it.element.counter.at(it.element.location()))
} + [ ] + it.element.body
)
text(size: 字号.三号, weight: "bold", res)
} else {
// we're doing indenting here
h(1.5em * (it.level - 1)) + it
}
}
s
}
#let part-bib = {
locate(loc => {
//https://github.com/typst/typst/issues/1097
let ref-counter = counter("part-refs")
ref-counter.update(1)
show regex("^\[(\d+)\]\s"): it => [
[#ref-counter.display()]
]
for target in part-refs.at(loc) {
block(cite(target, form: "full"))
ref-counter.step()
}
part-refs.update(())
})
}
#let part-and-headings = figure.where(kind: "part", outlined: true).or(heading.where(outlined: true)) |
https://github.com/fabriceHategekimana/master | https://raw.githubusercontent.com/fabriceHategekimana/master/main/2_Etat_de_l_art/R.typ | typst | #import "../src/module.typ" : *
#pagebreak()
== Le système de type de R
Avant de nous lancer sur la construction de notre solution, il est important de voir le fonctionnement du langage R afin de voir les caractéristiques qui en font un bon candidat en tant que langage de référence.
En R, tout est représenté sous forme de vecteurs, de liste ou de fonction. Même les scalaires sont des vecteurs. Un scalaire est simplement un vecteur de longueur 1, ce qui signifie que toute valeur en R est intrinsèquement un vecteur. Cette uniformité simplifie la manipulation des données, car les mêmes opérations peuvent être appliquées à des valeurs simples ou à des ensembles de valeurs sans distinction.
#Exemple()[Les vecteurs en R
```R
# créer un vecteur
v1 <- c(1, 2, 3, 4) # donne [1, 2, 3, 4]
# La fonction 'c()' concatènes des vecteurs
v2 <- c(c(1, 2), c(3, 4)) # donne [1, 2, 3, 4]
# Définir une valeur crée automatiquement un vecteur
v3 <- 2 # donne [2]
```
]
De plus, les structures de données plus complexes, comme les listes, sont également basées sur des vecteurs. Les listes en R peuvent contenir des vecteurs de différentes longueurs et de différents types, offrant une grande flexibilité dans la gestion et l'organisation des données. C'est pourquoi il existe de nombreuses fonctions par défaut en R qui sont conçues pour opérer directement sur des vecteurs ou des listes, rendant le langage particulièrement puissant et efficace pour les analyses statistiques et les opérations de données.
#Exemple()[Les listes en R
```R
# Création d'une liste: utilise le mot-clé "list"
nombres <- list(1, 2, 3, 4, 5)
noms <- list("Alice", "Bob", "Charlie")
# Accès aux éléments d'une liste
premier_nombre <- nombres[[1]] # Résultat : 1
deuxieme_nom <- noms[[2]] # Résultat : "Bob"
# Ajouter des éléments à une liste
nombres <- append(nombres, 6) # La liste devient : list(1, 2, 3, 4, 5, 6)
noms <- append(noms, "David") # La liste devient : list("Alice", "Bob", "Charlie", "David")
# Supprimer des éléments d'une liste
nombres <- nombres[-which(nombres == 3)] # La liste devient : list(1, 2, 4, 5, 6)
dernier_nombre <- tail(nombres, n = 1) # Dernier élément : 6
nombres <- nombres[-length(nombres)] # Retirer le dernier élément, la liste devient : list(1, 2, 4, 5)
```
]
Dans le langage R, tout peut avoir des attributs. Les attributs sont des métadonnées associées à un objet R. Ils fournissent des informations supplémentaires sur l'objet, sa structure, ou son comportement. Les vecteurs et les listes peuvent ainsi contenir des informations supplémentaires qui peuvent aider à changer le comportement du code s'il a été prévu pour.
#Exemple()[Les attributs en R
```R
# Créer un vecteur
vecteur <- c(1, 2, 3)
# Afficher les attributs du vecteur
attributes(vecteur)
# Accéder à l'attribut "noms" (qui n'existe pas par défaut)
attr(vecteur, "noms")
# Ajouter un attribut "noms" au vecteur
noms <- c("un", "deux", "trois")
attr(vecteur, "noms") <- noms
# Afficher l'attribut "noms" après l'avoir ajouté
attr(vecteur, "noms")
```
]
Ces attributs sont des métadonnées qui peuvent être changées durant le temps d'exécution. Elles peuvent aussi être appliquées aux fonctions. Les classes ne sont en fait que des listes qui ont des attributs spécifiques. Ces attributs peuvent être utilisés lorsque les structures sont passées en tant que éléments de fonction, l'expédition de la bonne fonction à appeler se fait de façon dynamique (dynamic dispatch #footnote[Le dynamic dispatch, ou la répartition dynamique, est un concept clé en programmation orientée objet qui concerne la façon dont les méthodes sont sélectionnées et exécutées en fonction du type réel d'un objet lors de l'exécution du programme. En d'autres termes, cela permet à un langage de déterminer dynamiquement quelle méthode appeler en fonction du type de l'objet sur lequel la méthode est invoquée.]). C'est ce qu'utilise actuellement le système S3 ou S4 de R.
Les arrays dans R sont la structure de données la plus proche de ce qu'est un tenseur. En effet, c'est une représentation de tenseur. En réalité, les arrays sont des vecteurs avec un attribut spécial décrivant la dimension du dit tenseur. Mais la structure sous-jacente reste le vecteurs.
#Exemple()[Les tableaux en R
```r
# Création d'un array 2x3
array_2x3 <- array(1:6, dim = c(2, 3))
print(array_2x3)
# Création d'un array 3x3x2
array_3x3x2 <- array(1:18, dim = c(3, 3, 2))
print(array_3x3x2)
```
]
Le fer de lance de R se trouve dans les dataframes qui sont une implémentation presque entièrement intégré dans le langage. Les dataframes sont des structures de données fondamentales en R, utilisées pour organiser des données tabulaires sous forme de lignes et de colonnes. Chaque colonne représente une variable distincte et chaque ligne correspond à une observation ou un enregistrement unique. Les dataframes sont essentiels en R pour plusieurs raisons principales. Tout d'abord, ils permettent de manipuler et d'analyser facilement des ensembles de données complexes et hétérogènes, provenant de diverses sources telles que des fichiers CSV, des bases de données ou des résultats d'expérimentations scientifiques. De plus, R offre un large éventail de fonctions intégrées et de packages spécialisés dédiés à la manipulation, à la transformation et à l'analyse de dataframes, facilitant ainsi des tâches telles que le filtrage, le tri, le calcul de statistiques descriptives et la création de graphiques. Enfin, les dataframes jouent un rôle crucial dans les analyses statistiques et la modélisation de données, permettant aux chercheurs, aux statisticiens et aux scientifiques des données d'effectuer des manipulations complexes tout en maintenant une organisation structurée et facilement interprétable des données. En réalité, un dataframe est une liste de vecteurs par définition.
#Exemple()[Les dataframes en R
```R
# Créer des vecteurs pour chaque variable
nom <- c("Alice", "Bob", "Charlie", "David")
age <- c(18, 21, 22, 19)
filiere <- c("Informatique", "Mathématiques", "Statistique", "Informatique")
moyenne <- c(16.5, 17.2, 18.1, 15.8)
# Combiner les vecteurs dans un data frame
etudiants <- data.frame(nom, age, filiere, moyenne)
# Afficher le data frame
print(etudiants)
```
]
En R, les fonctions jouent un rôle central et peuvent être définies de manière anonyme, ce qui est un aspect clé de la programmation fonctionnelle. Une fonction anonyme est une fonction sans nom qui est définie à la volée, souvent utilisée comme argument à d'autres fonctions. En R toute fonction est une fonction anonyme.
#Exemple()[Les fonctions anonymes
```R
# Création et utilisation de fonctions anonymes en R
#Définir une fonction anonyme
add_two <- function(x) { x + 2 }
# Utilisation de la fonction
result <- add_two(3)
print(result) # Résultat : 5
#Utiliser des fonctions anonymes avec lapply
nombres <- list(1, 2, 3, 4, 5)
```
]
L'équivalent de la fonction map sont les fonctions apply et lapply. Apply s'applique à des array, mais lapply est plutôt utilisé pour travailler avec des listes.
#Exemple()[Applications sur les listes
```R
# Utiliser une fonction anonyme pour ajouter 2 à chaque élément
result <- lapply(nombres, function(x) { x + 2 })
print(result) # Résultat : list(3, 4, 5, 6, 7)
# Utiliser des fonctions anonymes avec apply
# Créer une matrice
matrice <- matrix(1:9, nrow = 3)
```
]
Nous avons aussi des fonctions comme reduce et filter comme pour un langage de programmation fonctionnel utilisant des fonctions d'ordre supérieur.
#Exemple()[Fonctions reduces et filters
```R
# Utiliser des fonctions anonymes avec Reduce
# Utiliser une fonction anonyme pour calculer la somme cumulative des éléments
result <- Reduce(function(x, y) { x + y }, nombres)
print(result) # Résultat : 15
# Utiliser des fonctions anonymes avec Filter et Find
# Utiliser une fonction anonyme pour filtrer les éléments pairs
result <- Filter(function(x) { x %% 2 == 0 }, nombres)
print(result) # Résultat : list(2, 4)
```
]
Pour le reste les fonctions peuvent directement marcher sur des vecteur à cause de la fonctionnalité de "vectorization" du langage.
<NAME> et al (source: Évaluating the design of the R language) ont donné une évaluation plus formelle du langage R et de sa sémantique.
|
|
https://github.com/VisualFP/docs | https://raw.githubusercontent.com/VisualFP/docs/main/SA/design_concept/content/poc/options_ui_bolero.typ | typst | #import "../../../acronyms.typ": ac
= Bolero
Bolero is an F\# wrapper around Blazor
#footnote("https://dotnet.microsoft.com/en-us/apps/aspnet/web-apps/blazor"),
leveraging different libraries to create web applications. With Blazor, web
applications can run both on the server side through web-sockets or on the
client side through WebAssembly.
While Beloro doesn't implement #ac("FRP"), it has a Model-View-Update
architecture, clearly separating #ac("UI") from business logic in a reactive way.
In addition to defining the web page structure from F\# code, Bolero also offers
the possibility to use #ac("HTML") templates with "holes" as placeholders for page
values, event listeners, etc. @bolero
The clear separation of the #ac("UI") and business logic and the support of the
established .NET platform is a significant advantage for Bolero.
The two downsides are that neither of the authors is familiar with the framework
and that F\# doesn't really fit into a project, that aims to create a Haskell-compatible visual editor.
|
|
https://github.com/tianyaochou/resume | https://raw.githubusercontent.com/tianyaochou/resume/master/main.typ | typst | #import "template.typ": *
#let data = json("resume.json")
#let me = data.at("profile")
#show: resume.with(
name: me.at("name"),
email: me.at("email"),
phone: me.at("telephone"),
github: me.at("github"),
linkedin: me.at("linkedin")
)
#section(icon: "icons/user-solid.svg")[About Me]
#grid(
columns: 2,
gutter: 1em,
image("image.jpeg", height: 8em),
align(horizon)[I am a fast learner with a passion for exploring new technologies and evaluating them in practice. Continuously rethinking about the status quo, I actively seek solutions of improvement with an analytical mindset, and I am ready to tackle unknown technological difficulties with structured approach and deliver results. In addition, I also pay attention to details. Moreover, I am collaborative and a team player, valuing diverse perspectives.]
)
#section(icon: "icons/graduation-cap-solid.svg")[Education]
#let educations = data.at("educations")
#for edu in educations {
education(
institute: edu.at("institute"),
degree: edu.at("program"),
start: edu.at("start"),
end: edu.at("end"),
eval(edu.at("description"), mode: "markup")
)
}
#section(icon: "icons/user-group-solid.svg")[Experiences]
#let experiences = data.at("experiences")
#for exp in experiences {
experience(
role: exp.at("role"),
place: exp.at("organization") + ", " + exp.at("location"),
start: exp.at("start"),
end: exp.at("end"),
eval(exp.at("description"), mode: "markup")
)
}
#section(icon: "icons/screwdriver-wrench-solid.svg")[Skills]
#let skills = data.at("skills")
#strong("Programming Languages") \
Multilingual, able to adapt to any language including C\#, but mainly:
#let pls = skills.at("programming")
#for (level, pls_) in pls {
level + ": "
pls_.join(", ")
linebreak()
}
#strong("Tools and Frameworks") \
#let tools = skills.at("tools")
#tools.join(", ")
#section(icon: "icons/language-solid.svg")[Languages]
English: Fluent(TOEFL 98) \
Chinese: Native \
Danish: Beginner(DU3 Modul 4)
#pagebreak()
#section(icon: "icons/folder-open-solid.svg")[Projects]
#let renderProjects(projects) = {
for p in projects {
if not p.at("hide", default: false) {
project(
name: p.at("name"),
tech: p.at("keywords", default: ""),
url: p.at("url", default: ""),
eval(p.at("description"), mode: "markup")
)
}
}
}
#let projects = data.at("projects")
#let software = projects.at("software")
#renderProjects(software)
#let research = projects.at("research")
#renderProjects(research)
#let hardware = projects.at("hardware")
#renderProjects(hardware)
|
|
https://github.com/Skimmeroni/Appunti | https://raw.githubusercontent.com/Skimmeroni/Appunti/main/C++/Introduzione/Array.typ | typst | Creative Commons Zero v1.0 Universal | #import "@preview/showybox:2.0.1": showybox
Un *array* é una sequenza di dati dello stesso tipo, memorizzati in aree di
memoria contigue chiamate *celle*, utile per memorizzare dati che fra loro
hanno un qualche legame logico. Un array viene dichiarato come una normale
variabile di un certo tipo, ma accodando `[]` al nome. La dimensione di un
array é fissata, direttamente nel codice riportandola fra le parentesi
quadre oppure venendo "dedotta" dal compilatore in base a come l'array
viene inizializzato.
Un array viene inizializzato riportando fra parentesi graffe i valori,
separati da virgole, che verranno assegnati ordinatamente a ciascuna
posizione dell'array. Se vi sono piú valori che posizioni nell'array,
il compilatore restituisce un errore. Non é possibile cambiare i valori
assegnati alle celle di un array usando la medesima sintassi
dell'inizializzazione, ma occorre farlo cella per cella. Riportando
il nome dell'array con N fra le parentesi graffe si ottiene il valore
nella (N - 1)-esima cella dell'array; gli array partono da 0. Il compilatore
non restituisce un messaggio di errore se si cerca di accedere ad una cella
di memoria che supera le dimensioni dell'array.
```
array_type array_name[n] // Size set to n
array_type array_name[n] = {v1, ..., vm} // m can't be greater than n
array_type array_name[] // Size to be determined
array_type array_name[] = {v1, ..., vn} // Size is set to n by the compiler
```
#showybox[
```
char array1[3] // Not initialised
char array2[3] = {'a', 'b', 'c'} // Fully initialised (sizes match)
char array3[3] = {'a'} // Partially initialised (less elements than size)
int array4[] = {1, 2, 3, 4, 5} // Size is set to 5 by the compiler
array2 = {'p', 'q', 'r'} // NOT allowed
array3[0] = 'f'; // Allowed
array3[1] = 'b'; // Allowed
array4[10] = 10; // NOT allowed
char x = array3[0] // Allowed
char x = array2[5] // Allowed, but dangerous
```
]
Un array puó essere costituito a sua volta da array; si parla in questo caso
di *array multidimensionale*. Un array multidimensionale viene dichiarato
come un normale array ma riportando tante parentesi quadre quante sono le
dimensioni; il valore fra le parentesi quadre indica la lunghezza degli
array di tale dimensione. Solamente la prima dimensione di un array
multidimensionale (quella piú a sinistra) puó venire lasciata alla
deduzione del compilatore: le restanti devono per forza essere specificate.
I "sotto-array" di un array multidimensionale sono comunque tutti dello
stesso tipo.
```
// Multidimensional array having n dimensions. First dimensions is long
// a, second is long b, etcetera
array_type array_name[a][b]...[n]
```
#showybox[
```
int array0[5][3];
int array1[2][3] = {{1, 2, 3}, {4, 5, 6}};
int v = array1[0][2]; // First array, third element
int array2[][3] = {{1, 2, 3}, {4, 5, 6}}; // Allowed
int array3[3][] = {{1, 2, 3}, {4, 5, 6}}; // NOT allowed
int array4[][] = {{1, 2, 3}, {4, 5, 6}}; // NOT allowed
```
]
La sintassi degli array é molto simile alla sintassi dei puntatori, perché i
due sono intimamente legati. Infatti, é possibile inizializzare un puntatore
con il nome di un array (fintanto che i tipi sono coerenti); sebbene questo
non sia formalmente corretto, dato che un array _non_ é un puntatore, questo
abuso di notazione é accettato per motivi storici. Un puntatore che assume
come valore un array diventa un puntatore al primo elemento di tale array.
Una volta inizializzato un puntatore con un array, é possibile utilizzarlo
per scorrere lungo l'array in maniera naturale. Un puntatore puó anche essere
inizializzato con un elemento dell'array specifico, e diventa un puntatore
a tale cella di memoria.
#showybox[
```
int array[3] = {-1, -2, -3};
int *p;
p = array; // Allowed, but should be p = &(array[0])
int *q = array++; // Allowed, but should be q = &(array[1])
array++; // NOT allowed
p++; // Allowed, points to array[1]
int w = p[0] // Equals *array[1]
int x = p[1] // Equals *array[2]
```
]
I puntatori possono essere associati anche ad array multidimensionali.
Assegnare un puntatore ad un array multidimensionale corrisponde ad
assegnarlo ad uno dei suoi sottoarray; scorrere con tale puntatore
corrisponde a scorrere di sottoarray in sottoarray.
#showybox[
```
int array[2][3] = {{1, 2, 3}, {4, 5, 6}};
int* q = array; // NOT allowed
int (*p)[3] = array; // Pointer to first array of 3 integers
p++; // Shifts to next 3-dimesional array
(*p)[1] = 10; // array[1][1] = 10
```
]
// Esiste un modo per decifrare i tipi di dato cursati,
// ha probabilmente senso prenderla dal libro
Una *reference* é un tipo di dato simile al puntatore. Una reference
é di fatto un _alias_ per un'altra variabile; ogni volta che viene
fatta una manipolazione sulla reference, tale manipolazione viene
propagata sulla variabile originale. Una reference deve necessariamente
essere inizializzata quando viene dichiarata, pena messaggio di errore
da parte del compilatore, perché una reference non inizializzata non ha
alcun significato. L'inizializzazione deve essere rispetto ad una variabile,
non rispetto ad un valore. Una volta dichiarato ed inizializzato, un reference
non puó venire "sganciato" e riassegnato ad una variabile diversa, nemmeno se
ha lo stesso tipo della precedente. Cosí come i puntatori, le reference sono
di tipo "reference a...".
```
reference_type& reference_name = variable_to_be_referenced
```
#showybox[
```
int x = 10;
int& y = x; // y references x
y++; // de facto x++
int& z; // NOT allowed
int& w = 10; // NOT allowed
```
]
|
https://github.com/gldraphael/typst-resume | https://raw.githubusercontent.com/gldraphael/typst-resume/main/template.typ | typst | #import "style.typ": *
#let resume(
full-name: "",
email: "",
place: "",
links: (),
body
) = {
// Set the document's basic properties.
set document(author: full-name, title: full-name)
set page(paper: "us-letter")
// Set body font family.
set text(font: body-font, lang: "en")
show math.equation: set text(weight: 400)
show heading: set text(font: heading-font)
grid(
columns: (1fr, 1fr, 1fr),
align(left)[
#text(place, font: heading-font)\
#text(email, font: heading-font)
],
align(center)[
#block(text(font: heading-font, weight: 700, 1.75em, full-name))
],
align(right)[
#for l in links { [#text(link(l.link, l.name), font: heading-font) \ ] }
]
)
body
}
#let section(title: "") = {
[
= #text(title, fill: theme-color)
]
}
#let position(
title: "",
company: "",
location: "",
dates: ""
) = {
[
#grid(
columns: (1fr, 1fr, 1fr),
align(left)[
#text(title, font: heading-font, weight: 700)
],
align(center)[
#text(company, font: heading-font, weight: 700) \
#text(location, font: heading-font, size: 0.9em)
],
align(right)[
#text(dates, font: heading-font, weight: 700)
]
)
]
}
|
|
https://github.com/typst/packages | https://raw.githubusercontent.com/typst/packages/main/packages/preview/unichar/0.1.0/ucd/index.typ | typst | Apache License 2.0 | #let get-data(code) = {
if 0x0 <= code and code <= 0x7f {
import "block-0000.typ"
("Basic Latin", block-0000.data.at(code - 0x0, default: ()))
} else if 0x80 <= code and code <= 0xff {
import "block-0080.typ"
("Latin-1 Supplement", block-0080.data.at(code - 0x80, default: ()))
} else if 0x100 <= code and code <= 0x17f {
import "block-0100.typ"
("Latin Extended-A", block-0100.data.at(code - 0x100, default: ()))
} else if 0x180 <= code and code <= 0x24f {
import "block-0180.typ"
("Latin Extended-B", block-0180.data.at(code - 0x180, default: ()))
} else if 0x250 <= code and code <= 0x2af {
import "block-0250.typ"
("IPA Extensions", block-0250.data.at(code - 0x250, default: ()))
} else if 0x2b0 <= code and code <= 0x2ff {
import "block-02B0.typ"
("Spacing Modifier Letters", block-02B0.data.at(code - 0x2b0, default: ()))
} else if 0x300 <= code and code <= 0x36f {
import "block-0300.typ"
("Combining Diacritical Marks", block-0300.data.at(code - 0x300, default: ()))
} else if 0x370 <= code and code <= 0x3ff {
import "block-0370.typ"
("Greek and Coptic", block-0370.data.at(code - 0x370, default: ()))
} else if 0x400 <= code and code <= 0x4ff {
import "block-0400.typ"
("Cyrillic", block-0400.data.at(code - 0x400, default: ()))
} else if 0x500 <= code and code <= 0x52f {
import "block-0500.typ"
("Cyrillic Supplement", block-0500.data.at(code - 0x500, default: ()))
} else if 0x530 <= code and code <= 0x58f {
import "block-0530.typ"
("Armenian", block-0530.data.at(code - 0x530, default: ()))
} else if 0x590 <= code and code <= 0x5ff {
import "block-0590.typ"
("Hebrew", block-0590.data.at(code - 0x590, default: ()))
} else if 0x600 <= code and code <= 0x6ff {
import "block-0600.typ"
("Arabic", block-0600.data.at(code - 0x600, default: ()))
} else if 0x700 <= code and code <= 0x74f {
import "block-0700.typ"
("Syriac", block-0700.data.at(code - 0x700, default: ()))
} else if 0x750 <= code and code <= 0x77f {
import "block-0750.typ"
("Arabic Supplement", block-0750.data.at(code - 0x750, default: ()))
} else if 0x780 <= code and code <= 0x7bf {
import "block-0780.typ"
("Thaana", block-0780.data.at(code - 0x780, default: ()))
} else if 0x7c0 <= code and code <= 0x7ff {
import "block-07C0.typ"
("NKo", block-07C0.data.at(code - 0x7c0, default: ()))
} else if 0x800 <= code and code <= 0x83f {
import "block-0800.typ"
("Samaritan", block-0800.data.at(code - 0x800, default: ()))
} else if 0x840 <= code and code <= 0x85f {
import "block-0840.typ"
("Mandaic", block-0840.data.at(code - 0x840, default: ()))
} else if 0x860 <= code and code <= 0x86f {
import "block-0860.typ"
("Syriac Supplement", block-0860.data.at(code - 0x860, default: ()))
} else if 0x870 <= code and code <= 0x89f {
import "block-0870.typ"
("Arabic Extended-B", block-0870.data.at(code - 0x870, default: ()))
} else if 0x8a0 <= code and code <= 0x8ff {
import "block-08A0.typ"
("Arabic Extended-A", block-08A0.data.at(code - 0x8a0, default: ()))
} else if 0x900 <= code and code <= 0x97f {
import "block-0900.typ"
("Devanagari", block-0900.data.at(code - 0x900, default: ()))
} else if 0x980 <= code and code <= 0x9ff {
import "block-0980.typ"
("Bengali", block-0980.data.at(code - 0x980, default: ()))
} else if 0xa00 <= code and code <= 0xa7f {
import "block-0A00.typ"
("Gurmukhi", block-0A00.data.at(code - 0xa00, default: ()))
} else if 0xa80 <= code and code <= 0xaff {
import "block-0A80.typ"
("Gujarati", block-0A80.data.at(code - 0xa80, default: ()))
} else if 0xb00 <= code and code <= 0xb7f {
import "block-0B00.typ"
("Oriya", block-0B00.data.at(code - 0xb00, default: ()))
} else if 0xb80 <= code and code <= 0xbff {
import "block-0B80.typ"
("Tamil", block-0B80.data.at(code - 0xb80, default: ()))
} else if 0xc00 <= code and code <= 0xc7f {
import "block-0C00.typ"
("Telugu", block-0C00.data.at(code - 0xc00, default: ()))
} else if 0xc80 <= code and code <= 0xcff {
import "block-0C80.typ"
("Kannada", block-0C80.data.at(code - 0xc80, default: ()))
} else if 0xd00 <= code and code <= 0xd7f {
import "block-0D00.typ"
("Malayalam", block-0D00.data.at(code - 0xd00, default: ()))
} else if 0xd80 <= code and code <= 0xdff {
import "block-0D80.typ"
("Sinhala", block-0D80.data.at(code - 0xd80, default: ()))
} else if 0xe00 <= code and code <= 0xe7f {
import "block-0E00.typ"
("Thai", block-0E00.data.at(code - 0xe00, default: ()))
} else if 0xe80 <= code and code <= 0xeff {
import "block-0E80.typ"
("Lao", block-0E80.data.at(code - 0xe80, default: ()))
} else if 0xf00 <= code and code <= 0xfff {
import "block-0F00.typ"
("Tibetan", block-0F00.data.at(code - 0xf00, default: ()))
} else if 0x1000 <= code and code <= 0x109f {
import "block-1000.typ"
("Myanmar", block-1000.data.at(code - 0x1000, default: ()))
} else if 0x10a0 <= code and code <= 0x10ff {
import "block-10A0.typ"
("Georgian", block-10A0.data.at(code - 0x10a0, default: ()))
} else if 0x1100 <= code and code <= 0x11ff {
import "block-1100.typ"
("<NAME>", block-1100.data.at(code - 0x1100, default: ()))
} else if 0x1200 <= code and code <= 0x137f {
import "block-1200.typ"
("Ethiopic", block-1200.data.at(code - 0x1200, default: ()))
} else if 0x1380 <= code and code <= 0x139f {
import "block-1380.typ"
("Ethiopic Supplement", block-1380.data.at(code - 0x1380, default: ()))
} else if 0x13a0 <= code and code <= 0x13ff {
import "block-13A0.typ"
("Cherokee", block-13A0.data.at(code - 0x13a0, default: ()))
} else if 0x1400 <= code and code <= 0x167f {
import "block-1400.typ"
("Unified Canadian Aboriginal Syllabics", block-1400.data.at(code - 0x1400, default: ()))
} else if 0x1680 <= code and code <= 0x169f {
import "block-1680.typ"
("Ogham", block-1680.data.at(code - 0x1680, default: ()))
} else if 0x16a0 <= code and code <= 0x16ff {
import "block-16A0.typ"
("Runic", block-16A0.data.at(code - 0x16a0, default: ()))
} else if 0x1700 <= code and code <= 0x171f {
import "block-1700.typ"
("Tagalog", block-1700.data.at(code - 0x1700, default: ()))
} else if 0x1720 <= code and code <= 0x173f {
import "block-1720.typ"
("Hanunoo", block-1720.data.at(code - 0x1720, default: ()))
} else if 0x1740 <= code and code <= 0x175f {
import "block-1740.typ"
("Buhid", block-1740.data.at(code - 0x1740, default: ()))
} else if 0x1760 <= code and code <= 0x177f {
import "block-1760.typ"
("Tagbanwa", block-1760.data.at(code - 0x1760, default: ()))
} else if 0x1780 <= code and code <= 0x17ff {
import "block-1780.typ"
("Khmer", block-1780.data.at(code - 0x1780, default: ()))
} else if 0x1800 <= code and code <= 0x18af {
import "block-1800.typ"
("Mongolian", block-1800.data.at(code - 0x1800, default: ()))
} else if 0x18b0 <= code and code <= 0x18ff {
import "block-18B0.typ"
("Unified Canadian Aboriginal Syllabics Extended", block-18B0.data.at(code - 0x18b0, default: ()))
} else if 0x1900 <= code and code <= 0x194f {
import "block-1900.typ"
("Limbu", block-1900.data.at(code - 0x1900, default: ()))
} else if 0x1950 <= code and code <= 0x197f {
import "block-1950.typ"
("Tai Le", block-1950.data.at(code - 0x1950, default: ()))
} else if 0x1980 <= code and code <= 0x19df {
import "block-1980.typ"
("New Tai Lue", block-1980.data.at(code - 0x1980, default: ()))
} else if 0x19e0 <= code and code <= 0x19ff {
import "block-19E0.typ"
("Khmer Symbols", block-19E0.data.at(code - 0x19e0, default: ()))
} else if 0x1a00 <= code and code <= 0x1a1f {
import "block-1A00.typ"
("Buginese", block-1A00.data.at(code - 0x1a00, default: ()))
} else if 0x1a20 <= code and code <= 0x1aaf {
import "block-1A20.typ"
("Tai Tham", block-1A20.data.at(code - 0x1a20, default: ()))
} else if 0x1ab0 <= code and code <= 0x1aff {
import "block-1AB0.typ"
("Combining Diacritical Marks Extended", block-1AB0.data.at(code - 0x1ab0, default: ()))
} else if 0x1b00 <= code and code <= 0x1b7f {
import "block-1B00.typ"
("Balinese", block-1B00.data.at(code - 0x1b00, default: ()))
} else if 0x1b80 <= code and code <= 0x1bbf {
import "block-1B80.typ"
("Sundanese", block-1B80.data.at(code - 0x1b80, default: ()))
} else if 0x1bc0 <= code and code <= 0x1bff {
import "block-1BC0.typ"
("Batak", block-1BC0.data.at(code - 0x1bc0, default: ()))
} else if 0x1c00 <= code and code <= 0x1c4f {
import "block-1C00.typ"
("Lepcha", block-1C00.data.at(code - 0x1c00, default: ()))
} else if 0x1c50 <= code and code <= 0x1c7f {
import "block-1C50.typ"
("Ol Chiki", block-1C50.data.at(code - 0x1c50, default: ()))
} else if 0x1c80 <= code and code <= 0x1c8f {
import "block-1C80.typ"
("Cyrillic Extended-C", block-1C80.data.at(code - 0x1c80, default: ()))
} else if 0x1c90 <= code and code <= 0x1cbf {
import "block-1C90.typ"
("Georgian Extended", block-1C90.data.at(code - 0x1c90, default: ()))
} else if 0x1cc0 <= code and code <= 0x1ccf {
import "block-1CC0.typ"
("Sundanese Supplement", block-1CC0.data.at(code - 0x1cc0, default: ()))
} else if 0x1cd0 <= code and code <= 0x1cff {
import "block-1CD0.typ"
("Vedic Extensions", block-1CD0.data.at(code - 0x1cd0, default: ()))
} else if 0x1d00 <= code and code <= 0x1d7f {
import "block-1D00.typ"
("Phonetic Extensions", block-1D00.data.at(code - 0x1d00, default: ()))
} else if 0x1d80 <= code and code <= 0x1dbf {
import "block-1D80.typ"
("Phonetic Extensions Supplement", block-1D80.data.at(code - 0x1d80, default: ()))
} else if 0x1dc0 <= code and code <= 0x1dff {
import "block-1DC0.typ"
("Combining Diacritical Marks Supplement", block-1DC0.data.at(code - 0x1dc0, default: ()))
} else if 0x1e00 <= code and code <= 0x1eff {
import "block-1E00.typ"
("Latin Extended Additional", block-1E00.data.at(code - 0x1e00, default: ()))
} else if 0x1f00 <= code and code <= 0x1fff {
import "block-1F00.typ"
("Greek Extended", block-1F00.data.at(code - 0x1f00, default: ()))
} else if 0x2000 <= code and code <= 0x206f {
import "block-2000.typ"
("General Punctuation", block-2000.data.at(code - 0x2000, default: ()))
} else if 0x2070 <= code and code <= 0x209f {
import "block-2070.typ"
("Superscripts and Subscripts", block-2070.data.at(code - 0x2070, default: ()))
} else if 0x20a0 <= code and code <= 0x20cf {
import "block-20A0.typ"
("Currency Symbols", block-20A0.data.at(code - 0x20a0, default: ()))
} else if 0x20d0 <= code and code <= 0x20ff {
import "block-20D0.typ"
("Combining Diacritical Marks for Symbols", block-20D0.data.at(code - 0x20d0, default: ()))
} else if 0x2100 <= code and code <= 0x214f {
import "block-2100.typ"
("Letterlike Symbols", block-2100.data.at(code - 0x2100, default: ()))
} else if 0x2150 <= code and code <= 0x218f {
import "block-2150.typ"
("Number Forms", block-2150.data.at(code - 0x2150, default: ()))
} else if 0x2190 <= code and code <= 0x21ff {
import "block-2190.typ"
("Arrows", block-2190.data.at(code - 0x2190, default: ()))
} else if 0x2200 <= code and code <= 0x22ff {
import "block-2200.typ"
("Mathematical Operators", block-2200.data.at(code - 0x2200, default: ()))
} else if 0x2300 <= code and code <= 0x23ff {
import "block-2300.typ"
("Miscellaneous Technical", block-2300.data.at(code - 0x2300, default: ()))
} else if 0x2400 <= code and code <= 0x243f {
import "block-2400.typ"
("Control Pictures", block-2400.data.at(code - 0x2400, default: ()))
} else if 0x2440 <= code and code <= 0x245f {
import "block-2440.typ"
("Optical Character Recognition", block-2440.data.at(code - 0x2440, default: ()))
} else if 0x2460 <= code and code <= 0x24ff {
import "block-2460.typ"
("Enclosed Alphanumerics", block-2460.data.at(code - 0x2460, default: ()))
} else if 0x2500 <= code and code <= 0x257f {
import "block-2500.typ"
("Box Drawing", block-2500.data.at(code - 0x2500, default: ()))
} else if 0x2580 <= code and code <= 0x259f {
import "block-2580.typ"
("Block Elements", block-2580.data.at(code - 0x2580, default: ()))
} else if 0x25a0 <= code and code <= 0x25ff {
import "block-25A0.typ"
("Geometric Shapes", block-25A0.data.at(code - 0x25a0, default: ()))
} else if 0x2600 <= code and code <= 0x26ff {
import "block-2600.typ"
("Miscellaneous Symbols", block-2600.data.at(code - 0x2600, default: ()))
} else if 0x2700 <= code and code <= 0x27bf {
import "block-2700.typ"
("Dingbats", block-2700.data.at(code - 0x2700, default: ()))
} else if 0x27c0 <= code and code <= 0x27ef {
import "block-27C0.typ"
("Miscellaneous Mathematical Symbols-A", block-27C0.data.at(code - 0x27c0, default: ()))
} else if 0x27f0 <= code and code <= 0x27ff {
import "block-27F0.typ"
("Supplemental Arrows-A", block-27F0.data.at(code - 0x27f0, default: ()))
} else if 0x2800 <= code and code <= 0x28ff {
import "block-2800.typ"
("Braille Patterns", block-2800.data.at(code - 0x2800, default: ()))
} else if 0x2900 <= code and code <= 0x297f {
import "block-2900.typ"
("Supplemental Arrows-B", block-2900.data.at(code - 0x2900, default: ()))
} else if 0x2980 <= code and code <= 0x29ff {
import "block-2980.typ"
("Miscellaneous Mathematical Symbols-B", block-2980.data.at(code - 0x2980, default: ()))
} else if 0x2a00 <= code and code <= 0x2aff {
import "block-2A00.typ"
("Supplemental Mathematical Operators", block-2A00.data.at(code - 0x2a00, default: ()))
} else if 0x2b00 <= code and code <= 0x2bff {
import "block-2B00.typ"
("Miscellaneous Symbols and Arrows", block-2B00.data.at(code - 0x2b00, default: ()))
} else if 0x2c00 <= code and code <= 0x2c5f {
import "block-2C00.typ"
("Glagolitic", block-2C00.data.at(code - 0x2c00, default: ()))
} else if 0x2c60 <= code and code <= 0x2c7f {
import "block-2C60.typ"
("Latin Extended-C", block-2C60.data.at(code - 0x2c60, default: ()))
} else if 0x2c80 <= code and code <= 0x2cff {
import "block-2C80.typ"
("Coptic", block-2C80.data.at(code - 0x2c80, default: ()))
} else if 0x2d00 <= code and code <= 0x2d2f {
import "block-2D00.typ"
("Georgian Supplement", block-2D00.data.at(code - 0x2d00, default: ()))
} else if 0x2d30 <= code and code <= 0x2d7f {
import "block-2D30.typ"
("Tifinagh", block-2D30.data.at(code - 0x2d30, default: ()))
} else if 0x2d80 <= code and code <= 0x2ddf {
import "block-2D80.typ"
("Ethiopic Extended", block-2D80.data.at(code - 0x2d80, default: ()))
} else if 0x2de0 <= code and code <= 0x2dff {
import "block-2DE0.typ"
("Cyrillic Extended-A", block-2DE0.data.at(code - 0x2de0, default: ()))
} else if 0x2e00 <= code and code <= 0x2e7f {
import "block-2E00.typ"
("Supplemental Punctuation", block-2E00.data.at(code - 0x2e00, default: ()))
} else if 0x2e80 <= code and code <= 0x2eff {
import "block-2E80.typ"
("CJK Radicals Supplement", block-2E80.data.at(code - 0x2e80, default: ()))
} else if 0x2f00 <= code and code <= 0x2fdf {
import "block-2F00.typ"
("Kangxi Radicals", block-2F00.data.at(code - 0x2f00, default: ()))
} else if 0x2ff0 <= code and code <= 0x2fff {
import "block-2FF0.typ"
("Ideographic Description Characters", block-2FF0.data.at(code - 0x2ff0, default: ()))
} else if 0x3000 <= code and code <= 0x303f {
import "block-3000.typ"
("CJK Symbols and Punctuation", block-3000.data.at(code - 0x3000, default: ()))
} else if 0x3040 <= code and code <= 0x309f {
import "block-3040.typ"
("Hiragana", block-3040.data.at(code - 0x3040, default: ()))
} else if 0x30a0 <= code and code <= 0x30ff {
import "block-30A0.typ"
("Katakana", block-30A0.data.at(code - 0x30a0, default: ()))
} else if 0x3100 <= code and code <= 0x312f {
import "block-3100.typ"
("Bopomofo", block-3100.data.at(code - 0x3100, default: ()))
} else if 0x3130 <= code and code <= 0x318f {
import "block-3130.typ"
("Hangul Compatibility Jamo", block-3130.data.at(code - 0x3130, default: ()))
} else if 0x3190 <= code and code <= 0x319f {
import "block-3190.typ"
("Kanbun", block-3190.data.at(code - 0x3190, default: ()))
} else if 0x31a0 <= code and code <= 0x31bf {
import "block-31A0.typ"
("Bopomofo Extended", block-31A0.data.at(code - 0x31a0, default: ()))
} else if 0x31c0 <= code and code <= 0x31ef {
import "block-31C0.typ"
("CJK Strokes", block-31C0.data.at(code - 0x31c0, default: ()))
} else if 0x31f0 <= code and code <= 0x31ff {
import "block-31F0.typ"
("Katakana Phonetic Extensions", block-31F0.data.at(code - 0x31f0, default: ()))
} else if 0x3200 <= code and code <= 0x32ff {
import "block-3200.typ"
("Enclosed CJK Letters and Months", block-3200.data.at(code - 0x3200, default: ()))
} else if 0x3300 <= code and code <= 0x33ff {
import "block-3300.typ"
("CJK Compatibility", block-3300.data.at(code - 0x3300, default: ()))
} else if 0x3400 <= code and code <= 0x4dbf {
import "block-3400.typ"
("CJK Unified Ideographs Extension A", block-3400.data.at(str(code - 0x3400, base: 16), default: ()))
} else if 0x4dc0 <= code and code <= 0x4dff {
import "block-4DC0.typ"
("Yijing Hexagram Symbols", block-4DC0.data.at(code - 0x4dc0, default: ()))
} else if 0x4e00 <= code and code <= 0x9fff {
import "block-4E00.typ"
("CJK Unified Ideographs", block-4E00.data.at(str(code - 0x4e00, base: 16), default: ()))
} else if 0xa000 <= code and code <= 0xa48f {
import "block-A000.typ"
("Yi Syllables", block-A000.data.at(code - 0xa000, default: ()))
} else if 0xa490 <= code and code <= 0xa4cf {
import "block-A490.typ"
("Yi Radicals", block-A490.data.at(code - 0xa490, default: ()))
} else if 0xa4d0 <= code and code <= 0xa4ff {
import "block-A4D0.typ"
("Lisu", block-A4D0.data.at(code - 0xa4d0, default: ()))
} else if 0xa500 <= code and code <= 0xa63f {
import "block-A500.typ"
("Vai", block-A500.data.at(code - 0xa500, default: ()))
} else if 0xa640 <= code and code <= 0xa69f {
import "block-A640.typ"
("Cyrillic Extended-B", block-A640.data.at(code - 0xa640, default: ()))
} else if 0xa6a0 <= code and code <= 0xa6ff {
import "block-A6A0.typ"
("Bamum", block-A6A0.data.at(code - 0xa6a0, default: ()))
} else if 0xa700 <= code and code <= 0xa71f {
import "block-A700.typ"
("Modifier Tone Letters", block-A700.data.at(code - 0xa700, default: ()))
} else if 0xa720 <= code and code <= 0xa7ff {
import "block-A720.typ"
("Latin Extended-D", block-A720.data.at(code - 0xa720, default: ()))
} else if 0xa800 <= code and code <= 0xa82f {
import "block-A800.typ"
("<NAME>", block-A800.data.at(code - 0xa800, default: ()))
} else if 0xa830 <= code and code <= 0xa83f {
import "block-A830.typ"
("Common Indic Number Forms", block-A830.data.at(code - 0xa830, default: ()))
} else if 0xa840 <= code and code <= 0xa87f {
import "block-A840.typ"
("Phags-pa", block-A840.data.at(code - 0xa840, default: ()))
} else if 0xa880 <= code and code <= 0xa8df {
import "block-A880.typ"
("Saurashtra", block-A880.data.at(code - 0xa880, default: ()))
} else if 0xa8e0 <= code and code <= 0xa8ff {
import "block-A8E0.typ"
("Devanagari Extended", block-A8E0.data.at(code - 0xa8e0, default: ()))
} else if 0xa900 <= code and code <= 0xa92f {
import "block-A900.typ"
("<NAME>", block-A900.data.at(code - 0xa900, default: ()))
} else if 0xa930 <= code and code <= 0xa95f {
import "block-A930.typ"
("Rejang", block-A930.data.at(code - 0xa930, default: ()))
} else if 0xa960 <= code and code <= 0xa97f {
import "block-A960.typ"
("<NAME> Extended-A", block-A960.data.at(code - 0xa960, default: ()))
} else if 0xa980 <= code and code <= 0xa9df {
import "block-A980.typ"
("Javanese", block-A980.data.at(code - 0xa980, default: ()))
} else if 0xa9e0 <= code and code <= 0xa9ff {
import "block-A9E0.typ"
("Myanmar Extended-B", block-A9E0.data.at(code - 0xa9e0, default: ()))
} else if 0xaa00 <= code and code <= 0xaa5f {
import "block-AA00.typ"
("Cham", block-AA00.data.at(code - 0xaa00, default: ()))
} else if 0xaa60 <= code and code <= 0xaa7f {
import "block-AA60.typ"
("Myanmar Extended-A", block-AA60.data.at(code - 0xaa60, default: ()))
} else if 0xaa80 <= code and code <= 0xaadf {
import "block-AA80.typ"
("Tai Viet", block-AA80.data.at(code - 0xaa80, default: ()))
} else if 0xaae0 <= code and code <= 0xaaff {
import "block-AAE0.typ"
("Meetei Mayek Extensions", block-AAE0.data.at(code - 0xaae0, default: ()))
} else if 0xab00 <= code and code <= 0xab2f {
import "block-AB00.typ"
("Ethiopic Extended-A", block-AB00.data.at(code - 0xab00, default: ()))
} else if 0xab30 <= code and code <= 0xab6f {
import "block-AB30.typ"
("Latin Extended-E", block-AB30.data.at(code - 0xab30, default: ()))
} else if 0xab70 <= code and code <= 0xabbf {
import "block-AB70.typ"
("Cherokee Supplement", block-AB70.data.at(code - 0xab70, default: ()))
} else if 0xabc0 <= code and code <= 0xabff {
import "block-ABC0.typ"
("Meetei Mayek", block-ABC0.data.at(code - 0xabc0, default: ()))
} else if 0xac00 <= code and code <= 0xd7af {
import "block-AC00.typ"
("Hangul Syllables", block-AC00.data.at(str(code - 0xac00, base: 16), default: ()))
} else if 0xd7b0 <= code and code <= 0xd7ff {
import "block-D7B0.typ"
("Hangul Jamo Extended-B", block-D7B0.data.at(code - 0xd7b0, default: ()))
} else if 0xd800 <= code and code <= 0xdb7f {
import "block-D800.typ"
("High Surrogates", block-D800.data.at(str(code - 0xd800, base: 16), default: ()))
} else if 0xdb80 <= code and code <= 0xdbff {
import "block-DB80.typ"
("High Private Use Surrogates", block-DB80.data.at(str(code - 0xdb80, base: 16), default: ()))
} else if 0xdc00 <= code and code <= 0xdfff {
import "block-DC00.typ"
("Low Surrogates", block-DC00.data.at(str(code - 0xdc00, base: 16), default: ()))
} else if 0xe000 <= code and code <= 0xf8ff {
import "block-E000.typ"
("Private Use Area", block-E000.data.at(str(code - 0xe000, base: 16), default: ()))
} else if 0xf900 <= code and code <= 0xfaff {
import "block-F900.typ"
("CJK Compatibility Ideographs", block-F900.data.at(code - 0xf900, default: ()))
} else if 0xfb00 <= code and code <= 0xfb4f {
import "block-FB00.typ"
("Alphabetic Presentation Forms", block-FB00.data.at(code - 0xfb00, default: ()))
} else if 0xfb50 <= code and code <= 0xfdff {
import "block-FB50.typ"
("Arabic Presentation Forms-A", block-FB50.data.at(code - 0xfb50, default: ()))
} else if 0xfe00 <= code and code <= 0xfe0f {
import "block-FE00.typ"
("Variation Selectors", block-FE00.data.at(code - 0xfe00, default: ()))
} else if 0xfe10 <= code and code <= 0xfe1f {
import "block-FE10.typ"
("Vertical Forms", block-FE10.data.at(code - 0xfe10, default: ()))
} else if 0xfe20 <= code and code <= 0xfe2f {
import "block-FE20.typ"
("Combining Half Marks", block-FE20.data.at(code - 0xfe20, default: ()))
} else if 0xfe30 <= code and code <= 0xfe4f {
import "block-FE30.typ"
("CJK Compatibility Forms", block-FE30.data.at(code - 0xfe30, default: ()))
} else if 0xfe50 <= code and code <= 0xfe6f {
import "block-FE50.typ"
("Small Form Variants", block-FE50.data.at(code - 0xfe50, default: ()))
} else if 0xfe70 <= code and code <= 0xfeff {
import "block-FE70.typ"
("Arabic Presentation Forms-B", block-FE70.data.at(code - 0xfe70, default: ()))
} else if 0xff00 <= code and code <= 0xffef {
import "block-FF00.typ"
("Halfwidth and Fullwidth Forms", block-FF00.data.at(code - 0xff00, default: ()))
} else if 0xfff0 <= code and code <= 0xffff {
import "block-FFF0.typ"
("Specials", block-FFF0.data.at(str(code - 0xfff0, base: 16), default: ()))
} else if 0x10000 <= code and code <= 0x1007f {
import "block-10000.typ"
("Linear B Syllabary", block-10000.data.at(code - 0x10000, default: ()))
} else if 0x10080 <= code and code <= 0x100ff {
import "block-10080.typ"
("Linear B Ideograms", block-10080.data.at(code - 0x10080, default: ()))
} else if 0x10100 <= code and code <= 0x1013f {
import "block-10100.typ"
("Aegean Numbers", block-10100.data.at(code - 0x10100, default: ()))
} else if 0x10140 <= code and code <= 0x1018f {
import "block-10140.typ"
("Ancient Greek Numbers", block-10140.data.at(code - 0x10140, default: ()))
} else if 0x10190 <= code and code <= 0x101cf {
import "block-10190.typ"
("Ancient Symbols", block-10190.data.at(code - 0x10190, default: ()))
} else if 0x101d0 <= code and code <= 0x101ff {
import "block-101D0.typ"
("Phaistos Disc", block-101D0.data.at(code - 0x101d0, default: ()))
} else if 0x10280 <= code and code <= 0x1029f {
import "block-10280.typ"
("Lycian", block-10280.data.at(code - 0x10280, default: ()))
} else if 0x102a0 <= code and code <= 0x102df {
import "block-102A0.typ"
("Carian", block-102A0.data.at(code - 0x102a0, default: ()))
} else if 0x102e0 <= code and code <= 0x102ff {
import "block-102E0.typ"
("Coptic Epact Numbers", block-102E0.data.at(code - 0x102e0, default: ()))
} else if 0x10300 <= code and code <= 0x1032f {
import "block-10300.typ"
("Old Italic", block-10300.data.at(code - 0x10300, default: ()))
} else if 0x10330 <= code and code <= 0x1034f {
import "block-10330.typ"
("Gothic", block-10330.data.at(code - 0x10330, default: ()))
} else if 0x10350 <= code and code <= 0x1037f {
import "block-10350.typ"
("Old Permic", block-10350.data.at(code - 0x10350, default: ()))
} else if 0x10380 <= code and code <= 0x1039f {
import "block-10380.typ"
("Ugaritic", block-10380.data.at(code - 0x10380, default: ()))
} else if 0x103a0 <= code and code <= 0x103df {
import "block-103A0.typ"
("Old Persian", block-103A0.data.at(code - 0x103a0, default: ()))
} else if 0x10400 <= code and code <= 0x1044f {
import "block-10400.typ"
("Deseret", block-10400.data.at(code - 0x10400, default: ()))
} else if 0x10450 <= code and code <= 0x1047f {
import "block-10450.typ"
("Shavian", block-10450.data.at(code - 0x10450, default: ()))
} else if 0x10480 <= code and code <= 0x104af {
import "block-10480.typ"
("Osmanya", block-10480.data.at(code - 0x10480, default: ()))
} else if 0x104b0 <= code and code <= 0x104ff {
import "block-104B0.typ"
("Osage", block-104B0.data.at(code - 0x104b0, default: ()))
} else if 0x10500 <= code and code <= 0x1052f {
import "block-10500.typ"
("Elbasan", block-10500.data.at(code - 0x10500, default: ()))
} else if 0x10530 <= code and code <= 0x1056f {
import "block-10530.typ"
("<NAME>", block-10530.data.at(code - 0x10530, default: ()))
} else if 0x10570 <= code and code <= 0x105bf {
import "block-10570.typ"
("Vithkuqi", block-10570.data.at(code - 0x10570, default: ()))
} else if 0x105c0 <= code and code <= 0x105ff {
import "block-105C0.typ"
("Todhri", block-105C0.data.at(code - 0x105c0, default: ()))
} else if 0x10600 <= code and code <= 0x1077f {
import "block-10600.typ"
("Linear A", block-10600.data.at(code - 0x10600, default: ()))
} else if 0x10780 <= code and code <= 0x107bf {
import "block-10780.typ"
("Latin Extended-F", block-10780.data.at(code - 0x10780, default: ()))
} else if 0x10800 <= code and code <= 0x1083f {
import "block-10800.typ"
("Cypriot Syllabary", block-10800.data.at(code - 0x10800, default: ()))
} else if 0x10840 <= code and code <= 0x1085f {
import "block-10840.typ"
("Imperial Aramaic", block-10840.data.at(code - 0x10840, default: ()))
} else if 0x10860 <= code and code <= 0x1087f {
import "block-10860.typ"
("Palmyrene", block-10860.data.at(code - 0x10860, default: ()))
} else if 0x10880 <= code and code <= 0x108af {
import "block-10880.typ"
("Nabataean", block-10880.data.at(code - 0x10880, default: ()))
} else if 0x108e0 <= code and code <= 0x108ff {
import "block-108E0.typ"
("Hatran", block-108E0.data.at(code - 0x108e0, default: ()))
} else if 0x10900 <= code and code <= 0x1091f {
import "block-10900.typ"
("Phoenician", block-10900.data.at(code - 0x10900, default: ()))
} else if 0x10920 <= code and code <= 0x1093f {
import "block-10920.typ"
("Lydian", block-10920.data.at(code - 0x10920, default: ()))
} else if 0x10980 <= code and code <= 0x1099f {
import "block-10980.typ"
("Meroitic Hieroglyphs", block-10980.data.at(code - 0x10980, default: ()))
} else if 0x109a0 <= code and code <= 0x109ff {
import "block-109A0.typ"
("Meroitic Cursive", block-109A0.data.at(code - 0x109a0, default: ()))
} else if 0x10a00 <= code and code <= 0x10a5f {
import "block-10A00.typ"
("Kharoshthi", block-10A00.data.at(code - 0x10a00, default: ()))
} else if 0x10a60 <= code and code <= 0x10a7f {
import "block-10A60.typ"
("Old South Arabian", block-10A60.data.at(code - 0x10a60, default: ()))
} else if 0x10a80 <= code and code <= 0x10a9f {
import "block-10A80.typ"
("Old North Arabian", block-10A80.data.at(code - 0x10a80, default: ()))
} else if 0x10ac0 <= code and code <= 0x10aff {
import "block-10AC0.typ"
("Manichaean", block-10AC0.data.at(code - 0x10ac0, default: ()))
} else if 0x10b00 <= code and code <= 0x10b3f {
import "block-10B00.typ"
("Avestan", block-10B00.data.at(code - 0x10b00, default: ()))
} else if 0x10b40 <= code and code <= 0x10b5f {
import "block-10B40.typ"
("Inscriptional Parthian", block-10B40.data.at(code - 0x10b40, default: ()))
} else if 0x10b60 <= code and code <= 0x10b7f {
import "block-10B60.typ"
("Inscriptional Pahlavi", block-10B60.data.at(code - 0x10b60, default: ()))
} else if 0x10b80 <= code and code <= 0x10baf {
import "block-10B80.typ"
("<NAME>", block-10B80.data.at(code - 0x10b80, default: ()))
} else if 0x10c00 <= code and code <= 0x10c4f {
import "block-10C00.typ"
("Old Turkic", block-10C00.data.at(code - 0x10c00, default: ()))
} else if 0x10c80 <= code and code <= 0x10cff {
import "block-10C80.typ"
("Old Hungarian", block-10C80.data.at(code - 0x10c80, default: ()))
} else if 0x10d00 <= code and code <= 0x10d3f {
import "block-10D00.typ"
("<NAME>", block-10D00.data.at(code - 0x10d00, default: ()))
} else if 0x10d40 <= code and code <= 0x10d8f {
import "block-10D40.typ"
("Garay", block-10D40.data.at(code - 0x10d40, default: ()))
} else if 0x10e60 <= code and code <= 0x10e7f {
import "block-10E60.typ"
("Rumi Numeral Symbols", block-10E60.data.at(code - 0x10e60, default: ()))
} else if 0x10e80 <= code and code <= 0x10ebf {
import "block-10E80.typ"
("Yezidi", block-10E80.data.at(code - 0x10e80, default: ()))
} else if 0x10ec0 <= code and code <= 0x10eff {
import "block-10EC0.typ"
("Arabic Extended-C", block-10EC0.data.at(str(code - 0x10ec0, base: 16), default: ()))
} else if 0x10f00 <= code and code <= 0x10f2f {
import "block-10F00.typ"
("Old Sogdian", block-10F00.data.at(code - 0x10f00, default: ()))
} else if 0x10f30 <= code and code <= 0x10f6f {
import "block-10F30.typ"
("Sogdian", block-10F30.data.at(code - 0x10f30, default: ()))
} else if 0x10f70 <= code and code <= 0x10faf {
import "block-10F70.typ"
("Old Uyghur", block-10F70.data.at(code - 0x10f70, default: ()))
} else if 0x10fb0 <= code and code <= 0x10fdf {
import "block-10FB0.typ"
("Chorasmian", block-10FB0.data.at(code - 0x10fb0, default: ()))
} else if 0x10fe0 <= code and code <= 0x10fff {
import "block-10FE0.typ"
("Elymaic", block-10FE0.data.at(code - 0x10fe0, default: ()))
} else if 0x11000 <= code and code <= 0x1107f {
import "block-11000.typ"
("Brahmi", block-11000.data.at(code - 0x11000, default: ()))
} else if 0x11080 <= code and code <= 0x110cf {
import "block-11080.typ"
("Kaithi", block-11080.data.at(code - 0x11080, default: ()))
} else if 0x110d0 <= code and code <= 0x110ff {
import "block-110D0.typ"
("<NAME>", block-110D0.data.at(code - 0x110d0, default: ()))
} else if 0x11100 <= code and code <= 0x1114f {
import "block-11100.typ"
("Chakma", block-11100.data.at(code - 0x11100, default: ()))
} else if 0x11150 <= code and code <= 0x1117f {
import "block-11150.typ"
("Mahajani", block-11150.data.at(code - 0x11150, default: ()))
} else if 0x11180 <= code and code <= 0x111df {
import "block-11180.typ"
("Sharada", block-11180.data.at(code - 0x11180, default: ()))
} else if 0x111e0 <= code and code <= 0x111ff {
import "block-111E0.typ"
("<NAME>", block-111E0.data.at(code - 0x111e0, default: ()))
} else if 0x11200 <= code and code <= 0x1124f {
import "block-11200.typ"
("Khojki", block-11200.data.at(code - 0x11200, default: ()))
} else if 0x11280 <= code and code <= 0x112af {
import "block-11280.typ"
("Multani", block-11280.data.at(code - 0x11280, default: ()))
} else if 0x112b0 <= code and code <= 0x112ff {
import "block-112B0.typ"
("Khudawadi", block-112B0.data.at(code - 0x112b0, default: ()))
} else if 0x11300 <= code and code <= 0x1137f {
import "block-11300.typ"
("Grantha", block-11300.data.at(code - 0x11300, default: ()))
} else if 0x11380 <= code and code <= 0x113ff {
import "block-11380.typ"
("Tulu-Tigalari", block-11380.data.at(code - 0x11380, default: ()))
} else if 0x11400 <= code and code <= 0x1147f {
import "block-11400.typ"
("Newa", block-11400.data.at(code - 0x11400, default: ()))
} else if 0x11480 <= code and code <= 0x114df {
import "block-11480.typ"
("Tirhuta", block-11480.data.at(code - 0x11480, default: ()))
} else if 0x11580 <= code and code <= 0x115ff {
import "block-11580.typ"
("Siddham", block-11580.data.at(code - 0x11580, default: ()))
} else if 0x11600 <= code and code <= 0x1165f {
import "block-11600.typ"
("Modi", block-11600.data.at(code - 0x11600, default: ()))
} else if 0x11660 <= code and code <= 0x1167f {
import "block-11660.typ"
("Mongolian Supplement", block-11660.data.at(code - 0x11660, default: ()))
} else if 0x11680 <= code and code <= 0x116cf {
import "block-11680.typ"
("Takri", block-11680.data.at(code - 0x11680, default: ()))
} else if 0x116d0 <= code and code <= 0x116ff {
import "block-116D0.typ"
("Myanmar Extended-C", block-116D0.data.at(code - 0x116d0, default: ()))
} else if 0x11700 <= code and code <= 0x1174f {
import "block-11700.typ"
("Ahom", block-11700.data.at(code - 0x11700, default: ()))
} else if 0x11800 <= code and code <= 0x1184f {
import "block-11800.typ"
("Dogra", block-11800.data.at(code - 0x11800, default: ()))
} else if 0x118a0 <= code and code <= 0x118ff {
import "block-118A0.typ"
("<NAME>", block-118A0.data.at(code - 0x118a0, default: ()))
} else if 0x11900 <= code and code <= 0x1195f {
import "block-11900.typ"
("<NAME>", block-11900.data.at(code - 0x11900, default: ()))
} else if 0x119a0 <= code and code <= 0x119ff {
import "block-119A0.typ"
("Nandinagari", block-119A0.data.at(code - 0x119a0, default: ()))
} else if 0x11a00 <= code and code <= 0x11a4f {
import "block-11A00.typ"
("Zanabazar Square", block-11A00.data.at(code - 0x11a00, default: ()))
} else if 0x11a50 <= code and code <= 0x11aaf {
import "block-11A50.typ"
("Soyombo", block-11A50.data.at(code - 0x11a50, default: ()))
} else if 0x11ab0 <= code and code <= 0x11abf {
import "block-11AB0.typ"
("Unified Canadian Aboriginal Syllabics Extended-A", block-11AB0.data.at(code - 0x11ab0, default: ()))
} else if 0x11ac0 <= code and code <= 0x11aff {
import "block-11AC0.typ"
("<NAME>", block-11AC0.data.at(code - 0x11ac0, default: ()))
} else if 0x11b00 <= code and code <= 0x11b5f {
import "block-11B00.typ"
("Devanagari Extended-A", block-11B00.data.at(code - 0x11b00, default: ()))
} else if 0x11bc0 <= code and code <= 0x11bff {
import "block-11BC0.typ"
("Sunuwar", block-11BC0.data.at(code - 0x11bc0, default: ()))
} else if 0x11c00 <= code and code <= 0x11c6f {
import "block-11C00.typ"
("Bhaiksuki", block-11C00.data.at(code - 0x11c00, default: ()))
} else if 0x11c70 <= code and code <= 0x11cbf {
import "block-11C70.typ"
("Marchen", block-11C70.data.at(code - 0x11c70, default: ()))
} else if 0x11d00 <= code and code <= 0x11d5f {
import "block-11D00.typ"
("<NAME>", block-11D00.data.at(code - 0x11d00, default: ()))
} else if 0x11d60 <= code and code <= 0x11daf {
import "block-11D60.typ"
("<NAME>", block-11D60.data.at(code - 0x11d60, default: ()))
} else if 0x11ee0 <= code and code <= 0x11eff {
import "block-11EE0.typ"
("Makasar", block-11EE0.data.at(code - 0x11ee0, default: ()))
} else if 0x11f00 <= code and code <= 0x11f5f {
import "block-11F00.typ"
("Kawi", block-11F00.data.at(code - 0x11f00, default: ()))
} else if 0x11fb0 <= code and code <= 0x11fbf {
import "block-11FB0.typ"
("Lisu Supplement", block-11FB0.data.at(code - 0x11fb0, default: ()))
} else if 0x11fc0 <= code and code <= 0x11fff {
import "block-11FC0.typ"
("Tamil Supplement", block-11FC0.data.at(code - 0x11fc0, default: ()))
} else if 0x12000 <= code and code <= 0x123ff {
import "block-12000.typ"
("Cuneiform", block-12000.data.at(code - 0x12000, default: ()))
} else if 0x12400 <= code and code <= 0x1247f {
import "block-12400.typ"
("Cuneiform Numbers and Punctuation", block-12400.data.at(code - 0x12400, default: ()))
} else if 0x12480 <= code and code <= 0x1254f {
import "block-12480.typ"
("Early Dynastic Cuneiform", block-12480.data.at(code - 0x12480, default: ()))
} else if 0x12f90 <= code and code <= 0x12fff {
import "block-12F90.typ"
("Cypro-Minoan", block-12F90.data.at(code - 0x12f90, default: ()))
} else if 0x13000 <= code and code <= 0x1342f {
import "block-13000.typ"
("Egyptian Hieroglyphs", block-13000.data.at(code - 0x13000, default: ()))
} else if 0x13430 <= code and code <= 0x1345f {
import "block-13430.typ"
("Egyptian Hieroglyph Format Controls", block-13430.data.at(code - 0x13430, default: ()))
} else if 0x13460 <= code and code <= 0x143ff {
import "block-13460.typ"
("Egyptian Hieroglyphs Extended-A", block-13460.data.at(code - 0x13460, default: ()))
} else if 0x14400 <= code and code <= 0x1467f {
import "block-14400.typ"
("Anatolian Hieroglyphs", block-14400.data.at(code - 0x14400, default: ()))
} else if 0x16100 <= code and code <= 0x1613f {
import "block-16100.typ"
("<NAME>", block-16100.data.at(code - 0x16100, default: ()))
} else if 0x16800 <= code and code <= 0x16a3f {
import "block-16800.typ"
("Bamum Supplement", block-16800.data.at(code - 0x16800, default: ()))
} else if 0x16a40 <= code and code <= 0x16a6f {
import "block-16A40.typ"
("Mro", block-16A40.data.at(code - 0x16a40, default: ()))
} else if 0x16a70 <= code and code <= 0x16acf {
import "block-16A70.typ"
("Tangsa", block-16A70.data.at(code - 0x16a70, default: ()))
} else if 0x16ad0 <= code and code <= 0x16aff {
import "block-16AD0.typ"
("<NAME>", block-16AD0.data.at(code - 0x16ad0, default: ()))
} else if 0x16b00 <= code and code <= 0x16b8f {
import "block-16B00.typ"
("<NAME>", block-16B00.data.at(code - 0x16b00, default: ()))
} else if 0x16d40 <= code and code <= 0x16d7f {
import "block-16D40.typ"
("<NAME>", block-16D40.data.at(code - 0x16d40, default: ()))
} else if 0x16e40 <= code and code <= 0x16e9f {
import "block-16E40.typ"
("Medefaidrin", block-16E40.data.at(code - 0x16e40, default: ()))
} else if 0x16f00 <= code and code <= 0x16f9f {
import "block-16F00.typ"
("Miao", block-16F00.data.at(code - 0x16f00, default: ()))
} else if 0x16fe0 <= code and code <= 0x16fff {
import "block-16FE0.typ"
("Ideographic Symbols and Punctuation", block-16FE0.data.at(str(code - 0x16fe0, base: 16), default: ()))
} else if 0x17000 <= code and code <= 0x187ff {
import "block-17000.typ"
("Tangut", block-17000.data.at(str(code - 0x17000, base: 16), default: ()))
} else if 0x18800 <= code and code <= 0x18aff {
import "block-18800.typ"
("Tangut Components", block-18800.data.at(code - 0x18800, default: ()))
} else if 0x18b00 <= code and code <= 0x18cff {
import "block-18B00.typ"
("Khitan Small Script", block-18B00.data.at(code - 0x18b00, default: ()))
} else if 0x18d00 <= code and code <= 0x18d7f {
import "block-18D00.typ"
("Tangut Supplement", block-18D00.data.at(str(code - 0x18d00, base: 16), default: ()))
} else if 0x1aff0 <= code and code <= 0x1afff {
import "block-1AFF0.typ"
("Kana Extended-B", block-1AFF0.data.at(code - 0x1aff0, default: ()))
} else if 0x1b000 <= code and code <= 0x1b0ff {
import "block-1B000.typ"
("Kana Supplement", block-1B000.data.at(code - 0x1b000, default: ()))
} else if 0x1b100 <= code and code <= 0x1b12f {
import "block-1B100.typ"
("Kana Extended-A", block-1B100.data.at(code - 0x1b100, default: ()))
} else if 0x1b130 <= code and code <= 0x1b16f {
import "block-1B130.typ"
("Small Kana Extension", block-1B130.data.at(str(code - 0x1b130, base: 16), default: ()))
} else if 0x1b170 <= code and code <= 0x1b2ff {
import "block-1B170.typ"
("Nushu", block-1B170.data.at(code - 0x1b170, default: ()))
} else if 0x1bc00 <= code and code <= 0x1bc9f {
import "block-1BC00.typ"
("Duployan", block-1BC00.data.at(code - 0x1bc00, default: ()))
} else if 0x1bca0 <= code and code <= 0x1bcaf {
import "block-1BCA0.typ"
("Shorthand Format Controls", block-1BCA0.data.at(code - 0x1bca0, default: ()))
} else if 0x1cc00 <= code and code <= 0x1cebf {
import "block-1CC00.typ"
("Symbols for Legacy Computing Supplement", block-1CC00.data.at(code - 0x1cc00, default: ()))
} else if 0x1cf00 <= code and code <= 0x1cfcf {
import "block-1CF00.typ"
("Znamenny Musical Notation", block-1CF00.data.at(code - 0x1cf00, default: ()))
} else if 0x1d000 <= code and code <= 0x1d0ff {
import "block-1D000.typ"
("Byzantine Musical Symbols", block-1D000.data.at(code - 0x1d000, default: ()))
} else if 0x1d100 <= code and code <= 0x1d1ff {
import "block-1D100.typ"
("Musical Symbols", block-1D100.data.at(code - 0x1d100, default: ()))
} else if 0x1d200 <= code and code <= 0x1d24f {
import "block-1D200.typ"
("Ancient Greek Musical Notation", block-1D200.data.at(code - 0x1d200, default: ()))
} else if 0x1d2c0 <= code and code <= 0x1d2df {
import "block-1D2C0.typ"
("Kaktovik Numerals", block-1D2C0.data.at(code - 0x1d2c0, default: ()))
} else if 0x1d2e0 <= code and code <= 0x1d2ff {
import "block-1D2E0.typ"
("Mayan Numerals", block-1D2E0.data.at(code - 0x1d2e0, default: ()))
} else if 0x1d300 <= code and code <= 0x1d35f {
import "block-1D300.typ"
("Tai Xuan Jing Symbols", block-1D300.data.at(code - 0x1d300, default: ()))
} else if 0x1d360 <= code and code <= 0x1d37f {
import "block-1D360.typ"
("Counting Rod Numerals", block-1D360.data.at(code - 0x1d360, default: ()))
} else if 0x1d400 <= code and code <= 0x1d7ff {
import "block-1D400.typ"
("Mathematical Alphanumeric Symbols", block-1D400.data.at(code - 0x1d400, default: ()))
} else if 0x1d800 <= code and code <= 0x1daaf {
import "block-1D800.typ"
("Sutton SignWriting", block-1D800.data.at(code - 0x1d800, default: ()))
} else if 0x1df00 <= code and code <= 0x1dfff {
import "block-1DF00.typ"
("Latin Extended-G", block-1DF00.data.at(code - 0x1df00, default: ()))
} else if 0x1e000 <= code and code <= 0x1e02f {
import "block-1E000.typ"
("Glagolitic Supplement", block-1E000.data.at(code - 0x1e000, default: ()))
} else if 0x1e030 <= code and code <= 0x1e08f {
import "block-1E030.typ"
("Cyrillic Extended-D", block-1E030.data.at(code - 0x1e030, default: ()))
} else if 0x1e100 <= code and code <= 0x1e14f {
import "block-1E100.typ"
("<NAME>", block-1E100.data.at(code - 0x1e100, default: ()))
} else if 0x1e290 <= code and code <= 0x1e2bf {
import "block-1E290.typ"
("Toto", block-1E290.data.at(code - 0x1e290, default: ()))
} else if 0x1e2c0 <= code and code <= 0x1e2ff {
import "block-1E2C0.typ"
("Wancho", block-1E2C0.data.at(code - 0x1e2c0, default: ()))
} else if 0x1e4d0 <= code and code <= 0x1e4ff {
import "block-1E4D0.typ"
("<NAME>", block-1E4D0.data.at(code - 0x1e4d0, default: ()))
} else if 0x1e5d0 <= code and code <= 0x1e5ff {
import "block-1E5D0.typ"
("<NAME>", block-1E5D0.data.at(code - 0x1e5d0, default: ()))
} else if 0x1e7e0 <= code and code <= 0x1e7ff {
import "block-1E7E0.typ"
("Ethiopic Extended-B", block-1E7E0.data.at(code - 0x1e7e0, default: ()))
} else if 0x1e800 <= code and code <= 0x1e8df {
import "block-1E800.typ"
("<NAME>ikakui", block-1E800.data.at(code - 0x1e800, default: ()))
} else if 0x1e900 <= code and code <= 0x1e95f {
import "block-1E900.typ"
("Adlam", block-1E900.data.at(code - 0x1e900, default: ()))
} else if 0x1ec70 <= code and code <= 0x1ecbf {
import "block-1EC70.typ"
("Indic Siyaq Numbers", block-1EC70.data.at(code - 0x1ec70, default: ()))
} else if 0x1ed00 <= code and code <= 0x1ed4f {
import "block-1ED00.typ"
("Ottoman Siyaq Numbers", block-1ED00.data.at(code - 0x1ed00, default: ()))
} else if 0x1ee00 <= code and code <= 0x1eeff {
import "block-1EE00.typ"
("Arabic Mathematical Alphabetic Symbols", block-1EE00.data.at(code - 0x1ee00, default: ()))
} else if 0x1f000 <= code and code <= 0x1f02f {
import "block-1F000.typ"
("Mahjong Tiles", block-1F000.data.at(code - 0x1f000, default: ()))
} else if 0x1f030 <= code and code <= 0x1f09f {
import "block-1F030.typ"
("Domino Tiles", block-1F030.data.at(code - 0x1f030, default: ()))
} else if 0x1f0a0 <= code and code <= 0x1f0ff {
import "block-1F0A0.typ"
("Playing Cards", block-1F0A0.data.at(code - 0x1f0a0, default: ()))
} else if 0x1f100 <= code and code <= 0x1f1ff {
import "block-1F100.typ"
("Enclosed Alphanumeric Supplement", block-1F100.data.at(code - 0x1f100, default: ()))
} else if 0x1f200 <= code and code <= 0x1f2ff {
import "block-1F200.typ"
("Enclosed Ideographic Supplement", block-1F200.data.at(code - 0x1f200, default: ()))
} else if 0x1f300 <= code and code <= 0x1f5ff {
import "block-1F300.typ"
("Miscellaneous Symbols and Pictographs", block-1F300.data.at(code - 0x1f300, default: ()))
} else if 0x1f600 <= code and code <= 0x1f64f {
import "block-1F600.typ"
("Emoticons", block-1F600.data.at(code - 0x1f600, default: ()))
} else if 0x1f650 <= code and code <= 0x1f67f {
import "block-1F650.typ"
("Ornamental Dingbats", block-1F650.data.at(code - 0x1f650, default: ()))
} else if 0x1f680 <= code and code <= 0x1f6ff {
import "block-1F680.typ"
("Transport and Map Symbols", block-1F680.data.at(code - 0x1f680, default: ()))
} else if 0x1f700 <= code and code <= 0x1f77f {
import "block-1F700.typ"
("Alchemical Symbols", block-1F700.data.at(code - 0x1f700, default: ()))
} else if 0x1f780 <= code and code <= 0x1f7ff {
import "block-1F780.typ"
("Geometric Shapes Extended", block-1F780.data.at(code - 0x1f780, default: ()))
} else if 0x1f800 <= code and code <= 0x1f8ff {
import "block-1F800.typ"
("Supplemental Arrows-C", block-1F800.data.at(code - 0x1f800, default: ()))
} else if 0x1f900 <= code and code <= 0x1f9ff {
import "block-1F900.typ"
("Supplemental Symbols and Pictographs", block-1F900.data.at(code - 0x1f900, default: ()))
} else if 0x1fa00 <= code and code <= 0x1fa6f {
import "block-1FA00.typ"
("Chess Symbols", block-1FA00.data.at(code - 0x1fa00, default: ()))
} else if 0x1fa70 <= code and code <= 0x1faff {
import "block-1FA70.typ"
("Symbols and Pictographs Extended-A", block-1FA70.data.at(code - 0x1fa70, default: ()))
} else if 0x1fb00 <= code and code <= 0x1fbff {
import "block-1FB00.typ"
("Symbols for Legacy Computing", block-1FB00.data.at(code - 0x1fb00, default: ()))
} else if 0x20000 <= code and code <= 0x2a6df {
import "block-20000.typ"
("CJK Unified Ideographs Extension B", block-20000.data.at(str(code - 0x20000, base: 16), default: ()))
} else if 0x2a700 <= code and code <= 0x2b73f {
import "block-2A700.typ"
("CJK Unified Ideographs Extension C", block-2A700.data.at(str(code - 0x2a700, base: 16), default: ()))
} else if 0x2b740 <= code and code <= 0x2b81f {
import "block-2B740.typ"
("CJK Unified Ideographs Extension D", block-2B740.data.at(str(code - 0x2b740, base: 16), default: ()))
} else if 0x2b820 <= code and code <= 0x2ceaf {
import "block-2B820.typ"
("CJK Unified Ideographs Extension E", block-2B820.data.at(str(code - 0x2b820, base: 16), default: ()))
} else if 0x2ceb0 <= code and code <= 0x2ebef {
import "block-2CEB0.typ"
("CJK Unified Ideographs Extension F", block-2CEB0.data.at(str(code - 0x2ceb0, base: 16), default: ()))
} else if 0x2ebf0 <= code and code <= 0x2ee5f {
import "block-2EBF0.typ"
("CJK Unified Ideographs Extension I", block-2EBF0.data.at(str(code - 0x2ebf0, base: 16), default: ()))
} else if 0x2f800 <= code and code <= 0x2fa1f {
import "block-2F800.typ"
("CJK Compatibility Ideographs Supplement", block-2F800.data.at(code - 0x2f800, default: ()))
} else if 0x30000 <= code and code <= 0x3134f {
import "block-30000.typ"
("CJK Unified Ideographs Extension G", block-30000.data.at(str(code - 0x30000, base: 16), default: ()))
} else if 0x31350 <= code and code <= 0x323af {
import "block-31350.typ"
("CJK Unified Ideographs Extension H", block-31350.data.at(str(code - 0x31350, base: 16), default: ()))
} else if 0xe0000 <= code and code <= 0xe007f {
import "block-E0000.typ"
("Tags", block-E0000.data.at(code - 0xe0000, default: ()))
} else if 0xe0100 <= code and code <= 0xe01ef {
import "block-E0100.typ"
("Variation Selectors Supplement", block-E0100.data.at(code - 0xe0100, default: ()))
} else if 0xf0000 <= code and code <= 0xfffff {
import "block-F0000.typ"
("Supplementary Private Use Area-A", block-F0000.data.at(str(code - 0xf0000, base: 16), default: ()))
} else if 0x100000 <= code and code <= 0x10ffff {
import "block-100000.typ"
("Supplementary Private Use Area-B", block-100000.data.at(str(code - 0x100000, base: 16), default: ()))
} else {
(none, ())
}
}
|
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.