OpenLLM-France/wikimedia huggingface dataset:
# Poker/Control

Control is a variant of Seven-Card Stud poker.

## How To Play

Each player antes and is dealt two cards face down followed by one face up card. Betting begins with the player with the highest card. The other players follow.
Next, the person with the highest "up" hand is in control, and must decide to "let it ride" or re-deal. If the player wants to re-deal, then the cards are shuffled and everyone re-antes and the game is re-dealt. If the player "lets it ride", he can then check or bet.
After everyone has called, raised, or folded; everyone is dealt one more down card. After this, there is no more betting to take place. The winner is the one with the highest hand. Everyone who stays and loses owes a pre-set amount to the next pot. The game is not over until only one person is left in.

## Notes

Most of the time no betting takes place until the end of the last up card. If you have a flush on the fifth card, you could only have a Jack high up, while someone has a pair of threes they are in control and can re-deal it if they see you betting.
When the controller goes, and bets if you are on his left you could raise with a medium or good drawing hand in the hope of getting more people out, and if they do not fold you could still hit and win a bigger pot.
# Poker/Five card stud
## Rules

* There can be a maximum of 10 players in a hand of five card stud.
* Each player is dealt one card face down (the hole card) and one card face up (an open card.) The two players to the dealer's left act as big blind and small blind, respectively. The big blind must place an ante equal to one betting division, while the small blind must place an ante equal to one-half of one betting division. Thus, in a $5/$10 game, the big blind must ante $5, and the small blind must ante $2.50.
** In a game involving a bring-in bet, the player with the smallest initial open card (determined in descending order from Ace to Deuce, with the suits descending Spades, Hearts, Diamonds, Clubs) must place a bet equal to the big blind, in order to sweeten the pot.
* Once the antes have been placed, betting continues in a similar fashion to other poker games. The player to the left of the big blind acts first. Each player has three options: he or she may fold his hand, forfeiting any stakes they have placed in the pot and their chance to win the hand; call the previous bet, matching the largest single bet placed in the pot thus far; or they may raise the previous bet, exceeding the largest bet by one betting division.
** Betting Example: Five players, Alex, Ben, Chris, Donna, and Ellen sit clockwise around a table playing $5/$10 five card stud. Alex is the dealer, Ben is the big blind, and Chris is the small blind. (For the sake of our example, there is no bring-in bet.) Donna may fold her hand, call the big blind by placing $5 in the pot, or raise the pot by placing $10 in the pot. If Donna raises, Ellen must place $10 in the pot to call or $15 to raise. If Ellen also raises, Alex must place $15 in the pot to call, or $20 to raise. In limit games, each betting round is capped at 4 times the betting division for that round. Thus, in this first round, the maximum raise is $20.
* Once betting for the first round has ended, with all players either calling or folding, a second open card is dealt, and a new betting round begins.
* Again, when betting for the second round has ended, a third open card is dealt. In the third betting round, the opening bet is doubled - in our $5/$10 game, a player must place $10 in the pot initially, and all raises will be in increments of $10 (with $40 being the maximum raise.)
* Finally, the fourth open card is dealt, and the hands are complete. A fourth betting round occurs (again with a doubled opening bet), and finally the hands are revealed, with the best hand taking the pot.
# Poker/FollowQueen

Follow the queen is a variation of seven card stud. The queen is a wild card at all times. When a queen is dealt as an up card, the very next card is the second wild card. If another queen comes up, the second wild card changes to the next card. If no queen comes up or a queen is the last up card, then there is no second wild card.
A variation is to charge an fixed ante to be paid by a player when he is dealt an up wild card.
# Poker/CrazyPineapple

Crazy Pineapple is a variant of hold'em in which each player receives 3 cards as a holding and must discard one of these 3 cards after the post-flop betting interval. The game play is otherwise similar to hold'em.
# Poker/Guts

In guts players pay an ante and receive two cards. Then players must all declare at the count of three whether they intend to contest the pot (e.g. you drop a chip on the table in front of you if you're in). If you lose, you pay the amount in the pot. Flushes and straights do not count.
In three card guts, flushes and straights do count. A variation is to have a one card draw after declaration.
A variation for declaration is to have players declare in order around the table.
# Pinyin/In-

See also
wur-
# Pinyin/Improve

See also
# Pinyin/Impose

See also
# Pinyin/In

See also
# Pinyin/In Which

See also
# Operating System Design/Swapping

Swapping concept comes in terms of process scheduling. Swapping is basically implemented by Medium term scheduler.Medium term scheduler removes process from CPU for duration and reduce the degree of multiprogramming. And after some time these process can again be reintroduced into main memory. Process execution will again be resumed from the point it left CPU. This scheme is called swapping. More generally we can say swapping is removing of process from memory to secondary memory and again back to main memory.
Example: Assume a multiprogramming environment with Round-Robin CPU scheduling algorithm. When a quantum expires, the memory manager will start to swap out the process that just finished, and swap in another piece to the memory space that has been freed. In the meantime, CPU scheduler will allocate a time slice to some other process in memory. When each process finishes its quantum it will be swapped back with another process. Ideally, memory manager can swap process fast enough so that there is always at least one process in memory, ready to execute, when the CPU scheduler wants to reschedule the CPU. The quantum must also be sufficiently large that reasonable amounts of computing are done between swaps.
Swapping can be implemented in various ways. For example, swapping can be priority based. That means if a higher priority process arrives and wants service, the memory manager can swap out the lower priority process to the secondary memory so that it higher priority process can be loaded to main memory for execution. As soon as higher priority process finishes, the lower priority process will be swapped back to main memory and execution will be continued. Sometimes swapping is also called roll out, roll in.
Address binding rules over the memory space to be allocated to process. Because process that has been swapped out need to be swapped in on same memory location from where it let off. And address binding implements it.
Swapping requires a backing store. And this backing store is as fast as disk. This backing store should be large enough to maintain copies of all memory images for all users.
Swapping also means copying some data from one memory to another.
# Operating System Design/Scheduling Processes/Priority Scheduling

In Priority Scheduling, each process is given a priority, and higher priority methods are executed first, while equal priorities are executed First Come First Served or Round Robin.
There are several ways that priorities can be assigned:
* Internal priorities are assigned by technical quantities such as memory usage, and file I/O operations.
* External priorities are assigned by politics, commerce, or user preference, such as importance and amount being paid for process access (the latter usually being for mainframes).
SPN is a form of priority scheduling based on External Priorities.

## Analogy

Internal: At a store, the person with the right change and only two items gets to check out first. External: At a store, the cashier is bribed by the most important customer, who can thus check out first.

## Advantages and Disadvantages

A process can sometimes become starved, live locked, or indefinitely blocked. One way to fix this is by aging the priority, so that the longer a process has waited for CPU time, the higher its priority is.
# Operating System Design/Scheduling Processes/SPN

Shortest Process Next (SPN) scheduling, also called Shortest Job First (SJF) scheduling, assigns the process estimated to complete fastest to the CPU as soon as CPU time is available.
This method falls prey to the halting problem. The halting problem is unsolvable, but basically states that given a program and a particular input, can we determine if it will ever finish? With a simple program we could try to run it, and if it completes then we know it will finish, but if it doesn't complete in a given time, perhaps we just didn't wait long enough.
There is no way to determine which process is going to run in the least amount of time unless you allow all processes to run and record their execution times or take input from the user.
This method also allows for live lock with many short processes locking a longer process out from the CPU.

## Analogy

The cashier in a store finds the person with the fewest items, and checks out their items first.

## Implementation

it can be implemented by choosing the shortest job before the higher job.

## Advantages and Disadvantages

SPN tends to be the most optimal scheduling system for total number of jobs completed short of SRT, but requires exact knowledge of how long a process will take. This is usually input by the user. If the mechanism to determine what is the shortest job is faulty then this might significantly reduce the throughput. Given a system with a lot of short jobs and one long job then the long job might never be run.
# Operating System Design/Scheduling Processes/SRT

The Shortest Remaining Time (SRT) scheduling system is a more intelligent version of SPN that allows shorter processes to skip ahead as they appear, instead of only processing the shortest process at the time that CPU time becomes available.
This method also falls prey to the halting problem, and is also susceptible to live lock.
There is no way to determine which process is going to run in the least amount of time unless you allow all processes to run and record their execution times or take input from the user.

## Analogy

The individual with the least amount of items is allowed to skip to the front of the line regardless of how long everyone else has been waiting..

## Advantages and Disadvantages

SRT tends to be the most optimal scheduling system if we are hoping to run as many processes as possible in a given time, but requires exact knowledge of how long a process will take. This is usually input by the user or calculated from previous runs of the process.
# Operating System Design/Security/Security

Security is one of the most sought-after features in an operating system today. With computers now being used to store vast amounts of data, from top-secret government information to enterprises and business keeping track of bank account numbers, security in an operating system is a must. Within the next pages we will discuss the basics of OS security, from user authentication and cryptography to modern internet cryptographic algorithms.

## Further reading

* Basic Computer Security
* Internet Technologies/SSH
* Minimizing hard disk drive failure and data loss
* ERP5 Handbook/Magic Security
* Security Architecture and Design
* Fundamentals of Information Systems Security
* .NET Development Foundation/Security
* Visual Basic .NET/Security
* FOSS Network Infrastructure and Security/Security Functions with FOSS
* CIW Security Professional Exam 1D0-470
* UNIX Computing Security
* Linux Guide/Security
* Evolution of Operating Systems Designs/Security: capabilities
# Operating System Design/Segmentation

Segmentation is one of the most common ways to achieve memory protection. In a computer system using segmentation, an instruction operand that refers to a memory location includes a value that identifies a segment and an offset within that segment. A segment has a set of permissions, and a length, associated with it. If the currently running process is allowed by the permissions to make the type of reference to memory that it is attempting to make, and the offset within the segment is within the range specified by the length of the segment, the reference is permitted; otherwise, a hardware exception is raised.
In addition to the set of permissions and length, a segment also has associated with it information indicating where the segment is located in memory. It may also have a flag indicating whether the segment is present in main memory or not; if the segment is not present in main memory, an exception is raised, and the operating system will read the segment into memory from secondary storage. The information indicating where the segment is located in memory might be the address of the first location in the segment, or might be the address of a page table for the segment, if the segmentation is implemented with paging. In the first case, if a reference to a location within a segment is made, the offset within the segment will be added to address of the first location in the segment to give the address in memory of the referred-to item; in the second case, the offset of the segment is translated to a memory address using the page table.
In most systems in which a segment doesn't have a page table associated with it, the address of the first location in the segment is an address in main memory; in those systems, no paging is done. In the Intel 80386 and later, that address can either be an address in main memory, if paging is not enabled, or an address in a paged "linear" address space, if paging is enabled.
A memory management unit (MMU) is responsible for translating a segment and offset within that segment into a memory address, and for performing checks to make sure the translation can be done and that the reference to that segment and offset is permitted.
This usage should not be confused with that of the memory segments used by early x86 processors such as the Intel 8086 and Intel 8088, as they did not provide any protection (any program could access any segment with no restrictions, and a segment consisted of only a starting location and a fixed length of 64 KiB); segmentation in the Intel 80286 and later provided protection.it protects the file of the main memory.
# Operating System Design/Scheduling Processes/Round Robin

Round Robin scheduling is an older method of CPU time sharing.
Each process is given a certain amount of CPU time (a time slice), and if it is not finished by the end of the time slice, the process is moved to the back of the process queue, and the next process in line is moved to the CPU.
A common variant on Round Robin allows a process to give up the remainder of its time slice if it doesn't need it. This might be because it is waiting for a particular event, or because it is completed.
Unlike Shortest Process Next and Shortest Remaining Time, this method does not exhibit live lock nor is it impacted much by the halting problem (a process that never ends will not end, but other processes will still run).

## Analogy

At a mall, the cashier offers each customer a certain amount of time to checkout their items, and if they aren't done with their items by the time set by the cashier, the customer must go to the back of the line and wait. This repeats until all items are checked out.

## Advantages and Disadvantages

If the set time is too short, then too much process switching will take place and the design will become slow. If the set time is too long, then the system may become unresponsive, time wasting and would emulate First Come First Served.
# Operating System Design/Security/Privileges

A great percentage of the operating systems that are used today have user account privileges. These privileges may be for security reasons, to make sure that someone does not leak internal company information out, or to protect the well-being of the computer from some people's incompetence with a computer, or to prevent grave mistake from crashing the system, or to stop system failure or hacking of a computer (internally or externally) through an account with restricted access to files.
For example, in Windows XP, there are two kinds of accounts: Administrator and Limited. When one has an Administrator account, they have virtually ultimate power, and can change system files or other users' files at will. On the other hand, a person with a Limited account can only change their own files and such. Multi-user Operating systems should incorporate user account privilege restriction in their design.
# Operating System Design/Scheduling Processes/FCFS

The first come, first served (commonly called FIFO ‒ first in, first out) process scheduling algorithm is the simplest process scheduling algorithm. It is rarely used in modern operating systems, but is sometimes used inside of other scheduling systems.

## Analogy

A FIFO acts like any normal queue whether, it is a line in a cinema, a checkout line in a store, or a queue for a ticket booth. The first person or process to arrive (First In) is the first one to be dealt with (First Out). If one person goes through the line and then decides they forgot something then they have to go back through.
This is exactly how OS's with this design let programs conduct their business. One person (aka: process) at a time.

## Implementation

To implement this, you can create a queue, an abstract data type (ADT) that can be constructed from a linked list data structure. The system can dequeue the next process from the front of the queue, run the process until completion (or enqueue the process at the end of the line in more complex schemes), then enqueue the process at the end of the line, allowing the next process to use the CPU.

## Advantages and Disadvantages

Advantages:
* simple
* easy and useful and understand
* first come, first served
Disadvantages:
* This scheduling method is nonpreemptive, that is, the process will run until it finishes.
* Because of this nonpreemptive scheduling, short processes which are at the back of the queue have to wait for the long process at the front to finish
* Throughput is not efficient.
* It is used in a small system only where I/O efficiency is not very important.
# Pinyin/Nuclear

Search nuclear
# Pinyin/Not
## Adverb

* not: used for making a sentence, expression, or word negative
** bu: yohngyur shii juh'zi, shuofaa, huoh ciryuu cherngweir fooudihng
# Pinyin/Not only

See also
# Pinyin/Now

See also
# Pinyin/Nose

Search Pinyin nose
The nose is the part of your face above your mouth that you use for smelling and breathing.
bir'zi shih miahnbuh zuiiba shahngmiahn yohnglair wern qihweih her huxi d buhfehn.
# Pinyin/Not enough

See also
# Pinyin/Nuclear test

See also
# Pinyin/Notation

Notation is a system of symbols used to represent information.
biaaoshihfaa shih yohnglair biaaoshih xihnxi d furhaoh xihtoong.
# Pinyin/Notice

See also
# Pinyin/Quick

See also
# Pinyin/Rabbit

See also
# Pinyin/Quinoa

Search Pinyin quinoa
# Pinyin/RNA

RNA, short for ribonucleic acid, is a kind of nucleic acid. It is different to DNA. DNA has two strands while RNA has one strand.
RNA, ribonucleic acid de suōxiě, shì yī zhǒng nucleic acid, yǔ DNA bùtóng. DNA yǒu 2 tiáo liàn ér RNA yǒu​​ 1 tiáo liàn.
# Pinyin/Race

A race is a group of people who are similar in skin color or other physical features.
zhoongzur shih huseh huoh qirta shentii tehzheng xiangsih d 1-zuu rern.
# Pinyin/Quarter

See also
# Pinyin/Rabies

See also
Rabies is a zoonotic disease (a disease that is transmitted to humans from animals) that is caused by a virus. The disease infects domestic and wild animals, and is spread to people through close contact with infected saliva via bites or scratches.
Kuángquǎnbìng shì yīzhǒng rénchùgònghuàn jíbìng (yóu dòngwù chuánbō dào rénlèi de jíbìng), yóu yīzhǒng bìngdú yǐnqǐ. Kuángquǎnbìng gǎnrǎn jiāchù hé yěshēng dòngwù, ránhòu tōngguò yǎoshāng huò zhuāshāng, jīngguò yǔ shòudào gǎnrǎn de tuòyè mìqiè jiēchù chuánbō zhì rén.
# Pinyin/Style

See also
A style is the particular way in which something is done.
fengger shih moouwuh d tehdihng fangshih.
# Pinyin/Submarine

A submarine is a boat that can go underwater.
qiarntiing shih kee qiarnshuii d chuarn.
# Pinyin/Success

Success
Be hard at work, do not say you cannot. All troubles can be defeated. Without rain, there is no rainbow. Without hardwork, where come success. Therefore, success belongs to bravely fighting hardworkers.
Chénggōng
Jiāyóu, bùyào shuō bù xíng. Zhǐyào kěn nǔlì, suǒyǒu kùnnán dōu huì bèi jībài. Méiyǒu yǔ-hòu, nǎ lái cǎihóng. Méiyǒu nǔlì, nǎ lái chénggōng. Suǒyǐ, chénggōng shì shǔyú yǒnggǎn fèndòu de nǔlìzhě.
# Pinyin/Study

Search Pinyin study

## Noun

* study is the activity of gaining knowledge.
** xuerxir shih quuder zhishir d huordohng.
# Pinyin/Subway

See also
# Pinyin/Substance

Search Pinyin substance
A substance is a particular type of liquid, solid, or gas.
wuhzhih shih tehdihng zhoongleih d yehtii, guhtii, huoh qihtii.
# Pinyin/Subject

A subject is a thing or person that is being discussed, described or dealt with.
zhuutir shih beih taaoluhn, miaorshuh huoh chuulii d shihwuh huoh rern.
# Physics Study Guide/Quantum Mechanics
## The Beginning Of The End

By the start of the twentieth century, a major problem had become apparent in what is now referred to as 'classical physics'. The Rayleigh-Jeans Law of thermodynamics stated that as the wavelength of the light incident on a hot body, the total power reflected from the body would also increase. The problem with this was that as the wavelength increased towards zero, the power increased towards infinity. This peak occurred about the ultraviolet section on the EM spectrum so the problem became known as the Ultraviolet Catrastope. This marked the beginning of the end for classical physics.
However, in 1900, a physicist named Max Planck went before the German Physical Society and presented a groundbreaking new theory on thermal radiation. It was based on an idealised body called a blackbody - perfect absorber and emitter of radiation. The emission spectrum of this body is identical to that of classical theory until it reaches a specific wavelength, dependent on the temperature of the body, where it peaks and then drops to zero for the shortest wavelengths.
# Physics Study Guide/Reviews

Thanks karl!
it's very helpful!!!!
# Physics Study Guide/The purpose of Physics

The Purpose of Physics
Physics is concerned with understanding the natural world, in the broadest and most fundamental sense. This understanding helps us explain, predict and control the world around us.
# Physics Study Guide/Style Guide
#### Equations

For uniformity in the book a template should be used for embeding equations. View the template at Template:PSG/eq use it as follows
Which gives

#### Units

Units should be given using the \mathrm command and small spaces \, between the units. Vectors should be bold and italicized if they are variables with the \boldsymbol command.
* Barry N. Taylor (2004), Guide for the Use of the International System of Units (SI) (version 2.2). Available. National Institute of Standards and Technology, Gaithersburg, MD.

## Global Style Guidelines

* Wikibooks Manual of Style