OpenLLM-France/wikimedia huggingface dataset:
# Introduction

Address Book is a very simple application for storing Names, Addresses, Phone Numbers, E-Mail addresses, etc. for everyone you know; something like the digital equivalent of a Rolodex. Address Book ties in with other applications like Mail, iCal and iChat. Address book also has hooks into .Mac and local LDAP servers.
# Mac OS X Tiger/Locally increased lead

< Mac OS X
Problem: When I type a certain character, the lead of that line - and that line height only - increases. Solution: This is caused by a lack of the typed character in the font you are using.
In this example, as soon as we type a eurosign, the line height increases, only in that line. The cause of this is the lack of a eurosign in the font we are using, the Templete Gothic. Flash MX 2004 tries to help out by putting in a eurosign from another font and this causes the difference in line height. Avoid this character, use a different font or recompile your font with eurosign in it.
# LMIs in Control/Click here to continue/Fundamentals of Matrix and LMIs/Tangential Nevanlinna Pick
## Tangential Nevanlinna-Pick

The Tangential Nevanlinna-Pick arises in multi-input, multi-output (MIMO) control theory, particularly $H_{\infty }$ robust and optimal control.
The problem is to try and find a function $H:C\to C^{pxq}$ which is analytic in $C_{+}$ and satisfies ‌ $H({\lambda }_{i})u_{i}=v_{i},$   $i=1,...,m$   with $||H||_{\infty }\leq 1$ $(1)$

## The System

$N_{(ij)}$ is a set of $pxq$ matrix valued Nevanlinna functions. The matrix valued function H({\lambda}) analytic on the open upper half plane is a Nevanlinna function if $Im(H({\lambda }))\geq 0$ $({\lambda }\in {\pi }^{+})$.

## The Data

Given: ‌ Initial sequence of data points on real axis ${\lambda }_{1},...,{\lambda }_{m}$ with ${\lambda }_{i}\in C_{+}{\widehat {=}}(s|Re(s)>0)$, ‌ And two sequences of row vectors containing distinct target points $u_{1},....,u_{m}$ with $u_{i}\in C^{q}$, and $v_{1},...,v_{m}$ with $v_{i}\in C^{p},i=1,...,m$.

## The LMI: Tangential Nevanlinna- Pick

Problem (1) has a solution if and only if the following is true:

##### Nevanlinna-Pick Approach

$N_{ij}=$ ${\frac {u_{i}^{\ast }u_{j}-v_{i}^{\ast }v_{j}}{\ {\lambda }_{i}^{\ast }+{\lambda }_{j}}}$ ‌

##### Lyapunov Approach

N can also be found using the Lyapunov equation:
$A^{\ast }N+NA-(U^{\ast }U-V^{\ast }V)=0$
where $A=diag({\lambda }_{1},...,{\lambda }_{m}),U=[u_{1}...u_{m}],V=[v1...vm]$
The tangential Nevanlinna-Pick problem is then solved by confirming that $N\geq 0$.

## Conclusion:

If $N_{(ij)}$ is positive (semi)-definite, then there exists a norm-bounded analytic function, $H$ which satisfies $H({\lambda }_{i})u_{i}=v_{i},$  $i=1,...,m$   with $||H||_{\infty }\leq 1$

## Implementation

Implementation requires YALMIP and a linear solver such as sedumi. - MATLAB code for Tangential Nevanlinna-Pick Problem.

## Related LMIs

Nevalinna-Pick Interpolation with Scaling

## External Links

* LMI Methods in Optimal and Robust Control - A course on LMIs in Control by Matthew Peet.
* LMIs in Systems and Control Theory - A downloadable book on LMIs by Stephen Boyd.
* Generalized Interpolation in $H_{\infty }$ by Donald Sarason.
* Tangential Nevanlinna-Pick Interpolation Problem With Boundary Nodes in the Nevanlinna Class And The Related Moment Problem by Yong Jian Hu and Xiu Ping Zhang.

## Return to Main Page:

LMIs in Control: https://en.wikibooks.org/wiki/LMIs_in_Control
# LMIs in Control/Click here to continue/Fundamentals of Matrix and LMIs/Variable Reduction Lemma
## Introduction

The variable reduction lemma allows the solution of algebraic Riccati inequality that involve a matrix of unknown dimension. This often arises when finding the controller that minimizes the H$_∞$ norm.

## The Data

In order to find the unknown matrix $M$ we need matrices $A$, $P$ & $Q$.

## The Optimization Problem

Given a symmetric matrix $A\in \mathbb {R} ^{n\times n}$ and two matrices $P$ & $Q$ of column dimension n, consider the problem of finding matrix $M$ of compatible dimensions such that
    ${\begin{aligned}\ A+P^{T}M^{T}Q+Q^{T}M^{T}P<0\\\end{aligned}}$
The above equation is solvable for some $M$ if and only if the following two conditions hold
    ${\begin{aligned}\ W_{P}^{T}AW_{P}<0\\\ W_{Q}^{T}AW_{Q}<0\\\end{aligned}}$
Where $W_{P}$ and $W_{Q}$ are matrices whose columns are bases for the null spaces of $P$ & $Q$, respectively.

## Conclusion

Using this technique we can get the value of unknown matrix $M$.

## External Links

A list of references documenting and validating the LMI.
* https://web.mit.edu/braatzgroup/33 A tutorial on linear and bilinear matrix inequalities.pdf - A journal paper on the said LMI
* https://onlinelibrary.wiley.com/doi/abs/10.1002/rnc.4590040403 - Research paper on the said LMI and its proof

## Return to Main Page

https://en.wikibooks.org/wiki/LMIs_in_Control
# LMIs in Control/Click here to continue/Fundamentals of Matrix and LMIs/Young’s Relation-Based Properties
## Young’s Relation-Based Properties

1. Consider $X$,$Y\in \mathbb {R} ^{n\times m}$ and $Z\in \mathbb {S} ^{m}$. The matrix inequality given by
                               ${\begin{aligned}Z+XTY+YTX>0,\end{aligned}}$
    is satisfied if and only if there exist $Q\in \mathbb {S} ^{m}$, $P\in \mathbb {S} ^{n}$,$G1\in \mathbb {R} ^{n\times n}$,$G2\in \mathbb {R} ^{n\times m}$,$F\in \mathbb {R} ^{m\times n}$, and $H\in \mathbb {R} ^{m\times m}$, where $Q>0$
    and $P>0$, such that
                ${\begin{bmatrix}P&Y\\*&Q\end{bmatrix}}>0$ and ${\begin{bmatrix}Z+Q+X^{T}PX&F-X^{T}G_{2}&H-X^{T}G_{1}\\*&G_{1}+G_{1}^{T}-P&F^{T}+G_{2}-Y\\*&*&H^{T}+H-Q\end{bmatrix}}$
2. Consider $X$,$Y\in \mathbb {R} ^{n\times n}$ and $W\in \mathbb {S} ^{m}$, where $X$ is full rank and $W>0$. The matrix inequality given by
                               ${\begin{aligned}X^{T}-W>0,\end{aligned}}$
    is satisfied if there exist $\lambda \in \mathbb {R} _{>0}$ such that
                ${\begin{bmatrix}\lambda \mathbf {1} &\lambda \mathbf {1} &\mathbf {0} \\*&\mathbf {X} +\mathbf {X} ^{T}&\mathbf {W} ^{\frac {1}{2}}\\*&*&\lambda \mathbf {1} \end{bmatrix}}>0$

## External Links

A list of references documenting and validating the LMI.
* LMI Methods in Optimal and Robust Control - A course on LMIs in Control by Matthew Peet.
* LMIs in Systems and Control Theory - A downloadable book on LMIs by Stephen Boyd.
* LMI Properties and Applications in Systems, Stability, and Control Theory - A List of LMIs by Ryan Caverly and James Forbes. (2.4.1 page 23)
# LMIs in Control/Click here to continue/Integral Quadratic Constraints/Frequency Domain
## The System

We will consider the following feedback interconnection $S(G,\Delta )$:
    ${\begin{cases}v=Gu+f,\\u=\Delta (v)+r\end{cases}}$
where $r$ and $f$ are exogeneous inputs. $G$ and $\Delta$ are two casual operators.

## The Problem

Let $\Pi :j\mathbb {R} \rightarrow \mathbb {C}$ be a measurable Hermitian-valued function, $G\in \mathbb {R} \mathbb {H} _{\infty }$ and $\Delta$ be a bounded casual operator. $\exists \epsilon >0$ such that
${\begin{bmatrix}G(j\omega )\\I\end{bmatrix}}^{*}\Pi (j\omega ){\begin{bmatrix}G(j\omega )\\I\end{bmatrix}}\leq -\epsilon I\qquad \forall \omega \in \mathbb {R}$
Then the feedback interconnection of $G$ and $\Delta$ is stable.

## The Data

$G$ is a linear time-invariant system with the state space realization:
       ${\begin{cases}{\dot {x}}=Ax+Bu\\y=Cx+Du\end{cases}}$
where $x$ is the state.
Any $\Pi \in \mathbb {R} \mathbb {H} _{\infty }$ can be factorized as $\Pi =\Psi ^{*}M\Psi$ where $M=M^{T}$ and $\Psi \in \mathbb {R} \mathbb {H} _{\infty }$. Denote the state space realization of $\Psi$ by $(A_{\psi },[B_{\psi 1},B_{\psi 2}],C_{\psi },[D_{\psi 1},D_{\psi 2}])$.
A state space realization for the system $\Psi {\begin{bmatrix}G\\I\end{bmatrix}}$ is $({\hat {A}},{\hat {B}},{\hat {C}},{\hat {D}}):=\left({\begin{bmatrix}A&0\\B_{\psi 1}C&A_{\psi }\end{bmatrix}},{\begin{bmatrix}B\\B_{\psi 2}+B_{\psi 1}D\end{bmatrix}},{\begin{bmatrix}D_{\psi 1}C&C_{\psi }\end{bmatrix}},D_{\psi 2}+D_{\psi 1}D\right)$

## The LMI

If there exists a matrix $P=P^{T}$ such that
    ${\begin{bmatrix}{\hat {A}}^{T}P+P{\hat {A}}&P{\hat {B}}\\{\hat {B}}^{T}P&0\end{bmatrix}}+{\begin{bmatrix}{\hat {C}}^{T}\\{\hat {D}}^{T}\end{bmatrix}}M{\begin{bmatrix}{\hat {C}}&{\hat {D}}\end{bmatrix}}<0$
then the feedback interconnection $S(G,\Delta )$ is stable.

## References

A. Megretski and A. Rantzer, "System analysis via integral quadratic constraints," in IEEE Transactions on Automatic Control, vol. 42, no. 6, pp. 819-830, June 1997, doi: 10.1109/9.587335
P. Seiler, "Stability Analysis With Dissipation Inequalities and Integral Quadratic Constraints," in IEEE Transactions on Automatic Control, vol. 60, no. 6, pp. 1704-1709, June 2015, doi: 10.1109/TAC.2014.2361004
# LMIs in Control/Click here to continue/Fundamentals of Matrix and LMIs/Schur Complement Lemma-Based Properties

An important tool for proving many LMI theorems is the Schur Compliment. It is frequently used as a method of LMI linearization.

### The Schur Compliment

Consider the matricies $Q$, $M$, and $R$ where $Q$ and $M$ are self-adjoint. Then the following statements are equivalent:
      * $Q>0$ and $M-RQ^{-1}R^{*}>0$ both hold.
      * $M>0$ and $Q-R^{*}M^{-1}R>0$ both hold.
      * ${\begin{bmatrix}M&R\\R^{*}&Q\end{bmatrix}}>0$ is satisfied.
More concisely:
       ${\begin{bmatrix}M&R\\R^{*}&Q\end{bmatrix}}>0\iff {\begin{bmatrix}M&0\\0&Q-R^{*}M^{-1}R\end{bmatrix}}>0\iff {\begin{bmatrix}M-RQ^{-1}R^{*}&0\\0&Q\end{bmatrix}}>0$

## External Links

* LMI Methods in Optimal and Robust Control - A course on LMIs in Control by Matthew Peet.
* LMI Properties and Applications in Systems, Stability, and Control Theory - A List of LMIs by Ryan Caverly and James Forbes.
* LMIs in Systems and Control Theory - A downloadable book on LMIs by Stephen Boyd.
# LMIs in Control/Click here to continue/Fundamentals of Matrix and LMIs/Strict Schur Complement
### Strict Schur Complement

Consider $A\in \mathbb {S} ^{n},B\in \mathbb {R} ^{n\times m},$ and $C\in \mathbb {S} ^{m}.$ The following statements are equivalent.
a) ${\begin{bmatrix}A&B\\B^{T}&C\end{bmatrix}}<0$
b) $A-BC^{-1}B^{T}<0,C<0$
c) $C-B^{T}A^{-1}B<0,A<0$

## External Links

* LMI Methods in Optimal and Robust Control - A course on LMIs in Control by Matthew Peet.
* LMI Properties and Applications in Systems, Stability, and Control Theory - A List of LMIs by Ryan Caverly and James Forbes.
* LMIs in Systems and Control Theory - A downloadable book on LMIs by Stephen Boyd.
# LMIs in Control/Click here to continue/Fundamentals of Matrix and LMIs/Submatrix Determinants and Imaginary and Real Parts
## Submatrix Determinants
### Required data

Consider $A\in \mathbb {S} ^{n}$, Let$A_{k}\in \mathbb {S} ^{k}$ be a submatrix of A consisting of its first $k$rows and columns, where $k\leq n$.

### Matrix inequality

The matrix inequality $A>0$ is satisfied if and only if
$det(A_{k})>0,k=1,.....,n$.

## Imaginary and Real Parts
### Required data

Consider $Q_{R}\in \mathbb {S} ^{n}$, $Q_{I}\in \mathbb {R} ^{n\times n}$, $Q=Q^{H}=Q_{R}+jQ_{I}\in \mathbb {C} ^{n\times n}$,

### Matrix inequality

The matrix inequality, $Q>0$ is equivalent to the matrix inequality given by
${\begin{bmatrix}Q_{R}&Q_{I}\\-Q_{I}&Q_{R}\end{bmatrix}}>0$.

## External Links

* LMI Methods in Optimal and Robust Control - A course on LMIs in Control by Matthew Peet.
* LMIs in Systems and Control Theory - A downloadable book on LMIs by Stephen Boyd.
* LMI Properties and Applications in Systems, Stability, and Control Theory - A downloadable book on LMIs by Ryan James Caverly and James Richard Forbes.
# LMIs in Control/Click here to continue/Fundamentals of Matrix and LMIs/Strict Projection Lemma
## Introduction

Projection Lemma is also known as Matrix Elimination Lemma. Strict Projection Lemma is one of the characteristics of the Projection Lemma.

## Strict Projection Lemma

Consider $\Psi \in \mathbb {S} ^{n}$, $G\in \mathbb {R} ^{n\times m}$, $\Lambda \in \mathbb {R} ^{m\times p}$, and $H\in \mathbb {R} ^{n\times p}.$ There exists $\Lambda$ such that:
${\begin{aligned}\ \Psi +G\Lambda H^{T}+H\Lambda ^{T}G^{T}<0,\end{aligned}}$
if and only if,
${\begin{aligned}\ N_{G}^{T}\Psi N_{G}<0\end{aligned}}$,
${\begin{aligned}\ N_{H}^{T}\Psi N_{H}<0\end{aligned}}$,
where ${\mathcal {R}}(N_{G})={\mathcal {N}}(G^{T})$ and ${\mathcal {R}}(N_{H})={\mathcal {N}}(H^{T})$.

## External Links

A list of references documenting and validating the LMI.
# LMIs in Control/Click here to continue/Fundamentals of Matrix and LMIs/Young’s Relation (Completion of the Squares)

This method is used to solve quadratic equations that can't be factorized.

## Matrix inequality

Consider $X,Y\in \mathbb {R} ^{n\times m}$ and $S\in \mathbb {S} ^{n\times n}$ , where $S$ >0, The matrix inequality given by
    ${\begin{aligned}\ X^{T}Y+Y^{T}X\leq X^{T}S^{-1}X+Y^{T}SY,\\\end{aligned}}$
which is named Young’s relation or Young’s inequality.

## Derivation

Young’s relation can be derived from a completion of the squares as follows.
    ${\begin{aligned}0\leq (X-SY)^{T}S^{-1}(X-SY)\\0\leq X^{T}S^{-1}X+Y^{T}SY-X^{T}Y-Y^{T}X\\X^{T}Y+Y^{T}X\leq X^{T}S^{-1}X+Y^{T}SY,\end{aligned}}$
which is named Young’s relation.

## Reformulation of Young’s Relation

Consider $X,Y\in \mathbb {R} ^{n\times m}$ and $S\in \mathbb {S} ^{n\times n}$ , where $S$ >0, The matrix inequality given by
    ${\begin{aligned}\ X^{T}Y+Y^{T}X\leq {\frac {1}{2}}(X+SY)^{T}S^{-1}(X+SY),\\\end{aligned}}$
is a reformulation of Young’s relation.

## External Links

A list of references documenting and validating the LMI.
* LMI Methods in Optimal and Robust Control - A course on LMIs in Control by Matthew Peet.
* LMIs in Systems and Control Theory - A downloadable book on LMIs by Stephen Boyd.
* LMI Properties and Applications in Systems, Stability, and Control Theory - A List of LMIs by Ryan Caverly and James Forbes. (2.4.1 page 23)
# LPI Linux Certification/Basic network troubleshooting
## Detailed Objectives

(LPIC-1 Version 5.0)
Weight: 4
Description: Candidates should be able to troubleshoot networking issues on client hosts.
Key Knowledge Areas:
* Manually configure network interfaces, including viewing and changing the configuration of network interfaces using iproute2.
* Manually configure routing, including viewing and changing routing tables and setting the default route using iproute2.
* Debug problems associated with the network configuration.
* Awareness of legacy net-tools commands.
The following is a partial list of the used files, terms and utilities:
* ip
* hostname
* ss
* ping
* ping6
* traceroute
* traceroute6
* tracepath
* tracepath6
* netcat
* ifconfig
* netstat
* route
# LPI Linux Certification/Configure Communication Devices
## Configure Communication Devices
### Detailed Objective

Weight: 1

#### Description

    Candidates should be able to install and configure different internal and external communication devices like modems, ISDN adapters and DSL modems.
* Key knowledge area(s):
** Verification of compatibility requirements (such as the modem is not a "winmodem").
** Correctly set IRQs, DMAs and I/O Ports of the cards to avoid conflicts between devices.
** Load and configure suitable device drivers.
** Set serial port speed.
** Setup modem for outbound PPP connections.
* The following is a partial list of the used files, terms and utilities:
** /proc/dma
** /proc/interrupts
** /proc/ioports
** setserial

### I/O Ports

To list the I/O ports the system uses, print the /proc/ioports file.

### Interrupts

To list all the interrupts used by all the devices, print the /proc/interrupts file.
An optimized system will not have any interrupt lines used by more than one heavily-used device.
Remember that every ISR from every device will be executed for each interrupt.

### DMA

To list all the ISA DMA (Direct Memory Access) channels in-use, print out the /proc/dma file.

### PCI

To list all the devices on the pci buses, print out the /proc/pci file.

### Exercises

* Exercises results
# LPI Linux Certification/Configure Fundamental BIOS Settings Exercise Results

* To show the amount of physical RAM available: use free or cat /proc/meminfo | grep MemTotal
* Which are the devices that are sharing an interrupt line? cat /proc/interrupts | more
** How many PCI buses and bridges are there? lspci | wc -l
** Are there any PCI/ISA bridges? lspci | grep 'PCI\|ISA'
* What is the option with lspci to list all the Intel PCI devices? lspci -d 8086:*
* What is the command to set you IDE hard drive in read only mode? hdparm -r1 <device>
* What is the command to turn on/off the disk cache hard drive? hdparm -W1 <device> hdparm -W0 <device>
* What does the setpci utility do? setpci is a utility for querying and configuring PCI devices.
* What would be the command to write a word in register N of a PCI device? setpci -s 12:3.4 N.W=1
# LPI Linux Certification/Configure Modem & Sound Cards
## Configure Modem & Sound Cards
### Detailed Objective

Weight: 1

#### Description

    Candidates should be able to configure modem and sound card settings.
* Key knowledge area(s):
** Ensure devices meet compatibility requirements (particularly that the modem is not an unsupported "win-modem").
** Verify that correct resources are used by the cards.
** Configure modem for outbound dial-up.
** Set serial port speeds.
* The following is a partial list of the used files, terms and utilities:
** /proc/dma
** /proc/interrupts
** /proc/ioports
** /proc/pci
** lspci
** lsusb

### Modems

A modem is a device that lets you send digital data through a telephone line. The four types of modem are:
* External: Connected through the serial port.
* USB: Connected through USB.
* Internal: ISA or PCI board.
* Built-in: Part of the motherboard.
Most new modems are Plug and Play and you have various ways to deal with it:
* The serial driver does it all for you.
* Use the isapnp program.
* Let a PnP BIOS do the configuration.
To display the configuration of an ISA device, use pnpdump. This utility can dump information (IO ports, interrupts, and DMA channels) that the card uses. To configure any ISA devices, use isapnp. For more information check the man page of isapnp.conf file.

### Serial ports

An external modem can be configured with setserial.
Example:

### Dial Out and In

In order to dial out with a modem, you can use the application setserial or minicom. A configuration file can be created with the -s option.
In order to be able to handle users dialing in, the system needs to be able to start a getty process to handle the dial-in session. The configuration must be done in the /etc/inittab file.
Once /etc/inittab is modified, init needs to re-read it.

### Exercises

* Exercises results
# LPI Linux Certification/Basic DNS Server Configuration
## Detailed Objectives (207.1)

(LPIC-2 Version 4.5)
Weight: 3
Description: Candidates should be able to configure BIND to function as a caching-only DNS server. This objective includes the ability to manage a running server and configuring logging.
Key Knowledge Areas:
* BIND 9.x configuration files, terms and utilities.
* Defining the location of the BIND zone files in BIND configuration files.
* Reloading modified configuration and zone files.
* Awareness of dnsmasq, djbdns and PowerDNS as alternate name servers.
The following is a partial list of the used files, terms and utilities:
* /etc/named.conf
* /var/named/
* /usr/sbin/rndc
* kill
* host
* dig

## Basic BIND 8 configuration
### Setting up a caching-only nameserver

To speed up the cumbersome process of DNS queries, DNS servers usually cache answers from other DNS servers – even negative queries (i.e an authoritative server's answer « name does not exist » is also cached by your local DNS)
Configuring BIND as a caching-only nameserver involves setting up only a « . » zone, that is, only tell it about the root nameservers and not specifying any zones, as follows :
The file named.cache can be generated by using dig @a.root-servers.net
Logging in BIND is controlled by two main concepts : channels and categories A channel specifies where logged data goes : to syslog, to a file, etc... A category specifies what data is logged
Channels allows you to filter messages by priority, like syslog's priorities. They are essentially the same, but two more are available for BIND : debug and dynamic, which affect debug level logging Debug sets a debug level, which will be active after the first trace command is given via ndc; dynamic will increment and decrement debug levels after each trace command is given via ndc
Example of logging configuration:
To activate logging, after bind is started, issue a command :
Key terms, files and utilities : /etc/named.conf /usr/sbin/ndc /usr/sbin/named-bootconf Kill
# LPI Linux Certification/Compiling A Kernel
## Detailed Objectives (201.2)

(LPIC-2 Version 4.5)
Weight: 2
Description: Candidates should be able to properly configure a kernel to include or disable specific features of the Linux kernel as necessary. This objective includes compiling and recompiling the Linux kernel as needed, updating and noting changes in a new kernel, creating an initrd image and installing new kernels.
Key Knowledge Areas:
* /usr/src/linux/
* Kernel Makefiles
* Kernel 2.6.x/3.x make targets
* Customize the current kernel configuration.
* Build a new kernel and appropriate kernel modules.
* Install a new kernel and any modules.
* Ensure that the boot manager can locate the new kernel and associated files.
* Module configuration files
* Use DKMS to compile kernel modules.
* Awareness of dracut
The following is a partial list of the used files, terms and utilities:
* mkinitrd
* mkinitramfs
* make
* make targets (all, config, xconfig, menuconfig, gconfig, oldconfig, mrproper, zImage, bzImage, modules, modules_install, rpm-pkg, binrpm-pkg, deb-pkg)
* gzip
* bzip2
* module tools
* /usr/src/linux/.config
* /lib/modules/kernel-version/
* depmod
* dkms
# LPI Linux Certification/LPIC2 Exam 201

* LPI Linux Certification
* LPIC1 Exam 101
* Detailed Objectives
* LPIC1 Exam 102
* Detailed Objectives
* LPIC2 Exam 201
* Detailed Objectives
* LPIC2 Exam 202
* Detailed Objectives
* NOTICE
* This book is still in progress.
* It certainly contains errors or approximations.
* The author declines any responsibility for whatever it is used.
This is part of LPI Linux Certification.
LPI Level 2 Exam 201 tests basic capabilities in these areas:
* Linux Kernel
** 2.201.1 Kernel Components
** 2.201.2 Compiling a kernel
** 2.201.3 Patching a kernel
** 2.201.4 Customizing a kernel
* System Startup
** 2.202.1 Customizing system startup and boot processes
** 2.202.2 System recovery
* Filesystems
** 2.203.1 Operating the Linux filesystem
** 2.203.2 Maintaining a Linux filesystem
** 2.203.3 Creating and configuring filesystem options
* Hardware
** 2.204.1 Configuring RAID
** 2.204.2 Adding new hardware
** 2.204.3 Software and kernel configuration
** 2.204.4 Configuring PCMCIA devices
* File and Service Sharing
** 2.209.1 Configuring a samba server
** 2.209.2 Configuring an NFS server
* System Maintenance
** 2.211.1 System logging
** 2.211.2 Packaging software
** 2.211.3 Backup operations
* System Customization and Automation
** 2.213.1 Automating tasks using scripts
* Troubleshooting
** 2.214.2 Creating recovery disks
** 2.214.3 Identifying boot stages
** 2.214.4 Troubleshooting LILO
** 2.214.5 General troubleshooting
** 2.214.6 Troubleshooting system resources
** 2.214.8 Troubleshooting environment configurations

## See also

* LPIC2 Exam 202

## External links

* Tasks
* Objectives
# LPI Linux Certification/LPIC1 Exam 102/Exercises results

* LPIC1 Exam 102
* Detailed Objectives
* Kernel
* Runlevels
* Printing
* Documentation
* Shells & Scripts
* Administrative Tasks
* Networking Fundamentals
* Networking Services
* Security
* Exercices results
# Making Websites with Flask
## Contents
### Introduction

    Overview, history, and prerequisites

### Getting Started

    Installation and Hello World!

### Routing

    Route Variables, Trailing Slash, and URL Building

### Templating

    Displaying HTML pages and more

### Creating a web app

    The final challenge