OpenLLM-France/wikimedia huggingface dataset:
# A-level Computing 2009/AQA/Problem Solving, Programming, Operating Systems, Databases and Networking/Programming Concepts/Pointers

A pointer is a data type whose value refers directly to (or "points to") another value stored elsewhere in the computer memory using its address.
Pointers are incredibly important computing concepts as we need pointers to create many of the ADTs (Abstract Data Types) we are going to talk about. Some languages don't allow you to directly manipulate them, but all languages use them. For this section of the book you need to be familiar with the concept of pointers as we'll be using them heavily when we talk about linked lists, queues and stacks.
Quick examples of pointers might include the next free memory location in an array, or the location in memory that an array is stored at.
Example: Pointers
Let's take a look at how pointers are used in the C programming Language.
We are going to deal with two variables:
a
ptr
We are also going to meet two key characters:
& - where &a would return the address location of variable a
* - where *ptr = 8 means follow the memory address stored in ptr and set that location to 8
Assume that a is located at address 0x8130 in memory and ptr at 0x8134; also assume this is a 32-bit machine such that an int is 32-bits in size. The following is what would be in memory after the following code snippet is executed:
int a = 5;
int *ptr = NULL;
AddressContents
0x81300x00000005
0x81340x00000000
(The NULL pointer shown here is 0x00000000.)
By assigning the address of a to ptr:
ptr = &a;
yields the following memory values:
AddressContents
0x81300x00000005
0x81340x00008130
Then by dereferencing ptr by coding:
*ptr = 8;
the computer will take the contents of ptr (which is 0x8130), 'locate' that address, and assign 8 to that location yielding the following memory:
AddressContents
0x81300x00000008
0x81340x00008130
Clearly, accessing a will yield the value of 8 because the previous instruction modified the contents of a by way of the pointer ptr. :
* Exercise: Pointers
* Give a uses for pointers:
* Answer:
* storing next free memory addresses. Used to create abstract data types.
* What would the following output, where cout << writes a line to the screen:
* int q = 89;
* int *next = NULL;
* next = &q;
* cout << *next;
* q = 23;
* *next = 56;
* cout << q;
* Answer:
* 89
* 56
# A-level Computing 2009/AQA/Problem Solving, Programming, Operating Systems, Databases and Networking/Programming Concepts/Insertion sort

You should have covered bubble sort during the AS course. Unfortunately bubble sort is a very slow way of sorting data and very rarely used in industry. We'll now look at a much faster algorithm, insertion sort.
Insertion sort is a simple sorting algorithm: a comparison sort in which the sorted array (or list) is built one entry at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort and you may cover these at university. However, insertion sort provides several advantages:
* simple implementation
* efficient on small data sets
* uses a fixed amount of memory when running
Insertion sort requires the use of two arrays, one ordered, and one unordered. Each repetition of the algorithm moves an item from the unordered list, into a sorted position in the ordered list, until there are no elements left in the unordered list.
Sorting is typically done in-place without needing extra memory. The resulting array after k iterations has the property where the first k + 1 entries are sorted. In each iteration the first remaining entry of the input is removed, inserted into the result at the correct position, thus extending the result:
becomes
with each element greater than x copied to the right as it is compared against x.
* Example: Insertion Sort
* The following table shows the steps for sorting the sequence {5, 7, 0, 3, 4, 2, 6, 1}. For each iteration, the number of positions the inserted element has moved is shown in parentheses. Altogether this amounts to 17 steps.
* 5 7 0 3 4 2 6 1 (0)
* 5 7 0 3 4 2 6 1 (0)
* 0 5 7 3 4 2 6 1 (2)
* 0 3 5 7 4 2 6 1 (2)
* 0 3 4 5 7 2 6 1 (2)
* 0 2 3 4 5 7 6 1 (4)
* 0 2 3 4 5 6 7 1 (1)
* 0 1 2 3 4 5 6 7 (6)
* for i ← 1 to i ← length(A)-1
* // A[ i ] is added in the sorted sequence A[0, .. i-1]
* // save A[i] to make a hole at index iHole
* item ← A[i]
* iHole ← i
* // keep moving the hole to next smaller index until A[iHole - 1] is <= item
* while iHole > 0 and A[iHole - 1] > item
* // move hole to next smaller index
* A[iHole] ← A[iHole - 1]
* iHole ← iHole - 1
* // put item in the hole
* A[iHole] ← item
* ' a procedure to sort an array of integers
* Exercise: Insertion Sort
* Describe the process of insertion sort
* Answer:
* Insertion sort is a simple sorting algorithm: a comparison sort in which the sorted array (or list) is built one entry at a time.
* Show the how insert sort would work on the following unordered array:
* 9 6 7 1 2
* Answer:
* sort left hand side is underlined
* 9 6 7 1 2
* 6 9 7 1 2
* 6 7 9 1 2
* 1 6 7 9 2
* 1 2 6 7 9
* Show how the insert sort would work on the following unordered array
* G K L A J
* Answer:
* sort left hand side is underlined
* G K L A J
* G K L A J
* G K L A J
* A G K L J
* A G J K L
* Complete the trace table for the following code:
* Answer:
# 99 Elm Problems/Problem 55

Construct completely balanced binary trees, that is, the difference of the number of nodes in its left and right subtrees is not greater than one.
# # # THIS IS A STUB # # #
Result:
Solutions
# 99 Elm Problems/Problem 48

"Truth tables for logical expressions. Generalize problem 47 in such a way that the logical expression may contain any number of logical variables. Define table’ in a way that table’(List,Expr) prints the truth table for the expression Expr, which contains the logical variables enumerated in List.
# # # THIS IS A STUB # # #
Result:
Solutions"
# 99 Elm Problems/Problem 5/Solutions

Solution 1: Recursive version
Solution 2: Using List.foldl
# 99 Elm Problems/Problem 57

Construct a binary search tree from a list of integer numbers.
# # # THIS IS A STUB # # #
Result:
Solutions
# 99 Elm Problems/Problem 49

Write the sequence of Gray codes for a given number of bits. Can you apply the method of "result caching" to make the predicate more efficient, when it is used repeatedly?
# # # THIS IS A STUB # # #
Result:
Solutions
# 99 Elm Problems/Problem 56

Find if the structure of the left and right subtrees are identical.
# # # THIS IS A STUB # # #
Result:
Solutions
# 99 Elm Problems/Problem 5

Elm provides the function List.reverse to reverse the order of elements in a list. See if you can implement it.
Result:
Solutions
# 99 Elm Problems/Problem 50

Construct a list hc(S,C) terms, where C is the Huffman code word for the symbol S. In our example, the result could be Hs = [hc(a,'0'), hc(b,'101'), hc(c,'100'), hc(d,'111'), hc(e,'1101'), hc(f,'1100')] [hc(a,'01'),...etc.]. The task shall be performed by the predicate huffman/2 defined as follows: % huffman(Fs,Hs) :­ Hs is the Huffman code table for the frequency table Fs
# # # THIS IS A STUB # # #
Result:
Solutions
# 99 Elm Problems/Problem 46

Define functions for logical operations. 46.a) and’ 46.b) or’ 46.c) nand 44.d) nor’ 44.e) xor’ 44.f) impl’ 44.g) equ’ (for logical equivalence) 44.h) Write the truth table of a given logical expression in two variables.
# # # THIS IS A STUB # # #
Result:
Solutions
# 99 Elm Problems/Problem 47

Truth tables for logical expressions (2). Continue problem 46 by defining and/2, or/2, etc as being operators. This allows to write the logical expression in the more natural way, as in the example: A and (A or not B). Define operator precedence as usual; i.e. as in Java.
# # # THIS IS A STUB # # #
Result:
Solutions
# A Chronological Survey of Sedimentary Landforms in the Continental United States

A Chronological Survey is ultimately intended to serve as the companion and reference volume to a larger work entitled Introduction to Stratigraphy and Sedimentation. The Survey will explore the environmental conditions that existed during each Geologic time period from the Cambrian to the present, and will select one or more localities for each time period to examine in detail. We will not cover the Precambrian at this time, but may add chapters on that later.
Together, these works are a massive undertaking that will require much time to complete. The primary author welcomes contributions from others!

## Contents

Introduction
The Cenozoic
Quaternary
Neogene
Paleogene
The KT Boundary
The Mesozoic
Cretaceous
Jurassic
Triassic
The PT Boundary
The Paleozoic
Permian
Pennsylvanian
Mississippian
Devonian
Silurian
Ordovician
Cambrian
# Chapter 3: Writing a Document from a Template
## Articles

If you're a scientist or scientist-in-training you've probably had to deal with writing an article at some point in your life. Wikipedia has this to say about the scientific article:
Which is extremely true. Again, for the sake of brevity we will not delve into the specific requirements of the various academic and scientific journals one can publish too (however the author will note that excellent examples can be found at Arixiv or by using a Google Scholar search for a topic or paper of interest), we will instead simply look at how one would format one of these documents.

### The Absolute Basic Template

We present here the simplest template to work with. From here you can edit the body of the document, create your article, and essentially get a finished product that looks good. Of course every individual author will have different needs but those can be addressed later. Here is the template, we'll go through everything else in a moment, it may be a good idea to copy this into your typesetting application so you can see what it look like, but don't typeset it quite yet:
The first thing you'll want to note is that any line beginning with a '%' symbol

## Books

← Typesetting: The Basics
# A Chronological Survey of Sedimentary Landforms in the Continental United States/Ordovician

Ordovician period 488.3± 1.7 Ma to 443.7±1.5 Ma :
| Mean atmospheric O$_2$ content over period duration | ca. 13.5 Vol % (68 % of modern level) |
| Mean atmospheric CO$_2$ content over period duration | ca. 4200 ppm (15 times pre-industrial level) |
| Mean surface temperature over period duration | ca. 16 °C (2 °C above modern level) |
| Sea level (above present day) | 180m; rising to 220m in Caradoc and falling sharply to 140m in end-Ordovician glaciations |
The Ordovician period opened with no sedimentary break from the Cambrian, but is nevertheless distinct because the fossil assemblage changes drastically. Many Cambrian marine species disappeared or were greatly reduced in numbers in what has been called the Cambrian-Ordovician Extinction Event (Wikipedia article). The most useful group for dating the Cambrian-Ordovician boundary is the Brachiopods. This group was dominantly composed of inarticulated forms (lacking a specific hinge structure between the shell halves) during the Cambrian, but the relative abundance is reversed at the beginning of the Ordovician. The hinge may have provided some added protection against predators, which were now beginning to appear in the fossil record.
The Ordovician period opened with the Cambrian Sauk Seas still dominating the landscape. The Sauk transgression reached its maximum extent during Early Ordovician time, then began a slow regression that culminated in the complete removal of the epeiric sea at the end of the Early Ordovician. It is thought that this regression represents a period of cratonic uplift due to tectonic forces. The regression of the Sauk Seas left behind a blanket deposit of shoreline sandstones that represent erosion of the newly emerged craton.
This exposure of the craton to subaerial erosion appears to have lasted for a very long time. No depositional sequence exists by which we may determine exactly how much time is missing, but the fossil record suggests it was many millions of years. During this time, what little geographic relief the craton possessed was eroded down, and the clastic remnants of that erosion are present in the sand layer. The flat, sand covered surface was extensively reworked by erosional forces, and eventually became quite uniform in composition across wide areas of the craton.

## References

* ↑ Image:Sauerstoffgehalt-1000mj.svg
* ↑ Image:Phanerozoic Carbon Dioxide.png
* ↑ Image:All palaeotemps.png
* ↑ Haq, B. U. (2008). "A Chronology of Paleozoic Sea-Level Changes". Science. 322: 64–68. doi:10.1126/science.1161648.
# Beekeeping/Hive Bodies

Hive bodies are the exterior structure of the hive.
In a Langstroth bee hive, the hive body is a four-sided box, with the top and bottom open for stacking. Two sides are notched to support the top bars of removable frames. A complete hive consists of a bottom board, one or more hive bodies, an inner cover and a top/weather cover.
Commercial hive bodies are sized around a 20 inch basic dimension. They are 20" from front to back, and hold 8 or 10 frames (14" or 17") across the width. "Deep" hive bodies are approximately 10" tall and "medium" are 6-5/8" tall (approximately 1/2 and 1/3 of 20" respectively). A typical commercial hive consists of a two deep bodies called brood bodies on the bottom, a queen excluder screen, and three medium bodies called 'supers' on top. There is no difference between the brood bodies and supers, only how they are used by the colony and the beekeeper. Colonies naturally produce brood lower in the hive, and store excess above. Honey is harvested only from the supers, and they are shorter solely for ease of lifting.
Bees will sometimes identify the wrong hive as their home hive, and an attempt to enter the wrong hive can be a fatal mistake. Although many hive bodies are often painted a single color, some beekeepers claim to have found that a variety of bright colors can help the bees find their way back to their hives more easily. The arrangement of the hive stacks may also be important for visual recognition of the home hive. However, since bees likely use many other visual, spatial and olfactory cues to identify their home hive, the color of the hive bodies may have only a marginal effect on choice.
# Beekeeping/Inner Cover

An inner cover is typically used in conjunction with a telescoping cover. The inner cover provides an air space for insulation against heat and cold. It also prevents the bees from gluing the top cover to the top bars of the super under it. With an inner cover, the top cover is easier to remove from the hive. The hole in the inner cover can be used for feeding the bees.
# Beekeeping/Hive Tool
## Usage
### Hive tools can be used for

   * loosening hive bodies and frames.
   * scraping off excess bur comb or propolis from hive parts.
   * removing a bee sting from the body

### Hive tools, when jointly used for beekeeping, should not be used for

   * Mixing paint, varnish or chemicals

## Selecting a Design

There exist multiple designs of hive tools, but in truth most any kind of pry bar with a blade will work. If you find that money is burning a hole in your pocket, feel free to invest in a high quality Teflon coated hive tool that would likely outlast any beekeeper. Hive tools generally come in 7 and 10-inch varieties. If possible, before purchasing, see how the tool fits in your hand, and buy the one you are most comfortable with. Although it may not seem like an issue, the color of your hive tool may be important. If possible, purchase a brightly colored hive tool or paint it such. A brightly colored hive tool will stand out a lot better when dropped. It is rather difficult to continue working if you lose your tool.

## Purchasing

Hive tools are sold by nearly every bee keeping supply house, but similar items can be found at most every hardware store. Simply look for a quality scraper/nail puller type of tool.

## Maintenance

* It is advisable to sharpen the blade of a hive tool when needed. It is difficult to predict the intervals when such would need to be done, but most beekeepers do so at least once a year.
* If a hive tool is used on a hive that may be infected by disease it is often advisable to clean the tool by flame.
# Beekeeping/Images and Illustrations
## Honeybee Photographs
### Outside The Hive
#### Visiting Flowers

* A bee gathering pollen
* Pollinating Bee
* Bee on a peach blossom
* Bee collecting nectar
* Honeybee collecting pollen from a plum blossom
* Bee wings

#### Swarms

* A swarm cluster
* A swarm on a fence.

### Miscellaneous Activities

* Worker bee
* Thirsty Drone Bees
* Thirsty Worker Bee
* Bee with pollen

### Inside The Hive

* Queen cells
* A marked queen bee

## Beekeeping
### Hive Parts

* Langstroth Frames
* Entrance Reducer
* Porter Bee Escape
* Queen Excluder
* Mouse Guard
* Wax Foundation

### Tools

* Bee Brush
* Hive Tool
* Smoker
# A-level Graphic Products/Edexcel/Unit 3 :Designing for the Future/Sustainability/Life cycle assessment

There is a balance that manufacturer need to get correct, this is the balance between making the product good for the environment and inexpensive to make/sell.
Life-cycle assessment (LCA) is the process of reviewing a product's life, from "cradle to grave" (from when the materials are being obtained from the ground until the point it is disposed).

## Life-cycle inventory (LCI)

Consumers are becoming more aware of the environmental impact of certain products. The BSI and ISO 14000 now demand that companies constantly improve their attitude toward the environment; this is measured through a life-cycle inventory.
A life-cycle inventory will look at all of the input and output processes that occur during the life-cycle of a product.
This is split into two parts:
* Environmental inputs and outputs of raw materials and energy resources.
* Economic inputs and outputs of products, components or energy that are outputs from other processes.
# A-level Graphic Products/Edexcel/Unit 3 :Designing for the Future/Systems and control
## Contents

* Manufacturing systems
* Computer-integrated manufacture
* Robotics and Artificial Intelligence
* Flow charts
# A-level Graphic Products/Edexcel/Unit 3 :Designing for the Future/Sustainability
## Contents

* Life cycle assessment
* Cleaner design and technology
* Minimising waste production
* Renewable and non-renewable sources of energy
* Responsibilities of developed countries
# A-level Graphic Products/Edexcel/Unit 3 :Designing for the Future/Systems and control/Flow charts
## Different types of flow chart

* Start and Stop symbols are used as a starting point for the diagram and exit point(s).
* Process symbols are used for to indicate that a process is happening.
* Decision symbols are used for when there are multiple out comes, two or more arrows should come out of the diagram and redirect you to another part of the diagram. Next to each arrow there should be a note saying what the out come is, e.g. 'Yes' near one arrow and 'No' near another.
* Arrow symbols are used to indicate the flow of where you're meant to go next.
There are two types of control systems used for flow charts, Open-loop and Closed-loop.

### Open-Loop

An open loop system is a system is a flow chart that is does not loop back to a previous part of the diagram, it can still have decision symbols as long as they do not go back to a stage that you've already been to.

### Closed-loop

A closed-loop system is the opposite to an open-loop system; the flow chart contains a decision that leads back to a previous part in the diagram.

## References

* ↑ https://en.wikipedia.org/wiki/Control_theory#Classical_control_theory
# Leg Angle Limits

| | Minimum | Maximum |
| Actuator Output (forward and backward thighs) | -45° | +107.5° |
| Leg Length | +34.5° | +160° |
| Spring Deflection | -15° Extension | +35° Compression |
| Hip | -10° Adduction Toes together | +20° Abduction Toes spread apart |
| caption here | caption here | caption here |
# Body (or Torso)

* Mass = 22.22268345 kilograms
Center of mass: ( meters )
* X = -0.00281061
* Y = 0.33493699
* Z = 0.00319347
Principal axes of inertia and principal moments of inertia: ( kilograms * square meters ) Taken at the center of mass.
| Ix = (0.00070046, 0.99983654, -0.01806682) | Px = 0.71977094 |
| Iy = (0.03700520, 0.01802854, 0.99915243) | Py = 1.19184042 |
| Iz = (0.99931483, -0.00136843, -0.03698652) | Pz = 1.60484185 |
Moments of inertia: ( kilograms * square meters ) Taken at the center of mass and aligned with the output coordinate system.
| Lxx = 1.60427586 | Lxy = 0.00089539 | Lxz = 0.01525904 |
| Lyx = 0.00089539 | Lyy = 0.71992603 | Lyz = -0.00854831 |
| Lzx = 0.01525904 | Lzy = -0.00854831 | Lzz = 1.19225132 |
Moments of inertia: ( kilograms * square meters ) Taken at the output coordinate system.
| Ixx = 4.09750513 | Ixy = -0.02002455 | Ixz = 0.01505958 |
| Iyx = -0.02002455 | Iyy = 0.72032821 | Iyz = 0.01522136 |
| Izx = 0.01505958 | Izy = 0.01522136 | Izz = 3.68542951 |
# Slip Rings

| Mercotac | from old beaversource page |
| Conductix | from old beaversource page |
| Rotary Systems | from old beaversource page |
| United Equipment Accessories | We bought a unit(s) from here in 2013 |
# ATRIAS 2.1 Handbook/General Information/Suppliers and Manufacturers/Water Jetting Shops

| Name | Location | Phone | Comments |
| Colorado Water Jet | Berthoud, Colorado | 866-532-5404 | Used by Dr. Hurst in the past. |
| Katon Precision | Albany, Oregon | | | see Machine Shops |
| NW Stamping | Eugene, Oregon | (541)747-4269 | see Machine Shops |