OpenLLM-France/wikimedia huggingface dataset:
# History of China/People's Republic of China and the Modern World

The history of the People's Republic of China started on 1 October, 1949, when, after the near complete victory by the Chinese Communist Party in the Chinese Civil War, Mao Zedong declared the foundation atop Tiananmen.
The PRC history can be divided into four sub-divisions: the Mao era (1949-76), the Deng and Reforms era (1976-89), the Jiang era (1989-2002), and the 'recent' era (2002-present). And there have been five generations of leadership: Mao Zedong, Deng Xiaoping, Jiang Zemin, Hu Jintao and Xi Jinping.

## Unit 1: The Mao Era (1949-76)

Mao was in power since the foundation of the PRC until 1976.
# Databases/PostgreSQL

PostgreSQL, often simply Postgres, is an w:object-relational database management system (ORDBMS). PostgreSQL is w:ACID-compliant and transactional. PostgreSQL has updatable [w:[View (SQL)|views]] and w:materialized views, triggers, w:foreign keys; supports functions and stored procedures, and other expandability

## Installing PostgreSQL
### MacOS

* brew install postgres

### Linux, BSD variants

The easiest way to install PostgreSQL in these operating systems is to use their respective built-in package managers - for instance, the pkg command in DragonFlyBSD or apt in Debian and its derivatives. Be advised that there will be different variants of PostgreSQL available for install at a given point, specially regarding version numbers and client/server side. You should decide beforehand which version suits your needs for a particular application. Furthermore, you need to make sure that you have sufficient privileges in the system to install software (properly configured sudo/doas access, for example) or your install will fail.

## Basic Commands

Binaries: psql, pg_dump.
* Connect to a PostgreSQL database: psql -h localhost -U postgres -d somedb
* Connect to a PostgreSQL database with a timeout of 5 seconds: env PGCONNECT_TIMEOUT=5 psql -h localhost -U postgres -d somedb
* Show tables: \dt or SELECT * FROM pg_catalog.pg_tables;
* Describe employees table: \d employees
* Show/List schemas: select nspname from pg_catalog.pg_namespace;
* Create backup: use pg_dump and ~/.pgpass file for automating login.

## Releases (yearly)

PostgreSQL release a new version approximately every year around October: https://en.wikipedia.org/wiki/PostgreSQL#Release_history
* October 2018 PostgreSQL 11.0 https://www.postgresql.org/about/news/1894/, https://www.postgresql.org/docs/release/11.0/
* October 2019 PostgreSQL 12.0 https://www.postgresql.org/about/news/1976/, https://www.postgresql.org/docs/release/12.0/
# Applied Programming/Databases/Python3 PostgreSQL

This program shows the PostgreSQL database management.
# Euclidean space/Affine subspace/Perpendicular/Fact/Proof

We write $P-Q=u_{1}+u_{2}+u$ with $u_{1}\in U_{1}$, $u_{2}\in U_{2}$, and $u\in {\left(U_{1}+U_{2}\right)}^{\perp }$; such a decomposition does always exist, $u_{1},u_{2}$ are not uniquely determined (in case $U_{1}\cap U_{2}\neq 0$), but $u$ is uniquely determined. We have
    $P_{1}-u_{1}=P_{2}+u_{2}+u\,,$
and $Q_{1}:=P_{1}-u_{1}\in E_{1}$, and $Q_{2}:=P_{2}+u_{2}\in E_{2}$. The distance between $Q_{1}$ and $Q_{2}$ is $\Vert {u}\Vert$. For arbitrary points $R_{1}=Q_{1}+v_{1}\in E_{1}$ and $R_{2}=Q_{2}+v_{2}\in E_{2}$ fulfilling $v_{1}\in U_{1}$ and $v_{2}\in U_{2}$, we have
    ${\begin{aligned}d(R_{1},R_{2})^{2}&=\Vert {R_{1}-R_{2}}\Vert ^{2}\\&=\Vert {v_{1}-v_{2}+u}\Vert ^{2}\\&=\left\langle v_{1}-v_{2}+u,v_{1}-v_{2}+u\right\rangle \\&=\left\langle v_{1}-v_{2},v_{1}-v_{2}\right\rangle +\left\langle u,u\right\rangle \\&\geq \left\langle u,u\right\rangle ,\end{aligned}}$
that is,
    $d(R_{1},R_{2})\geq \Vert {u}\Vert \,.$
# 3D Modelling/Projective Geometry
## Introduction

In this learning module about productive geometry we consider a special application of projections in mathematics, that project a three-dimensional space onto a two dimensional plane. A snapshot with a camera is such a projection, that maps vectors in a three-dimensional space $\mathbb {R} ^{3}$ onto the image as a two-dimensional space $\mathbb {R} ^{2}$.

## Learning Task

* (Art) Explore, when art discovered a geometrical approach to create paintings that respect construct geometrically the size of objects that appear to smaller on the canvas, if they a far away (see also Perspective Drawing on Mirror).
* (Perspective Drawing) Perform the small course of creating a perspective drawing of a box as a projection of the 3D object on a mirror.
* (Mathematics) Explore the concept of Projective Geometry in general. How does projective geometry generalize the approach of creating a two-dimensional image of objects in the three-dimensional space.
# Voice Acting/Relaxation Exercises

Choose from these exercises to relax anytime, especially before or after a performance. You may wish to explore the many variations of the simple exercises described here to find relaxation techniques that work best for you.
No medical advice is provided here; please contact qualified medical personnel to obtain medical advice.

## Square Breathing

* Inhale counting 1,2,3,4
* Hold the breath counting 1,2,3,4
* Exhale counting 1,2,3,4
* Hold counting 1,2,3,4
* Repeat

## Autogenic Training

Autogenic training is a desensitization-relaxation technique intended to elicit a relaxation response.
* Begin muscular relaxation by repeating the verbal formula, "My right arm is heavy", emphasizing heaviness. During the initial stages of the training, the feeling of heaviness in the trained arm is more expressed and occurs more rapidly. The same feeling can be experienced in the other extremities at the same time in the other arm. Within a week, a short concentration can trigger the sensation of heaviness in your arms and legs.
* Passive concentration focuses on feeling warm, initiated by the instruction "My right arm is warm".
* Begin cardiac activity using the formula "My heartbeat is calm and regular".
* Focus passive concentration on the respiratory mechanism with the formula "It breathes me".
* Concentrate on the warmth in the abdominal region with "My solar plexus is warm".
* Passive concentration focuses on coolness in the cranial region with the formula "My forehead is cool".

## Progressive Muscle Relaxation

Progressive muscle relaxation is a method of deep muscle relaxation based on the premise that muscle tension is the body's psychological response to anxiety-provoking thoughts and that muscle relaxation blocks anxiety.
Choose from the many progressive muscle relaxation scripts available, including:
* Berkeley Progressive Muscle Relaxation Script
* Psych Central Progressive Muscle Relaxation
* A video Progressive Muscle Relaxation (With Music)

## Guided Imagery

Guided imagery is a mind-body intervention where a teacher helps a participant evoke and generate mental images that simulate or re-create the sensory perception of sights, sounds, tastes, smells, movements, and images associated with touch, such as texture, temperature, and pressure and that may precipitate strong emotions or feelings.
Choose from the many guided imagery scripts available, including:
* Inner Health Studio Public Speaking Visualization
* Ocean Escape (with music): Walk Along the Beach Guided Meditation and Visualization

## Biofeedback

Biofeedback is the process of gaining greater awareness of physiological functions primarily using instruments that provide information on the activity of those physiological systems, with a goal of being able to manipulate them at will.
You may find that using a simple galvanic skin response biofeedback device can help you relax.
# Skew lines/R^3/Distance/Linear system/Example

Two (affine) lines $G,H\subseteq \mathbb {R} ^{3}$ are called skew if they do not have any point in common and if they are also not parallel, meaning their vectors are linear independent. Then, these vectors generate a plane; there exists a vector $u$ perpendicular to this plane. We can compute one such vector, the normal vector, with the cross product. Let
    $G=P+\mathbb {R} v\,,$
and
    $H=Q+\mathbb {R} w\,.$
The linear system of equations
    $P-Q=av+bw+cu\,$
has a unique solution $(a,b,c)\in \mathbb {R} ^{3}$. Here, $P-av\in G$ and $Q+bw\in H$ are the dropped perpendicular feet, where the distance of the lines is obtained, according to fact. This distance is $\Vert {cu}\Vert$.
# Skew lines/Distance/Determinant and cross product/Fact

Let
    $G=P+\mathbb {R} v\,$
and
    $H=Q+\mathbb {R} w\,$
be skew lines in $\mathbb {R} ^{3}$, with vectors $v,w\in \mathbb {R} ^{3}$. Let $u$ be a normed vector that is perpendicular to $v$ and $w$.
    $d(G,H)=\vert {\left\langle P-Q,u\right\rangle }\vert \,.$
# Sequences and series
## Arithmetic progressions

The difference between any two terms of the series is a constant, called common difference. For example,
2,5,8,11,14,... 1,2,3,4,... -10,-5,0,5,10,... If the first term is denoted by a and common difference by d. then series is given by: a,a+d,a+2d,... Therefore the nthis given by a+(n-1)d

### Finding the sum of an arithmetic progression

Let the sum be denoted by S $S=(a)+(a+d)+(a+2d)+(a+3d)+(a+4d)...+a+(n-1)d$
also $S=(a+(n-1)d)...+(a+d)+a$
Adding these we get
$2S=(2a+(n-1)d)+(2a+(n-1)d)+(2a+(n-1)d)...$ n times
Therefore $S=n(2a+(n-1)d)/2$

## Geometric progressions

Ratio of any two terms of the series is constant. If first term is denoted by a, and common ratio by r. Then the series is given by:- a,ar,ar$^2$,...ar$^{(n-1)}$ Example:- 1,2,4,8,16,... 1,-2,4,-8,16,...(note here that r is negative)

### Finding the sum of a geometric progression

Let the sum be denoted by S S=a+ar+... (i) Multiply the equation by r. rS=ar+ar$^2$... (ii) Subtract (ii) from (i) S(1-r)=a-ar$^n$ This gives S=a(1-r$^n$)/(1-r) (for r not equal to 1)
When r=1, S=a+a+a+...(to n terms) S=na
# Skew lines/Distance/Determinant and cross product/Fact/Proof

We use example, and consider
    $P-Q=av+bw+cu\,.$
According to Cramer's rule, we obtain, using fact (5) and that $u$ is a linear multiple of $v\times w$,
    ${\begin{aligned}c&={\frac {\det {\begin{pmatrix}v_{1}&w_{1}&P_{1}-Q_{1}\\v_{2}&w_{2}&P_{2}-Q_{2}\\v_{3}&w_{3}&P_{3}-Q_{3}\end{pmatrix}}}{\det {\begin{pmatrix}v_{1}&w_{1}&u_{1}\\v_{2}&w_{2}&u_{2}\\v_{3}&w_{3}&u_{3}\end{pmatrix}}}}\\&={\frac {\left\langle v\times w,P-Q\right\rangle }{\left\langle v\times w,u\right\rangle }}\\&={\frac {\left\langle u,P-Q\right\rangle }{\left\langle u,u\right\rangle }}\\&=\left\langle u,P-Q\right\rangle .\end{aligned}}$
# Linear algebra (Osnabrück 2024-2025)/Part II/Lecture 36

    Triangles
In this and the next lecture we are dealing with triangles. Triangle geometry/Introduction/Section
    The Pythagorean theorem
We first deal with right triangles. Triangle geometry/Right triangles/Pythagoras/Section
    Thales's theorem

## Theorem
### Proof

$\Box$
    The intercept theorems
Intercept theorems/Linear algebra/Section
# Python Programming

Python is a widely used high-level, general-purpose, interpreted, dynamic programming language. Python supports many programming paradigms, including object-oriented, functional, and procedural programming. Its design philosophy emphasizes code readability, simplicity, and its syntax allows programmers to express concepts in fewer lines of code than possible in other popular programming languages. Python is very extensible and the modularity of this language has made it popular for adding interfaces to existing applications.
This course comprises 16 lessons on Python programming using Python 3. Each lesson includes a combination of Wikipedia and Internet-based readings, YouTube videos, and hands-on learning activities.
This entire Wikiversity course can be downloaded in book form by selecting Download Learning Guide in the sidebar.

## Preparation

This is a second-semester, college-level course. Learners should already be familiar with introductory computer concepts and have advanced or proficient-level computer skills.

## Lessons

* Introduction
* Variables
* Conditions
* Loops
* Functions
* Strings
* Lists
* Dictionaries
* Tuples and Sets
* Classes
* Modules
* RegEx
* Files
* Internet Data
* Databases
* GUI

## See Also

* Computer Programming
* Python
* Python Concepts
* Wikipedia: Python (programming language)
* Wikibooks: Python Programming
* PythonLearn.com
* Microsoft MVA: Introduction to Programming with Python
* Open Book Project: Beginning Python Programming
* Digital Ocean: How to Code in Python3
* Interactive Python: How to Think Like a Computer Scientist
* PracticePython.org
* WsCube Tech Python Tutorial
* AutomateTheBoringStuff.com Python Book
* FutureLearn: Programming 101: An Introduction to Python for Educators
* Hejex Technology Python Syllabus

## Participation

This section is for the purpose of optionally documenting one's participation process in the course. Here might be notes by learners who might document their learning process and how they view the learning materials and/or how they interacted with them, contributed content or ideas regarding interacting with it. It may include participants experiences with material. Their motivation reasons for participating in the course as a whole and for parts of the course.
* Participation
# Triangle geometry/Introduction/Section

A triangle is just a tuple $(A,B,C)$ of three points (called vertices) in an affine space $E$ (typically, an affine plane) over a Euclidean space $V$. We allow the situation that some or all vertices coincide (a degenerate triangle), and we identify triangles if they only differ by the ordering of the vertices. A triangle is by definition not degenerate if and only if the three points are affinely independent. Quite often, we regard a triangle as its convex hull, that is, the set
    ${\left\{rA+sB+tC\mid r+s+t=1,\,0\leq r,s,t\leq 1\right\}}$
of all barycentric combinations of the three points, where all coefficients are not negative. The connecting segment
    ${\overline {A,B}}={\left\{rA+sB\mid r+s=1,\,0\leq r,s\leq 1\right\}}\,$
is called the edge between the vertices $A$ and $B$ (or the edge opposite of $C$). It is often denoted by $c$, its length is
    $d(A,B)=\Vert {\overrightarrow {AB}}\Vert \,.$
The corresponding denominations hold for the other edges. Sometimes we also denote the lengths of the edges by $a,b,c$. The angle $\angle (A,B,C)$ of the triangle at the vertex $B$ is defined as
    $\angle ({\overrightarrow {BA}},{\overrightarrow {BC}}),$
accordingly for the other vertices. The angles are usually denoted by $\alpha ,\beta ,\gamma$.

## Definition

Triangle/Congruent/Definition
We also say that congruent triangles can be transformed into each other by an affine-linear isometry.

## Theorem
### Proof

$\Box$

## Definition

Triangle/Properly congruent/Definition

## Definition

Triangle/Similar/Translation and angle-preserving/Definition

## Theorem
### Proof

$\Box$
# Congruent triangles/Same lengths/Fact/Proof

Translations and isometries preserve lengths; therefore, congruent triangles have the same lengths of edges. Let now two triangles $(A,B,C)$ and $(A',B',C')$ be given, having the same edge lengths. After renaming, we may assume that the edge lengths fulfill the relation
    $d(A,B)\geq d(A,C)\geq d(B,C)\,,$
and that the same holds for the second triangle. We can assume $E=\mathbb {R} ^{2}$, and we can also assume after a translation that $A=A'=0$ holds. After rotations of the triangles around the origin, we may further assume that $B$ as well as $B'$ lie on the positive $x$-axis. Because of the length equality, we have $B=B'$. The points $C$ and $C'$ have, on one hand, the same distance to $0$, and, on the other hand, the same distance to $B$. That is, they lie on the intersection of a circle about $0$ and a circle about $B$. Since there are only two intersection points, we have either $C=C'$, or $C$ and $C'$ can be transformed to each other by a reflection at the $x$-axis.
# Triangle/Similar/Translation and angle-preserving/Definition

Two triangles in a Euclidean plane are called similar if they can be transformed into each other by the composition of a translation and an angle-preserving mapping.
# Triangle/Congruent/Definition

Two triangles in a Euclidean plane are called congruent if they can be transformed into each other by the composition of a translation and an isometry.
# Congruent triangles/Same lengths/Fact

Two triangles in a Euclidean plane
congruent
# Triangle/Properly congruent/Definition

Two triangles in a Euclidean plane are called properly congruent if they can be transformed into each other by the composition of a translation and a proper isometry.
# Triangle/Similar/Angle/Fact

Two triangles in a Euclidean plane
similar
# Triangle geometry/Right triangles/Pythagoras/Section
## Definition

Right triangle/Definition

## Definition

Right triangle/Hypotenuse/Definition

## Definition

Right triangle/Cathetus/Definition
The Pythagorean theorem for a right triangle says the following.

## Theorem
### Proof

$\Box$
In this formulation, we use that the area of a square (that is, of the geometric object) equals the (arithmetic) square of the side lengths. The proof does not refer to areas.

## Definition

Triangle/Altitude/Definition
The length of the altitude is also called the altitude.

## Definition

Triangle/Foot/Definition
Der following theorem is called Cathetus theorem.

## Theorem
### Proof

$\Box$
The following theorem is called Right triangle altitude theorem.

## Theorem
### Proof

$\Box$
The following theorem is called Law of cosines.

## Theorem
### Proof

$\Box$
# Right triangle/Definition

A triangle $(A,B,C)$ is called a right triangle if for one vertex the adjacent edges are perpendicular to each other.
# Right triangle/Cathetus/Definition

In a right triangle, the sides adjacent to the right angle are called the catheti (or legs) of the right triangle.
# Right triangle/Hypotenuse/Definition

In a right triangle, the side opposite to the right angle is called the hypotenuse of the right triangle.
# Programming Fundamentals/Introduction/Clojure
## Try It

Copy and paste the code above into one of the following free online development environments or use your own Clojure compiler / interpreter / IDE.
* CodeChef
* Ideone
* paiza.IO
* repl.it
* RexTester
* TutorialsPoint

## See Also

* Wikibooks: Clojure Programming
* TutorialsPoint: Clojure
* ClojureDocs: Clojure Core
# Neuroethics/Blogs

Topic:Neuroethics
* BrainBlogger
* Brain Waves (Zack Lynch)
* Mind-Hacks
* Nature-Neuroscience
* Neuroethics and Law (Prof. Adam Kolber)
* Neurevolution
* Neuroanthropology
* Neuroculture
* Neurocritic
* Neuro-Journalism Mill
* Neurophilosophy
* Neurophilosophy and Sociocognition
* Neuroscience Blogs (List of neuro-blogs)
* Neurosecurity
* NKU Cognitive Neuroscience
* Psychopolitics
* Spirituality and the Brain
* The Frontal Cortex
* Time Blog: Your brain on Politics
# Neuroethics/Associations

Topic: Neuroethics
# Neuroethics/Courses

Topic:Neuroethics
Dana Foundation
# Neuroethics/News

Topic:Neuroethics

## March 2008

La prochaine loi de bioethique devra repondre aux progres de L'exploration du cerveau humain, Le Monde, Samedi le 29 Mars
# Neuroethics

Welcome to these pages on Neuroethics Research and Communications.

## Areas of science

At the moment, in addition to building more general resources, we are focusing on three scientific areas:
* Brain Imaging
* Brain Manipulation
* Predictive Medicine

## General resources

* Books
* Blogs
* Courses
* Magazines
* News
* Journals and journal articles
* Neuroscience centres around the world
* Centres
* Associations
* Events

## Art

* Fiction
# Neuroethics/Journals

Topic:Neuroethics

## Journals

American Journal of Bioethics – Neuroscience
Biosocieties
The Journal of Cognitive Neuroscience
Neuroethics

## Special issues

American Journal of Bioethics, Volume 5, Number 2, March-April.

## Journal articles

Forthcoming
Farah, M.*, Illes, J.*, Cook-Deegan, R., Gardner, H., Kandel, E., King, P., Parens, E., Wolpe, P.R., Sahakian, B. (In Press) Neuroethics and the enhancement of cognition and learning. Nature Reviews Neuroscience. [See also talk at Cambridge University]
Illes, J., Rosen, A., Huang, L., Goldstein, R.A., Raffin, T.A., Swan, G., Atlas, S.W. (In Press) Incidental findings on adult brain MRI: Age-related double dissociation and ethical considerations. Neurology.
Evers, K.(2005) Neuroethics: A Philosophical Challenge, American Journal of Bioethics, Volume 5, Number 2, Page 31.
Farah, M.J. (2005) Neuroethics: the practical and the philosophical, Trends in Cognitive Science, January, Volume 9, Number 1, Pages 34-40.
de Vries, R. (2005) Framing Neuroethics: A Sociological Assessment of the Neuroethical Imagination, The American Journal of Bioethics, Volume 5, Issue 2, March, Pages 25 - 27
# Neuroethics/Fiction

Topic:Neuroethics

## Books

* The Diving Bell and the Butterfly
Was Proust a Neuroscientist - add details here
Film
* The Diving Bell and the Butterfly
TV
* 3lbs
# Neuroethics/Books

Topic: Neuroethics
Ackerman, S. (2006) Hard Science, Hard Choices: Facts, Ethics, and Policies Guiding Brain Science Today, Dana Press.
# Neuroethics/Events

Topic:Neuroethics
2008
July
18 EuroScience Open Forum (ESOF) The Human Mind and Behavior. Barcelona, Spain. With Pierre Magistretti Brain-Mind Institute Switzerland, Elaine Snell (European Dana Alliance for the Brain (EDAB) in the United Kingdom, Alison Abbott of Nature in Germany, Paul Matthews of Imperial College London and GlaxoSmithKline (GSK), UK, Christian Keysers of University Medical Centre Groningen, The Netherlands, and Hossein Esteky of the Institute for Studies in Theoretical Physics and Mathematics of Iran.
14 FENS 2008 International Neuroethics Network/ Neuroethics Society Social, Tuesday, July 14, 2008 at 1700h, Crowne Plaza Hotel, Brussels. With Pierre Magistretti (University of Lausanne, Switzerland), Giorgio Innocenti (Karolinska Institute, Sweden) and Judy Illes (University of British Columbia, Canada).
June
26-28, 2008 Neuroethics Symposium, Society for Philosophy and Psychology Annual Meeting Philadelphia, Pennsylvania, USA.
4-6, 2008 Neuroethics Session, EndoNeuroPsycho Meeting, Doortwerth,The Netherlands
May
April
7 Should Criminal Law Be Reconsidered in Light of Advances in Neuroscience? Harvard Law School, April 7 2008
March
8-16, 2008 International and Interdisciplinary European Conference on Brain - Neuroscience - Ethics The Heinrich Pesch Haus, Center for Applied Ethics, Ludwigshafen, Germany, March 8-16 2008
February
15, AAAS Symposium Poverty and Brain Development: Correlations, Mechanisms, and Societal Implications, AAAS Annual Meeting, Boston, Massachusetts, February 15 2008
January
2007
Neuroethical Issues in Cognitive Enhancement and Neuroimaging, Barbara Sahakian, Department of Clinical Neuropsychology, Department of Psychiatry, Cambridge University, Talk at Emmanuel College, Cambridge (UK) 27 November 2007
The Ethics of Neuroimaging, October 4 and 5, 2007, 3TU.Centre for Ethics and Technology and Delft University of Technology
2006
2005
2004
2003
2002
Neuroethics Conference: Mapping the Field, San Francisco, California, May 13-14 2002