OpenLLM-France/wikimedia huggingface dataset:
# Mario franchise strategy guide/Items/Shine Sprite

Shine Sprites are small, sun-shaped beings with black eyes that have appeared throughout the Super Mario series of games, starting with Super Mario Sunshine.
In Super Mario Sunshine it is revealed that the pollution caused by Shadow Mario scared the Shine Sprites of Isle Delfino away. Without the Shine Sprites, Isle Delfino was covered in a perpetual dark shadow. Throughout Super Mario Sunshine, Mario had to collect Shine Sprites to travel further through the game.
In Mario Kart: Double Dash!!, a Capture the flag like mini-game can be played involving Shine Sprites. Players would have to grab a Shine Sprite a hold onto it for a set amount of time to win the game, while avoiding other players who will try to steal the Shine Sprite using various weaponry. In Mario Kart DS, another Shine Sprite related game can be played, this time involving nine Shine Sprites that the player has to obtain and hold onto.
In Paper Mario: The Thousand-Year Door, Shine Sprites appear throughout the game, usually being hidden inside transparent blocks. If players collect three Shine Sprites Paper Mario: The Thousand-Year Door they can give them to Merlon, who will upgrade a partner's abilities in exchange for them. In Mario & Luigi: Partners in Time, Shine Sprites are found in Shine Blocks, which can only be found in darkened areas. Once a Shine Block is hit, it will release a Shine Sprite that will brighten the surrounding area. If players hit a Shine Block incorrectly though, it will release a fireball that will damage whoever hit it.
# Mario franchise strategy guide/Locations/Banana Hoard

The Banana Hoard is a fictional collection of golden fruit featuring in the Donkey Kong game series. It has been stolen a number of times, forming the main plot of the Donkey Kong Country games, and Donkey Kong 64, specifically. The Banana Hoard has an uncanny ability to appear far larger than it is. For example, though it is meant to consist of only 201 Bananas, it often looks more like it is in excess of 1,000 bananas. The current owner of the Hoard is Donkey Kong, who at present resides as King of DK Isles.

## The Rareware Banana

Since Donkey Kong 64, all of the Golden Bananas in the Banana Hoard have had a little Nintendo insignia on the side. However, the 201st Golden Banana, held by the Banana Fairy, has a Rareware logo on the side instead. This banana is a secret, and is required to achieve the game's 101% completion rating.
# Mario franchise strategy guide/Items/Metal Box

A Metal Box is an green cube in the Super Mario Bros. series that has appeared in several video games. It makes its first appearance in Super Mario 64 and contains the Metal Cap, which can turn Mario into metal. This has the effect of making him heavier than normal, allowing him to perform actions such as walking on the sea floor, and withstanding wind gusts. It appears again in Super Smash Bros. Melee as an item able to turn characters into metal, except that there is no Metal Cap because the box itself activates the transformation.
# Mario franchise strategy guide/Items/Wing Cap

The Wing Cap is an item available in Super Mario 64. The Wing Cap is a red hat that allows Mario to fly, letting him reach previously unreachable areas, and collect airborne coins to earn stars. While wearing the Wing Cap, Mario's controls are inverted, just like airplane controls. The Wing Cap is found in red blocks marked with white exclamation marks, and are found in various levels in the game. The Wing Cap can also be used to fly around in front of the castle, after gaining access to the roof.
A great way to use the Wing cap is to push up on the control stick (which makes Mario go down) so Mario dives, and picks up speed. Then, push down on the control stick (which will make Mario go up) and Mario will zoom up to higher than where Mario was before you started the maneuver. The Wing cap lasts for only a short while, so don't be caught way above the ground when the Wing cap runs out.

## Wing Cap Blocks

The Wing Cap blocks have to be activated by accessing a secret level before they can be used. This level is available after obtaining about 10 stars. To enter the level, Mario must stand on the sun logo in the lobby of Princess Peach's Castle and look up. In the level, a large red switch must be pressed to activate the Wing Cap blocks.

## Development

In early development shots of Super Mario 64 DS, each of the characters was shown wearing a Wing Cap, but this does not happen in the game's story mode, as the Wing Cap is not an item. Instead, it is a special move for Mario, only available upon finding a feather from a red block. The other characters may only use the move in Wireless Multiplayer games.
# Mario franchise strategy guide/Items/Metal Cap

The Metal Cap is the metallic cap that Mario could pick up in Super Mario 64. If Mario smashed a green !-block, the cap would come out, and Mario would catch it. In Super Mario 64 DS, Wario is the only character who can become metal. When metal, Mario (or Wario) does not need to breathe, allowing him to walk through poisonous gases and lava and stay under water until the cap wear's off. You can walk on ocean floors, which can be both an advantage and a disadvantage. Also, you cannot be blown away by strong gusts of wind. Enemies are more easily killed (i.e. you just touch them), and you cannot be shocked.
The green !-block is also seen in Super Smash Bros. Melee, and makes your character heavier after directly attacking or picking up the item (projectiles will destroy it). This power up is good in that you are less likely to be knocked from the stage but bad in that you cannot stay airborne for as long and fall quicker when knocked off the platform. It also makes the character mute, good for those with distinctive sounds while charging attacks.
# Mario franchise strategy guide/Items/Tanooki Suit

The Tanooki suit is a special power up originating from the video game Super Mario Bros. 3, and was only found in a few special locations, such as the treasure chests inside Toad's House. It had the same powers as Raccoon Mario plus the added benefit of being able to temporarily change into an invincible (but immobile) statue by pressing "DOWN" and "B" on the controller. Mario can do this at a height to land on and destroy certain enemies in the game that were originally thought to be indestructible, though it can be very difficult to time such attacks correctly.
"Tanooki" actually refers to a Japanese animal (both real and mythical) called a Tanuki—the mythical version known for its mischievous and jolly nature and being a master of disguise and shape-shifting. The Tanooki suit itself resembles popular Tanuki statues in Japan, and its ability to transform into a smiling statue to avoid or defeat enemies is no doubt a direct reference to the mythical animal's abilities. Because Nintendo games are targeted at children, the Tanuki suit does not feature the traditional huge testicles typical of most real tanuki statues. The fact that Raccoon Mario is powered up by a leaf is also a bit of a joke—a Tanuki looks somewhat similar to a Raccoon, their name is often mistranslated as Raccoon in other languages, and the mythical version of the creature was known for using leaves as part of its mischievous magic.
As an interesting side note, the programmers made a small mistake involving the Tanooki Suit — when he is shown about to play a 'slider' or 'memory' game, Mario is still depicted as Super Mario.
Strangely, the Tanooki suit was never featured in The Adventures of Super Mario Bros. 3. It did, however, receive a comic book story of its own, titled "Tanooki Suits Me" (printed in the trade paperback Mario's Special Powers).
# JavaScript/Regular expressions/Exercises

Topic: Regular Expressions
1. Does the password "kw8h_rt" contain a digit?
2. Be creative! Define a rule for passwords, read a password from the user using prompt, and check it.
3. Does the sentence "Kim and Maren are friends." contains the word "are"?
4. Be creative! Read strings from the user (prompt) that match the following regular expressions:
* d\dd
* d\d+d
* \bwhy\b
* x\s-\sy\s=\sz
Discuss the meaning of the above REs with your colleague.
5. Normalize the phone number "0800 123-456-0" by stripping out all non-numerical characters.
6. Split the following sentences into an array that contains only its words.
"Tom cried: 'What the hell is going on?'. Then he left the room."
# JavaScript/Reserved words

In JavaScript, some tokens (words) have a special semantic (meaning). Therefore they cannot be used as names of variables, functions, classes, etc. Some of them are generally reserved words; others are reserved only in a special context; others are reserved for possible future usage without having a special functionality nowadays; others have been defined in outdated ECMAScript versions of the years 1997 - 99.
The list of such special words as of 2022 follows. For some of the words, we offer further information.
* abstract
* await
* boolean
* break
* byte
* case
* catch
* char
* class
* const
* continue
* debugger
* default
* delete
* do
* double
* else
* enum
* export
* extends
* false
* final
* finally
* float
* for
* function
* goto
* if
* implements
* import
* in
* instanceof
* int
* interface
* let
* long
* native
* new
* null
* package
* private
* protected
* public
* return
* short
* static
* super
* switch
* synchronized
* this
* throw
* throws
* transient
* true
* try
* typeof
* var
* void
* volatile
* while
* with
* yield
Furthermore, there are predefined methods like forEach, predefined modules like Math, or predefined objects like BigInt whose names should be avoided also.

## References

* ↑ ECMA: Keywords
* ↑ MDN: Keywords
# JavaScript/Reserved words/do
## The do keyword

The do … while statements executes a loop until the condition in the while statement is reached.

### Examples
## See also

* while
# JavaScript/Relation to other languages

If you have programming experience or training with another language, learning JS will be easier and more difficult at the same time. Especially the fact that JS is a member of the C-family languages (C, C++, Java, ...) may help and confuse simultaneously. It uses the common syntax but implements concepts that differ from the other family members. Therefore it might entice you with this C- or Java-like syntax. Underneath, it is an entirely different beast. The semantic and design are influenced by the programming languages Self and Scheme.
The easy part for C or Java programmers will be picking up the syntax. Most parts of the flow control, logic, and arithmetic are the same. After diving deeper into the language, you will notice the differences. Here are some distinctions to Java.

### Behavior of Variables

Starting with the obvious, JS is a loosely typed language. There are several implications for this:
* Integers and floats are both represented by 64-bit floating point numbers (but crazily enough, bitwise operations are still available and sometimes faster).
* You may change a variable's type at will.
* Objects consist of key/value pairs, labeled 'properties'. Values can be changed, and complete properties can be added or removed from an object at will.
The list goes on, and we are granted extraordinary powers to do wonderful and sometimes incredibly stupid things whilst programming. So it's very important to keep sober-minded when attempting to harness the power of the dynamic variables.

### Scope of Variables

* From module to module: In Java the key-words public, private, and protected defines the visibility of variables to other modules (classes). In JS there is only the simple export/import resp. module.exports/require mechanism.
* Within a module: In JS the visibility within a module is defined by the key-words var(outdated, don't use it anymore), let, and const. Java knows the keyword var too, but its semantic is a little different. The JS const is equivalent to Java's final.
* Within blocks: 'Blocks' are code sequences surrounded with brackets { }. The visibility of variables concerning blocks is identical in JS (using let or const) and Java: The variables are visible within the defining block and the included blocks but not outside of the defining block.
* Closure: A closure is an - anonymous or named - function that can refer to variables of its enclosing context. In this case, the function 'sees' the variable's value as of the moment the function was created but not as of the later moment when it is called. JS has used this concept since its early days. Java uses similar but not identical technics to access variables of outer context: inner classes and lambda expressions.

### Classes

Unlike Java, JS is a classless language. Instead, JS uses prototypes to implement object-oriented features like inheritance. Classes can be simulated, but it is only 'syntactically sugar', and if you remove the idea of classes from your head, the learning process will become easier.
# JavaScript/Removing elements

HTML pages and DOM objects are hierarchically structured. Every element and attribute belongs to exactly one parent. To delete an element or attribute, first, you must locate the parent element. The remove operation can be done on this object.

## Remove elements

Elements are removed with the removeChild function. To delete the <p> element from the <div> element in the following example
the JavaScript code is ...
... and the remaining HTML structure will be

### Children of children

If an element is removed, all of its children are removed as well. By this, you can remove huge parts of the DOM with one command if they have a common root. E.g., remove a complete list:
The JavaScript fragment removes the <ul> element as well as all <li> elements.

### parentNode

To remove an element, you need to know its parent element. If you can locate only the child, but for some reason, not the parent, the child's property parentNode shows you the way.

## Remove attributes

Attributes are removed with the removeAttribute function. To delete the href attribute from the <a> element in the following example
the JavaScript code is:
The element itself, including the text of the link, keeps alive, but you cannot navigate anymore.

## See also

* MDN Remove Child
* MDN Remove Attribute
# JavaScript/Reserved words/break
## The break keyword

The break keyword interrupts a loop immediately.

### Examples
## See also

* continue
* for
* do … while
# JavaScript/Reserved words/catch
## The catch keyword

The catch keyword is used as part of the try statement.

### Examples
## See also

* finally
* throw
* try
# JavaScript/Reserved words/continue
## The continue keyword

The continue keyword interrupts the loop immediately, going to the starting line as if the loop had been finished to the end and incrementing the loop variable, if any.

### Examples
## See also

* break
* for
# JavaScript/Reserved words/case
## The case keyword

The case keyword is used in the switch statement that is an alternative for complex if … else if … else statements.

### Examples
## See also

* break
* default
* switch
# JavaScript/Reserved words/else
## The else keyword

The else keyword creates a clause inside the if statement. It is optional end executes only if all other if … else if blocks do not execute.

### Examples
## See also

* else
# LMIs in Control/pages/hinfinityoptimalobserver

$H\infty$-Optimal observers yield robust estimates of some or all internal plant states by processing measurement data. Robust observers are increasingly demanded in industry as they may provide state and parameter estimates for monitoring and diagnosis purposes even in the presence of large disturbances such as noise etc. It is there where Kalman filters may tend to fail. State observer is a system that provides estimates of internal states of a given real system, from measurements of the inputs and outputs of the real system. The goal of $H_{\infty }$ -optimal state estimation is to design an observer that minimizes the $H_{\infty }$ norm of the closed-loop transfer matrix from w to z.

## The System

Consider the continuous-time generalized plant $P$ with state-space realization
    ${\begin{aligned}{\dot {x}}&=Ax+B_{1}w,\\y&=C_{2}x+D_{21}w\\\end{aligned}}$

## The Data

The matrices needed as input are $A,B_{1},B_{2},C_{2},D_{21},D_{11}$.

## The Optimization Problem

The observer gain $L$ is to be designed such that the $H\infty$ of the transfer matrix from w to z, given by
    ${\begin{aligned}T(s)=C_{1}(s1-(A-LC_{2}))^{-1}(B_{1}-LD_{21})+D_{11}\\\end{aligned}}$
is minimized. The form of the observer would be:
    ${\begin{aligned}{\dot {\hat {x}}}=A{\hat {x}}+L(y-{\hat {y}}),\\{\hat {y}}=C_{2}{\hat {x}}\\\end{aligned}}$

## The LMI: $H_{\infty }$ Optimal Observer

The $H\infty$-optimal observer gain is synthesized by solving for $P\in \mathbb {S} ^{n_{x}},G\in \mathbb {R} ^{n_{x}\times n_{y}}$, and $\gamma \in \mathbb {R} _{>0}$ that minimize $\zeta (\gamma )=\gamma$ subject to $P>0$ and
       ${\begin{aligned}{\begin{bmatrix}PA+A^{T}P-GC_{2}-{C_{2}}^{T}G^{T}&&PB_{1}-GD_{21}&&C_{1}\\\star &&-\gamma 1&&{D_{11}}^{T}\\\star &&\star &&-\gamma 1\end{bmatrix}}<0\\\end{aligned}}$

## Conclusion:

The $H_{\infty }$ -optimal observer gain is recovered by $L=P^{-1}G$ and the $H_{\infty }$ norm of T(s) is $\gamma$.

## Implementation

Link to the MATLAB code designing $H\infty$- Optimal Observer
https://github.com/Ricky-10/coding107/blob/master/HinfinityOptimalobserver

# 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/pages/systemzeroswithoutfeedthrough

Let's say we have a transfer function defined as a ratio of two polynomials: ${\begin{aligned}H(s)={\frac {N(s)}{D(s)}}\\\end{aligned}}$ Zeros are the roots of N(s) (the numerator of the transfer function) obtained by setting $N(s)=0$ and solving for s.The values of the poles and the zeros of a system determine whether the system is stable, and how well the system performs. Similarly, the system zeros are either real or appear in complex conjugate pairs. In the case of system zeros without feedthrough, we take the assumption that $D=0$.

## The System

Consider a continuous-time LTI system, $G$ , with minimal statespace representation $(A,B,C,0)$
       ${\begin{aligned}{\dot {x}}(t)=Ax(t)+Bu(t)\\y(t)=Cx(t)\end{aligned}}$

## The Data

The matrices:
    ${\begin{aligned}A\in \mathbb {R} ^{n\times n}\\M\in \mathbb {R} ^{n\times q}\\N\in \mathbb {R} ^{q\times n}\\\end{aligned}}$

## The LMI: System Zeros without feedthrough

The transmission zeros of $G(s)=C(sI-A)^{-}1B$ are the eigenvalues of $NAM$, where $N\in \mathbb {R} ^{q\times n},M\in \mathbb {R} ^{n\times q},CM=0,NB=0,NM=1.$. Therefore , $G(s)$ is a minimum phase if and only if there exists $P\in \mathbb {S} ^{q}$, where $P>0$ such that
       ${\begin{aligned}PNAM+M^{T}A^{T}N^{T}P<0\end{aligned}}$

## Conclusion:

If P exists, it ensures non-minimum phase. Eigenvalues of NAM then gives the zeros of the system.

## Implementation

https://github.com/Ricky-10/coding107/blob/master/Systemzeroswithoutfeedthrough

## 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.
* 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.
* Control_Systems/Poles_and_Zeros
# LMIs in Control/pages/systemzeros through feedthrough

Let's say we have a transfer function defined as a ratio of two polynomials: ${\begin{aligned}H(s)={\frac {N(s)}{D(s)}}\\\end{aligned}}$ Zeros are the roots of N(s) (the numerator of the transfer function) obtained by setting $N(s)=0$ and solving for s.The values of the poles and the zeros of a system determine whether the system is stable, and how well the system performs. Similarly, the system zeros are either real or appear in complex conjugate pairs. In the case of system zeros without feedthrough, we take the assumption that $D=0$.

## The System

Consider a continuous-time LTI system, $G$ , with minimal statespace representation $(A,B,C,0)$
       ${\begin{aligned}{\dot {x}}(t)=Ax(t)+Bu(t)\\y(t)=Cx(t)\end{aligned}}$

## The Data

The matrices:
    ${\begin{aligned}A\in \mathbb {R} ^{n\times n}\\M\in \mathbb {R} ^{n\times q}\\N\in \mathbb {R} ^{q\times n}\\\end{aligned}}$

## The LMI: System Zeros without feedthrough

The transmission zeros of $G(s)=C(sI-A)^{-}1B$ are the eigenvalues of $NAM$, where $N\in \mathbb {R} ^{q\times n},M\in \mathbb {R} ^{n\times q},CM=0,NB=0,NM=1.$. Therefore , $G(s)$ is a minimum phase if and only if there exists $P\in \mathbb {S} ^{q}$, where $P>0$ such that
       ${\begin{aligned}PNAM+M^{T}A^{T}N^{T}P<0\end{aligned}}$

## Conclusion:

If P exists, it ensures non-minimum phase. Eigenvalues of NAM then gives the zeros of the system.

## Implementation

https://github.com/Ricky-10/coding107/blob/master/Systemzeroswithoutfeedthrough

## 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.
* 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.
* Control_Systems/Poles_and_Zeros
# LMIs in Control/pages/systemzeroswithfeedthrough

Let's say we have a transfer function defined as a ratio of two polynomials: ${\begin{aligned}H(s)={\frac {N(s)}{D(s)}}\\\end{aligned}}$ Zeros are the roots of N(s) (the numerator of the transfer function) obtained by setting $N(s)=0$ and solving for s.The values of the poles and the zeros of a system determine whether the system is stable, and how well the system performs. Similarly, the system zeros are either real or appear in complex conjugate pairs. In the case of system zeros with feedthrough, we take $D$ as full rank.

## The System

Consider a continuous-time LTI system, $G$ , with minimal statespace representation $(A,B,C,D)$
       ${\begin{aligned}{\dot {x}}(t)=Ax(t)+Bu(t)\\y(t)=Cx(t)+Du\end{aligned}}$

## The Data

The matrices needed as inputs are:
    ${\begin{aligned}A\in \mathbb {R} ^{n\times n}\\B\in \mathbb {R} ^{n\times m}\\N\in \mathbb {R} ^{p\times n}\\\end{aligned}}$
In this case, $m\leq p$

## The LMI: System Zeros with feedthrough

The transmission zeros of $G(s)=C(sI-A)^{-}1B+D$ are the eigenvalues of $A-B(D^{T}D)^{-1}D^{T}C$. Therefore , $G(s)$ is a minimum phase if and only if there exists $P\in \mathbb {S} ^{q}$, where $P>0$ such that
       ${\begin{aligned}P(A-B(D^{T}D)^{-1}D^{T}C)+(A-B(D^{T}D)^{-1}D^{T}C)^{T}P<0\\\end{aligned}}$

## Conclusion:

If P exists, it ensures non-minimum phase. Eigenvalues of $A-B(D^{T}D)^{-1}D^{T}C$ then gives the zeros of the system.

## Related LMIs

LMIs_in_Controls/pages/systemzeroswithoutfeedthrough

## Implementation

https://github.com/Ricky-10/coding107/blob/master/systemzeroswithfeedthrough

## 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.
* 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.
* Control_Systems/Poles_and_Zeros