OpenLLM-France/wikimedia huggingface dataset:
# SQL Exercises/The warehouse
## Exercises

1. Select all warehouses.
2. Select all boxes with a value larger than $150.
3. Select all distinct contents in all the boxes.
4. Select the average value of all the boxes.
5. Select the warehouse code and the average value of the boxes in each warehouse.
6. Same as previous exercise, but select only those warehouses where the average value of the boxes is greater than 150.
7. Select the code of each box, along with the name of the city the box is located in.
8. Select the warehouse codes, along with the number of boxes in each warehouse. Optionally, take into account that some warehouses are empty (i.e., the box count should show up as zero, instead of omitting the warehouse from the result).
9. Select the codes of all warehouses that are saturated (a warehouse is saturated if the number of boxes in it is larger than the warehouse's capacity).
10. Select the codes of all the boxes located in Chicago.
11. Create a new warehouse in New York with a capacity for 3 boxes.
12. Create a new box, with code "H5RT", containing "Papers" with a value of $200, and located in warehouse 2.
13. Reduce the value of all boxes by 15%.
14. Apply a 20% value reduction to boxes with a value larger than the average value of all the boxes.
15. Remove all boxes with a value lower than $100.
16. Remove all boxes from saturated warehouses.
# Java Programming/Preface

* Topics:
* Preface
* Getting started
* Language fundamentals
* Classes and objects
* Aggregate
* Exceptions
* Concurrent Programming
* Javadoc & Annotations
* Designing user interfaces
* Advanced topics
* Navigate Preface: ( v • d • e )
* About this book
* History of Java
* Overview of the Java programming language
* The Java platform (JRE & JDK)
Learning a computer programming language is like a toddler's first steps. You stumble, and fall, but when you start walking, programming becomes second nature. And once you start programming, you never cease evolving or picking up new tricks. Learn one programming language, and you will "know" them all — the logic of the world will begin to unravel around you.

## Are you new to programming?

If you have chosen Java as your first programming language, be assured that Java is also the first choice for computer science programs in many universities. Its simple and intuitive syntax, or grammar, helps beginners feel at ease with complex programming constructs quickly.
However, Java is not a basic programming language. In fact, NASA used Java as the driving force (quite literally) behind its Mars Rover missions. Robots, air traffic control systems and the self-checkout barcode scanners in your favorite supermarkets can all be programmed in Java.

## Programming with Java

By now, you might truly be able to grasp the power of the Java programming language. With Java, there are many possibilities. Yet not every programmer gets to program applications that take unmanned vehicles onto other planets. Software that we encounter in our daily life is somewhat humble in that respect. Software in Java, however, covers a vast area of the computing ecosphere. Here are just a few examples of the ubiquitous nature of Java applications:
* Office suites LibreOffice and Apache OpenOffice (similar to Microsoft Office) have been written in Java.
* The popular building game Minecraft is written in Java.
* Two of the world's renowned digital video recorders, TiVo and BSkyB's Sky+ use built-in live television recording software to record, rewind and play your favorite television shows. These applications make extensive use of the Java programming language.
The above mentioned applications illustrate the reach and ubiquity of Java applications. Here's another fact: almost 80% of mobile phone vendors adopt Java as their primary platform for the development of applications. The most widely used mobile-based operating system, Android, uses Java as one of its key application platforms.

## What can Java not do?

Well, to be honest, there is nothing that Java can't do, at least for application programming. Java is a "complete" language; the only limits are programmer imagination and ability. This book aims to get you acquainted with the basics of the language so you can create the software masterpiece of your dreams. The one area where Java can't be used is for direct interaction with computer hardware. If you want to write an operating system, you will need to look elsewhere!
# 68000 Assembly/Registers

With the exception of the 16-bit status register, all 68000 registers are 32-bits wide.
There are eight data registers: d0, d1, d2, d3, d4, d5, d6, and d7. These are intended to hold numbers that will have various mathematical and logical operations performed on them.
There are seven address registers: a0, a1, a2, a3, a4, a5, and a6. These are typically used as pointers.
There is one active stack pointer: SP, also called a7. Normally the processor is in user mode. In user mode, SP refers to the User Stack Pointer (USP) register. (During interrupts, the active stack pointer SP is another register called the Interrupt Stack Pointer or the System Stack Pointer. The 68020 and higher processors have a third register called the Master Stack Pointer. Neither the ISP nor the MSP can be accessed in user mode).
The 68K includes special addressing modes that make it easy to manipulate a data stack structure using any address register.
The Program Counter (PC) points to the current instruction. On the 68000, only the lower 24 bits output to any pins, giving a maximum addressing range of 16MiB. The Program Counter is changed automatically when a new instruction is loaded or when a BRA, BCC, BSR, JMP, JSR, RTS, or RTE instruction is used. It can also be used as a pointer in PC relative addressing modes.
The Condition Code Register (CCR) consists of the lower byte of the Status Register (SR). Only the lower byte is accessible in user mode, and of this, only the first five bits are useful. In supervisor mode, the entire 16-bit register is accessible. The register looks like this:
| 15 | 14 | 13 | 12 | 11 | 10 | 9 | 8 | 7 | 6 | 5 | 4 | 3 | 2 | 1 | 0 |
| T1 | T0 | S | M | 0 | I2 | I1 | I0 | 0 | 0 | 0 | X | N | Z | V | C |
Here's the decoded register contents:
| Bit | Description |
| C | Carry |
| V | Overflow |
| Z | Zero |
| N | Negative |
| X | Extend |
| I0 | Interrupt priority mask bit 1 |
| I1 | Interrupt priority mask bit 2 |
| I2 | Interrupt priority mask bit 3 |
| M | Master/Interrupt switch. Determines which stack mode to use if S is set. If M is clear, SP refers to ISP, else SP refers to MSP. This bit is always clear on processor models lower than 68020. |
| S | Supervisor Mode flag. If clear, SP refers to USP. If set, look at M to determine what stack SP points to. |
| T0 | Trace bit 1. If set, trace on change of program flow. This bit is always cleared on processor models lower than 68020. |
| T1 | Trace bit 2. If set, trace is allowed on any instruction. DO NOT SET BOTH TRACE BITS AT THE SAME TIME! |
# Equipment

The equipment which is used to play Go has remained almost the same throughout the game's four thousand year history. The game’s board and pieces are simple enough that you could make do with things found around your own home.

## Board

The Board, or Goban (碁盤) in Japanese, is the surface on which the game is played. Printed on this board is a grid, usually nineteen-by-nineteen though other sizes are common. Games are also frequently played on smaller boards, traditionally 9x9 and 13x13. It's possible to experiment with even more unusual board geometries. A traditional Goban has four feet and sits on the floor, but many modern boards have no feet and are designed for tabletop use. These are also called table boards. Beginning players often play on paper using a thirteen-by-thirteen grid, allowing them to get the hang of the game without spending a lot of money on a board or time on more complicated, full-board games. Physical gobans are traditionally made of light-colored wood. They range from cheap models (folding boards, roll-up mats) to club-quality boards (solid wood ranging up to 4" thick or so) and truly beautiful traditional "floor boards," which have legs and are often constructed with great care from exotic woods such as the coveted "Kaya."

## Stones

Stones (also known as seeds) are the game pieces of Go and are placed on the intersections of the lines on a board. The stones are black and white, generally made from glass, plastic, marble, slate, or clamshell, and come in many sizes ranging from 7mm to 11.3mm in thickness. A set of Go stones can cost anywhere from a few dollars to thousands of dollars. The highest-quality stones are made from slate (black) and specially carved clamshells (white), and cost hundreds of dollars per set. A full set of stones consists of 181 black stones and 180 white stones. Stones are uniform and round, reminiscent of an oversized M&M candy. It is traditional to have a bowl for each player's stones (these are often carved pleasingly from attractive woods), using the upturned lid of the bowl to store captured prisoner stones of the opposite color during play.

## Bowls

Bowls are just a place to keep your stones while they are not on the board. They are not a necessary part of the equipment. Bowls are normally made from wood or plastic and are usually the cheapest part of a set. Some boards have drawers to keep stones in so you don't have to have bowls, however most do not. Captured stones are kept in the lid of the bowl in Japanese and Korean rules. In Chinese rules, you may place them back in your bowl.
More information on boards and stones from Sensei's Library.

# Playing on a computer

If you want to play Go but don't want to buy/make/borrow the equipment needed, there are many different kinds of software developed to play Go over the Internet. Such sites and programs include OGS, FoxWeiqi, GoQuest, and Pandanet.
# Go Programming Language Cookbook/Bit map

Given a big file of IPv4 addresses (more than 100 GB) — we need to count unique addresses. If we use generic map[string]bool — we will need more than 64 GB of RAM, so lets use the bit map:
# Routing protocols and architectures/Print version

Onako Ntlangani
# Transportation Deployment Casebook
## Table of contents

| Introduction About Featured Cases Communication Technologies Cellular Telephone (2012) United States Post Office (2011) US Post Office (2013) Transportation Vehicle Technologies Beijing cars (2018) Accessible Public Transportation (2011) Battery Electric Vehicles (2015) Cable Car (2012) Hybrid Electric Vehicles (2012) Hybrid-Electric Bus (2011) Trolleybus (2012) Sport Utility Vehicles (2013) | Transit Systems Bay Area Rapid Transit System (2012) Beijing Metro (2012) New York Subway (1904-1945) (2011) New York Subway 1901 to 2012 (2013) Shanghai Metro (2012) Twin Cities Rapid Transit (2012) Transit Payment Technologies Go To Cards (2013) Smart Cards (2013) Rail Systems California Railroads (2011) TGV (2011) Policies and Laws Seat Belts (2013) Highway Systems Interstate Highway System (2011) | All Cases 2011 2012 2013 2014 2015 2018 2019 2020 2021 2022 2023 2024 2025 |

## Related Wikibooks

* Fundamentals of Transportation
* Transportation Economics
* Transportation Geography and Network Science
* Transportation Planning Casebook
# Earthquakes

This book will be on earthquakes, a natural disaster that can kill and destroy. But with proper prediction, we can figure out where there is a lot of danger and how to prevent as many casualties as possible. If you are interested in volcanoes, but think that you should learn about seismology as well, then here is the place

## Table of Contents

* Plate Tectonics
* Basics of Earthquakes
* Measuring and Predicting Earthquakes
* Seismology and the Seismograph
* The Seismologist
* Special Topics
* Some Earthquakes Around the World
* 8.5 Earthquake in Chile

## Resources

* Volcanoes—Volcanoes and earthquakes are often seen together.
* The US Geological Society (USGS)—The USGS researches earthquakes and volcanoes, among other things.
* DK E-guide Earth—The DK E-guide to Earth is Internet-linked. Here is the section on earthquakes.
* Incorporated Research Institutions for Seismology (IRIS)—IRIS is a non-profit consortium dedicated to the acquisition, management, and distribution of seismological data.
# Earthquakes/8.5 Earthquake in Chile

The 1960 Valdivia earthquake and tsunami (Spanish: Terremoto de Valdivia) or the Great Chilean earthquake (Gran terremoto de Chile) occurred on 22 May 1960. Most studies have placed it at 9.4–9.6 on the moment magnitude scale,[1] while some studies have placed the magnitude lower than 9.4,[6][7] making it the most powerful earthquake ever recorded. It occurred in the afternoon (19:11:14 GMT, 15:11:14 local time), and lasted 10 minutes. The resulting tsunamis affected southern Chile, Hawaii, Japan, the Philippines, eastern New Zealand, southeast Australia, and the Aleutian Islands.
# Chess Opening Theory/1. d4/1...b6
## 1... b6 - English Defence

With the move 1.... b6 Black prepares to develop the Queenside Bishop. It's also a flexible option when played with the e6 development as Black has various ideas involving the e6, Nf6, Bb4, Bb7 moves.

### White's responses

White likely to respond with one of the following:
* 2. c4 A standard reply, White continues in Queen Gambit formation ready to play e4.
* 2. Nf3 May transpose into a Queen's Indian Defence.
* 2. e4 This move order arrives at a Owen's Defence.

## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation.
1. d4 b6
| | 2 | 3 | 4 | 5 | 6 | 7 |
| English Defence | c4 e6 | e4 Bb7 | Bd3 f5!? | exf5 Bxg2 | Qh5+ g6 | fxg6 Bg7 | ∞ |
| Queen's Indian Defence | Nf3 Bb7 | c4 e6 | Nc3 Nf6 | a3 d5 | cxd5 Nxd5 | e3 Be7 | +/= |
| Owen Defence | e4 Bb7 | Bd3 e6 | Nf3 c5 | c3 Nf6 | Qe2 Be7 | O-O Nc6 | ∞ |
When contributing to this Wikibook, please follow the Conventions for organization.

## References

* Kasparov, Garry, & Keene, Raymond 1989 Batsford chess openings 2. ISBN 0-8050-3409-9.
# Jonesboro, Arkansas

Jonesboro, Arkansas is a textbook over Jonesboro, the fifth-largest city in Arkansas. This textbook is designed for students in secondary and postsecondary education.

## Table of contents

* Introduction
* Culture and demographics
* Geography
* Government

## Credits

All help is welcome! Please add your name below if you want to be credited.
* Jonesboropedia
# History of the National Hockey League/1917–1942/Expansion in the 1920s

The NHL grew to six teams in 1924, adding a second team in Montreal, the Maroons, and the first American team, the Boston Bruins. The Bruins were purchased by Charles Adams, a grocery store financier who had first developed an interest in hockey during the Stanley Cup playoffs, paying $16,000 for the team. The Maroons were created to replace the Wanderers and to appeal to the English population of Montreal. The first NHL game played in the United States was a 2–1 Bruins victory over the Maroons at the Boston Arena on December 1, 1924. The Montreal Forum, which in later decades became synonymous with the Canadians, was built in 1924 to house the Maroons. The Canadians did not move into the Forum until two years later. The Forum hosted its first Stanley Cup final in its second year, as the Maroons defeated the WCHL's Victoria Cougars in the 1926 Stanley Cup Finals, the last time a non-NHL team competed for the Cup.
The New York Americans began play in 1925 along with the NHL's third American-based team, the Pittsburgh Pirates. Three more teams were added for the 1926–27 season. Tex Rickard, operator of Madison Square Garden, had reluctantly allowed the Americans into his arena the year before. However, the Americans were so popular in New York that Rickard felt his arena could support a second team. As a result, the New York Rangers were granted to Rickard on May 15, 1926. In November of that year, the league announced that the cities of Detroit, Michigan and Chicago, Illinois would get teams. Detroit purchased the assets of the Victoria Cougars to stock the expansion Detroit Cougars. The players of the Portland Rosebuds were sold to coffee tycoon Frederic McLaughlin for his new Chicago Black Hawks team. The three new franchises brought the NHL to ten teams.
The Rangers reached the 1928 Stanley Cup Finals, in just their second season, against the Maroons. Lorne Chabot was injured early in the second game of the series, leaving the Rangers without a goaltender. As the Maroons were unwilling to allow the Rangers to substitute a goaltender watching from the Montreal Forum stands, Rangers coach Lester Patrick was forced into goal himself. A defenceman during his playing days, the 44-year-old Patrick allowed only one goal on 19 shots as the Rangers won the game in overtime, 2–1. The Rangers signed New York Americans goaltender Joe Miller the next day and went on to capture the Stanley Cup in five games.
# Jonesboro, Arkansas/Government

The city government of Jonesboro, Arkansas, uses a mayor–council structure, with an elected mayor serving as the chief executive of the city, and elected councilors representing districts of the city. Various appointed positions work in specific areas, such as budgeting, city development, and public communications.
The city government is headquartered at the Municipal Center in downtown Jonesboro.
# Monkey
## History

Monkey is a BASIC dialect programming language that translates Monkey code into multiple cross-platforms. Currently the supported target platforms include Windows, Mac OS X, Android, iOS, HTML5, Flash and XNA.
Monkey is the latest programming language by Blitz Research Limited, following BlitzMax (2004) and BlitzBasic (2000), two prior BASIC programming dialects from the same author.

## Compilation

Monkey code is translated into the target language via the Trans tool and into a native compiler depending on the target platform. Monkey requires the use of other compilers and development kits to reach the end target. This process is largely automated with the accompanying IDE, Monk (2011) and Ted (2012).

## Modules

Modules provide the runtime functionality of Monkey. They are stored in the modules directory inside the Monkey directory, and accessed via the Import commands.

## References

* User Guide
* Language
   * Reference
   * Lists
   * Stacks
   * Maps
* Modules
   * Mojo
   * OpenGL
   * OS
* Third-Party Modules
   * Diddy
   * Box2d
   * Chipmunk
   * MNet

## External links

* Monkey Website
* Monkey Community Forums
# OpenSCAD Tutorial
## Table of Contents

* Introduction
* Chapter 1
** A few words about OpenSCAD
** Getting started with the Tutorial
** Basic information about the OpenSCAD environment
** Creating your first object
** Creating a slightly different cube
** Adding more objects and translating objects
** The cylinder primitive and rotating objects
** Completing your first model
** Creating a second model
* Chapter 2
** Scaling parts or the whole model
** Quick quiz
** Parameterizing parts of your model
** Parameterizing more parts of your model
** Challenge
** Parameterizing your own models
* Chapter 3
** The sphere primitive and resizing objects
** Combining objects in other ways
* Chapter 4
** Defining and using modules
** Parameterizing modules
** Defining default values of module’s parameters
** Separating the whole model into modules
* Chapter 5
** Creating and utilizing modules as separate scripts
** Using a script with multiple modules
** Using the MCAD library
** Creating even more parameterizable modules
** Challenge
* Chapter 6
** OpenSCAD variables
** Conditional variable assignment
** More conditional variable assignments
** Conditional creation of objects – If statement
** Challenge
* Chapter 7
** Creating repeating patterns of parts/models – For loops
** Creating more complex patterns
** Challenge
** Creating patterns of patterns – Nested for loops
* Chapter 8
** Rotationally extruding 3D objects from 2D objects
** Challenge
** Linearly extruding 3D objects from 2D objects
* Chapter 9
** Doing math calculations in OpenSCAD
** Creating any 2D object with the polygon primitive
** Challenge
** Creating more complex object using the polygon primitive and math
** Another challenge

## Useful links

* OpenSCAD's website
* Download OpenSCAD
* Syntax cheat sheet
* The OpenSCAD Language Manual for use later as a reference.
# Numbers and measurements/Numbers

This page will be talking about number units that are greater or equal to one.

## More

Go to Googology for more.
# Mirad Grammar

Mirad Grammar · Introduction →
Welcome to a textbook on the grammar of Mirad. Formerly known as Unilingua, Mirad is an artificially constructed auxiliary language (conlang) developed originally by Paris-based author Noubar Agopoff as a serious medium for easy, regular, expressive, and logical international communication. This textbook is a revision of the language with many new features, plus access to a bilingual dictionary containing over 209,000 word/expression pairings, over ten times the size the original Unilingua vocabulary. The vocabulary is internally consistent and was developed systematically from scratch with no relation to existing natural languages.
Table of Contents :
| Introduction Why Mirad? Alphabet Pronunciation Syllabification Stress Phonotactics Parts of Speech Nouns Articles Adjectives Adverbs Determiners Numbers Pronouns Verbs Prepositions Conjunctions | Interjections Hybrids Greetings and Euphemisms Acronyms and Abbreviations Onomatopoeia Vocabulary Formation Word Families Syntax Sample Texts Analyzed Lesson 1 Lesson 2 Lesson 3 Lesson 4 Lesson 5 Mirad-English Dictionary Flaws in Mirad |
# Open Scholarship Policy Observatory (Volume 1)/The Canadian–Australian Partnership for Open Scholarship (CAPOS)

This observation was written by Caroline Winter, for the Electronic Textual Cultures Laboratory and the Implementing New Knowledge Environments partnership.
The Canadian­–Australian Partnership for Open Scholarship (CAPOS) is a collaboration between the INKE Partnership and a collective of Australian researchers and research groups, policy makers, computing organizations, libraries and library associations, and universities.
CAPOS seeks to advance open scholarship in Canada and Australia by providing opportunities for training and international collaboration at the Digital Humanities Summer Institute (DHSI) and at DH Downunder, analyzing and implementing international open scholarship policy, facilitating innovation in open scholarship through the development of open research infrastructure, and increasing awareness and building community across open scholarship stakeholder groups.
More information about CAPOS and its partner members is available on the INKE website.

## History and Events

CAPOS began in conversations at DHSI, DH Downunder, INKE Partnership Gatherings, and other events that bring together the open scholarship community of practice together. It was launched in 2018.
The first official CAPOS Gathering will be held at the University of Newcastle in December 2019, in association with DH Downunder 2019: Knowledge Creation in the 21st Century: Approaches to Open, Digital Scholarship. The event will feature talks by Clare Appavoo from the Canadian Research Knowledge Network (CRKN), Ginny Barbour from the Queensland University of Technology and the Australasian Open Access Strategy Group (AOASG), Jonathan Bengtson from the University of Victoria Libraries and the Canadian Association of Research Libraries (CARL-ABRC), and Alexis Tindall from the Australian Research Data Commons (ARDC). It will also feature lightning talks and discussion addressing issues related to open social scholarship and knowledge creation in the digital age. Registration is now open for the event.
DH Downunder 2019, to be held at the University of Newcastle from December 9–13, 2019, includes an Open Scholarship track with several classes taught by CAPOS members. Registration is open for this event as well.

## An International Collaboration with Global Effects

Through this collaboration, CAPOS will work toward increasing the efficiency and impact of its Canadian and Australian partners’ open scholarship activities to further the global open scholarship movement.