OpenLLM-France/wikimedia huggingface dataset:
# Adventist Youth Honors Answer Book/Beef cattle breeds

Angus :
* Description: Angus cattle are naturally polled (meaning they do not grow horns) and solid black, although white may appear on the udder. Black Angus are the most popular beef breed of cattle in the United States.
Brahman :
* Description: The Brahman has a distinct large hump over the top of the shoulder and neck, and a loose flap of skin (dewlap) hanging from the neck. Their ears are large and floppy. Bulls weigh 800 to 1100 kgs. Despite their huge size, they are known as a docile breed, if handled with kindness from calfhood.
Charolais :
* Description: This breed has been quite popular in the top end of Australia where they are more adaptable to the harsh weather conditions. The coat is almost pure white.
Hereford :
* Description: Hereford cattle are a widely-used breed in temperate areas, mainly for beef production. Originally from Herefordshire, England, they are the most common breed of beef cattle in the temperate parts of Australia. The breed also enjoys great popularity among ranchers in the desert American Southwest of the United States and also in the centre and east of Argentina.
Texas Longhorn :
* Description: The Texas longhorn is a breed of cattle known for its characteristic horns, which can extend to six feet in width and have a slight upward turn at their tips, as well as for their distinctive burnt orange coloring.
# Adventist Youth Honors Answer Book/Arts and Crafts/Whistles - Advanced

Whistles - Advanced :
| Arts and Crafts North American Division | Skill Level 2 |
| Arts and Crafts North American Division | Year of Introduction: 2007 |

## 1. Have the Whistle Honor

Instructions and tips for earning the Whistles honor can be found in the Arts and Crafts chapter.
# A-level Computing 2009/AQA/Problem Solving, Programming, Operating Systems, Databases and Networking/Operating Systems

* Specification link : Operating Systems
* Role of an Operating System
* Provision of a virtual machine
* Resource management
* Understand that the role of the operating system is to hide the complexities of the hardware from the user. In addition, it manages the hardware resources in order to provide for an orderly and controlled allocation of the processors, memories and I/O devices among the various processes competing for them.
* Role of the operating system
* Provision of a virtual machine
* Resource management
* Specification link : Operating System Classification
* Interactive
* Real time
* Network
* Device
* Embedded
* Desktop
* Server
* Define interactive, real time and network operating systems and explain their operational characteristics.
* Compare and contrast device operating systems (smartphone, PDA), embedded operating systems (car, aircraft), desktop operating systems, server operating systems.
# A-level Computing 2009/AQA/Problem Solving, Programming, Operating Systems, Databases and Networking/Databases/SQL

Structured Query Language (SQL) is used to perform function on a database. There are four main functions that you should be familiar with: SELECT, INSERT, UPDATE, DELETE
To help us understand how these things work we are going to use a test data set. Databases are used in all areas of the computer industry, but for the moment we are going to use a dataset that keeps track of crooks in England, noting, names, gender, date of birth, towns and numbers of scars. Take a look at the crooks data table below:
| ID | name | gender | DoB | town | numScars |
| 1 | Geoff | male | 12/05/1982 | Hull | 0 |
| 2 | Jane | female | 05/08/1956 | York | 1 |
| 3 | Keith | male | 07/02/1999 | Snape | 6 |
| 4 | Oliver | male | 22/08/1976 | Blaxhall | 2 |
| 5 | Kelly | female | 11/11/1911 | East Ham | 10 |
| 6 | Marea | female | 14/07/1940 | Wythenshawe | 6 |
To select all the items from this table we can use:
This would display all the results. But what if we just want to display the names and number of scars of the female crooks?
The result of this query would be:
| name | numScars |
| Jane | 1 |
| Kelly | 10 |
| Marea | 6 |
* Questions
* Write an SQL statement that selects the names and dates of birth of male crooks with less than 3 scars.
* Answer:
* SELECT name, DoB FROM crooks
* WHERE gender = 'male'
* AND numScars < 3
* Extension: Practice SQL
* You can practice your SQL skills using Access, MySQL (as part of XAMPP), MSSQL, SQLite etc. If you don't have this software easily available you might want to take a look at the SQLZoo site, which allows you to hone your skills in an online environment where you don't have to worry about accidentally deleting all your records! For the exam and probably for your projects you need to be very good at SQL, so get practicing.
* AQA Teacher Resources: Database querying a database using SQL
* http://filestore.aqa.org.uk/subjects/AQA-2510-W-TRB-COMP3QDUSQL.PDF
# A-level Computing 2009/AQA/Problem Solving, Programming, Operating Systems, Databases and Networking/Databases/UPDATE

Database aren't always perfect and there may be times that we want to change the data inside our database. For example in Facebook if someone is annoying you and you limit their access to your profile, you'd update the access field from 'normal' to 'restricted'. Or if one of our crooks gets an additional scar you'd have to update the numScars field. Let's take a look at that example, where our crook Peter gains a scar on his right cheek. This was his initial state:
But we have a problem here, this statement updates all records to numScars = 8. This means that every crook will now have 8 scars!
| ID | name | gender | DoB | town | numScars |
| 1 | Geoff | male | 12/05/1982 | Hull | 8 |
| 2 | Jane | female | 05/08/1956 | York | 8 |
| 3 | Keith | male | 07/02/1999 | Snape | 8 |
| 4 | Oliver | male | 22/08/1976 | Blaxhall | 8 |
| 5 | Kelly | female | 11/11/1911 | East Ham | 8 |
| 6 | Marea | female | 14/07/1940 | Wythenshawe | 8 |
We need to specify which crooks we want to update by using a WHERE clause, you saw it earlier in the SELECT example.
* Exercise: UPDATE statements
* Using the above data set, write an UPDATE statement to change Geoff's age to 17/12/1939
* Answer:
* UPDATE crooks
* SET DoB = '17/12/1939'
* WHERE name = 'Geoff'
* All the crooks have moved to Canary Wharf, update the table to show this
* Answer:
* UPDATE crooks
* SET town = 'Canary Wharf'
* All the female crooks named Sheila have lied about their ages and they were all born on January 16, 1984
* Answer:
* UPDATE crooks
* SET DoB = '16/01/1984' ---be careful with dates, they might be using American format
* WHERE name = 'Sheila'
* AND gender = 'Female'
# A-level Computing 2009/AQA/Problem Solving, Programming, Operating Systems, Databases and Networking/Definitions
## Real Numbers

A number which you can count to using your fingers and toes
# A-level Computing 2009/AQA/Problem Solving, Programming, Operating Systems, Databases and Networking/Operating Systems/Provision of a virtual machine

The Virtual Machine is presented by the Operating System to the user, hiding all the complexities of the hardware behind layers of OS software. The final layers of the operating system are the user Interface and the Application programming interface, which calls on the services of the Operating System. Here are the layers of the OS which hide all complexities from the user, from the Hardware to the final layers of the User Interface and the API:
* Hardware
* Kernel - the bridge between the Hardware components and the Applications
* Device drivers
* Processor management
* Memory management
* File management
* I/O management
* User Interface/API

## Application Programming Interface

Not all machines should be expected to have exactly the same setup. The Application Programming Interface (API) makes it possible for the same piece of program to be used on different computers. It is the layer of the software that allows the application programs to call on the services of the OS.
# A-level Computing 2009/AQA/Problem Solving, Programming, Operating Systems, Databases and Networking/Operating Systems/Resource management

Being the most fundamental of all system programs, Operating Systems are trusted with the job of controlling and sorting through the hardware, and this includes all the main components of the computer. To ensure that there is little confusion, the OS programs managing the key resources are giving relatively simple names depending on the resource they manage:
| Key Resource | OS Program |
| Processors | Processor Scheduling |
| Storage | Memory management |
| I/O devices | I/O management |
| Data | File management |
Remember: Data is stored information, but Storage holds the information.
# A-level Computing/AQA/Paper 2/Fundamentals of computer systems/Boolean algebra

We have met gate logic and combinations of gates. Another way of representing gate logic is through boolean algebra, a way of algebraically representing logic gates. You should have already covered the symbols, below is a quick reminder:
| Bitwise Operator | NOT(${\overline {A}}$) | AND(.) | OR(+) | XOR($\oplus$) | NAND(${\overline {A.B}}$) | NOR(${\overline {A+B}}$) |
| Description | invert input | where exactly two 1s | where one or more 1s | where exactly one 1 | where less than two 1s | where exactly two 0s |
For the exam you might have:
* to convert logic gates into boolean algebra,
* build logic gate combinations from boolean algebra,
* simplify boolean algebra.
For example, in the exam it may ask you what is the boolean algebra for A or B?
The answer to this is A + B.
In the exam the question will most likely be harder to solve so you should learn how to combine all these into what you want to represent.
# A-level Computing/AQA/Paper 2/Fundamentals of computer systems/Boolean gate combinations

Now you have learnt logic gates we will take a look at how they are combined inside hardware. You may well be asked in an exam to draw your own logic gates or to work out what a combination of logic gates will output. In this section we will look at the best way to describe what a set of logic gates is in boolean algebra. Let's take a look at a quick example:
* Exercise: Logic gate combination outputs
* For the following logic gate combinations work out output Q for each:
* Answer:
* Answer:
* Answer:
* This equation can be simplified to equal $A.B$, as $B.B=B$, we'll find out why this is the case in the simplifying boolean equations section coming up
* Answer:
* This equation can be simplified to equal 0 (always false), as ${\overline {A+B}}.A=0$, we'll find out why this is the case in the simplifying boolean equations section coming up
* Answer:
# A-level Computing/AQA/Paper 2/Fundamentals of computer systems
## Fundamentals of computer systems

* Logic gates
* Boolean gate combinations
* Building_circuits
* Simplifying boolean equations
* Boolean identities
* De Morgan's Laws
* Gate conversion
* Uses of gates
* Hardware and software
# A-level Computing/AQA/Paper 2/Fundamentals of computer systems/Building circuits

A common question in the exam is to be given some boolean algebra and be asked to express it as logic gates. Let's take a look at an addition and subtraction example that you should be familiar with:
First we are going to deal with the inner-most brackets
Finally we combine this answer with the $9-$
It will work exactly in the same way for boolean algebra, but instead of using numbers to store our results, we'll use logic gates:
* Example: Building circuits
* $C.(A+B)$
* As with any equation, we are going to deal with the inner-most brackets first$(A+B)$, then combine this answer with the $C.$
* Exercise: Building circuits
* Draw the circuit diagrams for the following. (Remember: do we deal with AND or OR first?):
* $A.B+C$
* Answer:
* $({\overline {A}}+{\overline {B}}).C$
* Answer:
* ${\overline {(A+B)}}.C$
* Answer:
* $(A.{\overline {B}})\oplus (B.C)$
* Answer:
* ${\overline {(A.B).(C+{\overline {D}})}}$
* Answer:
A common question in the exam is to give you a description of a system. You'll then be asked to create a boolean statement from this description, and finally build a logic gate circuit to show this system:
Example: Building circuits
Using boolean algebra describe the following scenario:
A car alarm is set off if a window is broken or if it senses something moving inside car, and the car is not being towed, or the engine is not on.
Where:
A = being towed,
B = window broken,
C = engine on,
D = senses movement
Before you rush into answering a question like this, let's try and break it down into its components. The questioner will often be trying to trick you. The two occasions that the alarm will sound are:
$B+D$ but there is a caveat, the alarm will sound if either of these are true AND two things are also true, namely the engine is NOT on, and the car is NOT being towed:
${\overline {A}}+{\overline {C}}$
Combining both we get (remember the brackets!):
$(B+D).({\overline {A}}+{\overline {C}})$
The next step is to create a diagram out of this: :
* Exercise: Building circuits
* A security system allows people of two different clearance levels access to a building. Either they have low privileges and they have a card and they are not carrying a mobile. Alternatively they have a key and are allowed to carry a mobile.
* The inputs available are:
* A = carrying a card
* B = carrying a mobile phone
* C = carrying a key
* Write down the boolean equation to express this:
* Answer:
* $(A.{\overline {B}})+(C)$
* If you wrote: $(A.{\overline {B}})+(C.B)$ You'd be wrong! The reason being the text says: Alternatively they have a key and are allowed to carry a mobile. This doesn't mean $C.B$, it means they can carry a mobile, or they can choose not to: $C.(B+{\overline {B}})$, which simplifies to: $C.(B+{\overline {B}})=C.(1)=C$.
* Draw the logic gate diagram to solve this:
* Answer:
# A-level Computing/AQA/Paper 2/Fundamentals of computer systems/Gate conversion

Sometimes it is cheaper to create circuits using only one sort of gate, and you might be asked to do so in the exam. These gates tend to be NAND & NOR gates. "But how can you create complex circuits by using only one type of gate?!" you may well ask. We'll now cover how other gates can be made from NAND & NOR gates:
| Step | NOR Gate | Equivalent |
| Diagram | | |
| Description | If you split the same input (A) and feed it into NOR both gate inputs you create a NOT Gate | If you split the same input (A) and feed it into NOR both gate inputs you create a NOT Gate |
| Truth Table | Because: A A $A+A$ ${\overline {A+A}}$ ${\overline {A}}$ 0 0 0 1 1 1 1 1 0 0 | Because: A A $A+A$ ${\overline {A+A}}$ ${\overline {A}}$ 0 0 0 1 1 1 1 1 0 0 |
| Step | NAND Gate | Equivalent |
| Diagram | | |
| Description | If you split the same input (A) and feed it into both NAND gate inputs you create a NOT Gate | If you split the same input (A) and feed it into both NAND gate inputs you create a NOT Gate |
| Truth Table | Because: A A $A.A$ ${\overline {A.A}}$ ${\overline {A}}$ 0 0 0 1 1 1 1 1 0 0 | Because: A A $A.A$ ${\overline {A.A}}$ ${\overline {A}}$ 0 0 0 1 1 1 1 1 0 0 |
* Exercise: Gate Conversion
* Render the following boolean equations using only NAND gates:
* ${\overline {{\overline {A}}.B}}$
* Answer:
* ${\overline {A}}.{\overline {B}}$
* Answer:
* Now try the similar questions using only NOR gates (you might need De Morgan's Law to help you out here, or use a truth table to simplify things)
* $A+{\overline {B}}$
* Answer:
* ${\overline {A}}.{\overline {B}}$
* Answer:
* Why might you want to use only one sort of gate to create a circuit?
* Answer:
* It might be cheaper to make circuits with only one sort of gate, it might make for simpler circuits
# Ada Programming/Attributes/'Unconstrained Array
## Description

The Unconstrained_Array attribute can be used with a prefix that denotes any type or subtype. It is a static attribute that yields True if the prefix designates an unconstrained array, and False otherwise. In a generic instance, the result is still static, and yields the result of applying this test to the generic actual.
# Ada Programming/Attributes/'Universal Literal String
## Description

The prefix of Universal_Literal_String must be a named number. The static result is the string consisting of the characters of the number as defined in the original source. This allows the user program to access the actual text of named numbers without intermediate conversions and without the need to enclose the strings in quotes (which would preclude their use as numbers).
For example, the following program prints the first 50 digits of pi:
# Animal Behavior

Animal Behavior
A guide to the hows and whys of animals interacting with each other and with the world around them.
A Free Online Textbook
    Contributors
    Notes to Contributors
    Textbook cover
This textbook explores the mechanisms and evolution of animal behavior, including neural, hormonal, and genetic substrates of behavior; foraging; anti-predator defenses; mating systems and sexual selection; social behavior; communication; parental care; kin selection and recognition; and territoriality. Associated laboratory exercises will provide hands-on experience for many of these concepts.

## Contents
### Chapter 1. History, Aims and Approaches

   * Definition of Animal Behavior
   * Aims of Animal Behavior
   * History of Animal Behavior
   * Scientific Method in Animal Behavior

### Chapter 2. Development, Learning and Genetics

   * Nature v Nurture
   * Development/Maturation
      * Human Cognitive Development
   * Learning and Memory
   * Behavioral Genetics

### Chapter 3. Proximate Mechanisms of Behavior

   * Neuroscience
   * Sensory Biology
   * Neural Orchestration of Motor Responses
   * Behavioral Endocrinology
   * Biological Rhythms

### Chapter 4. Functional Significance of Behavior

   * Evolution
   * Mating Systems
   * Population Genetics
   * Modeling Behavior
   * Altruism and Sociality
   * Coevolution

### Chapter 5. Phylogeny, and Behavior

   * Darwin's Finches

### Chapter 6. Behavior Case Studies

* Communication Systems
   * Bird Song
   * Human Language
   * The Parallels between Bird Song and Human Language Learning
* Spatial Distributions
   * Habitat Use
   * Orienting, Navigation, Migration
   * Territoriality
* Mating Systems
   * Brood Parastism
* other
   * Army Ants
   * Honeybee Foraging Behavior
   * Penguins
   ** Penguin Loving
   * Sea Turtles
   ** Sea Turtle Nesting Behavior

### Chapter 7. Comparative Human Behavior

   * Human Evolution
# Animal Behavior/Altruism
## Altruism

Altruism consists of unselfish/selfless acts in which the altruist puts other individual’s interests before their own. The general expectation is that the evolution of altruistic traits is not compatible with selfish gene theory. How could such a mechanism reinforce a behavior jeopardizing ones own interests at the expense of another's?
Units of Selection. Group selection. Altruistic behavior could be rooted through group selectionist thinking where altruistic traits favor reproductive success of a group at the expense of that of an individual.
* Group
* Individual
* Gene
Self-sacrificing Behavior: e.g. vampire bats, guard bees, Cooperative breeding, e.g. African Kingfishers, Acorn Woodpeckers, Florida Scrub Jay;

### True Altruism

An individual behaves in such a way as to enhance the reproduction of another individual, at a cost to its own fitness. (e.g., Sterile workers in social insects who give up all reproduction for the benefit of their mother queen. Mutual or delayed benefits can’t account for this one: sterile workers never get to produce any daughters.)
Simple Egoistic Solutions for Individuals: Current or delayed benefits. Young may remain with their parents and help them or group members raise more offspring, rather than breeding themselves (e.g., ostriches, some primates). Helpers may gain useful experience in raising their own offspring or have an incrased chance to inherit a valuable breeding territory.
Complex Egoistic Solutions for Individuals: Prisoner's Dilemma: e.g. Pukekos (Porphyrio porphyrio)
Inclusive Fitness: An individual fitness solution to the paradox goes as follows: genes are favored that produce a disproportionate propagation of ones genes to subsequent generations even if it is at the expense of the individual. This may occur directly through either reproducing personally or indirectly by encouraging the reproduction of close relatives who share many of ones genes. Under those circumstances altruistic behaviors should primarily be directed towards close relatives who share many of the genes as compared to non-relatives who share fewer of them. Inclusive fitness refers to the sum of an individual's Direct Fitness (probability of reproductive success of one's own offspring) and its Indirect Fitness (probability of reproductive success of non-descendant relatives). Altruistic acts are frequently directed towards relatives. <Kin Selection>: selection for traits that lower an individual's personal fitness, but raise a relative's fitness. Recipient (related) kin share genes with the altruistic individual and are thus genetic extensions of them. Kin selection and inclusive fitness can explain sociality through increased survivorship of relatives, increased inclusive fitness, altruism, and delayed maturation or breeding.
# Animal Behavior/Ch1

<< Contents page | Chapter 1 | Chapter 2 >>|

## Chapter 1. History, Aims and Approaches of Animal Behavior

This chapter introduces the main topics that are covered by this field of research. A historical account discusses how we have tried to explore the behavior of humans and animals, to understand the biological constraints that impact our cognitive potential, and to make sense of the nature of human and animal personalities. As a scientific discipline Animal Behavior conforms to the rigors of the Scientific Method.
   * Definition of Animal Behavior
   * Scope of Animal Behavior
   * History of Animal Behavior
   * Scientific Method in Animal Behavior
<< Contents page | Chapter 1 | Chapter 2 >>|
# Animal Behavior/Ch2

<< Contents page | |<< Chapter 1 | Chapter 2 | Chapter 3 >>|

## Chapter 2. Development, Learning and Genetics

This chapter explores how behavior develops and changes during the lifespan of a single individual. It primarily considers the role that learned components, genetic influences, and their interactions play in the emergence of behavior.
   * Nature v Nurture
   * Development/Maturation
      * Human Cognitive Development
   * Learning and Memory
   * Behavioral Genetics
<< Contents page | |<< Chapter 1 | Chapter 2 | Chapter 3 >>|
# Animal Behavior/Ch3

<< Contents page | |<< Chapter 2 | Chapter 3 | Chapter 4 >>|

## Chapter 3. Proximate Mechanisms of Behavior

This chapter explores the most immediate biological functions that are responsible for producing a particular observation. The material aims to provide an understanding of how a behavior is elicited and coordinated. It includes a search for the impact of genetic components, physiological mechanisms, environmental conditions needed, and hormones on behavior.
   * Neuroscience
   * Sensory Biology
      * Pheromones
   * Neural Orchestration of Motor Responses
   * Behavioral Endocrinology
   * Biological Rhythms
<< Contents page | |<< Chapter 2 | Chapter 3 | Chapter 4 >>|