OpenLLM-France/wikimedia huggingface dataset:
# Ada Programming/Libraries/Ada.Strings.Wide Wide Unbounded.Wide Wide Hash

This language feature is only available from Ada 2005 on.
Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Hash is a unit of the Predefined Language Environment since Ada 2005.

## See also
### Wikibook

* Ada Programming/Libraries/Ada

### External examples

* Search for examples of Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Hash in: Rosetta Code, GitHub (gists), any Alire crate or this Wikibook.
* Search for posts related to Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Hash in: Stack Overflow, comp.lang.ada or any Ada related page.

### Ada Reference Manual
#### Ada 2005

* A.4.8: Wide_Wide_String Handling

#### Ada 2012

* A.4.8: Wide_Wide_String Handling
# Ada Programming/Libraries/Ada.Synchronous Task Control.EDF

This language feature has been introduced in Ada 2012.
Ada.Synchronous_Task_Control.EDF is a unit of the Predefined Language Environment since Ada 2012.

## See also
### Wikibook

* Ada Programming/Libraries/Ada
* Ada Programming/Libraries/Ada.Synchronous_Task_Control

### External examples

* Search for examples of Ada.Synchronous_Task_Control.EDF in: Rosetta Code, GitHub (gists), any Alire crate or this Wikibook.
* Search for posts related to Ada.Synchronous_Task_Control.EDF in: Stack Overflow, comp.lang.ada or any Ada related page.

### Ada Reference Manual
#### Ada 2012

* D.10: Synchronous Task Control

### Open-Source Implementations

FSF GNAT
* Specification: a-stcoed.ads
drake
* Specification: tasking/a-stcoed.ads
* Body: tasking/a-stcoed.adb
# Ada Programming/Libraries/Ada.Strings.Wide Wide Unbounded

This language feature is only available from Ada 2005 on.
Ada.Strings.Wide_Wide_Unbounded is a unit of the Predefined Language Environment since Ada 2005.

## See also
### Wikibook

* Ada Programming/Libraries/Ada
* Ada Programming/Strings

### External examples

* Search for examples of Ada.Strings.Wide_Wide_Unbounded in: Rosetta Code, GitHub (gists), any Alire crate or this Wikibook.
* Search for posts related to Ada.Strings.Wide_Wide_Unbounded in: Stack Overflow, comp.lang.ada or any Ada related page.

### Ada Reference Manual
#### Ada 2005

* A.4.8: Wide_Wide_String Handling

#### Ada 2012

* A.4.8: Wide_Wide_String Handling

### Open-Source Implementations

FSF GNAT
* Specification: a-stzunb.ads
* Body: a-stzunb.adb
drake
* Specification: strings/a-stzunb.ads
# Ada Programming/Libraries/Ada.Synchronous Task Control

This language feature is available from Ada 95 on.
Ada.Synchronous_Task_Control is a unit of the Predefined Language Environment since Ada 95.

## See also
### Wikibook

* Ada Programming/Libraries/Ada

### External examples

* Search for examples of Ada.Synchronous_Task_Control in: Rosetta Code, GitHub (gists), any Alire crate or this Wikibook.
* Search for posts related to Ada.Synchronous_Task_Control in: Stack Overflow, comp.lang.ada or any Ada related page.

### Ada Reference Manual
#### Ada 95

* D.10: Synchronous Task Control

#### Ada 2005

* D.10: Synchronous Task Control

#### Ada 2012

* D.10: Synchronous Task Control

### Open-Source Implementations

FSF GNAT
* Specification: a-sytaco.ads
* Body: a-sytaco.adb
drake
* Specification: tasking/a-sytaco.ads
* Body: tasking/a-sytaco.adb
# Ada Programming/Libraries/Ada.Synchronous Barriers

This language feature has been introduced in Ada 2012.
Ada.Synchronous_Barriers is a unit of the Predefined Language Environment since Ada 2012.

## See also
### Wikibook

* Ada Programming/Libraries/Ada

### External examples

* Search for examples of Ada.Synchronous_Barriers in: Rosetta Code, GitHub (gists), any Alire crate or this Wikibook.
* Search for posts related to Ada.Synchronous_Barriers in: Stack Overflow, comp.lang.ada or any Ada related page.

### Ada Reference Manual
#### Ada 2012

* D.10.1: Synchronous Barriers

### Open-Source Implementations

FSF GNAT
* Specification: a-synbar.ads
* Body: a-synbar.adb
drake
* Specification: tasking/a-synbar.ads
* Body: tasking/a-synbar.adb
# Ada Programming/Libraries/Ada.Task Attributes

This language feature is available from Ada 95 on.
Ada.Task_Attributes is a unit of the Predefined Language Environment since Ada 95.

## See also
### Wikibook

* Ada Programming/Libraries/Ada

### External examples

* Search for examples of Ada.Task_Attributes in: Rosetta Code, GitHub (gists), any Alire crate or this Wikibook.
* Search for posts related to Ada.Task_Attributes in: Stack Overflow, comp.lang.ada or any Ada related page.

### Ada Reference Manual
#### Ada 95

* C.7.2: The Package Task_Attributes

#### Ada 2005

* C.7.2: The Package Task_Attributes

#### Ada 2012

* C.7.2: The Package Task_Attributes

### Open-Source Implementations

FSF GNAT
* Specification: a-tasatt.ads
* Body: a-tasatt.adb
drake
* Specification: tasking/a-tasatt.ads
* Body: tasking/a-tasatt.adb
# Artificial Neural Networks/Competitive Learning
## Competitive Learning

Competitive learning is a rule based on the idea that only one neuron from a given iteration in a given layer will fire at a time. Weights are adjusted such that only one neuron in a layer, for instance the output layer, fires. Competitive learning is useful for classification of input patterns into a discrete set of output classes. The “winner” of each iteration, element i$^*$ , is the element whose total weighted input is the largest. Using this notation, one example of a competitive learning rule can be defined mathematically as:
    $w_{ij}[n+1]=w_{ij}[n]+\Delta w_{ij}[n]$
    $\Delta w_{ij}=\left\{{\begin{matrix}\eta (x_{i}-w_{ij})&{\mbox{ if }}i=j\\0&{\mbox{ otherwise}}\end{matrix}}\right.$

## Linear Vector Quantization

In a learning vector quantization (LVQ) machine, the input values are compared to the weight vector of each neuron. Neurons who most closely match the input are known as the best match unit (BMU) of the system. The weight vector of the BMU and those of nearby neurons are adjusted to be closer to the input vector by a certain step size. Neurons become trained to be individual feature detectors, and a combination of feature detectors can be used to identify large classes of features from the input space. The LVQ algorithm is a simplified precursor to more advanced learning algorithms, such as the self-organizing map. LVQ training is a type of competitive learning rule.
# Artificial Neural Networks/Control
## Control Systems

Artificial neural networks have been employed for use in control systems because of their ability to identify patterns, and to match arbitrary non-linear response curves.

## See Also

* Control Systems
# Artificial Neural Networks/Feature Detection

Feature detection or “association” networks are trained using non-noisy data, in order to recognize similar patterns in noisy or incomplete data. Correctly detecting features in the presence of noise can be used as an important tool for noise reduction and filtering.
For example, neural nets have been used successfully in a number of medical applications for detection of disease. One particular example is the use of ANN to detect breast cancer in mammography images.
# Artificial Neural Networks/Clustering

Similar to pattern matching, clustering is the ability to associate similar input patterns together, based on a measurement of their similarity or dissimilarity. An example of a clustering problem is the Netflix Prize, a competition to improve the Netflix recommendation system. Competitors are attempting to produce software systems that can suggest movies based on movies the viewer has already rated. Essentially, clustering movies based on the predicted like or dislike of the viewer.
# Artificial Neural Networks/Competitive Models
## Competitive Networks

Competitive networks are networks where neurons compete with one another. The weight vector is treated as a "prototype", and is matched against the input vector. The "winner" of each training session is the neuron whose weight vector is most similar to the input vector.
An example of a competitive network is shown below.
# Artificial Neural Networks/Curve Fitting
## Curve Fitting

Curve-fitting problems represent an attempt for the neural network to identify and approximate an arbitrary input-output relation. Once the relation has been modeled to the necessary accuracy by the network, it can be used for a variety of tasks, such as series prediction, function approximation, and function optimization.

## Function Approximation

Function approximation or modeling is the act of training a neural network using a given set of input-output data (typically through supervised learning) in order to deduce the relationship between the input and the output. After training, such an ANN can be used as a black box with an input-output characteristic approximately equal to the relationship of the training problems. Because of the modular and non-linear nature of artificial neural nets, they are considered to be able to approximate any arbitrary function to an arbitrary degree of accuracy. More accuracy in this case represents a tradeoff with system complexity, and the ability to generalize.
# Artificial Neural Networks/Echo State Networks

Echo State Networks, part of the Reservoir Computing paradigm, are an efficient type of Recurrent Neural Network where the recurrent neurons only have a partial connectivity between themselves. Such networks where only a subset of all possible connections is made are known as sparsely connected networks. In Echo State Networks, only the weights from the hidden layer to the output layer may be altered during training.
Echo State Networks are useful for matching and reproducing specific input patterns. Since the only tap weights modified during training are the output layer tap weights, training is typically quick and computationally efficient in comparison to other multi-layer networks that are not sparsely connected.
# Artificial Neural Networks/Convolutional Neural Networks
## Convolutional Neural Networks

Convolutional Neural Networks were first introduced in the approach done by LeCun et al. (1998) in document understanding recognition system. The CNN concept was neurobiologically inspired and motivated by animal visual cortex, namely the cat visual processing system.

## References

* LeCun, Y., Bottou, L., Bengio, Y., and Haffner, P. (1998). "Gradient-Based Learning Applied to Document Recognition". Proceedings of the IEEE, 86(11), pp. 2278–2324.
# Ada Programming/Delimiters
## Single character delimiters

    ampersand (operator)
    apostrophe, tick
    left parenthesis
    right parenthesis
    asterisk, multiply (operator)
    plus sign (operator)
    comma
    hyphen, minus (operator)
    full stop, point, dot
    solidus, divide (operator)
    colon
    semicolon
    less than sign (operator)
    equal sign (operator)
    greater than sign (operator)
    vertical line

## Compound character delimiters

    arrow
    double dot
    double star, exponentiate (operator)
    assignment
    inequality (operator)
    greater than or equal to (operator)
    less than or equal to (operator)
    left label bracket
    right label bracket
    box

## Others

The following ones are special characters but not delimiters.
    quotation mark, used for string literals.
    number sign, used in based numeric literals.
The following special characters are unused in Ada code - they are illegal except within string literals and comments (they are used in the Reference Manual Backus-Naur syntax definition of Ada):
    left square bracket
    right square bracket
    left curly bracket
    right curly bracket

## See also
### Wikibook

* Ada Programming

### Ada 95 Reference Manual

* 2.1: Character Set
* 2.2: Lexical Elements, Separators, and Delimiters

### Ada 2005 Reference Manual

* 2.1: Character Set
* 2.2: Lexical Elements, Separators, and Delimiters
# Ada Programming/Attrobutes/'Enum Rep
## Description

Return the number representing a given enumeration literal.
# Ada Programming/Coding standards
## Introduction

Each project should follow a specific coding standard to ease readability and maintenance of the source code, and reduce the insertion of errors. Depending on the requirements of the project, a set of guidelines can help to achieve the desired level of performance, portability, code complexity...
There are many ASIS tools that can be used to check automatically the adherence of Ada source code to the guidelines.

## Tools

* AdaControl (Rules)
* gnatcheck
* GNAT Pretty-Printer
* The GNAT Metric Tool gnatmetric

## Coding guidelines

* Ada Quality & Style Guide: Guidelines for Professional Programmers
* ISO/IEC TR 15942:2000, Guide for the use of the Ada programming language in high integrity systems, First edition (2000-03-01). ISO Freely Available Standards
* Leake, Stephen (2013-10-18). "Goddard Dynamic Simulator — Ada Coding Standard" (PDF). Archived from the original (PDF) on 2014-04-14. Retrieved 2015-08-07.
* ESA BSSC (1998). Ada Coding Standard (PDF) (BSSC(98)3 Issue 1 ed.). Archived from the original (PDF) on 2024. Retrieved 2015-08-06.
* "GNAT Coding Style: A Guide for GNAT Developers". GCC online documentation. Free Software Foundation. Retrieved 2009-01-19. (PDF)

## See also
### Other wikibooks

* Ada Style Guide

### Wikibook

* Ada Programming

### Ada Quality and Style Guide

* Chapter 1: Introduction

## External links

* Introduction to Coding Standards
# Ada Programming/Delimiters/&
## As operator
### Concatenating arrays

Any array type (including fixed Strings) can be concatenated using the & operator. You can also append a single element to an array.

## Common non-standard operations
### Concatenating strings

The & operator is also defined for Bounded_String and Unbounded_String.

## See also
### Wikibook

* Ada Programming/Delimiters
* Ada Programming/Operators

### Ada 95 Reference Manual

* 4.4 Expressions (Annotated)
* 4.5.3 Binary Adding Operators (Annotated)
* A.4.4 Bounded-Length String Handling (Annotated)
* A.4.5 Unbounded-Length String Handling (Annotated)

### Ada 2005 Reference Manual

* 4.4 Expressions (Annotated)
* 4.5.3 Binary Adding Operators (Annotated)
* A.4.4 Bounded-Length String Handling (Annotated)
* A.4.5 Unbounded-Length String Handling (Annotated)
Ada Operators :
| and | and then | > | + | abs | & |
| or | or else | >= | - | mod | |
| xor | = | < | * | rem | in |
| not | /= | <= | ** | / | not in |
# Annotated Republic of China Laws/Copyright Act/Article 98-1

| ←Article 98 | Copyright Act Republic of China (Taiwan) Law Article 98-1 | Article 99→ |

## Newly adopted and promulgated on 2003-07-09
### Article 98-1

    An article used in the commission of an offense or acquired through the commission of an offense set forth in paragraph 3, Article 91, or paragraph 3, Article 91bis, may be confiscated by the judiciary police if the offender escapes and is therefore unidentifiable.
    The article confiscated pursuant to the preceding paragraph shall be destroyed, provided that where the confiscated article is money, that money shall be submitted to the national treasury. The relevant provisions of the Act for the Maintenance of Social Order shall apply mutatis mutandis to the procedures of the aforementioned destruction and submission.

## Annotated by Wikibooks

* ↑ "Copyright Act". Laws & Regulations Database of The Republic of China. Ministry of Justice (Taiwan). 2003-07-09. Retrieved 2016-11-23.
# Annotated Republic of China Laws/Criminal Code of the Armed Forces
## History

From http://law.moj.gov.tw/ENG/LawClass/LawHistory.aspx?PCode=F0120001 :
* On September 25, 1929, National Government regulated 119th clause .
* On July 2, 1937, National Government modified and notified 2 th ,112 th -122 th Clauses.
* On April 21, 1967, President (88) (一) number 8800084040 orders to modified and notified Chapter 11 and 87th clause.
* On September 28, 2001, President (90) (一) number 9000195310 orders modified and notified 79th clause; it was implemented from October 2, 2001 on.
* Amended and promulgated on January 10th, 2007.
* Amended and promulgated on December 12th, 2007
* Amended and promulgated on January 2th, 2008.
* The amended Article 54 was promulgated by the Presidential Decree hua-zong-yi-yi-zi No. 10000263901 on November 30, 2011.
* Amended and promulgated on May. 22, 2013.

## Wikibooks annotation

* ↑ It should be corrected to 1999.
* ↑ This complete amendment is in a separate page, and later partial amendments are in other separate pages per articles.
* ↑ Amended Article 54 of this Code was also promulgated on May 22, 2013.
* ↑ Amended Article 44 of this Code was also promulgated on 15 January 2014.
# Annotated Republic of China Laws/Criminal Code of the Armed Forces/Article 66

| ←Article 54 to Article 65 | Criminal Code of the Armed Forces Republic of China Law Article 66 | Article 67 to Article 72→ |

## Promulgated full amendment on 2001-09-28

Effective on 2001-10-02

### Article 66

    Any person who makes any false military order, document, or other statement knowing it to be false shall be punished by imprisonment for not more than 5 years; if the commission of preceding crimes causes the injury to military interest, the offender shall be punished by imprisonment for life or for not less than seven years.
    Any person who, during wartime, commits an offense specified in the forepart of preceding paragraph shall be punished by death, imprisonment for life, or for not less than ten years; if the commission of preceding crimes causes the injury to military interest, the offender shall be punished by death.
    Any person who negligently commits an offense specified in the forepart of preceding paragraph shall be punished by imprisonment for not less than three and not more than ten years.
    Any person who unfaithfully or fails to transmit or report any military order, document, or other statement shall be punished in accordance with the provisions of preceding paragraphs.

## Promulgated amendment on 2007-01-10
### Article 66

    Any person who makes any false military order, document, or other statement knowing it to be false shall be punished by imprisonment for not more than 5 years; if the commission of preceding crimes causes the injury to military interest, the offender shall be punished by imprisonment for life or for not less than seven years.
    Any person who, during wartime, commits an offense specified in the forepart of preceding paragraph shall be punished by death, imprisonment for life, or for not less than ten years; if the commission of preceding crimes causes the injury to military interest, the offender shall be punished by death or imprisonment for life.
    Any person who negligently commits an offense specified in the forepart of preceding paragraph shall be punished by imprisonment for not less than three and not more than ten years.
    Any person who unfaithfully or fails to transmit or report any military order, document, or other statement shall be punished in accordance with the provisions of preceding paragraphs.
* ↑ Reversed-derived from 2007 text.
* ↑ "Criminal Code of the Armed Forces: Article 66". Laws & Regulations Database of The Republic of China. Ministry of Justice (Taiwan). 2017-04-19. Retrieved 2019-11-21.
# Annotated Republic of China Laws/Criminal Code of the Armed Forces/Article 72

| ←Article 66 to Article 71 | Criminal Code of the Armed Forces Republic of China Law Article 72 | Article 73 to Article 75→ |

## Promulgated full amendment on 2001-09-28

Effective on 2001-10-02

### Article 54

    A person who fabricates a military rumor with intent and intends of disperse the public shall be punished with imprisonment for not more than three years, detention, or a fine of not more than 300,000 yuan.

## Promulgated amendment on 2019-11-20
### Article 72

(awaiting governmental translation)
* ↑ "Criminal Code of the Armed Forces: Article 72". Laws & Regulations Database of The Republic of China. Ministry of Justice (Taiwan). 2017-04-19. Retrieved 2019-11-21.
# Annotated Republic of China Laws/Criminal Code of the Armed Forces/Article 27

| ←Article 1 to Article 26 | Criminal Code of the Armed Forces Republic of China Law Article 27 | Article 28 to Article 44→ |

## Promulgated full amendment on 2001-09-28

Effective on 2001-10-02.

### Article 27

    Any person who disobeys any operations order before or in the presence of the enemy shall be punished by death.
    An attempt to commit the offense specified in the preceding paragraph is punishable.

## Promulgated amendment on 2007-01-10
### Article 27

    Any person who disobeys any operations order before or in the presence of the enemy shall be punished by death or imprisonment for life.
    An attempt to commit the offense specified in the preceding paragraph is punishable.
* ↑ Reverse-derived from 2007 text.
* ↑ "Criminal Code of the Armed Forces: Article 27". Laws & Regulations Database of The Republic of China. Ministry of Justice (Taiwan). 2017-04-19. Retrieved 2019-11-21.
# Annotated Republic of China Laws/Criminal Code of the Armed Forces/Article 75

| ←Article 72 to Article 74 | Criminal Code of the Armed Forces Republic of China Law Article 75 | Article 76 to Article 79→ |

## Promulgated full amendment on 2001-09-28

Effective on 2001-10-02

### Article 75

    A person who gambles in the area of military base, vessel, structures or other military places shall be punished with imprisonment for not more than six months, detention, or a fine not more than 50,000 yuan may be imposed unless the item which he gambles is the one to provide temporary entertainment.
    A commander who harbors a subordinate who gambles or assembles persons to gamble shall be punished with imprisonment for not more than five years.
    Gambling apparatus at the site found at the gambling table or place for exchange of gambling tokens shall be confiscated whether or not it belongs to the offender.

## Promulgated amendment on 2017-04-19
### Article 75

    A person who gambles in the area of military base, vessel, structures or other military places shall be punished with imprisonment for not more than six months, detention, or a fine not more than 50,000 yuan may be imposed unless the item which he gambles is the one to provide temporary entertainment.
    A commander who harbors a subordinate who gambles or assembles persons to gamble shall be punished with imprisonment for not more than five years.
    Gambling apparatus at the site found at the gambling table or place for exchange of gambling tokens shall be confiscated whether or not it belongs to the offender.
* ↑ "Criminal Code of the Armed Forces: Article 75". Laws & Regulations Database of The Republic of China. Ministry of Justice (Taiwan). 2017-04-19. Retrieved 2019-11-21.
* ↑ Chinese text got minor change from "犯人" to "犯罪行為人" both meaning "offender". Thus the governmental translation in 2001 remains unchanged.
# Annotated Republic of China Laws/Copyright Act/Article 99

| ←Article 98-1 | Copyright Act Republic of China (Taiwan) Law Article 99 | Article 100→ |

## Promulgated full amendment on 1992-06-10 and 1998-01-21
### Article 99

    Upon motion by the injured party or another party having the right to file a complaint, an infringer as set out in Articles 91 through 95 may be ordered to publish all or part of the court judgment in a newspaper and bear the costs thereof.

## Promulgated deletion on 2006-05-30 effective on 2006-07-01
### Article 99

    Upon motion by the injured party or another party having the right to file a complaint, an infringer as set out in Articles 91 through Articles 93, Articles 95 may be ordered to publish all or part of the court judgment in a newspaper and bear the costs thereof.

## Annotated by Wikibooks

* ↑ "Copyright Act". Laws & Regulations Database of The Republic of China. Ministry of Justice (Taiwan). 2003-07-09. Retrieved 2016-11-23.
* ↑ "Copyright Act: Article 99". Laws & Regulations Database of The Republic of China. Ministry of Justice (Taiwan). 2003-07-09. Retrieved 2016-11-23.
# Anarchist Theories and Practices/Appendix 1: Glossary
## Praxis

N.
* Practice, as distinguished from theory
** "Both theory and praxis are crucial to an intelligent political philosophy"
# Anarchist Theories and Practices/Author List

This page is to list those who contribute to the book, to give credit where credit is due to people who give time and thought to this project.