OpenLLM-France/wikimedia huggingface dataset:
# Common Pronouns

In Hawaiian, pronouns are called Papani. Papani, as in English are people, being I, You, We, etc. I suppose the first, and most obvious pronouns that you should learn, would be, I, you (singular) and he/she/it.
| English | Hawaiian |
| I | Au |
| You | 'Oe |
| He or She | 'O ia |
Note how 'O ia is two words and not one; it is never one word.

## Aia Sentences

Most Hawaiian sentences resemble a squid, having three parts; the head- po'o, the connector- piko, and the tentacles- 'awe. The head represents the main idea of that sentence, the connector being the subject, and the tentacles are the rest of the sentence. An aia sentence is a location sentence in Hawaiian. It describes when or where something is. These sentences are so called because they always start with the word, aia. Its closest translation in English would be to be. (am, is, are, etc.)

### Practice

| Aia au ma ke kula. | I am at (the) school. |
| Aia 'oe me ke keiki. | You are with the child. |
| Aia ke luau i kēia lā. | The luau is today. |

### More Pronouns

The next pronouns that one must learn, are as follows:
| English | Hawaiian |
| we | kākou |
| you all | 'oukou |
| they | lākou |
Note how they all ends in -kou, and we and they both end in -ākou. It is important that the student make these type of connections when studying, so that the information gets permanently located in their memory. Also, all of these pronouns refer to three or more people; Hawaiian has different sets of pronouns that can be used, depending on the situation, but we will explain those later.

## Practice

| Nani lākou. | They are pretty. |
| Nui 'oukou. | You all are big. |
| E Kanani, ma'i kākou. | Kanani, we are sick. |
# Hawaiian Monarchs/Kamehameha I

Kamehameha I (c. 1758–May 8, 1819), united all the Hawaiian Islands together to form the Kingdom of Hawaii in 1810.

## Early Life

No one is quite sure exactly what year Kamehameha was born. Hawaiians did not have a written language before the 1800s. Some say Kamehameha was born in 1758 because that is the year Halley’s comet was seen in Hawaii. According to a prophecy, a fiery light in the sky would come before the birth of a “killer of chiefs”. Alapa’i, the chief of the island of Hawai’i, heard about this prophecy and ordered the baby Kamehameha to be killed. Kamehameha’s parents, Chief Keōua and Chiefess Kekuʻiapoiwa, secretly gave him to a trusted friend Nae’ole to take care of him and keep him safe from Chief Alapa’i. Five years later, Chief Alapa’i decided that maybe Kamehameha would not kill him and invited him back to live with his family.

## Unifying the Islands

When Kamehameha was 14, he overturned the Naha Stone. According to legend, only someone from the royal Naha family could move the stone. Whoever lifted the Naha Stone, would be the one to unite all of the Hawaiian Islands. Even though Kamehameha was not from the Naha family, he lifted and overturned the stone. Today, you can see the Naha Stone in front of the Hilo Public Library. From 1782 until 1810, Kamehameha fought many battles to conquer each of the Hawaiian islands. First, he defeated his cousin Kiwala’o and Chief Keawemaʻuhili who ruled the island of Hawai’i. Next, he defeated Chief Kalanikupule who ruled Maui and ‘Oahu. Kamehameha tried several times to attack Chief Kaumualiʻi of Kauai but was unsuccessful. Chief Kaumuali’i seeing there was no way to stop Kamehameha’s powerful army, offered to surrender Kauai and Ni’ihau.

## Wives and Children

King Kamehameha had many wives. His favorite wife was Kaahumanu. Kaahumanu had no children of her own but she hanai adopted Kamehameha’s son Liholiho. Kaahumanu was a strong political figure and even when Liholiho became King Kamehameha II she became his regent. A regent is someone who rules for someone else who is too young to rule. Keōpūolani was Kamehameha’s highest ranking wife. She had at least three children. Liholiho and Kauikeaouli were her sons. They would become Kamehameha II and Kamehameha III. Nāhiʻenaʻena was her daughter. Her other children died when they were very young.

## Death

Kamehameha died on May 8, 1819. Following Hawaiian customs, his bones were hidden by two of his most trusted friends. Even today no one knows where his body was buried.
After Kamehameha died, Liholiho became King Kamehameha II.

## See Also

* Wikipedia:Kamehameha I

## References

* Wong and Rayson (1987). Hawaii's Royal History. Bess Press. ISBN 0935848487

## Links

* History of King Kamehameha I
# Hawaiian/Lesson Two Quiz

For this quiz, the following table will help you as your "cheat sheet". Practice on memorizing the vocabulary, and remember, this is only a quiz.
Personal pronouns :
| | | | Singular (1) | Singular (1) | Singular (1) | Dual (2) | Dual (2) | Dual (2) | Dual (2) | Plural (3+) | Plural (3+) | Plural (3+) | Plural (3+) |
| | | | 1st | 2nd | 3rd | incl. | excl. | 2nd | 3rd | 1st incl. | 1st excl. | 2nd | 3rd |
| Case | Nominative | Nominative | au | 'oe | ia | kāua | māua | 'olua | lāua | kākou | mākou | 'oukou | lākou |
| Case | Genitive | a-class | ka'u | kāu | kāna | kā kāua | kā māua | kā 'olua | kā lāua | kā kākou | kā mākou | kā 'oukou | kā lākou |
| Case | Genitive | o-class | ko'u | kou | kōna | kō kāua | kō māua | kō 'olua | kō lāua | kō kākou | kō mākou | kō 'oukou | kō lākou |
| Case | Genitive | affectionate | ku'u | kō | Only used in 1st and 2nd person singular. | Only used in 1st and 2nd person singular. | Only used in 1st and 2nd person singular. | Only used in 1st and 2nd person singular. | Only used in 1st and 2nd person singular. | Only used in 1st and 2nd person singular. | Only used in 1st and 2nd person singular. | Only used in 1st and 2nd person singular. | Only used in 1st and 2nd person singular. |
| Case | Accusative, Dative | Accusative, Dative | ia'u | iā 'oe | iā ia | iā kāua | iā māua | iā 'olua | iā lāua | iā kākou | iā mākou | iā 'oukou | iā lākou |
Remember!!! Capitalize and punctuate all sentences.
Also!!! When you want to write a kahakō, (the line over a vowel making it longer) just add slashes around the letter you wish to lengthen. Ex: for "ā", write "/a/". Kāne=K/a/ne. etc.
Important!!! Did I remind you to punctuate all sentences?
# GLPK/GLPK file extensions

GLPK normally uses the following file extensions to indicate the various file types it uses.
| Ext | Description | Typical usage |
| ac | automake/autoconf configure definitions | installation |
| am | automake/autoconf makefile definitions | installation |
| bat | DOS/Windows batch file | installation |
| c | C implementation | GLPK source |
| cs | C# implementation | application programming |
| csv | comma separated values | data |
| dat | GNU MathProg data | GLPSOL |
| dbf | dBASE database (dBASE III/IV, FoxPro, etc.) | data |
| glp | GLPK problem format | model |
| glpk | GLPK problem format | model |
| h | C header (also C++ header) | GLPK source |
| in | automake/autoconf generated make or conf output | installation |
| log | terminal capture | various |
| lp | CPLEX LP format | model |
| m4 | M4 preprocessor file | installation |
| mod | GNU MathProg model (can also contain data) | GLPSOL |
| mps | MPS mathematical program (fixed format or free format) | model |
| out | GLPSOL solution in printable format | GLPSOL |
| sh | shell script | installation |
| sif | SIF standard input format (augmented MPS) | model |
| sol | GLPSOL solution in plain text format | GLPSOL |
| sql | structured query language data | data |
Documentation formats are excluded from this list.
# GLPK/Go

Go is an open source programming language.
A Go language binding for GLPK has been published at https://github.com/lukpank/go-glpk.
According to the author the binding is not yet complete but covers a useful part of the API .
# GLPK/GMPL Workarounds

This page offers alternative constructions for features that are not specifically supported by GMPL (MathProg).

## If–then–else conditional

GLPK does not provide an IF–THEN–ELSE syntax, often useful when post-processing results. Instead use the following syntax:
The {0} could be replaced by any set with one element. The for statement will iterate only once over the expression inside the subsequent braces.
The following minimal example creates output with differing line formats, dependent on whether a number is even or odd:

## Sorted output

It may be desirable to output a sorted sequence. The following example shows how:

## Mimicking an AMPL defined variable

The AMPL language has a construct called defined variables.
A defined variable consists of a variable declaration with an equals sign and a term on the right-hand side. Take for example:
Here f is a defined variable. The statement above does not actually declare a structural variable but rather works like a kind of a macro — so that each occurrence of f[k] is replaced by:
This construct is not supported in GMPL. But you can use a structural variable and a constraint instead to achieve the same effect — the downside being that this formulation may render your problem harder to solve:

## Sets of sets

Sets of sets do not exist in GMPL. Instead an indexing set and an indexed set can be used. The example below shows how to enumerate all subsets of given size of a superset.

## References

* ↑ Fourer, Robert; Gay, David M.; Kerningham, Brian W. (2002). AMPL : a modeling language for mathematical programming (2nd ed.). Duxbury Press. p. 131. ISBN 978-0534388096. Available as a downloadable PDF.
# GLPK/Graphical Output

This section discusses the use of third-party utilities to visualize aspects of a particular GLPK instance, including:
* the problem (being a representation of the underlying model)
* its solution (or the results more generally)
* the progress of the solver (in real-time or after completion).
The following methods have been successfully used:
* run a gnuplot script to interpret standard GLPK results
* run an R script to interpret standard GLPK results
* run an Using R Graphics for LP Dashboard script to interpret standard GLPK results
* print SVG output from GLPK — and display using a contemporary web browser or SVG editor (say Inkscape)
* print dot language output from GLPK — then process using graphiz and display in an SVG or PNG viewer
Some of these methods can (and perhaps have been) built into GLPK-specific IDEs, thereby relieving the user of the associated manual processing.
The following sub-chapters discuss some of these approaches in detail:
* graphical output using SVG
* graphical output using gnuplot

# References

* ↑ graphviz
# GLPK/Haskell

Haskell is a functional programming language. Several intepreters and compilers are offered..

## Glpk-hs

Package glpk-hs developed by Louis Wasserman provides a Haskell language binding for GLPK.

## Hmatrix

Hmatrix provided by Alberto Ruiz contains a Haskell binding for GLPK.

## References

* ↑ "Implementations - Haskell Wiki". 2012-03-12. Retrieved 2012-05-02.
# GLPK/Gnuplot

Gnuplot is a program for generating two and three dimensional plots of functions, data, and data fits. Gnuplot is published under the GNU General Public License.

## 2D histogram

Gnuplot expects data for histograms to be in multiple columns.
The following example is based on examples/transp.mod from the GLPK source distribution:
The above MathProg statements (inserted before the data statements of transp.mod and saved as a file named transp1.mod) will create, using the command glpsol --math transp1.mod, the following content in the file transp1.dat:
Using gnuplot, a histogram of transp1.dat can be drawn and then saved as a PNG image:
The above commands can either be hand entered into an interactive gnuplot session. Invoke gnuplot from the command-line to start such a session. Alternatively, the same commands can be saved in a text file transp1.gp and then run as a script from within gnuplot:
Finally, check the resulting transp1.png with any bitmap viewer, perhaps gthumb:

## 3D histogram

Gnuplot does not directly support native 3D histograms. Surfaces with rectangular grids can be passed to gnuplot using the following rules:
* provide one text line per point, with each field separated by a space
* consecutive points of one raster line should be on consecutive text lines
* place a blank text line between points of consecutive raster lines.
To create a 3D histogram it is necessary to provide the 4 corner points of each pillar of the histogram. The following example is again based on examples/transp.mod:
As before, a 3D histogram of transp2.dat can be drawn using gnuplot and saved as a PNG image:
# GLPK/GLPK change log

This page contains the change log for the official GLPK project. It spans GLPK 1.0 / 20 Oct 2000 to the present and is based on the ChangeLog file.
Note: the GLPK release information log is something different.
# GLPK/GLPK release information

This page contains release information for the official GLPK project. It spans GLPK 2.0 / 25 Jan 2001 to the present and is based on the NEWS file.
Note: the GLPK change log is something different.
# GLPK/GMPL Examples

There are a number of small and full-scale examples bundled with the official GLPK documentation. See the examples directory.
This Wikibook is not the place to duplicate that material verbatim. Rather this Wikibook seeks to provide smaller-scale representative examples with a greater level of explanation — in other words, the focus is on tutorial-style presentation.

## List of topics

* Knapsack problem — a classic packing problem from operations research
* Electricity markets — electricity sector liberalization
* Portfolio optimization — financial mathematics
# The Basics

Shortcut: I
Scissors is an interesting selection tool. It has some features of lasso, some features of paths tool and some of its own. It is useful for selecting a region defined by strong colour changes at the edges. To use scissors, you need to create a set of 'control nodes' (also referred to as anchors), at the edges of the region you are willing to select. The tool creates a curve through these nodes, following any high-contrast it can find. Each time you press left mouse button, you create a new anchor that is connected to the last control node by a curve. If you want to finish the selection, just press on the first node you've created. After that you can adjust the selection by modifying the curves or by moving/creating new nodes. When you are satisfied just press anywhere inside of the selection to create it.
   * Modes - determines the way of creating the selection, whether it'll be combined with existing one and such
   * Antialiasing - causes the boundary of the selection to be drawn smoother
   * Feather edge - causes the boundary of the selection to be blurred
   * Interactive boundary - the curves will be created instantly after creating a new node

## Modes, Antialiasing and Feather Edges

    See Selection Tools#Modes for information about Modes
    See Selection Tools#Antialiasing for information Antialiasing
    See Selection Tools#Feather Edges for information about Feather Edges option

## Interactive boundary

When this option is active, the curves between nodes will be really curves. Normally (when the option is disabled) there will be only straight lines until you finish the selection.
← Selection by Colour · Foreground Select →
# GLBasic Programming

Welcome, reading this WikiBook! The GLBasic Language is used in GLBasic, a program that makes programs with OpenGL and BASIC for very much operating systems BUT it's different programming than OpenGL and BASIC. That's why I have written this book. So that you can learn how to program GLBasic in a very easy way!

## Learning

Here are all the things to learn about GLBasic:

### BASIC

* Your First Program
* PRINT, CLEARSCREEN, and END
* Variables and Data Types
* User Input
* IF...THEN...ELSEIF...ELSE
* WHILE...WEND
* FOR...NEXT
* DO...LOOP
* GOTO
* Random Number Generation
* Subroutines and Functions
* Image Import

### OpenGL

* First Program
* Transparency
* Attributes, Varying and Uniforms
* Positioning and Rotating
Warning! The next stuff is only for full version!
* A Cube, Plus a Camera
* Displaying a Wooden Cube
If the pages are not ready made, it is to do!
# GIMP/Sharpening

More information coming soon!
# GIMP/Zoom Tool

Shortcut: Z
The zoom tool is used for magnifying a selected part of the image.
The first option is called Auto-resize window. By default it's disabled. By enabling it, it will resize the window according to the size of the magnified area.
Underneath are two other options, for zooming in or out. As mentioned later, you can toggle between those two using a keyboard shortcut.
By selecting an area of the image, you can zoom in/out on that area.

#### Key Modifiers (defaults)

Ctrl - changes direction of zooming.
Ctrl + Mouse Wheel - spinning the mouse wheel, without clicking, varies the zoom (the zoom tool does not need to be selected for this).
← Colour Picker · Measure Tool →
# The Basics

Shortcut: Shift + O
Select by colour works really similar to the Fuzzy Selection tool. The main difference is that when magic wand makes selection with no real gaps, selection by colour takes all the pixels with similar colour, regardless to where they are located.
   * Modes - determines the way of creating the selection, whether it'll be combined with existing one and such
   * Antialiasing - causes the boundary of the selection to be drawn smoother
   * Feather edge - causes the boundary of the selection to be blurred
   * Select transparent areas - gives the ability to select areas completely transparent
   * Sample merged - creates a selection from actual image, instead from the active layer
   * Threshold - determines the range of colours
   * Select by - select, which component shall be used for calculating the similarity

## Modes, Antialiasing and Feather Edges

    See Selection Tools#Modes for information about Modes
    See Selection Tools#Antialiasing for information Antialiasing
    See Selection Tools#Feather Edges for information about Feather Edges option

## All other options

See Fuzzy Selection for information about the tool as everything works completely (or almost completely) the same.
← Fuzzy Selection · Scissors →
# GIMP/Unsharp Mask

The Unsharp Mask filter performs a better job than the standard Sharpen filter by applying the sharpening selectively to a blurred version. Unsharp Mask tends to leave noisy sections of the image untouched.
Sharpening is a very desirable effect on blurry images or those which have been rescaled. Things are naturally sharp in your vision.
Note that the Unsharp Mask, like all other sharpening methods, will produce an aura around the edges if set too high.

## Sharpening Basics

Unsharp mask increases the apparent sharpness of image by increases the contrast around edges. Dark patches near lighter areas get darker, and light patches near dark areas get lighter.

## Filter Settings

Radius: The radius of the blur before the filtering. Where a value very low (0.1) will get similar effects as the standard sharpening filter, setting this higher removes noise and increases the contrast of the sharpening. Setting the blur radius too high, however, will have an effect similar to the Posterize tool.
Amount: The amount of sharpening to apply to the image. A useful value other than the default is 0.35, where it's usually not enough to produce a significant aura on edges.
Threshold: Helpful when the picture you are working with is very noisy. To avoid sharpening of noise in the image you can set the threshold level higher.
← Pixelize · Fractal Explorer →
# Engineering Tables/DTFT Transform Properties

| Property | Time domain $x[n]\!$ | Frequency domain $X(\omega )\!$ | Remarks |
| Linearity | $ax[n]+by[n]\!$ | $aX(e^{i\omega })+bY(e^{i\omega })\!$ | |
| Shift in time | $x[n-k]\!$ | $X(e^{i\omega })e^{-i\omega k}\!$ | integer k |
| Shift in frequency | $x[n]e^{ian}\!$ | $X(e^{i(\omega -a)})\!$ | real number a |
| Time reversal | $x[-n]\!$ | $X(e^{-i\omega })\!$ | |
| Time conjugation | $x[n]^{*}\!$ | $X(e^{-i\omega })^{*}\!$ | |
| Time reversal & conjugation | $x[-n]^{*}\!$ | $X(e^{i\omega })^{*}\!$ | |
| Derivative in frequency | ${\frac {n}{i}}x[n]\!$ | ${\frac {dX(e^{i\omega })}{d\omega }}\!$ | |
| Integral in frequency | ${\frac {i}{n}}x[n]\!$ | $\int _{-\pi }^{\omega }X(e^{i\vartheta })d\vartheta \!$ | |
| Convolve in time | $x[n]*y[n]\!$ | $X(e^{i\omega })\cdot Y(e^{i\omega })\!$ | |
| Multiply in time | $x[n]\cdot y[n]\!$ | ${\frac {1}{2\pi }}X(e^{i\omega })*Y(e^{i\omega })\!$ | |
| Correlation | $\rho _{xy}[n]=x[-n]^{*}*y[n]\!$ | $R_{xy}(\omega )=X(e^{i\omega })^{*}\cdot Y(e^{i\omega })\!$ | |
Where:
* $*\!$ is the convolution between two signals
* $x[n]^{*}\!$ is the complex conjugate of the function x[n]
* $\rho _{xy}[n]\!$ represents the correlation between x[n] and y[n].
# Engineering Tables/DFT Transform Properties

| | Periodic Sequence (Period N) | DFS Coefficients (Period N) |
| Notation | ${\tilde {x}}[n]$ | ${\tilde {x}}[k]$ periodic with period N |
| Linearity | $a_{1}{\tilde {x}}_{1}[n]+a_{2}{\tilde {x}}_{2}[n]\$ | $a_{1}{\tilde {X}}_{1}[k]+a_{2}{\tilde {X}}_{2}[k]\$ |
| | ${\tilde {X}}[n]$ | $N{\tilde {x}}[-k]$ |
| Time shifting | ${\tilde {x}}[n-m]\$ | $W_{N}^{km}{\tilde {X}}[k]\$ |
# Engineering Tables/DFT Transform Table

| Time-Domain x[n] | Frequency Domain X[k] | Notes |
| $x_{n}\equiv {\frac {1}{N}}\sum _{k=0}^{N-1}X_{k}\cdot e^{i2\pi kn/N}$ | $X_{k}\equiv \sum _{n=0}^{N-1}x_{n}\cdot e^{-i2\pi kn/N}$ | DFT Definition |
| $x_{n}\cdot e^{i2\pi kn/N}\,$ | $X_{n-k}\,$ | Shift theorem |
| $x_{n-k}\,$ | $X_{k}\cdot e^{-i2\pi kn/N}$ | Shift theorem |
| $x_{n}\in \mathbf {R}$ | $X_{k}=X_{N-k}^{*}\,$ | Real DFT |
| $a^{n}\,$ | ${\frac {1-a^{N}}{1-a\cdot e^{-i2\pi k/N}}}$ | |
| ${N-1 \choose n}\,$ | $\left(1+e^{-i2\pi k/N}\right)^{N-1}\,$ | |
# Engineering Tables/DTFT Transform Table

| Time domain $x[n]\,$ where $n\in \mathbb {Z}$ | Frequency domain $X(e^{j\omega })$ where $\omega \in \mathbb {R}$ | Remarks |
| ${\frac {1}{2\pi }}\int _{-\pi }^{\pi }{X\left(e^{j\omega }\right)}e^{j\omega n}d\omega$ | $\sum _{n=-\infty }^{\infty }{x[n]e^{-j\omega n}}$ | Definition |
| $x[n]={\begin{cases}1,&|n|\leq M\\0,&{\text{otherwise}}\end{cases}}$ | ${\frac {\sin \left(\omega \left({\frac {2M+1}{2}}\right)\right)}{\sin \left({\frac {\omega }{2}}\right)}}$ | |
| $\alpha ^{n}u\left[n\right]$ | ${\frac {1}{1-\alpha e^{-j\omega }}}$ | |
| $\delta [n]$ | $1\!$ | Here $\delta [n]$ represents the delta function which is 1 if $n=0$ and zero otherwise. |
| $u[n]={\begin{cases}0&{\text{for }}n<0\\1&{\text{for }}n\geq 0\end{cases}}$ | ${\frac {1}{1-e^{-j\omega }}}+\pi \sum _{p=-\infty }^{\infty }{\delta \left(\omega -2\pi p\right)}$ | |
| ${\frac {1}{\pi n}}\sin \left(Wn\right),\;\;\;\;0<W\leq \pi$ | $X(e^{j\omega })={\begin{cases}1,&|\omega |\leq W\\0,&W<|\omega |\leq \pi \end{cases}}$ | $X(e^{j\omega })$ is 2π periodic |
| $(n+1)\alpha ^{n}u\left[n\right]$ | ${\frac {1}{(1-\alpha e^{-j\omega })^{2}}}$ | |