OpenLLM-France/wikimedia huggingface dataset:
# Engineering Projects/Illuminate Clothing/Howard Community College/Spring2012

Project documentation focuses on how the team organized itself to tackle the unknown. This is a creative process. The details learned should be captured in tutorials. Project documentation should focus on how the team organized itself to step out into the unknown. Failure is common. The single most effective way to increase engineering respect is to document failures in a creative way that stimulates, inspires and helps others continue the project. Projects are never done. There are always loose ends. There are always decisions that might have been made more clearly. There are always other alternatives that might have been considered. None of this stuff appears in a tutorial. It does appear in the team documentation. Contents
Electronic Sections Expected[edit] Problem Statement[edit]
What is the final, negotiated problem statement? Team Members[edit]
Put each team members name here with links to their user pages here. Real names do not have to be used. Summary[edit]
Put an overall, short one paragraph summary here. Poster[edit]
Put a graphic in wikimedia, include the graphic here or link to it here. The graphic should be suitable for creating a traditional project poster. Story[edit]
Tell a detailed story of the project. Describe how split up, what the obstacles were, what testing was done, what informal decisions were made, what assumptions were made, what the results were. Decision List[edit]
List all formal decisions made with links to their documentation such as a decision tree or decision matrix. Material List[edit]
Software List[edit]
You installed different software packages or used already installed software. Describ the programs here. Time[edit]
Put one number here. Hours. Total hours that everyone worked on the project. Do not estimate. Do not talk about it. ADD. Tutorials[edit]
All projects create new tutorials of technical details future participants are going to want to know. They are going to be separate pages that are linked to here. Next Steps[edit]
List specific details, advice, describe the current problems that the next team faces associated with the project here.
# Engineering Projects/Illuminate Clothing/Howard Community College

Howard Community College is starting this project in the fall of 2011. The goal is to give those that program and/or game a very specific programming project.
       fall2012
       spring2012
       Fall2011
# Engineering Projects/Illuminate Clothing/Howard Community College/Fall2011

       501_T2C
       550_T2C 2ND PROJECT
       550_Tfalak 3RD PROJECT
# Engineering Projects/Illuminate Clothing/Howard Community College/fall2012

p1-504-gtdm
p2-504-krfb
# Engineering Projects/Igloo/Howard Community College/Fall2012/p1-502-rmwh

Please delete everything in italics after filling it out.
Project documentation focuses on how the team organized itself to tackle the unknown. This is a creative process. The details learned should be captured in tutorials. Project documentation should focus on how the team organized itself to step out into the unknown. Failure is common. The single most effective way to increase engineering respect is to document failures in a creative way that stimulates, inspires and helps others continue the project. Projects are never done. There are always loose ends. There are always decisions that might have been made more clearly. There are always other alternatives that might have been considered. None of this stuff appears in a tutorial. It does appear in the team documentation.

## Electronic Sections Expected
### Problem Statement

What is the final, negotiated problem statement?

### Team Members

Put each team members name here with links to their user pages here. Real names do not have to be used.

### Summary

Put an overall, short one paragraph summary here.

### Poster

Put a graphic in wikimedia, include the graphic here or link to it here. The graphic should be suitable for creating a traditional project poster.

### Story

Tell a detailed story of the project. Describe how split up, what the obstacles were, what testing was done, what informal decisions were made, what assumptions were made, what the results were.

### Decision List

List all formal decisions made with links to their documentation such as a decision tree or decision matrix.

### Material List

    1. List materials used, quantity, size, cost.
    2. Describe what needs to be purchased in the future to continue working on this project.

### Software List

You installed different software packages or used already installed software. Describ the programs here.

### Time

Put one number here. Hours. Total hours that everyone worked on the project. Do not estimate. Do not talk about it. ADD.

### Tutorials

All projects create new tutorials of technical details future participants are going to want to know. They are going to be separate pages that are linked to here.

### Next Steps

List specific details, advice, describe the current problems that the next team faces associated with the project here.
# Loop models and their critical limits

This page is for summarizing known results about two-dimensional loop models and their critical limits. There are many different loop models, depending on the lattice, on whether loops can cross, on whether the model is dilute, dense, fully packed, etc. In the critical limit, there are not that many different universality classes.
Results that are sufficiently well-established and well-covered in the literature could be summarized in Wikipedia. Here, we can have more recent or speculative results.

## Lattice statistical models

For the moment we are collecting useful information and reference. Ultimately we want to organize these models into something resembling a classification.
* 6 vertex model on a square lattice, giving rise to a free boson in the critical limit?
* Nonintersecting loops on a honeycomb lattice. (Honeycomb model.) (4 vertex model.)
* Fully-packed loops on a honeycomb lattice. (3 vertex model.)
* Completely packed loops on a square lattice. (Model T.) (2 vertex model.)
* Potts' random cluster model. (2 bond model.)
What about RSOS?

## Conformal field theories

* O(n) model.
* U(n) model.
* Potts model.
* Loop CFT.
* Compactified free boson.

## Relevant Wikipedia articles

* w:Potts model
* w:N-vector_model
* w:Ising model
* w:Two-dimensional_critical_Ising_model
# Lorentz transformation
## Proposition

Given that the interval $x^{\mu }x_{\mu }$ is invariant under a Lorentz transformation, prove that the Lorentz transformation is orthogonal.
| 1. | $x'^{\mu }x'_{\mu }=x^{\alpha }x_{\alpha }$. | Given. |
| 2. | $x'^{\mu }x'_{\mu }=g_{\mu \nu }x'^{\mu }x'^{\nu }$ | metric tensor |
| 3. | $x'^{\mu }=\Lambda ^{\mu }_{\alpha }x^{\alpha }$ | Lorentz transformation |
| 4. | $x'^{\nu }=\Lambda ^{\nu }_{\beta }x^{\beta }$ | Lorentz transformation |
| 5. | $x'^{\mu }x'_{\mu }=g_{\mu \nu }\Lambda ^{\mu }_{\alpha }x^{\alpha }\Lambda ^{\nu }_{\beta }x^{\beta }$ | Substitute 3 and 4 into 2. |
| 6. | $x^{\alpha }x_{\alpha }=g_{\alpha \beta }x^{\alpha }x^{\beta }$ | metric tensor |
| 7. | $g_{\mu \nu }\Lambda ^{\mu }_{\alpha }x^{\alpha }\Lambda ^{\nu }_{\beta }x^{\beta }=g_{\alpha \beta }x^{\alpha }x^{\beta }$ | From 5, 1, and 6. |
| 8. | $g_{\mu \nu }\Lambda ^{\mu }_{\alpha }\Lambda ^{\nu }_{\beta }x^{\alpha }x^{\beta }=g_{\alpha \beta }x^{\alpha }x^{\beta }$ | Rearrange 7. |
| 9. | ∴ $g_{\mu \nu }\Lambda ^{\mu }_{\alpha }\Lambda ^{\nu }_{\beta }=g_{\alpha \beta }$ | From 8, since $x^{\alpha }$ and $x^{\beta }$ may be arbitrary. |
| 10. | $g_{\alpha \beta }g^{\alpha \gamma }=\delta ^{\gamma }_{\beta }$ | Kronecker delta |
| 11. | $g_{\mu \nu }\Lambda ^{\mu }_{\alpha }\Lambda ^{\nu }_{\beta }g^{\alpha \gamma }=\delta ^{\gamma }_{\beta }$ | Multiply both sides of 9 by $g^{\alpha \gamma }$, then apply 10. |
| 12. | $g_{\mu \nu }\Lambda ^{\mu \gamma }\Lambda ^{\nu }_{\beta }=\delta ^{\gamma }_{\beta }$ | Contracting the indices $\alpha$ in 11. |
| 13. | $\Lambda _{\nu }^{\gamma }\Lambda ^{\nu }_{\beta }=\delta ^{\gamma }_{\beta }$ | Contracting the indices $\mu$ in 12. |
| 14. | $(\Lambda ^{T})^{\gamma }_{\nu }\Lambda ^{\nu }_{\beta }=\delta ^{\gamma }_{\beta }$ | Swap the order of indices in order to transpose the first $\Lambda$ of 13. |
| 15. | ∴ $\Lambda ^{T}=\Lambda ^{-1}$ $\Box$ | 14 may be paraphrased as $\Lambda ^{T}\Lambda =I$. |
Reference: http://www.physics.gla.ac.uk/~dmiller/lectures/RQM_2008.pdf, page 9.
# Louis de Funès' film characters
### Introduction

The aim of this project is to present an inventory of film characters played by Louis de Funès. The project itself has been created as an attempt to compensate for the scarcity of online information on the actor's filmography in English, especially on Wikipedia. Everyone is welcome to contribute, especially fans of de Funès and his films, since the project is meant to be a fan effort.

### Short bio

Louis de Funès (31 July 1914 – 27 January 1983) born Louis Germain David de Funès de Galarza, was a popular French actor of Spanish origin and one of the giants of French comedy alongside André Bourvil and Fernandel. His acting style is remembered for its high energy performance, wide range of facial expressions and engaging, snappy impatience and selfishness. A big part of his most famous work was in collaboration with director Jean Girault, and together, they wrote and directed the French classic L'avare (1980) in which he also starred.
He was a household name in several countries of Europe (Greece, Hungary, Czechoslovakia, Poland, Bulgaria, Germany, Spain, Turkey, Albania, Romania, USSR, Iran and Yugoslavia in particular) for many years, yet remained almost unknown in the English-speaking world. He was seen only once in the United States in 1974 with the release of The Mad Adventures of Rabbi Jacob, which was nominated for a Golden Globe. According to a 1968 poll he was France's favourite actor. Funès played over 130 roles in film and over 100 roles on stage.

### Browse by films

* The Gendarme series
* La Grande Vadrouille
* La Folie des Grandeurs (Delusions of Grandeur)
* Hibernatus
* La Soupe aux choux
* The Fantômas trilogy
* Les Aventures de Rabbi Jacob (The Mad Adventures of Rabbi Jacob)
* Les Grandes Vacances
* Le Petit Baigneur (The Little Bather)
# Internet Protocol Analysis/Name Resolution/Lesson Flashcards
## Instructions

* Click on the flashcard text to show the answer.
* Click on Next Card to show the next flashcard.
    Log in to hide the Clear the cache of this page? message before each new flashcard.
* Name Resolution Lesson
* The Domain Name System _____ the responsibility of assigning domain names and mapping those names to IP addresses. _____ name servers are assigned to be responsible for their particular domains, and in turn can assign other _____ name servers for their sub-domains. The Domain Name System distributes the responsibility of assigning domain names and mapping those names to IP addresses. Authoritative name servers are assigned to be responsible for their particular domains, and in turn can assign other authoritative name servers for their sub-domains.
* Next Card
# Internet Protocol Analysis/Network Monitoring/Lesson Flashcards
## Instructions

* Click on the flashcard text to show the answer.
* Click on Next Card to show the next flashcard.
    Log in to hide the Clear the cache of this page? message before each new flashcard.
* Network Monitoring Lesson
* Simple Network Management Protocol (SNMP) is an Internet-standard protocol for _____. With SNMP, administrative computers called _____ monitor or manage a group of hosts on a computer network. Each managed system executes an _____ which reports information via SNMP to the manager. Simple Network Management Protocol (SNMP) is an Internet-standard protocol for managing devices on IP networks. With SNMP, administrative computers called managers monitor or manage a group of hosts on a computer network. Each managed system executes an agent which reports information via SNMP to the manager.
* Next Card
# Internet Protocol Analysis/Network Monitoring/Terms Flashcards
## Instructions

* Click on the flashcard text to show the answer.
* Click on Next Card to show the next flashcard.
    Log in to hide the Clear the cache of this page? message before each new flashcard.
* Network Monitoring Terms
* The interval between the receipt of the end of transmission of an inquiry message and the beginning of the transmission of a response message to the station originating the inquiry is _____. response time
* Next Card
# Internet Protocol Analysis/Name Resolution/Terms Flashcards
## Instructions

* Click on the flashcard text to show the answer.
* Click on Next Card to show the next flashcard.
    Log in to hide the Clear the cache of this page? message before each new flashcard.
* Name Resolution Terms
* A portion of a domain name space using the Domain Name System (DNS) for which administrative responsibility has been delegated is a _____. DNS zone
* Next Card
# Internet Protocol Analysis/Packet Analyzers/Lesson Flashcards
## Instructions

* Click on the flashcard text to show the answer.
* Click on Next Card to show the next flashcard.
    Log in to hide the Clear the cache of this page? message before each new flashcard.
* Packet Analyzers Lesson
* Packet analyzers such as Wireshark and tcpdump depend on a packet capture library known as _____ or _____. Packet analyzers such as Wireshark and tcpdump depend on a packet capture library known as libpcap or WinPcap.
* Next Card
# Motivation and emotion/Book/2014/Firesetting motivation/Quiz

Firesetting quiz
# PlanetPhysics/Examples of Functor Categories
### Introduction

Let us recall the essential data required to define functor categories. One requires two arbitrary categories that, in principle, could be large ones, ${\mathcal {\mathcal {A}}}$ and ${\mathcal {C}}$, and also the class $'''M'''=[{\mathcal {\mathcal {A}}},{\mathcal {C}}]$ (alternatively denoted as ${\mathcal {C}}^{\mathcal {\mathcal {A}}}$) of all covariant functors from ${\mathcal {\mathcal {A}}}$ to ${\mathcal {C}}$. For any two such functors $F,K\in [{\mathcal {\mathcal {A}}},{\mathcal {C}}]$, $F:{\mathcal {\mathcal {A}}}\rightarrow {\mathcal {C}}$ and $K:{\mathcal {\mathcal {A}}}\rightarrow {\mathcal {C}}$, the class of all natural transformations from $F$ to $K$ is denoted by $[F,K]$, (or simply denoted by $K^{F}$). In the particular case when $[F,K]$ is a set one can still define for a small category ${\mathcal {\mathcal {A}}}$, the set $Hom(F,K)$. Thus, (cf. p. 62 in), when ${\mathcal {\mathcal {A}}}$ is a small category the class $[F,K]$ of natural transformations from $F$ to $K$ may be viewed as a subclass of the cartesian product $\prod _{A\in {\mathcal {\mathcal {A}}}}[F(A),K(A)]$, and because the latter is a set so is $[F,K]$ as well. Therefore, with the categorical law of composition of natural transformations of functors, and for ${\mathcal {\mathcal {A}}}$ being small, $'''M'''=[{\mathcal {\mathcal {A}}},{\mathcal {C}}]$ satisfies the conditions for the definition of a category, and it is in fact a functor category.

### Examples

* Let us consider ${\mathcal {A}}b$ to be a small abelian category and let $\mathbb {G} _{Ab}$ be the category of finite Abelian (or commutative) groups, as well as the set of all covariant functors from ${\mathcal {A}}b$ to $\mathbb {G} _{Ab}$. Then, one can show by following the steps defined in the definition of a functor category that $[{\mathcal {A}}b,\mathbb {G} _{Ab}]$, or ${\mathbb {G} _{Ab}}^{{\mathcal {A}}b}$ thus defined is an Abelian functor category .
* Let $\mathbb {G} _{Ab}$ be a small category of finite Abelian (or commutative) groups and, also let ${\mathsf {G}}_{G}$ be a small category of group-groupoids, that is, group objects in the category of groupoids. Then, one can show that the imbedding functors $I$ : from $\mathbb {G} _{Ab}$ into ${\mathsf {G}}_{G}$ form a functor category ${{\mathsf {G}}_{G}}^{\mathbb {G} _{Ab}}$.
* In the general case when ${\mathcal {\mathcal {A}}}$ is not small, the proper class $M=[{\mathcal {\mathcal {A}}},{\mathcal {{\mathcal {A}}'}}]$ may be endowed with the structure of a supercategory defined as any formal interpretation of ETAS with the usual categorical composition law for natural transformations of functors; similarly, one can construct a meta-category called the supercategory of all functor categories .
# PlanetPhysics/Examples of Periodic Functions

We list common periodic functions. In the parentheses, there are given their period with least modulus.
* One-periodic functions with a real period: sine ($2\pi$), cosine ($2\pi$), tangent ($\pi$), cotangent ($\pi$), secant ($2\pi$), cosecant ($2\pi$), and functions depending on them -- especially the triangular-wave function ($2\pi$); \,the mantissa function $x\!-\!\lfloor {x}\rfloor$ (1).
* One-periodic functions with an imaginary period: exponential function ($2i\pi$), hyperbolic sine ($2i\pi$), hyperbolic cosine ($2i\pi$), hyperbolic tangent ($i\pi$), hyperbolic cotangent ($i\pi$), and functions depending on them.
* Two-periodic functions:\, elliptic functions.
* Functions with infinitely many periods: the Dirichlet's function
   ${\begin{matrix}f\!:\;x\mapsto \!&\left\{{\begin{array}{ll}1&{\mbox{when}}\,\,x\in \mathbb {Q} \\0&{\mbox{when}}\,\,x\in \mathbb {R} \!setminus\!\mathbb {Q} \end{array}}\right.\end{matrix}}$
has any rational number as its period;\, a constant function has any number as its period.
# PlanetPhysics/Fermion

\newcommand{\sqdiagram}[9]{Failed to parse (unknown function "\diagram"): {\displaystyle \diagram #1 \rto^{#2} \dto_{#4}& \eqno{\mbox{#9}}} }
Fermions are particles with a half-integer spin value, and they are named after the famous Italian--American, Nobel Laureate physicist Enrico Fermi who built the first known operational nuclear reactor in Chicago as part of the Manhattan project during WWII. Several particles like leptons, quarks and baryons are all fermions.
Since fermions have half-integer spin they obey a certain type of quantum-mechanical statistics called the Fermi-Dirac statistics, which also includes the consequences of the Pauli `exclusion principle'; the latter principle states that no two fermions can occupy the same quantum mechanical state of a quantum mechanical system. The exclusion principle is the main reason that fermions are the building blocks of the existing physical world, and for the stability of the electron orbitals in atoms and molecules.
All known `elementary particles': quarks, electrons, protons, etc are fermions with a spin value of 1/2-- and this suggests that the spin 1/2 elementary particle state is a unique, fundamental state of all stable matter in our physical Universe.
(One notes however that in superconducting systems that are usually macroscopically coherent quantum systems, the formation of phase-correlated `Cooper pairs' of electrons coupled to the ionic lattice of the superconducting metal does apparently run counter to the Pauli exclusion principle; furthermore, the transition to superconductivity involves necessarily a spontaneous symmetry breaking that gives rise to Goldstone bosons without which the superconductivity phenomenon/superconductivity phase transition would not be possible. Thus, in superconducting materials the electron pairs follow the Bose-Einstein statistics of very low-temperature condensates and behave like coupled boson chains, instead of the Fermi statistics of uncorrelated electrons which is most common to high temperature electrons; then, all such superconducting electron pairs are able to occupy the ground state with the lowest possible energy in certain superconducting materials for temperatures below approximately 110 degree K.)
Fermions at high temperatures act on each other by exchanging field carrier bosons, just as, for example, in the case of quarks (that are fermions) and gluons (that are bosons) inside a nucleon, such as a proton or a neutron of an atomic nucleus.
# PlanetPhysics/Fermat's Principle

\newcommand{\sqdiagram}[9]{Failed to parse (unknown function "\diagram"): {\displaystyle \diagram #1 \rto^{#2} \dto_{#4}& \eqno{\mbox{#9}}} }

## Fermat's Principle

Initially conceived in optics, Fermat's principle was stated as the principle of least time for traveling light waves, that is the path or paths taken between two points by light which can be traversed in the least time; in an Euclidean space or a flat Minkowski space, this is the straight line defined by a single ray of light. This can be thought as the trajectory of an emitted photon traveling at the universal maximum speed $c$ in vacuum. In a Riemannian or Minkowski spacetime this corresponds to the surface of a light cone.
In general relativity, however, a point particle path is a geodesic curve in a Riemannian space that can be curved, for example, by the presence of intense gravitational fields. One such effect was observed and reported by modern astrophysicists and is called gravitational lensing .
# PlanetPhysics/Fermi Dirac Distribution

The Fermi-Dirac distribution gives the probability of a fermion occupying a Microstate with energy $\epsilon$ and chemical potential $\mu$ at a temperature T. It is:
   $f(\epsilon )={\frac {1}{1+exp({\frac {\epsilon -\mu }{kT}})}}$
# Literature/1986

Authors :
* A B C D E F G H I J K L M N O P Q R S T U V W X Y Z &

## Subpages

* Literature/1986/Arbib $^{[^]}$
* Literature/1986/Baars $^{[^]}$
* Literature/1986/Barrow $^{[^]}$
* Literature/1986/Cohen J $^{[^]}$
* Literature/1986/Cohen S $^{[^]}$
* Literature/1986/Dreyfus $^{[^]}$
* Literature/1986/Hirsch $^{[^]}$
* McClelland, James; David Rumelhart, and PDP Research Group (1986). Parallel Distributed Processing: Explorations in the Microstructure of Cognition. Volume 2: Psychological and Biological Models. Cambridge, MA: MIT Press. $^{[^]}$
* Literature/1986/Medawar $^{[^]}$
* Literature/1986/Norman $^{[^]}$
* Literature/1986/Perkins $^{[^]}$
* Literature/1986/Rumelhart $^{[^]}$
* Literature/1986/Salton $^{[^]}$
* Literature/1986/Simon $^{[^]}$
* Literature/1986/Sosa $^{[^]}$
* Literature/1986/Sperber $^{[^]}$
* Literature/1986/Suchman $^{[^]}$
* Swanson, Don R. (1986). "Fish oil, Raynaud's Syndrome, and Undiscovered Public Knowledge." Perspectives in Biology and Medicine 30 (1): 7-18. $^{[^]}$
* Trigg, Randall Hagner & Mark Weiser (1986). "TEXTNET: A Network-based Approach to Text Handling," ACM Transactions on Information Systems (TOIS) Vol. 4, No.1 (Jan. 1986) pp. 1-23. $^{[^]}$
* Literature/1986/Wilder-Smith $^{[^]}$
* Winograd, Terry and Flores, Fernando (1986). Understanding Computers and Cognition: A New Foundation for Design. Ablex Publishing Corp. $^{[^]}$
* Ngũgĩ wa Thiong'o (1986). Decolonising the Mind: the Politics of Language in African Literature Nairobi/London: East African Educational Publishers/ Heinemann, 1986. $^{[^]}$
# Literature/1985

Authors :
* A B C D E F G H I J K L M N O P Q R S T U V W X Y Z &

## Subpages

* Literature/1985/Bates $^{[^]}$
* Literature/1985/Benton $^{[^]}$
* Literature/1985/Blair $^{[^]}$
* Cleveland, Harlan (1985). The Knowledge Executive: Leadership in an Information Society. New York: Truman Tally Books. $^{[^]}$
* Literature/1985/Funk $^{[^]}$
* Literature/1985/Mandler $^{[^]}$
* Literature/1985/Newell $^{[^]}$
* Literature/1985/Rheingold $^{[^]}$
* Rosen, Robert (1985). Anticipatory Systems, Pergamon Press. $^{[^]}$
* Literature/1985/Shapin $^{[^]}$
* Literature/1985/Sternberg $^{[^]}$
* Literature/1985/Webber $^{[^]}$
# Literature/1985/Rosen

Authors :
* A B C D E F G H I J K L M N O P Q R S T U V W X Y Z &