OpenLLM-France/wikimedia huggingface dataset:
# Introduction to Sport Biomechanics

Biomechanics is a prominent sport science that explains the mechanical aspects of human movement. Introduction to Sport Biomechanics demonstrates the fundamental mechanical factors associated with human performance in sport. The description of gross movement patterns as well the forces associated with such movement will be explored with respect to linear and angular motion. Newton's Laws of motion will also be explored with specific application to a sporting context.
The basic principles of mechanical engineering will then be discussed in relation to sporting equipment design and the structure of the human body. This leads to an in-depth examination of gait biomechanics including walking, running, sprinting and changing directions (agility) relevant to sport. The kinetic link principles (effective force summation) will then be explored across various types of sports including those involving throwing, kicking and hitting.
Finally, basic fluid dynamic principles are considered including concepts of drag and propulsion in sports such as rowing, swimming and motor racing. Introduction to Sport Biomechanics provides a sound base of knowledge to then complete Applied Sport Biomechanics.

## Objectives

* Demonstrate a thorough understanding of mechanical factors that influence human movement
* Demonstrate an applied knowledge of musculoskeletal biomechanics relevant to sport
* Ability to conduct qualitative technique analysis and provide meaningful feedback to improve sporting performance

## Topics

* Background to sport biomechanics
* Describing motion including forms, linear, angular and projectile
* Levers and torque associated with human movement
* Application of Newton's Laws of Motion in sport
* Basic Engineering principles and the application to orthopaedic biomechanics
* Functional anatomy including spine, upper and lower extremity biomechanics
* Gait biomechanics including walking, running and sport-specific movement patterns
* Kinetic link principle applied to effective force summation in throwing, hitting and kicking sports
* Fluid dynamic principles including concepts of drag and propulsion

## Resources

* Hall, S.J. Basic Biomechanics (2006). Boston: McGraw-Hill.
* Resources - A range of resources to help with understanding the topics, completing the assignments, and submitting for assessment.

## Assignments

* Examination assessing application of biomechanical concepts and principles in sport
* Presentation involving a critical review of the scientific literature surrounding an area of interest in biomechanics
* Portfolio demonstrating an ability to conduct and present biomechanics research effectively

## Coordinator

Keane Wheeler
# Introduction to Robotics/Visuals/SI Units
## Meter

    Unit of length

## Kilogram

    Unit of mass

## Second

    Unit of time

## Ampere (Amp)

    Unit of current

## Volt

    Unit of electric potential

## Ohm

    Unit of electrical resistance

## Watt

    Unit of power
# Introduction to Robotics/Visuals/SI Prefixes

| 1000$^n$ | 10$^n$ | Prefix | Symbol | Value |
| 1000$^3$ | 10$^9$ | giga- | G | 1 000 000 000 |
| 1000$^2$ | 10$^6$ | mega- | M | 1 000 000 |
| 1000$^1$ | 10$^3$ | kilo- | k | 1 000 |
| 1000$^0$ | 10$^0$ | (none) | (none) | 1 |
| 1000$^{−2/3}$ | 10$^{−2}$ | centi- | c | 0.01 |
| 1000$^{−1}$ | 10$^{−3}$ | milli- | m | 0.001 |
| 1000$^{−2}$ | 10$^{−6}$ | micro- | µ | 0.000 001 |
| 1000$^{−3}$ | 10$^{−9}$ | nano- | n | 0.000 000 001 |
# Introduction to Sport Coaching

Sport coaching requires sound understanding of athlete development and effective communication strategies. Introduction to Sport Coaching provides fundamental understanding of the coaching and officiating process. A background to coaching will be presented initially and will consider the history of sport coaching and the requirements of sport coaching, including coaching ethics, code of conduct and the various leadership / management styles of a coach. Effective group management techniques will then be demonstrated in various practical sporting contexts. The principles of training will then be considered including the 5 S's of training and the use of game sense training in relevant sports. Sport coaching will then be examined with respect to specific population groups, including children, older adults, females, athletes with a disability and athletes from various cultural backgrounds. Finally, the future of sport coaching will be considered. The concepts explored in Introduction to Sport Coaching are expanded in Sport Strength and Conditioning and Assessment of Sport Coaching.

## Objectives

* Apply a basic coaching principles and plans as well as group management and time strategies to teach sport skills
* Demonstrate an understanding of the training requirements for various sports and different populations
* Conduct and interpret the results from a range of fitness and sport-specific tests

## Topics

* Background to sport coaching including accreditation and history
* Risk management and ethics in sport coaching
* The role of a coach including leadership and management in sport
* Group management techniques in sport coaching
* Application of training principles and designing training plans
* Long-term athlete development models and the application in sport coaching
* Coaching various populations groups including children, older adults, female athletes, athletes with a disability and athletes from different cultures
* Future of sport coaching

## Resources

* ASC, Beginning Coaching, Australian Sports Commission

## Assignments

* Australian Sports Commission online coach development courses including beginning coaching principles, introductory level officiating, Play by the Rules Coaches and Officials.
* Coaching practical to assess the effective delivery of a sport skills session.
* Examination to assess the application of concepts presented in Introduction to Sport Coaching.

## Coordinator

Keane Wheeler
# Introduction to Robotics/Visuals/Resistor Color Codes

* 0
* 1
* 2
* 3
* 4
* 5
* 6
* 7
* 8
* 9
| red green yellow gold | $25\times 10^{4}=250000=250k\Omega$ |
| red green yellow gold | $25\times 10^{4}=250000=250k\Omega$ |
| red green yellow gold | $25\times 10^{4}=250000=250k\Omega$ |
| red green yellow gold | $25\times 10^{4}=250000=250k\Omega$ |
| red green yellow gold | $25\times 10^{4}=250000=250k\Omega$ |
# LMCC/Hematology

Hematology is the study of blood, its components and functions in heath and disease conditions. The practice of Hematology globally, reveals that we have clinical hematologists, laboratory hematologists, experimental hematologists and comparative hematologists.
# Real polynomial/Degree 3/Positive coefficients/Zero/Pseudocode/Program/Exercise

Write a computer-program (in pseudocode) which for a polynomial $dX^{3}+cX^{2}+bX+a$ of degree $3$ computes a zero within an accuracy of a given number $e>0$ berechnet.
The initial configuration is
    $(a,b,c,d,e,1,0,0,\ldots )$
with $a,b,c\geq 0$ and $d,e>0$ (hence, the coefficients of the polynomial, the accuracy $e$ and $1$ are in the first memory units). The program shall print a sentence telling the bounds of an interval for a zero with the wished-for accuracy and stop.
# Real positive number/Root/Unique existence/Fact/Proof

We define recursively nested intervals $[a_{n},b_{n}]$. We set
    $a_{0}=0\,$
and we take for $b_{0}$ an arbitrary real number with $b_{0}^{k}\geq c$. Suppose that the interval bounds are defined up to index $n$, the intervals fulfil the containment condition and that
    $a_{n}^{k}\leq c\leq b_{n}^{k}\,$
holds. We set
    $a_{n+1}:={\begin{cases}{\frac {a_{n}+b_{n}}{2}},{\text{ if }}{\left({\frac {a_{n}+b_{n}}{2}}\right)}^{k}\leq c\,,\\a_{n}{\text{ else}},\end{cases}}\,$
and
    $b_{n+1}:={\begin{cases}{\frac {a_{n}+b_{n}}{2}},{\text{ if }}{\left({\frac {a_{n}+b_{n}}{2}}\right)}^{k}>c\,,\\b_{n}{\text{ else}}.\end{cases}}\,$
Hence one bound remains and one bound is replaced by the arithmetic mean of the bounds of the previous interval. In particular, the stated properties hold for all intervals and we have a sequence of nested intervals. Let $x$ denote the real number defined by this nested intervals according to fact. Because of exercise, we have
    $x=\lim _{n\rightarrow \infty }a_{n}=\lim _{n\rightarrow \infty }b_{n}\,.$
Due to fact, we get
    $x^{k}=\lim _{n\rightarrow \infty }a_{n}^{k}=\lim _{n\rightarrow \infty }b_{n}^{k}\,.$
Because of the construction of the interval bounds and due to fact, this is $\leq c$ but also $\geq c$, hence $x^{k}=c$.
# Real polynomial/Odd degree/Zero/Exercise

Show that a real polynomial of odd degree has at least one real zero.
# Real polynomial/Positive/Estimate/Exercise

Let
    $P(x)=a_{n}x^{n}+a_{n-1}x^{n-1}+\cdots +a_{2}x^{2}+a_{1}x+a_{0}\,$
denote a real polynomial with $a_{n}>0$. Describe in dependence on the coefficients $a_{0},\ldots ,a_{n}$ a bound $b$ such that
    $P(x)>0\,$
holds for all $x\geq b$.
# Real power series/Derivative by formal derivative/Fact

Let
    $g(x):=\sum _{n=0}^{\infty }a_{n}x^{n}\,$
denote a power series which converges on the open interval $]-r,r[$, and represents there a function $f\colon ]-r,r[\rightarrow \mathbb {R}$.
    ${\tilde {g}}(x):=\sum _{n=1}^{\infty }na_{n}x^{n-1}\,$
is convergent on $]-r,r[$. The function $f$ is differentiable in every point of the interval, and
    $f'(x)={\tilde {g}}(x)\,$
# Real plane/Polar coordinates/Angle naive/Example

An angle $\alpha$ and a positive real number $r$ define a unique point
    $P=(x,y)=(r\cos \alpha ,r\sin \alpha )=r(\cos \alpha ,\sin \alpha )\,$
in the real plane $\mathbb {R} ^{2}$. Here, $r$ is the distance between the point $P$ and the zero point $(0,0)$ and $(\cos \alpha ,\sin \alpha )$ means the intersecting point of the ray through $P$ with the unit circle. Every point $P=(x,y)\neq 0$ has a unique representation with $r={\sqrt {x^{2}+y^{2}}}$ and with an angle $\alpha$, which has to be chosen accordingly (the zero point is represented by $r=0$ and an arbitrary angle). The components $(r,\alpha )$ are called the polar coordinates of $P$.
# Real power series/Convergence/Continuous function/Fact

Let
    $f(x):=\sum _{n=0}^{\infty }c_{n}x^{n}\,$
be a power series and suppose that there exists some $x_{0}\neq 0$ such that $\sum _{n=0}^{\infty }c_{n}x_{0}^{n}$ converges.
$R$
(where $R=\infty$ is allowed) such that for all $x\in \mathbb {R}$ fulfilling $\vert {x}\vert <R$ the series converges absolutely. On such an (open) interval of convergence, the power series $f(x)$ represents a
# Real power series/Infinitely often differentiable/Fact

A function given by a power series
# Introduction to German

Welcome to Introduction to German, part of Foreign Language Learning and Language and Literature school. The aim of this beginner level course is to tell you about the basics of German, no prior knowledge is required. However it helps if you are good at English (used in this guide!) and know some grammar, like the difference between "plural" and "singular", you can move ahead. You can also join the German Stream if you so desire. :)

## First steps

Congratulations! To continue reading this page you just made the first step to learn German. So you can now say the classical phrase: "Ich lerne Deutsch" (rough Anglicized pronunciation: ish lerne Doich).
Now you have two things to master: Vocabulary and Grammar
The trick is that you can't focus just on one of these. You may think that vocabulary is enough. If you know the words, then you can say and write anything you want... but it is not that true. You also have to learn how to say and write it! Fortunately for you there is a good opportunity to practice this right here at Wikiversity.

## Vocabulary

All material concerning the German vocabulary is concentrated at German vocabulary and its subpages. Please help develop it further, possible in cooperation with Wikibooks using the well developed German textbook.

### Alphabet and Pronunciation

* Please see The Alphabet (at Wikibooks).

## Grammar

See German grammar.

## Typing German

See Typing German characters into a computer.
| For a PC, you have quick access by typing the following: ß - alt+225 ä - alt+132 ö - alt+148 ü - alt+129 Ä - alt+142 Ö - alt+153 Ü - alt+154 | On a Mac, the commands are as follows: ß - ⌥ + s ä - ⌥ + u, a ö - ⌥ + u, o ü - ⌥ + u, u Note: the umlaut can be assigned to any vowel by first holding '⌥' and pressing the 'u' key. It will then wait for a vowel key to be pressed. |

## Assignments

To help you get acquainted with the written language, use this subpage to get in contact with German speaking Wikiversity participants.

## Related materials

* German language on Wikipedia
* German, an open-ended textbook at Wikibooks
Learning materials and learning projects can be used by multiple departments. Cooperate with other departments that use the same learning resource.
Learning materials and learning projects are located in the main Wikiversity namespace. Simply make a link to the name of the lesson (lessons are independent pages in the main namespace) and start writing!

## Learning Resources

* A podcast for students Slow German is spoken clearly and slowly. More information at www.slowgerman.com (not cost free)
* An online learning tool Duolingo helps you practice vocabulary and grammar. More information at www.duolingo.com (free)

## Active participants

* RedAugust
* Exorcist_bob
* MjVP13
* Daniel M. Roberts
* HappyCamper
* --Smithgrrl 02:38, 5 November 2006 (UTC) Ich spreche Deutsch nicht besonders gut, aber möchte gerne helfen wenn ich kann!
* Kaiti Ich werde wenn ich kann helfen!
* Enlil Ninlil 04:13, 27 April 2007 (UTC)
* -Atcovi (Talk - Contribs) 18:51, 17 October 2017 (UTC)
# Introduction to German/Input
## How to type German characters into the computer
### Windows

(for these characters ensure that the num lock is on)
* For ä, hold down Alt, and press the numbers 1, 3, 2 on the keypad. Then release the Alt button.
* For Ä, hold down Alt, and press the numbers 1, 4, 2 on the keypad. Then release the Alt button.
* For ö, hold down Alt, and press the numbers 1, 4, 8 on the keypad. Then release the Alt button.
* For Ö, hold down Alt, and press the numbers 1, 5, 3 on the keypad. Then release the Alt button.
* For ü, hold down Alt, and press the numbers 1, 2, 9 on the keypad. Then release the Alt button.
* For Ü, hold down Alt, and press the numbers 1, 5, 4 on the keypad. Then release the Alt button.
* For ß, hold down Alt, and press the numbers 2, 2, 5 on the keypad. Then release the Alt button.
Alternatively you can use the US-International keyboard layout.
* For ä, hold down AltGr, and press Q.
* For Ä, hold down AltGr+Shift, and press Q.
* For ö, hold down AltGr, and press P.
* For Ö, hold down AltGr+Shift, and press P.
* For ü, hold down AltGr, and press Y.
* For Ü, hold down AltGr+Shift, and press Y.
* For ß, hold down AltGr, and press s

### Mac

* For ü, ö, and ä, hold down option-u, release, and type u, o, or a.
* For ß type option-s.

### GNU / Linux

Set up a key on the keyboard as the compose key. In GNOME this can be found in via the System -> Preferences -> Keyboard utility, on the Layout Options tab. To type an a letter with an umlaut, press the compose key followed by " and then the desired letter. To type the letter ß, press the compose key followed by the s key twice.
# Introduction to Electronics/Lecture Test Equipment

* EE90 Edit/View
* Electronic Engineering
* EE Introduction to Electronics
* Lecture, Test Equipment
* Lecture, Smart test equipment
* Lecture, Mounting Techniques
* Lecture, Soldering
* Lecture, Schematics
* Lecture, SPICE
* Mid-term Exam
* Final Exam

## Lecture 1, Basic test equipment
### DMM, power supplies, Oscilloscopes, Signal generators
#### DMM

Digital Multimeters (DMM) are used for measuring voltage, current, or resistance. They often have other features easing lab use, allowing you to measure for capacitance, inductance, and temperature among other things. They have two probes for taking measurements. Care must be taken that they be used properly depending on what is being measured else excessive current may flow through the probes.
When measuring voltage, set the multimeter into a voltage reading mode. In this mode only minuscule amounts of current should be able to flow through the probes. Place the probes across two points in the circuit to measure the voltage across those points. Voltage is always measured between two points. Sometimes its conventional to discuss a voltage at a single point in the circuit, but in this case, the voltage is conventionally relative to the circuit ground.
When measuring current, set the multimeter to measure current. In this mode ideally unlimited current should be able to flow through the probes. Multimeters should have a protective fuse which should blow when measuring current that is too great. Current is always measured through the probes, not across them. Therefore, to measure current through a device, disconnect that device, then touch one probe to the device lead and touch the other probe to the point in the circuit where the device lead was connected. Current should flow through the probes as though the device was connected directly in the circuit.
* Measurements of voltage by connecting in parallel to the element
* Measurements of current by connecting in series before the element

#### Power Supplies

Power supplies provide a stable source of power for circuits. A voltage is specified for the device. Also importantly, current limits are often also specifyable. Mindfully setting maximum current limits can protect circuits when mistakes are made which would cause excessive current to flow.

#### Oscilloscopes

Oscilloscopes are for measuring time varying voltages, particularly periodic signals. Oscilloscopes have a screen which displays a graph of the voltage over time, called the waveform. Oscilloscope screens are typically divided into squares called divisions. Vertically, the voltage per division can be adjusted to see smaller or larger voltages. Horizontally, the time per division can be adjusted to see faster or slower signals. Digital oscilloscopes often have other features for performing mathematical operations on the input signals.
watting for copyright permissions images/diagrams 50% done
Back to: Topic:Electronic Engineering
# Selected topics in finite mathematics/Voting/Borda count

vteModule 1: Graphs and Optimization :
vteModule 2: Logic, Arguments, and Voting :
vteModule 3: Mathematics in money and ?? :

## Objectives

Finding a winner in an election using a point system based on the first place vote down to the last place vote.

## Details

The Borda Count method finds a winner by using a points system, which entails each candidate gaining the most points to win the election. The system works by giving each candidate that got a first place vote three points, each second place vote two points, third place votes one point, and last place vote with 0. Then you would multiply the point awarded to each candidate respectively to the number of votes that they got. For example, if a candidate got 17 first place votes then you would multiply 17 by 3 and then adding to that with the other points that the candidate receives. Once the process is finished, the candidate with the most points wins the election.
# Selected topics in finite mathematics/Voting coalitions

vteModule 1: Graphs and Optimization :
vteModule 2: Logic, Arguments, and Voting :
vteModule 3: Mathematics in money and ?? :
A coalition of voters is a set of voters that all agree to vote in the same way.

## Objectives

Some objectives include: 1. finding winning coalitions 2. finding minimal winning coalitions 3. finding a critical voter(s) 4. deciding if a motion can be passed or not

## Details

A coalition of voters is a group of voters that all agree to vote the same way. A winning coalition is a group of voters that is guaranteed to win the election no matter how anyone else votes A minimal coalition occurs when each of the voter's vote is necessary for the group to win the election. If one voter were to back out, then the motion would fail to pass.

## Examples

* Suppose the US Senate has 49 Republicans, 49 Democrats, and 2 independents. Assume the Republicans form a coalition and the Democrats form a coalition. Then the minimal winning coalitions are {R, D}, {R, I1, I2}, {D, I1, I2}. Curiously, in this situation those two independent votes seem to be very influential.
* In publicly held companies, the shareholders often have votes in proportion to the amount of stock they hold. However, many shareholders own few enough shares that they are dummy voters. Suppose a company is held by 12 people: A, B, C, D, E, F, G, H, I, J, K, and L. If E through L are dummies, then no minimal winning coalitions contain them. One possible set of minimal winning coalitions would be: {A, B, D}, {A, B, C}. In this case both A and B have veto power because they are in every minimal winning coalition. However, together A and B require the support of either C or D to pass a motion.

## Homework

* Consider the voting system give by [q:A,B,C,D]=[13:7,5,4,3]. Identify all coalitions. Which are winning coalitions?
* Solution
* [ABD, ABC, ACD, and ABCD (there are no minimal winning coalitions) ]
* Consider the voting system give by [q:A,B,C,D,E,F,G]=[13:6,6,4,2,1,1,1]. Identify all minimal winning coalitions.
* Solution
* [{A,B,E}, {A,B,G}, {A,B,F}, {A,C,D,E}, {A,B,D,E}, {G,F,E,A,D}, {E,F,G,B,D}]
# Selected topics in finite mathematics/Voting/Condorcet method

vteModule 1: Graphs and Optimization :
vteModule 2: Logic, Arguments, and Voting :
vteModule 3: Mathematics in money and ?? :

## Objectives

Placing each candidate against the other candidates one at a time to determine who wins all of their one on one competitions.

## Details

Condorcet method: a method of analyzing elections which declares the winner to be the individual/candidate that would win when placed against all the other candidates in a two-person election, meaning to compare one candidates votes and the other candidates votes to see who has the most. Once a candidate is seen to have defeated each and every candidate in a one on one competition, then that candidate is declared the winner.
However, the method only works if one candidate wins every one on one competition with all the other candidates. If a candidate even loses one on one competition then that person is not qualified to win according to Condorcet's method.
# Selected topics in finite mathematics/Voting/Sequential pairwise elections

vteModule 1: Graphs and Optimization :
vteModule 2: Logic, Arguments, and Voting :
vteModule 3: Mathematics in money and ?? :

## Objectives

To determine a winner using a one on one elimination style until one is left standing.

## Details

Sequential pairwise voting is very similar to that of Condorcet's method of one on one competition. You take one candidate and pit him against another candidate. You look at the preference list and you identify the places of the votes that the two candidates that are receiving and you add them up and see who is highest. For example, if B and C are going against each other in the one on one, you look at the preference list and see who is above who and give the votes to whoever has the higher placed votes. So if B is above C in the preference list then B gets the votes and vice-versa. Then you eliminate the candidate with the fewest votes and the candidate that won moves on to face another candidate. So let us say B had the higher votes, so C is eliminated and B moves to face D or any other opponent. You keep this process going until one candidate is left.