OpenLLM-France/wikimedia huggingface dataset:
# Chess Opening Theory/1. e4/1...e5/2. f4/2...exf4/3. Nf3/3...d6/4. d4/4...g5

The most popular move in this reason. It serves 2 purposes. 1 is to defend the f4 pawn temporarily, and the next purpose is to march to g4 next move and attack the knight. White can continue in multiple ways here, such as Nc3 and h3
# Chess Opening Theory/1. e4/1...e5/2. f4/2...exf4/3. Nf3/3...d6/4. d4

d4 opens up the bishop to recapture the pawn, and grabs more central space. Black usually responds with g5, temporarily defending the pawn while planning ...g4 to trap the f3 knight. Believe me when there is a line where white sacrifices the knight on f3. :)
Compared to 4.Bc4, white usually castles QUEENSIDE with this variation, since white develops their queenside pieces and moves their queen usually.
# Cunningham-Euwe Variation

While White's 3.Nf3 prevented the check on h4, Black's third move renews the threat and develops. Here White doesn't have a promising way to stop the check on h4, as 4.g3?! fxg3 5.hxg3 Nf6 saddles White with a weak isolated pawn on g3, and the semi-open h-file cannot be effectively used. If he tries h4?! Nf6, he creates all sorts of weaknesses down the g-file, and further delays his development. He has two main continuations: 4.Bc4 and 4.Nc3, while d4!?, gaining central space, freeing d2 for the king, and preparing to round up f4 with Bxf4, may be playable as well. 4.Bc4 is the main line, clearing f1 for the White king to move to and eyeing a possible attack on f7. 4.Nc3, however, is also good, with simple development.

## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
1.e4 e5 2.f4 exf4 3.Nf3 Be7
| 4 | 5 | 6 | 7 |
| Bc4 Nf6 | e5 Ng4 | O-O Nc6 | d4 d5 | = |
| Nc3 Bh4+ | Ke2 d5 | Nxd5 Nf6 | Nxf6+ Qxf6 | ∞ |
When contributing to this Wikibook, please follow the Conventions for organization.

## References

de Firmian, Nick. Modern Chess Openings, 15th edition. New York, NY: Random House, 2008.
# Chess Opening Theory/1. e4/1...e5/2. f4/2...exf4/3. Nf3/3...d5
## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
1. e4 e5 2. f4 exf4 3. Nf3 d5
| 4 |
| exd5 | = |
| e5 | = |
When contributing to this Wikibook, please follow the Conventions for organization.
# Fischer Defense

Fischer called 3... d6 "a high-class waiting move." The idea of it is to avoid the Kieseritzky Gambit (1.e4 e5 2.f4 exf4 3.Nf3 g5 4.h4 g4 5.Ne5) and free the queen's bishop, as well as giving an extra space for the king to run to if necessary, while also taking away the e5 square from the f3 knight, potentially trapping it. However, it also blocks the f8-bishop.

## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
1.e4 e5 2.f4 exf4 3. Nf3 d6
* 4
* ... d4
* ... Bc4
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.
# Todo

1 introduction : An overview of Artificial Tissues & Organs and its social/historical contexts, applications, and current related research.
2skills needed to use the chapter as well as links to refresher material.
3sub-chapters A
Sub-chapters that focus in on just a few related concepts, or a specific technique.
Sub-chapters should include concept checks, worked examples, application exorcises where appropriate.
4sub-chapters B
5sub-chapters C
Each chapter should end with a chapter review that summarizes the chapter concepts, formulas, and methods.
The chapter summary should be fallowed be a series of exercises and one or more labs or projects that explores the material covered in the chapter.
Fill in the blanks
annotated bibliography
# Biomedical Engineering Theory And Practice/Biomaterials/4.1. Introduction

The National Institutes of Health Consensus Development Conference defined a biomaterial as ‘‘Any substance (other than a drug) or combination of substances,synthetic or natural in origin, which can be used for any period of time, as a whole or as a part of a system which treats, augments, or replaces any tissue, organ, or function of the body’’ (Boretos and Eden, 1984).
# Biomedical Engineering Theory And Practice

* Industrial employment for Biomedical Engineer
* Lecture at the Faculty of Biomedical Engineering, CTU in Prague
* Biomedical Engineering Laboratory
* Petty Officer 1st Class Sean Buckley and two of the three-person Afghan team he mentors stand in the biomedical engineering shop at Afghan National Army Camp Shaheen regional hospital (4632385674)
Volunteer Editor
* This is a wiki project - an open source, free access reference book. Anyone is welcome and encouraged to contribute anytime, anything (as long as it relates to Biomedical Engineering).
* Hanjin Deviasse Toronto,ON,Canada

## Table of contents

Licensing
Preface
* Introduction
* Physiological System
* Physiological Modeling and Simulation
* Theory of Bioelectric phenomena
* Bioelectric phenomena(Application)
* Neuro engineering
* Concept of Biomechanics
* Biomechanics II,Biomechanics of Bone and Tissue
* Biomechanics III,Biomechanics of Auditory System
* Biomechanics IV, Biomechanics of Heart and Blood
* Biomechanics V, Biomechanics of Blood and Lymphatic transportation
* Rehabilitation Engineering
* Biomaterials
** Requirements of Biomaterials
** Classes of Biomaterials
* Oncology
* Medical Imaging & Analysis
* Biotechnology
* Biosensors & Biochips
* Health Informatics
* Clinical Engineering
* Ethics
* The Technological Tools
* Introduction to Biostatistics with R for Bioengineers
** Introduction of R
** R Language
** R Programming
** R Graphics
** Descriptive statistics with R
** A Probability Model from the Sample Data
** Statistical Inference
* Further reading

## See also

* Medical Suction Machines and Aspirators; Operation and Maintenance
* Wikiversity:School:Medicine

## Acknowledgements

This Wikibook was inspired by the concept of a Wikibook Class Project and by the good leading example of Embedded Control Systems Design Wikibook.
# C Programming/POSIX Reference/utime.h

utime.h is the header in the C POSIX library for the C programming language that facilitates the setting of file access and modification times.

## Member functions

int utime(const char *path, const struct utimbuf *times) This function sets the access and modification times of the specified file.
The utime function sets the access and modification times of the file named by the path argument.

## Member types

Data types defined in the utime.h header include:
* struct utimbuf
** time_t actime access time
** time_t modtime modification time
The times are measured in seconds since the Epoch.

## References

* http://opengroup.org/onlinepubs/007908775/xsh/utime.h.html
* http://opengroup.org/onlinepubs/007908775/xsh/utime.html
# C Programming/POSIX Reference/unistd.h/write

The write system call writes data, in bytes as specified by the caller, from a buffer declared by the user in the program and then writes it into the file supplied by the calling process. In most modern operating system, a program that needs to write data to a file stored in a filesystem uses the Write system call. The file is identified by the file descriptor that is obtained from a previous call to open.
Write, thus, takes three arguments:
* The file descriptor of the file (fd).
* The buffer from where data is to be written into the file (buf).
* The number of bytes to be read from the buffer (nbytes).

## POSIX usage

The write system call interface is standardized by the POSIX specification. Data is written to a file by calling the write function. The function prototype is :
| Argument | Description |
| fd | It is the file descriptor which has been obtained from the call to open. It is an integer value. The values 0, 1, 2 can also be given, for standard input, standard output & standard error, respectively . |
| buf | It points to a character array, which can be used to store content obtained from the file pointed to by fd. |
| nbytes | It specifies the number of bytes to be written from the file into the character array. |
In above syntax, ssize_t is a typedef. It is a signed data type defined in sys/types.h. sizeof operator produces an integer value which is of type size_t.
The write function returns the number of bytes successfully written into the array, which may at times be less than the specified nbytes. It returns -1 if an error is encountered.

## Errors encountered during operation

Listed below are some errors that could be encountered during writing to a file. The errors are macros listed in errno.h .
| Error Numbers | Error | Meaning |
| 5 | EIO | Low-level errors, often concerned with hardware read/write operations. |
| 9 | EBADF | The file descriptor fd is not valid, or an attempt is being made to write into a file opened in 'read-only' mode. |
| 14 | EFAULT | The address specified in the function is an invalid address. |
| 22 | EINVAL | The argument(s) passed with the function is(are) invalid. |
| 28 | ENOSPC | No space available for writing onto the disc. |

## References

* ↑ http://www.unix.com/man-page/FreeBSD/2/write/ Manual page for Write
* ↑ http://www.gnu.org/s/hello/manual/libc/I_002fO-Primitives.html#I_002fO-Primitives I/O Primitives
* ↑ http://pubs.opengroup.org/onlinepubs/007904875/functions/write.html
* ↑ The C programming language. Brian Kernighan & Dennis Ritchie. India: PHI Learning Private Limited. ISBN 978-81-203-0596-0.
* ↑ http://www.gnu.org/s/hello/manual/libc/Error-Codes.html GNU C Library Manual
* ↑ http://www.ibm.com/developerworks/aix/library/au-errnovariable/ IBM page listing errors

## External links

* POSIX write
# C Programming/POSIX Reference/unistd.h/swab

swab is a function in the C programming language that copies one area of memory to another, but swaps adjacent bytes whilst it does so. As far as traceable, “swab” is a contraction of “swap byte”. It is not a standard ISO C library function, but appears in the Single Unix Specification (SUS) and POSIX.1-2001. These require that swab be declared in unistd.h. On other platforms, it may be declared in stdlib.h, if at all.
The swab function is useful for preparing blocks of data for further processing, in situations where the data blocks have been sent through a network arranged in network byte order, and must be rearranged into native byte order (or vice versa). This deals specifically with data blocks that are composed of 2-byte (16-bit) words that must be rearranged so that they have the proper endianness appropriate for the local system.

## External links

* swab: swap bytes – System Interfaces Reference, The Single UNIX® Specification, Issue 7 from The Open Group
# C Programming/POSIX Reference/unistd.h/select

select is a system call and application programming interface (API) in Unix-like and POSIX-compliant operating systems for examining the status of file descriptors of open input/output channels. The select system call is similar to the poll facility introduced in UNIX System V and later operating systems.
In the C programming language source code, the select system call is declared in the header file sys/select.h or unistd.h, and has the following syntax:
| argument | description |
| nfds | the maximum file descriptor across all the sets, plus 1 |
| readfds | fd_set type holding the file descriptors to be checked for being ready to read, and on output indicates which file descriptors are ready to read. Can be NULL. |
| writefds | fd_set type holding the file descriptors to be checked for being ready to write, and on output indicates which file descriptors are ready to write. Can be NULL. |
| errorfds | fd_set type holding the file descriptors to be checked for error conditions pending, and on output indicates which file descriptors have error conditions pending. Can be NULL. |
| timeout | structure of type struct timeval that specifies a maximum interval to wait for the selection to complete. If the timeout argument points to an object of type struct timeval whose members are 0, select does not block. If the timeout argument is NULL, select blocks until an event causes one of the masks to be returned with a valid (non-zero) value. |
fd_set type arguments may be manipulated with four utility macros: FD_SET, FD_CLR, FD_ZERO, and FD_ISSET.
Select returns the total number of bits set in readfds, writefds and errorfds, or zero if the timeout expired, and -1 on error.
The sets of file descriptor used in select are finite in size, depending on the operating system. The newer system call poll provides a more flexible solution.

## See also

* Berkeley sockets
* Polling
* Kqueue
* epoll

## External links

* Linux Manual Page for select(2) and a Tutorial
# C Programming/POSIX Reference/unistd.h/read

In most modern operating systems, a program that needs to access data from a file stored in a filesystem uses the read system call. The file is identified by the file descriptor that is obtained from a previous call to open. This system call reads data, in bytes as specified by the caller, from the file and stores then into a buffer supplied by the calling process.
The read system call can take three arguments:
* The file descriptor of the file,
* the buffer where the read data is to be stored and
* the number of bytes to be read from the file.

## POSIX usage

The read system call interface is standardized by the POSIX specification. Data from a file is read by calling the read function:
The value returned is the number of bytes read (zero indicates end of file) and the file position is advanced by this number. It is not an error if this number is smaller than the number of bytes requested; this may happen for example because fewer bytes are actually available right now (maybe because we were close to end-of-file, or because we are reading from a pipe, or from a terminal), or because the system call was interrupted by a signal.
Alternatively. -1 is returned when an error occurs, in such a case errno is set appropriately and it is left unspecified whether the file position (if any) changes.

## References

POSIX read
# Annotations of The Complete Peanuts

Since 2004, Fantagraphics Books has been republishing the complete run of the comic strip Peanuts in hardcover form, starting from the origin of the strip in October 1950. (For more details on the series, see The Complete Peanuts).
Charles M. Schulz made frequent topical references within the strip to the events and popular culture of the time, which would have required no explanation for a contemporary reader. Some of these references are now rather obscure, and might not be understood by someone not versed in the popular culture of the period. These annotations aim to provide background for such references, and explain their significance. Links to Wikipedia are provided where necessary, if more information is desired.
Each chapter corresponds with a separate volume from the Fantagraphics series, corresponding to two years of the published strips. The original publication dates of the strips are given in addition to the page numbers of the collection, so this reference work can also be used by people with access to the original archives.

## Contents

* 1950–1952
* 1953–1954
* 1955–1956
* 1957–1958
* 1959–1960
* 1961–1962
* 1963–1964
* 1965–1966
* 1967–1968
* 1969–1970
* 1971–1972
* 1973–1974
* 1975–1976
* 1977–1978
* 1979–1980
* 1981–1982
* 1983–1984
* 1985–1986
* 1987–1988
* 1989–1990
* 1991–1992
* 1993–1994
* 1995–1996
* 1997–1998
* 1999–2000 (also includes Lil' Folks)
* Comics and Stories (the final volume of extras)
# Annotations of The Art of Computer Programming Volume 1

The purpose of these annotations is to encourage and help people to read one of the most influential scientific books of the 20th century. The annotations in this wikibook apply to Volume 1 of The Art of Computer Programming, by Donald "Don" Knuth.
Please keep annotations succinct, clear, helpful, and professional.
Annotations are marked with the edition number, page number and section number. Related equations, theorems, or otherwise numbered items should also be marked. Use bold for the numbering, for example
    2nd Edition, pg 45, section 1.2.5, line -5. More factorials to memorize: 6! = 720, 7! = 5040, 8! = 40320, 9! = 362880
Annotations must be presented in the correct order. Defer to the third edition of the book in case of conflict.
TAOCP is copyrighted. Any quotes must respect the rules of copyright and/or specific instructions from the publisher.

## Chapters of this Book

* Chapter 1
# Annotations of The Complete Peanuts/1950 to 1952

Annotations to The Complete Peanuts: 1950 to 1952 by Charles M. Schulz (Fantagraphics Books, 2004. ISBN 156097589X
Annotations to other volumes: 1950–1952 · 1953–1954 · 1955–1956 · 1957–1958 · 1959–1960 · 1961–1962 · 1963–1964 · 1965–1966 · 1967–1968 · 1969–1970 · 1971–1972 · 1973–1974 · 1975–1976 · 1977–1978 · 1979–1980 · 1981–1982 · 1983–1984 · 1985–1986 · 1987–1988 · 1989–1990 · 1991–1992 · 1993–1994 · 1995–1996 · 1997–1998 · 1999–2000 · Comics and Stories
# Annotations of The Complete Peanuts/1953 to 1954

Annotations to The Complete Peanuts: 1953 to 1954 by Charles M. Schulz (Fantagraphics Books, 2004. ISBN 1560976144
Annotations to other volumes: 1950–1952 · 1953–1954 · 1955–1956 · 1957–1958 · 1959–1960 · 1961–1962 · 1963–1964 · 1965–1966 · 1967–1968 · 1969–1970 · 1971–1972 · 1973–1974 · 1975–1976 · 1977–1978 · 1979–1980 · 1981–1982 · 1983–1984 · 1985–1986 · 1987–1988 · 1989–1990 · 1991–1992 · 1993–1994 · 1995–1996 · 1997–1998 · 1999–2000 · Comics and Stories
# Annotations of The Complete Peanuts/1955 to 1956

Annotations to The Complete Peanuts: 1955 to 1956 by Charles M. Schulz (Fantagraphics Books, 2005. ISBN 1560976470
* P. 283 (October 18, 1956). There's no particular reason why Charlie Brown yelled this except that it's dog-related: it's the title of both the novel Lassie Come-Home (1940) and the movie based upon it, Lassie Come Home (1943), and in the well-known long-running TV series Lassie the dog's name gets iconically yelled in the opening.
* p. 300 (November 26, 1956). Lucy is reading an excerpt that recalls Dr. Benjamin Spock's The Common Sense Book of Baby and Child Care.
Annotations to other volumes: 1950–1952 · 1953–1954 · 1955–1956 · 1957–1958 · 1959–1960 · 1961–1962 · 1963–1964 · 1965–1966 · 1967–1968 · 1969–1970 · 1971–1972 · 1973–1974 · 1975–1976 · 1977–1978 · 1979–1980 · 1981–1982 · 1983–1984 · 1985–1986 · 1987–1988 · 1989–1990 · 1991–1992 · 1993–1994 · 1995–1996 · 1997–1998 · 1999–2000 · Comics and Stories
# Annotations of The Complete Peanuts/1959 to 1960

Annotations to The Complete Peanuts: 1959 to 1960 by Charles M. Schulz (Fantagraphics Books, 2006. ISBN 1560976713
Annotations to other volumes: 1950–1952 · 1953–1954 · 1955–1956 · 1957–1958 · 1959–1960 · 1961–1962 · 1963–1964 · 1965–1966 · 1967–1968 · 1969–1970 · 1971–1972 · 1973–1974 · 1975–1976 · 1977–1978 · 1979–1980 · 1981–1982 · 1983–1984 · 1985–1986 · 1987–1988 · 1989–1990 · 1991–1992 · 1993–1994 · 1995–1996 · 1997–1998 · 1999–2000 · Comics and Stories
# Chess Opening Theory/1. e4/1...e5/2. Nf3/2...Nc6/3. Bb5/3...f5/4. Nc3/4...fxe4/5. Nxe4/5...d5/6. Nxe5/6...dxe4/7. Nxc6/7...Qg5/8. Qe2/8...Nf6

| | a | b | c | d | e | f | g | h | |
| 8 | | | | | | | | | 8 |
| 7 | | | | | | | | | 7 |
| 6 | | | | | | | | | 6 |
| 5 | | | | | | | | | 5 |
| 4 | | | | | | | | | 4 |
| 3 | | | | | | | | | 3 |
| 2 | | | | | | | | | 2 |
| 1 | | | | | | | | | 1 |
| | a | b | c | d | e | f | g | h | |
Now Black's attack against g2 is a real one. Defending g2 with moves like 9.0-0 or 9.Rg1 is too slow; Black will have time to execute her secondary threat of ...a6 and ...Bd7. The clever 9. f4 solves this problem by defending g2 with gain of tempo, while threatening to give the knight a beautiful square on e5 to retreat to, at the cost of restoring material equality (9...Qxf4 is the main reply).
9. Ne5+ c6 10.f4 as played by Gyula Sax is just the same moves in a different order.
But there is an alternative in the controversial 9. Nxa7+!? as played by Peter Svidler. It has a very positive score for White, but from a very small sample size. If you can't see what a brilliant move 9.Nxa7+ is, it's probably because the Big 9.f4 industry has hired stooges to infiltrate our message boards and talk it down Magnus Carlsen can't see what a brilliant move 9.Nxa7+ is either.
# Chess Opening Theory/1. e4/1...e5/2. Nf3/2...Nc6/3. Bb5/3...f5/4. Nc3/4...fxe4/5. Nxe4/5...d5/6. Nxe5/6...dxe4/7. Nxc6/7...Qg5/8. Qe2/8...Nf6/9. Nxa7/9...Bd7/10. Bxd7

| | a | b | c | d | e | f | g | h | |
| 8 | | | | | | | | | 8 |
| 7 | | | | | | | | | 7 |
| 6 | | | | | | | | | 6 |
| 5 | | | | | | | | | 5 |
| 4 | | | | | | | | | 4 |
| 3 | | | | | | | | | 3 |
| 2 | | | | | | | | | 2 |
| 1 | | | | | | | | | 1 |
| | a | b | c | d | e | f | g | h | |
10...Nxd7 preserves castling rights for Black. Thanks to the precarious position of the a7-knight, it doesn't matter that it unprotects e4. The alternative 10...Kxd7? would allow the exchange of queens with 11.Qb5+ and the knight is saved.
# Chess Opening Theory/1. e4/1...e5/2. Nf3/2...Nc6/3. Bb5/3...f5/4. Nc3/4...fxe4/5. Nxe4/5...d5/6. Nxe5/6...dxe4/7. Nxc6/7...Qg5/8. Qe2/8...Nf6/9. Nxa7/9...Bd7/10. Bxd7/10...Nxd7/11. f4

| | a | b | c | d | e | f | g | h | |
| 8 | | | | | | | | | 8 |
| 7 | | | | | | | | | 7 |
| 6 | | | | | | | | | 6 |
| 5 | | | | | | | | | 5 |
| 4 | | | | | | | | | 4 |
| 3 | | | | | | | | | 3 |
| 2 | | | | | | | | | 2 |
| 1 | | | | | | | | | 1 |
| | a | b | c | d | e | f | g | h | |
Black's queen is attacked by an unprotected pawn. There are two plausible queen moves:
* 11...Qxf4 accepts the gambited f-pawn, which then allows White to solve most of her problems with the developing move 12.d4 before the a7-knight needs to be extracted to b5. White remains a pawn up and although Black can point to a passed pawn on e4, it's isolated and immobile.
* 11...Qc5 attempts to imbalance the position a little by grabbing the c2-pawn instead of the f4-pawn, thus isolating White's d-pawn. Sadly, 12.Nb5 Qxc2 13.d4! is still possible, and with 13...Qc6 not sufficing to defend the e-pawn because of 14.d5 (14...Qxd5?? 15.Nc7+) the queens will have to come off and White is a clear pawn up again.
Those two lines are Exhibits A and B for the prosecution's case that 9.Nxa7+ busts the whole Classical (7...Qg5) Schliemann Defence.
Other moves:
* 11...Qf5 was tried a bunch of times between 2011 and 2013, with no success whatsoever. White calmly retreats with 12.Nb5 and then has pawn majorities on both sides of the board. 12...O-O-O 13.a4 gets the queenside one rolling.
* Similarly 11...Qh4+. It's not clear how Black benefits from provoking g3 before retreating the queen to e7.
* 11...Qa5 was suggested on the ChessPublishing.com message board, but it's completely refuted by Solodovnichenko's 12.Nb5 Bc5 13.b4! Bxb4 14.Rb1 O-O-O 15.Na7+! Qxa7 16.Rxb4 when White's attacking chances are as great as Black's.
# Chess Opening Theory/1. e4/1...e5/2. Nf3/2...Nc6/3. Bb5/3...f5/4. Nc3/4...fxe4/5. Nxe4/5...d5/6. Nxe5/6...dxe4/7. Nxc6/7...Qd5/8. c4/8...Qd6/9. Qh5

| | a | b | c | d | e | f | g | h | |
| 8 | | | | | | | | | 8 |
| 7 | | | | | | | | | 7 |
| 6 | | | | | | | | | 6 |
| 5 | | | | | | | | | 5 |
| 4 | | | | | | | | | 4 |
| 3 | | | | | | | | | 3 |
| 2 | | | | | | | | | 2 |
| 1 | | | | | | | | | 1 |
| | a | b | c | d | e | f | g | h | |
9...g6 is the only safe move to block the check, because:
* 9...Qg6?? 10.Ne5+ wins the queen directly, and
* 9...Kd7?? 10.Qf7+ and the queen has to be shipped overboard with 10...Qe7, as either 10...Be7 or 10...Ne7 allow the pretty double check 11.Nb8+ followed by mate on e8.