OpenLLM-France/wikimedia huggingface dataset:
# Occupational Health/Occupational Injury

Avoiding occupational injury is in the shared interest of workers, employers, and governments. There is an inherent compromise that is struck between safety and productivity when doing dangerous, but necessary, work. Ultimately, the loss of productivity associated with an injured of killed worker and the loss of a productive member of society makes worker safety a common goal, to say nothing of the emotional pain of losing someone close.

### Occupational illnesses

Certain types of occupational illnesses, which can also be construed as Occupational injury, include chronic conditions like silicosis and asbestosis, caused by the breathing of hard mineral dust during the grinding of rock. They also include pathogens, like tuberculosis, which are especially prevalent in the occupation of medicine. For more details, go to the Occupational Illnesses page.
This page will focus more on more acute injuries, as well as injuries immediately dangerous to life and health (IDLH).

## Remedies
### Administrative controls

The provision for a safe working environment requires the linking of responsibility for an injury to the worker and the employer alike. It is reasonable to expect that a worker will engage in a given activity in a sensible fashion and with all faculties in place, and with a compliant attitude toward linked safety measures that have been inculcated by the policies of the employer. Piece work driven industrial processes are most likely to amplify the risks to workers as they work harder and faster and with any shortcut they may perceive in order to maximize their gain for time expended.
The linkage of responsibility for injury to a worker to his employer is justified by the fact that the participation in the work setting is a proximate cause of the injury sustained and that factors in the work environment unrelated to the workers behavior result in the injury. Litigation becomes the default result of dispute over responsibility and threatens by virtue of the shear volume of litigation that could potentially result. As a consequence we evolve systems of regulation for worker safety that are intended to enforce an acceptable level of safety thereby minimizing the risks to an acceptable level and in any case precluding the possibility of economic gain through a disregard for worker safety through an enforced sanctioning of the enterprise by the responsible government agency.

### Workers compensation

Society can balance the need to do necessary work, with the moral obligation to compensating the loss of income for those injured by enacting workers compensation laws.
Some people view workers compensation as a cost. However, one can also view workers compensation as a way to incentivize people to do dangerous work. When evaluating costs, hidden costs, like the cost of driving workers away, as well as the cost of hiring new workers to replace injured ones, to say nothing of potential future liabilities like lawsuits, must all be considered when evaluating the cost of workers' compensation.
By and large, for responsible businesses, the costs of workers compensation are well worth the risks mitigated.
# Occupational Health/Safety Training

A notable instance of OSHA requiring training are the rules and protocols under 29 CFR 1910.134. However, the implementation of of this rule varies dramatically. In fact, one 1985 paper pointed out that 9% of programs surveyed didn't even properly check for the use of NIOSH-approved respirators!

## Future questions

To truly evaluate the quality of 29 CFR 1910.134 programs would require a randomized control trial. However, notice that it is 29 CFR 1910.134 trial, not an N95 trial.
In the same way an RCT giving books to uninformed students, or life jackets who won't wear them will not produce any meaningful results, giving people respirators with no explanation won't either. One might as well not have a respirator program at all, given the results above.
Some RCTs that are called N95 RCTs are actually 1910.134 RCTs, like this one. One of the tell-tale signs is that the RCT excludes people with beards, people who, under 29 CFR 1910.134, are not allowed to wear negative-pressure respirators.

## More information

* 1985 paper on respirator program quality
# Occupational Health/Occupational Hygiene
## Evaluation of Risk
### Qualitative Risk Assessment
### Measurement of Exposure
#### Air Monitoring

Aerosols, Dusts & Fume; Gases & Vapours; Pumped Sampling Methods; Diffusive Sampling Methods; Direct Reading Instrumentation; Sampling Strategies; Statistical Methods in Exposure Monitoring;

#### Noise Monitoring

Sound Pressure Level Mapping; Dosimetry; Octave Band Analysis; high noise level induces the hearing loss and continues working in same condition makes person to irritating

#### Health Surveillance
## Control
### Hierarchy of Control
#### Provision of PPE

Respiratory Protection; Respirator Fit Testing; Qualitative Fit Test; Qualitative Fit Test (Particulate; Pressure Drop) Hearing Protection; Skin Protection; Gloves; Skin Protection Programmes;

#### Washing, changing and storage of clothing
### Maintenance and Testing of Control Measures
## Professional Bodies
### ACGIH
### CRBOH

CRBOH

### IOHA

IOHA

## Occupational Hygiene Education
### Graduate Education
### Post Graduate Education
#### India

In India, there is a occupational health course, where graduates receive a Diploma in Occupational Health (DOH), formerly the Diploma in Industrial Health (DIH). This is a post graduate two year course for medical graduates, and it is recognised by the Medical council of India (MCI). Presently, this course is conducted by West Bengal University of Health Sciences (WBUHS) at the India Institute of Hygiene and Public Health (AIIH&PH) in Kolkata, West Bengal, India.
# Order Theory/Lexicographic order

Definition (lexicographic order):
Let $(S_{\alpha },\leq _{\alpha })_{\alpha \in A}$ be preordered sets, where $A$ is well-ordered. Define an order on $\bigcup _{\alpha \in A}$, the Cartesian product, by
    $(s_{\alpha })_{\alpha \in A}\leq (t_{\alpha })_{\alpha \in A}:\Leftrightarrow$.
Proposition (lexicographic order induced by posets is poset):
Whenever $$
Proposition (lexicographic order induced by total orders is total):
Whenever $A$ is a well-ordered set and $(S_{\alpha },\leq _{\alpha })_{\alpha \in A}$ are totally ordered sets, the lexicographic order on $\prod _{\alpha \in A}S_{\alpha }$ is total.
Proof: Let any two elements $(s_{\alpha })_{\alpha \in A}$ and $(t_{\alpha })_{\alpha \in A}$ of $\prod _{\alpha \in A}S_{\alpha }$ be given. Then either $(s_{\alpha })_{\alpha \in A}=(t_{\alpha })_{\alpha \in A}$, or there exists a smallest $\beta \in A$ so that $s_{\beta }\neq t_{\beta }$. Since $\leq _{\beta }$ is total, either $s_{\beta }<t_{\beta }$ or $s_{\beta }>t_{\beta }$, and thus either $(s_{\alpha })_{\alpha \in A}<(t_{\alpha })_{\alpha \in A}$ or $(s_{\alpha })_{\alpha \in A}>(t_{\alpha })_{\alpha \in A}$. $\Box$
# Overview

Tables are the most easily recognized structure in relational databases. All relational databases store user information in tables, and it’s how we visualize the data - tables contain rows and columns.
In addition to tables that are stored on disk, there are ‘virtual tables’. Virtual Tables are called views. This descriptive term describes exactly what they are, it is a structure that is made up of selected columns from one or more tables. Views are a useful construct for simplifying data access – for example, if a user is not experienced in SQL, a view can be created for them. This is also useful for security purposes; certain table data can be made accessible through views only to selected users. Complex data structures can be constructed with views and this approach can hide this complexity from users.
# Oracle

Tables are logical structures that the end user works with, they contain columns and rows. Columns describe attributes of rows in the table, and each column has a name (i.e. Social_Security_Number), a data type and width, precision or scale. When tables are created, Oracle allocates a segment in the table space for the table. Data is added, removed, selected and changed by database row, and this is usually done through SQL
# Order Theory

* Preordered sets and posets
* Upper and lower bounds
* Well-ordered sets
* Series-parallel order
* Lexicographic order
* Ordinal numbers
* Chains, chain conditions, Zorn's lemma
* Lattices
* Total orders
* The Grothendieck axioms
* Continuous geometries
# Order Theory/Lattices
## Definition and characterisation

Definition (lattice):
Let $(X,\leq )$ be an ordered set. $X$ is called a lattice if and only if any two elements $x,y\in X$ have both a join and a meet.
Definition (algebraic lattice):
Let $L$ be any set, and let $\vee :L\times L\to L$ and $\wedge :L\times L\to L$ be two functions. $L$ is called an algebraic lattice if and only if the functions $\vee$ and $\wedge$ satisfy the following: For all $x,y,z\in X$

## Special types of lattices

Definition (complete lattice):
A complete lattice is an ordered set $(X,\leq )$ such that whenever $(x_{i})_{i\in I}$ is a family of elements of $X$, both $\bigvee _{i\in I}x_{i}$ and $\bigwedge _{i\in I}x_{i}$ exist.
# Summary

Both Oracle and IBM have the same fundamental construct that is stored on disk, fetched by the DBMS and held in the database buffer pool. IBM calls this a Page, whereas Oracle calls it a block. Both have a fixed header structure, but the contents are different. In IBM the header stores information about the location and size of free space in the page. In Oracle, the header stores directory information for tables and rows. In Oracle, data in the block fills the block from the bottom up, essentially squeezing the free space in the block between the data at the bottom, and directory information at the top. There is a fixed header overhead in both Oracle and IBM, but in Oracle part of the header are the table and row directories, which grow downward from the header – essentially the fixed and variable overhead of Oracle means the header is variable. In IBM, the header is fixed, and the information about where in the page data is located is stored in the ID Map which grows from the bottom of the page upward. A new 2 byte entry is made in the ID Map for each element in the page. The IBM page header keeps track of free space in the page, but as the page fills from the top down, the bottom of the table is comprised of contiguous free space, with the ID Map beneath this. When an insert of a row is attempted into a page (either an update of an existing row, or a new row) and there is no space available, DB2 will de-fragment the page to make more space. If this is still insufficient, the whole row is copied to another page and a pointer is left in the original position to this new page. In Oracle, when an update or insert does not have enough space, the row can be split into row pieces and the row pieces chained across blocks to overcome this. In Oracle, data and indexes can be mixed in a block, whereas in DB2 data and indexes have to be in their own page.
While it can be seen that there is a common unit of currency between disk and memory (be it a block or a page), that is fetched and written as a whole, and looks the same in both places, information is located in different places in each. The maps or directories to elements in a block or a page are in different places, and blocks and pages are filled differently with data (top down or bottom up).
Even though these constructs are structurally different, they do the same thing. The differences are largely academic since the DBMS is responsible for the writing, organization and management of blocks or pages, all the DBMS user knows is that in each case the block or page is read from disk into memory where its constituent parts (data and indexes) are available to their applications. It is useful however to understand these differences when considering compatibility, since they have ramifications for such techniques as data clustering. Clustering is the same thing in each DBMS (row re-sequencing and index clustering, for example), but the implementation is just different enough that this valuable facility is not completely transparent. This will be covered later once we have covered the similarities and differences in table structures, index structures and datatypes in each DBMS.
# Oratory and Rhetoric

Introduction to this book
Words are power. They have power over people's minds. Behind every event which changed the course of history are words of great orators.
This book will analyze the orators and their speeches and try to find out what makes them and their words great.
* Introduction to Oratory and Rhetoric
* History
* The Great Orators
* Rhetorical Devices
* Oratory in literature
* Topic
** Topic
** Topic
* References
# DB2

Because tables are logical structures, they are represented in DB2 the same way as they are in Oracle – Tables contain Rows and Columns. The analogous structures that can be seen in the two databases are that DB2 stores data in Pages, and Oracle uses Blocks. Both pages and blocks are fetched as a single contiguous chunk as extents. Within Oracle, extents are organized into segments, in DB2 they are managed in containers. Both containers and segments are contained within DB2 and Oracle tablespaces respectively.
# Mathematical Proof and the Principles of Mathematics/Sets/Replacement
## Replacement

The Axiom Schema of Replacement says that if one replaces each of the elements of a set according to some formula, then the result is also a set.
Axiom Schema (Replacement)
   Let $P(x,y,A)$ be a property such that for each $x\in A$ there is a unique $y$ such that $P(x,y,A)$ holds. There exists a set $B$ consisting of all the $y$ for which there exists some $x\in A$ such that $P(x,y,A)$ holds.
Technically the formula is allowed to have finitely many free variables, and is often written $P(x,y,w_{1},w_{2},\ldots ,w_{n},A)$.
As for the Axiom Schema of Comprehension, there is an axiom in the schema for every possible property $P(x,y,w_{1},w_{2},\ldots ,w_{n},A)$.
As for the Axiom of Foundation, most of mathematics can be accomplished without the Axiom Schema of Replacement. However, the axiom allows for the construction of certain infinite sets that are important in set theory itself.
# Mathematical Proof and the Principles of Mathematics/Sets/Power sets
## Power sets

Power sets allow us to discuss the class of all subsets of a given set $A$, i.e. $\{U\;|\;U\subseteq A\}$. That this is a set is the subject of the Power Set Axiom.
Axiom
   Given a set $A$ there exists a set of sets $S$ such that $U\in S$ iff $U\subseteq A$.
Theorem Given a set $A$, there exists a unique set whose elements are the subsets of $A$.
Proof If $S_{1}$ and $S_{2}$ are two such sets of subsets then $U\in S_{1}$ if and only if $U\subseteq A$. But the same is true of $S_{2}$. Thus $U\in S_{1}$ iff $U\in S_{2}$, and so $S_{1}=S_{2}$ by the Axiom of Extensionality. $\square$
Definition Given a set $A$, the set of all subsets of $A$ is called the power set of $A$. It is denoted ${\mathcal {P}}(A)$.
Example If $A=\{a,b,c\}$ then ${\mathcal {P}}(A)=\{\emptyset ,\{a\},\{b\},\{c\},\{a,b\},\{a,c\},\{b,c\},\{a,b,c\}\}$.

## Cartesian products

Recall the Kuratowski definition of an ordered pair, $(a,b)=\{\{a\},\{a,b\}\}$ for $a$ and $b$ elements of a set $A$. Note that $\{a\}$ and $\{a,b\}$ are both subsets of $A$, i.e. they are elements of the power set ${\mathcal {P}}(A)$.
This means that $(a,b)$ is a subset of ${\mathcal {P}}(A)$, i.e. $(a,b)\in {\mathcal {P}}({\mathcal {P}}(A))$.
We can generalise this slightly with a simple trick. We can define $(a,b)$ with $a\in A$ and $b\in B$ for sets $A$ and $B$. In order to do this, we simply take the elements $a$ and $b$ from the union of sets $A\cup B$.
In other words, we have $(a,b)\in {\mathcal {P}}({\mathcal {P}}(A\cup B))$ with $a\in A$ and $b\in B$.
Theorem The class of all ordered pairs $(a,b)$ of elements of $A\cup B$ with $a\in A$ and $b\in B$, is a set.
Proof The set in question is given by $\{x\in {\mathcal {P}}({\mathcal {P}}(A\cup B))\;|\;x=(a,b),a\in A\;{\mbox{and}}\;b\in B\}$. This is a set by the axioms of Power Set, Union and the Axiom Schema of Comprehension. $\square$
Definition The set of ordered pairs $(a,b)$ with $a\in A$ and $b\in B$ is called the cartesian product of $A$ and $B$, and is denoted $A\times B$.

## Exercises

* Show that for sets $A,B,C,D$ we have $(A\cap B)\times (C\cap D)=(A\times C)\cap (B\times D)$.
* Show that for sets $A,B,C$ we have $A\times (B\cap C)=(A\times B)\cap (A\times C)$.
* Show that for sets $A,B,C$ we have $A\times (B\cup C)=(A\times B)\cup (A\times C)$.
* Show that for sets $A,B,C$ with $A\subseteq B$ we have $A\times C\subseteq B\times C$.
← Classes and foundation · Natural numbers →
# Mathematical Proof and the Principles of Mathematics/Sets/Classes and foundation
## Foundation

Much of mathematics can be accomplished without the Axiom of Foundation, but it eliminates numerous pathological cases that would otherwise complicate set theory.
For example, the Axiom of Foundation excludes sets of the form $S=\{a_{1},a_{2},a_{3},\ldots \}$ where $a_{2}\in a_{1}$, $a_{3}\in a_{2}$, etc. It also excludes sets that contain themselves.
Later we'll also see that the Axiom of Foundation can be used along with the Axiom Schema of Replacement, which we have not defined yet, to show that sets cannot be nested infinitely deep. All sets can be built up from the bottom.
Axiom (Foundation)
   Every non-empty set $S$ contains an element that is disjoint from $S$.
The Axiom of Foundation is sometimes called the Axiom of Regularity.
One of the immediate consequences of the Axiom of Foundation is the following.
Theorem If $S$ is a set then $S\notin S$.
Proof Consider the set $\{S\}$ which is a set by the Axiom of Pair. Now the Axiom of Foundation says that this set must have an element that is disjoint from $\{S\}$. However the only element is $S$ and thus $S$ must be disjoint from $\{S\}$. Since $\{S\}$ contains $S$, this means that $S$ may not contain $S$. $\square$
Another way to show this result is to prove the following more general result and specialise it for $X=Y$.
Theorem If $X$ and $Y$ are sets then we do not have both $X\in Y$ and $Y\in X$.
Proof Consider the set $\{X,Y\}$ which is a set by the Axiom of Pair. By the Axiom of Foundation it must contain an element which is disjoint from it. Thus either $X$ or $Y$ is disjoint from $\{X,Y\}$.
As $\{X,Y\}$ contains both $X$ and $Y$, either $Y\notin X$ or $X\notin Y$. $\square$
Now we will show that there are no sets of the form $S=\{a_{1},a_{2},\ldots \}$ with $a_{i+1}\in a_{i}$ for all $i$.
Theorem There does not exist a set $S$ with the property that for all $x\in S$ there exists $y\in S$ such that $y\in x$.
Proof This follows directly from the Axiom of Foundation, since every element $x\in S$ has an element in common with $S$, namely the element $y\in x$ that is assumed to exist. $\square$

## Exercises

* Let $T=\{S,\{S\}\}$. Use the Axiom of Foundation to show that $S\neq T$.
← Union and intersection · Power sets →
# OpenGL Programming/Installation/GLUT

GLUT is the utility toolkit that provides Window management for OpenGL applications and their interface with the operating system.

## GLUT alternatives

GLUT started as a non-free library. Nowadays, free/open-source and portable alternatives such as FreeGLUT and OpenGLUT exist.
In this wikibook, we recommend FreeGLUT. See the platform-specific installation pages for details on how you can install it.

## More information

This program shows info about glut.
To compile :
To run :
* ↑ koders.com : glversion.c
- Recent stats
< OpenGL Programming/Installation
# OpenGL Programming/Intermediate/Lighting

In order to begin the proper light set up of OpenGL, you first have to understand the theory of micro quantimistics. This theory states that quantized light is refracted off of any surface at a congruent entrance as well as the departure for the surface, therefore we must take into account the refractive abstraction of the surface we are trying to create. To begin lighting, you must use the LIGHT_A_B_C operator. A,B, and C are variables that represent the different hues of light and color. A is for red, B is for green, and C is for blue. Most programmers pick their colors on programs such as paint and just transfer the numbers because most people do are not knowledgeable enough to memorize color consistencies. After you have chosen the type of light you want to be refracted and reflected from the surface, you have to put the direction and angle in brackets next to the operator. For example, LIGHT_23_13_4 {90 FRONT} beams a teal light on to your surface from the front in a perpendicular ray.
# OpenGL Programming/Installation/Mac

OpenGL was deprecated in macOS 10.14, but at least in macOS 10.15, OpenGL and GLUT are still available

### Use GLUT and OpenGL from within Xcode:

* Open Xcode located in "/Developer/Applications/"
* Choose "New Project" from the file menu
* Choose "Command Line Tool" under the Application template for Mac OS X
* Choose type "C++"
* Enter your desired project name and directory and click create
* In the "Linked Frameworks and Libraries" area click the "+" button, and select "OpenGL.framework"
* Repeat for "GLUT.framework"
When #including OpenGL & GLUT header files (but not the regular ones like iostream) within Xcode, make sure to do so like this:
in other words:
# OpenGL Programming/Installation/Windows

All version of Windows from Windows 95 come with an OpenGL implementation (usually version 1.4). However, if you installed (or updated) the drivers for your graphics card it's probable that you're using your board manufacturer's own implementation of OpenGL.

## OpenGL

The OpenGL library can usually be found by the name opengl32.dll under the \system32 folder, located in your system's root folder (usually c:\windows).
Headers compatible with OpenGL are bundled with most compilers. The header's versions may not be fully updated to your running implementation of OpenGL. If so, the new functions must be linked manually using the OpenGL's extension system, or using a wrapper such as GLEW.

## GLEW

GLEW's official release is meant to work with visualc++ - but if you're using MinGW/GCC with Code::Blocks, no worry - you can:
* link directly to the .dll (instead of adding the mingw-incompatible .lib)
* or, you can recompile it and use it as a shared library, using MSys:
* or, you can build GLEW statically: add glew32s.lib to linker libraries in the linker options, and add -DGLEW_STATIC to your compiler flags.
* Link: The OpenGL Extension Wrangler Library - Installation
* Link: glew-users : mailing list where I reported the link issue - hopefully the GLEW developers will provide a MinGW-compatible binary release.
GLee only compiles statically under Windows (not cross-compiling from GNU/Linux) but doesn't have this issue.

## GLUT

* freeglut Windows Development Libraries - link with -lfreeglut instead of -lglut32; don't use the Code::Blocks wizard for GLUT projects since it's specific to non-free GLUT
* Using OpenGL & GLUT in Code::Blocks - good tutorial; add #include <windows.h> before including non-free glut.h

## GLM

GLM is a headers-only library, so you just need to unzip the GLM release to a directory, and add that directory to your include path in the project properties.

## Cross-compilation

Newer tutorial Makefile's can now be invoked using a MXE-compatible environment, for example:
* Compile MXE:
* Prepare environment:
* Compile as easily as usual:
Debugging note: due to a bug you need to pipe your input to GDB through cat:

# Error logs

sdl2-config --libs sets the -mwindows option which removes the command black window but also stdout and stderr.
To see e.g. SDL_LogMessage output you can:
* force console mode:
* or explicitly redirect stderr:
(If you know why explicit redirection is necessary, feel free to explain.)
- Recent stats
< OpenGL Programming/Installation