OpenLLM-France/wikimedia huggingface dataset:
# French Revolution/Causes
## Causes

The Causes of the French Revolution were the significant historical factors that led to the revolution of 1789 in France.
Although France in 1785 faced economic difficulties, mostly concerning the equitability of taxation, it was one of the richest and most powerful nations of Europe. The French people also enjoyed more political freedom and a lower incidence of arbitrary punishment than any of their fellow Europeans. However, Louis XVI, his ministers, and the widespread French nobility had become immensely unpopular. This was a consequence of the fact that peasants and, to a lesser extent, the bourgeoisie, were burdened with ruinously high taxes levied to support wealthy aristocrats and their sumptuous, often gluttonous, lifestyles.
The fall of the ancien régime in France may be blamed, in part, on its own rigidity. Aristocrats were confronted by the rising ambitions of the merchants, tradesmen and prosperous farmers, who were allied with aggrieved peasants, wage-earners and intellectuals influenced by the ideas of Enlightenment philosophers. As the revolution proceeded, power devolved, from the monarchy and the privileged-by-birth, to more-representative political bodies, like legislative assemblies, but conflicts among the formerly allied republican groups became the source of considerable discord and bloodshed.
A growing number of the French citizenry had absorbed the ideas of "equality" and "freedom of the individual" as presented by Voltaire, Denis Diderot, Turgot, and other philosophers and social theorists of the Enlightenment. The American Revolution demonstrated that it was plausible for Enlightenment ideas on how a government should be organized to be put into actual practice. Some American diplomats, like Benjamin Franklin and Thomas Jefferson, had lived in Paris where they consorted freely with members of the French intellectual class. Furthermore, contact between American revolutionaries and the French troops who served as anti-British mercenaries in North America helped spread revolutionary ideals to the French people. After a time, many of the French began to attack the undemocratic nature of their own government, push for freedom of speech, challenge the Roman Catholic Church, and decry the prerogatives of the nobles.
Revolution was not due to a single event but to a series of events, that together irreversibly changed the organization of political power, the nature of society, and the exercise of individual freedoms.
# French Revolution/Images

* The Storming of the Bastille
* Ludwig XVI
* The Third Estate carrying the other estates
* The Estates General
* The Oath of the Tennis Court
* Declaration of the Rights of Man and of the Citizen
* Women's March on Versailles
* Monks and Nuns exercising their new freedoms
* Fête de la Fédération
* Storming of the Tuileries
* War in the Vendée
* Napoleon Bonaparte in the Coup D'etat of 18 Brumaire in Saint-Cloud.
* A sans-culotte
# French Revolution
## General

This Wikibook was constructed for the course Educational Technologies at the Master Program of Educational Sciences. The aim was to create a book that refers to the French Revolution and to be a useful tool both for teachers and for students. Enjoy reading!

## Table of contents

* Causes
* Battles
* Results
* Effects
* Images
* Videos
* Exercises
# French History
## Table of contents

* Gaul
* Franks
** Merovingian Dynasty
** Carolingian Dynasty
* Middle Ages
** Capetian Dynasty
* Valois Dynasty
** Hundred Years War
** French Wars of Religion
* Bourbon Dynasty
** Grand Alliance
* French Revolution
* First French Empire
* French Restoration
* Second Republic
* Second French Empire
** Crimean War
** Franco-Prussian War
* Third Republic
** World War 1
* World War II
* Fourth Republic
* Fifth Republic
** European Union
# French Revolution/Effects
## Effects

There are a lot of social and political effects such as the use of metric system, a shift from absolutism to republicanism, nationalism and the belief the country belongs to the people not to one sole ruler. Also after the Revolution occupations were open to all male applicants allowing the most ambitious and successful to succeed. Same goes for the military because instead of army rankings being based on class they were now based on caliber. The French Revolution also inspired many other repressed working class people of other countries to began their own revolutions. Elections, representative government and constitutions were now all a garmented part of France's government and their national flag was also permanently changed to the one it is now. Slavery was also abolished and most importantly the revolutionary idea of "if only a people tried they could ultimately reorganise society as they saw fit" became popular.
# French Revolution/Exercises
## 1. Fill the gap.

* The Queen ………………………………………… accused of spending huge amounts for luxuries. • During 1787-1789 French economy almost destroyed by …………………………… • The ………………………………………… was hoped for an English style of democracy. • The storm of Bastille was in ………………….. • The destroy of …………………………………………… system changed the all ……………………………………. • After French revolution were only ………………………………. schools. • The French revolution were started on …………………… and ended on ………………….. • The French revolution inspired the whole ………………………….. • One of the results of French revolution was the Declaration of …………………………………………………………. • In 1796 France has fronts with …………………………………………., ………………………………………….., ………………………………………….. • In 1802, Britain and French signed the ………………… …………….. as ending of the war.

## 2. Define the following

i) “Napoleonic Code” ii) “ Feudalism”
# GLPK/Cross Compilation

This page discusses cross-compilation.

## Windows target

If your GLPK-based application program is written in C or C++, compiled using GNU GCC on Linux, and statically linked to GLPK, then you can cross-compile to Windows. See the GCC documentation for details.

## MMIX target

GLPK itself may be cross-compiled to MMIX, a 64-bit RISC computer architecture designed by computer scientist Donald Knuth. Some instructions are contained in the file Makefile_MMIX, included in the GLPK distribution from version 4.37. The host machine will need to provide GNU GCC, normally available by default on Linux and BSD.

## Virtualization

While virtualization is not cross-compilation, it may well achieve the objectives you are seeking with cross-compilation or with multi-platform development.
# GLPK/Error handling

This page describes strategies for dealing with faults states in GLPK — while noting that prevention is usually better than cure.

## GLPK error hook function

If a run-time error occurs in the GLPK library, GLPK, by default, normally releases the GLPK library environment and aborts the calling program. If you would like to prevent the calling program being aborted, then define a custom error hook function and register this function by calling glp_error_hook. Your hook function should first invoke glp_free_env to free the GLPK library environment and then apply the longjmp call from the C standard library header setjmp.h to return control to the calling program. The calling program can then take the appropriate action, which may include an orderly retreat and exit.
The example below illustrates the use of a custom error hook function (note also the Doxygen markup in some comment blocks):

## Catching and handling user interrupts

Users sometimes wish to terminate a running command-line program. This is normally achieved by hitting Ctrl-C which causes the operating system to send a SIGINT signal to the active program.
If the SIGINT is not caught and handled by the program, the system terminates the process more-or-less instantly. Programmers often like to offer a more graceful approach. GLPK provides the glp_error_hook hook function for this purpose. If you wish to terminate the solver midway through a solution, simply call the following from within this hook:
If an MIP problem is running and you would like to let the current solution complete, then use:
The code for registering the hook function is not given here but further details can be found in this 2011 posting.
In GLPK for Java an error inside the GLPK library results in an exception of class org.gnu.glpk.GlpkException. Methods GLPK.glp_java_error and GLPK.glp_ios_terminate are provided. These can be called in terminal or callback listeners.
# GLPK/GLPK IDEs

An IDE is an integrated development environment. A custom MathProg IDE for GLPK may offer:
* syntax highlighting for the MathProg language
* keyword completion and other convenience shortcuts
* easy execution of the current model
* model and results visualization
* model version control
In addition, some IDEs are designed to be cross-platform in order to provide a similar experience on different operating systems — for instance, Windows, Mac, and Linux.
GLPK IDEs are distinct and different from application development IDEs, such as Microsoft Visual Studio.
Internal links;
* cross-platform IDEs
* Microsoft Windows IDEs
* Mac OS X IDEs
* Linux IDEs
# GLPK/Energy modeling

This page simply highlights the OSyMOSIS model, written in MathProg (with GAMS and Python versions also available). The test model is called UTOPIA and provides a useful introduction to building one form of energy systems model using mathematical programming.

## References

* ↑ Lavigne, Denis (2017). "OSeMOSYS energy modeling using an extended UTOPIA model" (PDF). Universal Journal of Educational Research. 5 (1): 162–169. doi:10.13189/ujer.2017.050120. Retrieved 2017-01-12.
# GLPK/F-Sharp

The F# is a functional programming language is developed by the F# Software Foundation, Microsoft, et al.

## GLPK for C#/CLI

GLPK for C#/CLI provides a common language interface (CLI) binding for GLPK. It is licensed under GPL V3. The coding is generated using SWIG.
GLPK for C#/CLI supports callback and terminal listeners. Errors occurring in the GLPK native library are thrown as exceptions. All functions of the GLPK API are available as methods of the GLPK object as shown in the example below:
# GLPK/Fortran

Fortran is a high-performance scientific computing language which dates from the 1950s and is still in use.

## Bindings for GNU gfortran

Jeff Kelly has made the following GNU gfortran GLPK language bindings available. See the next section for further details and discussion.

## Bindings for Fortran 2003

Jeff Kelly has made the following main program example available, complete with language bindings. This code was developed using the Intel Fortran 2003 compiler.
The program itself calls GLPK to:
The example includes the necessary Fortran bindings and also shows how to setup the callback for integer optimization (if required) using GLPKintsolcb and the Fortran LOC intrinsic.
The most difficult part when interfacing GLPK to Fortran concerns the two derived types glp_smcp (simplex settings) and glp_iocp (integer optimization settings). These derived types are treated as "blind arrays" so that one simply needs to match the bit pattern of the blind array with the derived type and then pass this via glp_init_smcp — for example (as shown below), the first integer value problem1_set1%msg_lev acts like an integer pointer to the blind array as usual.

### Main program example
## GLPK-Fortran

A FORTRAN 90 binding by Jeff Armstrong can be found at https://github.com/ArmstrongJ/GLPK-Fortran. Development stopped in 2014. The code in licensed under GPL 3.
# GLPK/GAMS plus GLPK

GAMS is a high-level modeling environment for mathematical optimization. GAMS can employ GLPK as its underlying solver by virtue of the COIN-OR GAMSlinks initiative. This feature relies on the COIN-OR Osi project, discussed here (with accompanying caveats).
GAMS and GLPK can also swap models at a low level using one of several common problem specification formats, including the MPS format. The GLPK interoperability page provides more information.
# How to Ace FYLSE/1996 F Q5
## Fact Summary

A and B agreed to kidnap V and B insisted A agree not to harm V and A agreed. They kidnapped V and sought a ransom and A raped V and V killed herself later and B didn't know about it. A told B V killed herself after A raped her and A was going to dispose V's body. B turned himself in to the police and the Police arrested B.

## Outline
### Conspiracy

* Unilateral

### Accomplice Liability

* Accessory after the Fact

### Felony Murder

* Inherently dangerous felony
* foreseeable and probable consequence during the commission of the crime
* Went to the police afterwards
# How to Ace FYLSE/1994 J Q3
## Fact Summary

J, a police officer in civilian clothes tried to arrest A which D thought as robbing A. D shoved J away and J killed A and D wrested the gun from J killed J. D was indicted for murder of J.
# How to Ace FYLSE/1995 J Q3
## Fact Summary

B got annoyed by W and made a citizen's arrest of W for loitering. W objected loudly. R overheard W's remarks and wrote a story that R was shoplifting on a newspaper.
# How Wikipedia Works/Introduction

Welcome! Wikipedia, the free encyclopedia, is the largest and most popular reference website in the world. Wikipedia is also unique: This encyclopedia is written by everyone and can be read by anyone.
This book is written for readers, current editors, potential contributors, and anyone else interested in Wikipedia. The book describes what kind of writing Wikipedia includes, how Wikipedia works behind the scenes, and how to get involved.
We cover all aspects of participating in Wikipedia, from reading the site to editing articles to navigating the site's community and governance.
Wikipedia is based on a wiki, a technology that allows anyone to change pages easily on the site. If you're impatient to work on Wikipedia, go to https://en.wikipedia.org/ and start improving the encyclopedia right now!
If you learn most quickly by diving right in, or if you already edit Wikipedia, then you can use this book as a reference guide and a source of tips. But if you're just starting out, or if you want to know everything about how Wikipedia works today and how it has developed over time, you should start reading from the beginning.
# How the Brain Works
## A Cognitive Neuroscience Perspective on the Human Brain

The cognitive neurosciences are a rapidly developing field. From early efforts to localize psychological functions in the brain using neuropsychological data to modern functional brain imaging research, our understanding of how the human brain works is growing exponentially. At the same time, however, it is becoming increasingly challenging to integrate this rapidly expanding knowledge into a comprehensive understanding of brain function. This wikibook discusses fundamental principles of human brain function emerging from the cognitive neurosciences. It aims at providing students and scholars with a broad insight into various perspectives on brain function.
(This wikibook will be the result of course work in a seminar held in the winter term 2016/2017.)

## Contents

* Test Chapter
* The Segregated Brain: Localization of Brain Function
* The Integrated Brain Part 1: Intrinsic Functional Networks
* The Integrated Brain Part 2: Connectomics
* The Hierarchical Brain
* The Rhythmic Brain
* The Noisy Brain
* The Predictive Brain
* The Conscious Brain
# How to Ace FYLSE/1992 J Q5
## Fact Summary

A and B transported drugs and A had C act as B's bodyguard. When V searched B, C came and killed him.
# How Wikipedia Works/Editing

In subsection:
    Ch.5 - Basic Editing
    Ch.6 - Good Writing and Research
    Ch.7 - Cleanup, Projects, Policy, and Processes
    Ch.8 - Building Wikipedia's Web
    Ch.9 - Images, Media, Templates and Special Characters
    Ch.10 - The Life Cycle of an Article
# How to Ace FYLSE/1988 J Q5
## Fact Summary

A and B raped C and killed C when C resisted. B is charged with felony murder.

## Analysis
### Felony murder

* malice
# Commutative Ring Theory/Derivations

Proposition (alternative construction of the universal derivation):
Let $S$ be a unital $R$-algebra. Note that $S\otimes _{R}S$ becomes an $S$-module via the linear extension of the operation $t(s\otimes u):=(ts)\otimes u$. We then have a morphism of $S$-modules
    $\phi :S\otimes _{R}S\to S,s\otimes t\mapsto s\cdot t$,
where the dot indicates the algebra multiplication of $S$. Set $I:=\ker \phi$ and $\Omega '_{S/R}:=I/I^{2}$. Then
    $d':S\to \Omega '_{S/R},~~t\mapsto t\otimes 1-1\otimes t+I^{2}$
is a derivation, and we have an isomorphism $\Theta :\Omega _{S/R}\to \Omega '_{S/R}$ inducing a commutative diagram
Proof: Note first that $d'$ is a derivation. This takes some explaining. First, note that for arbitrary $\alpha ,\beta$ the element $\alpha \otimes \beta -\beta \otimes \alpha$ is in $I$. Moreover, from this follows that the element
is in $I^{2}$ for $\alpha ,\beta ,\gamma ,\delta \in S$ arbitrary.
Hence, from the universal property of $d:S\to \Omega _{S/R}$, we obtain a unique morphism of $S$-modules $\Theta :\Omega _{S/R}\to \Omega '_{S/R}$ that makes the diagram
commutative. We construct an inverse map to $\Theta$. Namely, on $B\times B$ we can define the map
    $(\alpha ,\beta )\mapsto \alpha d\beta$ $\Box$
# Commutative Ring Theory/Greatest common divisors

Definition (divisor):
Let $R$ be a ring, and let $a\in R$. A divisor of $a$ is an element $b\in R$ such that there exists $c\in R$ such that $a=bc$. The notation $b|a$ indicates that $b$ is a divisor of $a$
Definition (greatest common divisor):
Let $R$ be a commutative ring, and let $a_{1},\ldots ,a_{n}\in R$. A greatest common divisor is an element $d\in R$ such that $d|a_{j}$ for all $j\in \{1,\ldots ,n\}$, and such that for any other element $c\in R$ such that $c|a_{j}$ for all $j\in \{1,\ldots ,n\}$, we have $c|d$.
Definition (coprime):
Let $R$ be a commutative ring, and let $a_{1},\ldots ,a_{n}\in R$. These elements $a_{1},\ldots ,a_{n}$ are said to be coprime if and only if whenever $d\in R$ is such that $d|a_{j}$ for all $j\in \{1,\ldots ,n\}$, then $d\in R^{\times }$.
Proposition (a set of elements of a commutative ring divided by their greatest common divisor is coprime):
Let $$
# Commutative Ring Theory
## Table of Contents

* Divisibility and principal ideals
* Greatest common divisors
* Bézout domains
* Principal ideal domains
* Euclidean domains
* Cayley‒Hamilton theorems and NAK lemmata
* Integral elements and extensions
* Tensor product of commutative rings
* Derivations
# Commutative Ring Theory/Principal ideal domains

Definition (principal ideal domain):
A principal ideal domain is an integral domain $R$ whose every ideal is principal.
Proposition (a Bézout domain is principal if and only if it is Noetherian or satisfies the ascending chain condition for principal ideals):
Let $R$ be a Bézout domain. Then the following are equivalent:
* $R$ is a principal ideal domain
* $R$ is noetherian
* The principal ideals of $R$ satisfy the ascending chain condition
Proof: The implication "1. $\Rightarrow$ 2." is obvious. Suppose that 3. holds, and let $I\leq R$ be any ideal. If $I$ was non-principal, then whenever $a\in I$, we could find a $b\in I$ such that $b\notin \langle a\rangle$. Hence, starting with an arbitrary $a_{1}\in I$ and invoking the axiom of dependent choice (applied to a set of finite tuples with an adequate relation) yields a sequence $(a_{n})_{n\in \mathbb {N} }$ in $I$ such that $a_{n+1}\notin \langle \gcd(a_{1},\ldots ,a_{n})\rangle$; indeed, $\gcd(a_{1},\ldots ,a_{n})\in I$ since $R$ is a Bézout domain. If we define
    $b_{n}:=\gcd(a_{1},\ldots ,a_{n})$, we have $\langle b_{1}\rangle \supsetneq \langle b_{2}\rangle \supsetneq \cdots$;
thus, we have defined an ascending chain of principal ideals of $R$ that does not stabilize. Finally, every principal ideal domain must be noetherian, since being noetherian is equivalent to all ideals being finitely generated. $\Box$
# Commutative Ring Theory/Bézout domains

Definition (Bézout domain):
A Bézout domain is an integral domain whose every finitely generated ideal is principal, ie. generated by a single element.
Proposition (Every Bézout domain is a GCD domain):
Let $R$ be a Bézout domain. Then $R$ is a GCD domain.
Proof: Given any two elements $a,b\in R$, we may consider the ideal $I=\langle a,b\rangle$ generated by $a$ and $b$. By the definition of Bézout domains, $I=\langle c\rangle$ for at least one $c\in R$ (which is moreover unique up to similarity). Then $\langle c\rangle \leq \langle a\rangle$ and $\langle c\rangle \leq \langle b\rangle$, so that by the characterisation of divisibility by principal ideals, $c$ is a common divisor of $a$ and $b$. Moreover, if $d\in R$ is another common divisor of $a$ and $b$, then $a,b\in \langle d\rangle$, so that $\langle a,b\rangle =\langle c\rangle \leq \langle d\rangle$, so that $d|c$. Hence, $c$ is a greatest common divisor of $a$ and $b$. $\Box$
# Commutative Ring Theory/Divisibility and principal ideals

Definition (principal ideal):
Let $R$ be a commutative ring. A principal ideal is a left principal ideal of $R$. Equivalently, it is a right principal ideal or a two-sided principal ideal of $R$.
Proposition (characterisation of divisibility by principal ideals):
Let $R$ be a commutative ring, and let $a,b\in R$. Then $a|b\Leftrightarrow \langle a\rangle \geq \langle b\rangle$.
Proof: Both assertions are equivalent to the existence of a $c\in R$ such that $b=ac$. $\Box$
Definition (similarity):
Let $R$ be a commutative ring. Two elements $a,b\in R$ are called similar if and only if there exists a unit $u\in R$ such that $a=ub$.
Proposition (similarity is an equivalence relation):
Given a ring $R$, the relation of similarity defines an equivalence relation on the elements of $R$.
Proof: For reflexivity, use the identity, and for symmetry, use the inverse. Suppose that $a=ub$ and $b=vc$, where $u,v\in R^{\times }$. Then $a=uvc$, where of course $uv\in R^{\times }$. $\Box$
Proposition (in an integral domain, the generating element of a principal ideal is unique up to similarity):
Let $R$ be an integral domain, and let $\langle a\rangle \leq R$ be a principal ideal of $R$. Then if $\langle a\rangle =\langle b\rangle$ for some element $b\in R$, we have $a=ub$ for some $u\in R^{\times }$.
Proof: The equation $\langle a\rangle =\langle b\rangle$ implies that $a=xb$ and $b=ya$ for certain $x,y\in R$. Hence, $a=xya$. By cancellation (which is applicable because $R$ is an integral domain), $xy=1$ and hence $x$ is a unit, so that $a$ and $b$ are similar. $\Box$