text:
Gene expression programming

In computer programming, gene expression programming (GEP) is an evolutionary algorithm that creates computer programs or models. These computer programs are complex tree structures that learn and adapt by changing their sizes, shapes, and composition, much like a living organism. And like living organisms, the computer programs of GEP are also encoded in simple linear chromosomes of fixed length. Thus, GEP is a genotype–phenotype system, benefiting from a simple genome to keep and transmit the genetic information and a complex phenotype to explore the environment and adapt to it.

Background
Evolutionary algorithms use populations of individuals, select individuals according to fitness, and introduce genetic variation using one or more genetic operators. Their use in artificial computational systems dates back to the 1950s where they were used to solve optimization problems (e.g. Box 1957 and Friedman 1959 ). But it was with the introduction of evolution strategies by Rechenberg in 1965 that evolutionary algorithms gained popularity. A good overview text on evolutionary algorithms is the book "An Introduction to Genetic Algorithms" by Mitchell (1996).

Gene expression programming belongs to the family of evolutionary algorithms and is closely related to genetic algorithms and genetic programming. From genetic algorithms it inherited the linear chromosomes of fixed length; and from genetic programming it inherited the expressive parse trees of varied sizes and shapes.

In gene expression programming the linear chromosomes work as the genotype and the parse trees as the phenotype, creating a genotype/phenotype system. This genotype/phenotype system is multigenic, thus encoding multiple parse trees in each chromosome. This means that the computer programs created by GEP are composed of multiple parse trees. Because these parse trees are the result of gene expression, in GEP they are called expression trees. Masood Nekoei, et al. utilized this expression programming style in ABC optimization to conduct ABCEP as a method that outperformed other evolutionary algorithms.ABCEP

Encoding: the genotype
The genome of gene expression programming consists of a linear, symbolic string or chromosome of fixed length composed of one or more genes of equal size. These genes, despite their fixed length, code for expression trees of different sizes and shapes. An example of a chromosome with two genes, each of size 9, is the string (position zero indicates the start of each gene):

where “L” represents the natural logarithm function and “a”, “b”, “c”, and “d” represent the variables and constants used in a problem.

Expression trees: the phenotype
As shown above, the genes of gene expression programming have all the same size. However, these fixed length strings code for expression trees of different sizes. This means that the size of the coding regions varies from gene to gene, allowing for adaptation and evolution to occur smoothly.

For example, the mathematical expression:
 * $$\sqrt{(a-b)(c+d)} \, $$

can also be represented as an expression tree:

where "Q” represents the square root function.

This kind of expression tree consists of the phenotypic expression of GEP genes, whereas the genes are linear strings encoding these complex structures. For this particular example, the linear string corresponds to:

which is the straightforward reading of the expression tree from top to bottom and from left to right. These linear strings are called k-expressions (from Karva notation).

Going from k-expressions to expression trees is also very simple. For example, the following k-expression:

is composed of two different terminals (the variables “a” and “b”), two different functions of two arguments (“*” and “+”), and a function of one argument (“Q”). Its expression gives:

K-expressions and genes
The k-expressions of gene expression programming correspond to the region of genes that gets expressed. This means that there might be sequences in the genes that are not expressed, which is indeed true for most genes. The reason for these noncoding regions is to provide a buffer of terminals so that all k-expressions encoded in GEP genes correspond always to valid programs or expressions.

The genes of gene expression programming are therefore composed of two different domains – a head and a tail – each with different properties and functions. The head is used mainly to encode the functions and variables chosen to solve the problem at hand, whereas the tail, while also used to encode the variables, provides essentially a reservoir of terminals to ensure that all programs are error-free.

For GEP genes the length of the tail is given by the formula:

 * $$t = h(n_\max-1)+1$$

where h is the head's length and nmax is maximum arity. For example, for a gene created using the set of functions $F = \{Q, +, −, ∗, /\}$ and the set of terminals T = {a, b}, nmax = 2. And if we choose a head length of 15, then t = 15 (2–1) + 1 = 16, which gives a gene length g of 15 + 16 = 31. The randomly generated string below is an example of one such gene:

It encodes the expression tree:

which, in this case, only uses 8 of the 31 elements that constitute the gene.

It's not hard to see that, despite their fixed length, each gene has the potential to code for expression trees of different sizes and shapes, with the simplest composed of only one node (when the first element of a gene is a terminal) and the largest composed of as many nodes as there are elements in the gene (when all the elements in the head are functions with maximum arity).

It's also not hard to see that it is trivial to implement all kinds of genetic modification (mutation, inversion, insertion, recombination, and so on) with the guarantee that all resulting offspring encode correct, error-free programs.

Multigenic chromosomes
The chromosomes of gene expression programming are usually composed of more than one gene of equal length. Each gene codes for a sub-expression tree (sub-ET) or sub-program. Then the sub-ETs can interact with one another in different ways, forming a more complex program. The figure shows an example of a program composed of three sub-ETs.

In the final program the sub-ETs could be linked by addition or some other function, as there are no restrictions to the kind of linking function one might choose. Some examples of more complex linkers include taking the average, the median, the midrange, thresholding their sum to make a binomial classification, applying the sigmoid function to compute a probability, and so on. These linking functions are usually chosen a priori for each problem, but they can also be evolved elegantly and efficiently by the cellular system of gene expression programming.

Cells and code reuse
In gene expression programming, homeotic genes control the interactions of the different sub-ETs or modules of the main program. The expression of such genes results in different main programs or cells, that is, they determine which genes are expressed in each cell and how the sub-ETs of each cell interact with one another. In other words, homeotic genes determine which sub-ETs are called upon and how often in which main program or cell and what kind of connections they establish with one another.

Homeotic genes and the cellular system
Homeotic genes have exactly the same kind of structural organization as normal genes and they are built using an identical process. They also contain a head domain and a tail domain, with the difference that the heads contain now linking functions and a special kind of terminals – genic terminals – that represent the normal genes. The expression of the normal genes results as usual in different sub-ETs, which in the cellular system are called ADFs (automatically defined functions). As for the tails, they contain only genic terminals, that is, derived features generated on the fly by the algorithm.

For example, the chromosome in the figure has three normal genes and one homeotic gene and encodes a main program that invokes three different functions a total of four times, linking them in a particular way.

From this example it is clear that the cellular system not only allows the unconstrained evolution of linking functions but also code reuse. And it shouldn't be hard to implement recursion in this system.

Multiple main programs and multicellular systems
Multicellular systems are composed of more than one homeotic gene. Each homeotic gene in this system puts together a different combination of sub-expression trees or ADFs, creating multiple cells or main programs.

For example, the program shown in the figure was created using a cellular system with two cells and three normal genes.

The applications of these multicellular systems are multiple and varied and, like the multigenic systems, they can be used both in problems with just one output and in problems with multiple outputs.

Other levels of complexity
The head/tail domain of GEP genes (both normal and homeotic) is the basic building block of all GEP algorithms. However, gene expression programming also explores other chromosomal organizations that are more complex than the head/tail structure. Essentially these complex structures consist of functional units or genes with a basic head/tail domain plus one or more extra domains. These extra domains usually encode random numerical constants that the algorithm relentlessly fine-tunes in order to find a good solution. For instance, these numerical constants may be the weights or factors in a function approximation problem (see the GEP-RNC algorithm below); they may be the weights and thresholds of a neural network (see the GEP-NN algorithm below); the numerical constants needed for the design of decision trees (see the GEP-DT algorithm below); the weights needed for polynomial induction; or the random numerical constants used to discover the parameter values in a parameter optimization task.

The basic gene expression algorithm
The fundamental steps of the basic gene expression algorithm are listed below in pseudocode:
 * 1) 	Select function set;
 * 2) 	Select terminal set;
 * 3) 	Load dataset for fitness evaluation;
 * 4) 	Create chromosomes of initial population randomly;
 * 5) 	For each program in population:1. Express chromosome;

2. Execute program;

3. Evaluate fitness; The first four steps prepare all the ingredients that are needed for the iterative loop of the algorithm (steps 5 through 10). Of these preparative steps, the crucial one is the creation of the initial population, which is created randomly using the elements of the function and terminal sets.
 * 1) 	Verify stop condition;
 * 2) 	Select programs;
 * 3) 	Replicate selected programs to form the next population;
 * 4) 	Modify chromosomes using genetic operators;
 * 5) 	Go to step 5.

Populations of programs
Like all evolutionary algorithms, gene expression programming works with populations of individuals, which in this case are computer programs. Therefore, some kind of initial population must be created to get things started. Subsequent populations are descendants, via selection and genetic modification, of the initial population.

In the genotype/phenotype system of gene expression programming, it is only necessary to create the simple linear chromosomes of the individuals without worrying about the structural soundness of the programs they code for, as their expression always results in syntactically correct programs.

Fitness functions and the selection environment
Fitness functions and selection environments (called training datasets in machine learning) are the two facets of fitness and are therefore intricately connected. Indeed, the fitness of a program depends not only on the cost function used to measure its performance but also on the training data chosen to evaluate fitness

The selection environment or training data
The selection environment consists of the set of training records, which are also called fitness cases. These fitness cases could be a set of observations or measurements concerning some problem, and they form what is called the training dataset.

The quality of the training data is essential for the evolution of good solutions. A good training set should be representative of the problem at hand and also well-balanced, otherwise the algorithm might get stuck at some local optimum. In addition, it is also important to avoid using unnecessarily large datasets for training as this will slow things down unnecessarily. A good rule of thumb is to choose enough records for training to enable a good generalization in the validation data and leave the remaining records for validation and testing.

Fitness functions
Broadly speaking, there are essentially three different kinds of problems based on the kind of prediction being made: The first type of problem goes by the name of regression; the second is known as classification, with logistic regression as a special case where, besides the crisp classifications like "Yes" or "No", a probability is also attached to each outcome; and the last one is related to Boolean algebra and logic synthesis.
 * 1) 	Problems involving numeric (continuous) predictions;
 * 2) 	Problems involving categorical or nominal predictions, both binomial and multinomial;
 * 3) 	Problems involving binary or Boolean predictions.

Fitness functions for regression
In regression, the response or dependent variable is numeric (usually continuous) and therefore the output of a regression model is also continuous. So it's quite straightforward to evaluate the fitness of the evolving models by comparing the output of the model to the value of the response in the training data.

There are several basic fitness functions for evaluating model performance, with the most common being based on the error or residual between the model output and the actual value. Such functions include the mean squared error, root mean squared error, mean absolute error, relative squared error, root relative squared error, relative absolute error, and others.

All these standard measures offer a fine granularity or smoothness to the solution space and therefore work very well for most applications. But some problems might require a coarser evolution, such as determining if a prediction is within a certain interval, for instance less than 10% of the actual value. However, even if one is only interested in counting the hits (that is, a prediction that is within the chosen interval), making populations of models evolve based on just the number of hits each program scores is usually not very efficient due to the coarse granularity of the fitness landscape. Thus the solution usually involves combining these coarse measures with some kind of smooth function such as the standard error measures listed above.

Fitness functions based on the correlation coefficient and R-square are also very smooth. For regression problems, these functions work best by combining them with other measures because, by themselves, they only tend to measure correlation, not caring for the range of values of the model output. So by combining them with functions that work at approximating the range of the target values, they form very efficient fitness functions for finding models with good correlation and good fit between predicted and actual values.

Fitness functions for classification and logistic regression
The design of fitness functions for classification and logistic regression takes advantage of three different characteristics of classification models. The most obvious is just counting the hits, that is, if a record is classified correctly it is counted as a hit. This fitness function is very simple and works well for simple problems, but for more complex problems or datasets highly unbalanced it gives poor results.

One way to improve this type of hits-based fitness function consists of expanding the notion of correct and incorrect classifications. In a binary classification task, correct classifications can be 00 or 11. The "00" representation means that a negative case (represented by "0”) was correctly classified, whereas the "11" means that a positive case (represented by "1”) was correctly classified. Classifications of the type "00" are called true negatives (TN) and "11" true positives (TP).

There are also two types of incorrect classifications and they are represented by 01 and 10. They are called false positives (FP) when the actual value is 0 and the model predicts a 1; and false negatives (FN) when the target is 1 and the model predicts a 0. The counts of TP, TN, FP, and FN are usually kept on a table known as the confusion matrix.

So by counting the TP, TN, FP, and FN and further assigning different weights to these four types of classifications, it is possible to create smoother and therefore more efficient fitness functions. Some popular fitness functions based on the confusion matrix include sensitivity/specificity, recall/precision, F-measure, Jaccard similarity, Matthews correlation coefficient, and cost/gain matrix which combines the costs and gains assigned to the 4 different types of classifications.

These functions based on the confusion matrix are quite sophisticated and are adequate to solve most problems efficiently. But there is another dimension to classification models which is key to exploring more efficiently the solution space and therefore results in the discovery of better classifiers. This new dimension involves exploring the structure of the model itself, which includes not only the domain and range, but also the distribution of the model output and the classifier margin.

By exploring this other dimension of classification models and then combining the information about the model with the confusion matrix, it is possible to design very sophisticated fitness functions that allow the smooth exploration of the solution space. For instance, one can combine some measure based on the confusion matrix with the mean squared error evaluated between the raw model outputs and the actual values. Or combine the F-measure with the R-square evaluated for the raw model output and the target; or the cost/gain matrix with the correlation coefficient, and so on. More exotic fitness functions that explore model granularity include the area under the ROC curve and rank measure.

Also related to this new dimension of classification models, is the idea of assigning probabilities to the model output, which is what is done in logistic regression. Then it is also possible to use these probabilities and evaluate the mean squared error (or some other similar measure) between the probabilities and the actual values, then combine this with the confusion matrix to create very efficient fitness functions for logistic regression. Popular examples of fitness functions based on the probabilities include maximum likelihood estimation and hinge loss.

Fitness functions for Boolean problems
In logic there is no model structure (as defined above for classification and logistic regression) to explore: the domain and range of logical functions comprises only 0's and 1's or false and true. So, the fitness functions available for Boolean algebra can only be based on the hits or on the confusion matrix as explained in the section above.

Selection and elitism
Roulette-wheel selection is perhaps the most popular selection scheme used in evolutionary computation. It involves mapping the fitness of each program to a slice of the roulette wheel proportional to its fitness. Then the roulette is spun as many times as there are programs in the population in order to keep the population size constant. So, with roulette-wheel selection programs are selected both according to fitness and the luck of the draw, which means that some times the best traits might be lost. However, by combining roulette-wheel selection with the cloning of the best program of each generation, one guarantees that at least the very best traits are not lost. This technique of cloning the best-of-generation program is known as simple elitism and is used by most stochastic selection schemes.

Reproduction with modification
The reproduction of programs involves first the selection and then the reproduction of their genomes. Genome modification is not required for reproduction, but without it adaptation and evolution won't take place.

Replication and selection
The selection operator selects the programs for the replication operator to copy. Depending on the selection scheme, the number of copies one program originates may vary, with some programs getting copied more than once while others are copied just once or not at all. In addition, selection is usually set up so that the population size remains constant from one generation to another.

The replication of genomes in nature is very complex and it took scientists a long time to discover the DNA double helix and propose a mechanism for its replication. But the replication of strings is trivial in artificial evolutionary systems, where only an instruction to copy strings is required to pass all the information in the genome from generation to generation.

The replication of the selected programs is a fundamental piece of all artificial evolutionary systems, but for evolution to occur it needs to be implemented not with the usual precision of a copy instruction, but rather with a few errors thrown in. Indeed, genetic diversity is created with genetic operators such as mutation, recombination, transposition, inversion, and many others.

Mutation
In gene expression programming mutation is the most important genetic operator. It changes genomes by changing an element by another. The accumulation of many small changes over time can create great diversity.

In gene expression programming mutation is totally unconstrained, which means that in each gene domain any domain symbol can be replaced by another. For example, in the heads of genes any function can be replaced by a terminal or another function, regardless of the number of arguments in this new function; and a terminal can be replaced by a function or another terminal.

Recombination
Recombination usually involves two parent chromosomes to create two new chromosomes by combining different parts from the parent chromosomes. And as long as the parent chromosomes are aligned and the exchanged fragments are homologous (that is, occupy the same position in the chromosome), the new chromosomes created by recombination will always encode syntactically correct programs.

Different kinds of crossover are easily implemented either by changing the number of parents involved (there's no reason for choosing only two); the number of split points; or the way one chooses to exchange the fragments, for example, either randomly or in some orderly fashion. For example, gene recombination, which is a special case of recombination, can be done by exchanging homologous genes (genes that occupy the same position in the chromosome) or by exchanging genes chosen at random from any position in the chromosome.

Transposition
Transposition involves the introduction of an insertion sequence somewhere in a chromosome. In gene expression programming insertion sequences might appear anywhere in the chromosome, but they are only inserted in the heads of genes. This method guarantees that even insertion sequences from the tails result in error-free programs.

For transposition to work properly, it must preserve chromosome length and gene structure. So, in gene expression programming transposition can be implemented using two different methods: the first creates a shift at the insertion site, followed by a deletion at the end of the head; the second overwrites the local sequence at the target site and therefore is easier to implement. Both methods can be implemented to operate between chromosomes or within a chromosome or even within a single gene.

Inversion
Inversion is an interesting operator, especially powerful for combinatorial optimization. It consists of inverting a small sequence within a chromosome.

In gene expression programming it can be easily implemented in all gene domains and, in all cases, the offspring produced is always syntactically correct. For any gene domain, a sequence (ranging from at least two elements to as big as the domain itself) is chosen at random within that domain and then inverted.

Other genetic operators
Several other genetic operators exist and in gene expression programming, with its different genes and gene domains, the possibilities are endless. For example, genetic operators such as one-point recombination, two-point recombination, gene recombination, uniform recombination, gene transposition, root transposition, domain-specific mutation, domain-specific inversion, domain-specific transposition, and so on, are easily implemented and widely used.

The GEP-RNC algorithm
Numerical constants are essential elements of mathematical and statistical models and therefore it is important to allow their integration in the models designed by evolutionary algorithms.

Gene expression programming solves this problem very elegantly through the use of an extra gene domain – the Dc – for handling random numerical constants (RNC). By combining this domain with a special terminal placeholder for the RNCs, a richly expressive system can be created.

Structurally, the Dc comes after the tail, has a length equal to the size of the tail t, and is composed of the symbols used to represent the RNCs.

For example, below is shown a simple chromosome composed of only one gene a head size of 7 (the Dc stretches over positions 15–22):

where the terminal "?” represents the placeholder for the RNCs. This kind of chromosome is expressed exactly as shown above, giving:

Then the ?'s in the expression tree are replaced from left to right and from top to bottom by the symbols (for simplicity represented by numerals) in the Dc, giving:

The values corresponding to these symbols are kept in an array. (For simplicity, the number represented by the numeral indicates the order in the array.) For instance, for the following 10 element array of RNCs:

 * C = {0.611, 1.184, 2.449, 2.98, 0.496, 2.286, 0.93, 2.305, 2.737, 0.755}

the expression tree above gives:

This elegant structure for handling random numerical constants is at the heart of different GEP systems, such as GEP neural networks and GEP decision trees.

Like the basic gene expression algorithm, the GEP-RNC algorithm is also multigenic and its chromosomes are decoded as usual by expressing one gene after another and then linking them all together by the same kind of linking process.

The genetic operators used in the GEP-RNC system are an extension to the genetic operators of the basic GEP algorithm (see above), and they all can be straightforwardly implemented in these new chromosomes. On the other hand, the basic operators of mutation, inversion, transposition, and recombination are also used in the GEP-RNC algorithm. Furthermore, special Dc-specific operators such as mutation, inversion, and transposition, are also used to aid in a more efficient circulation of the RNCs among individual programs. In addition, there is also a special mutation operator that allows the permanent introduction of variation in the set of RNCs. The initial set of RNCs is randomly created at the beginning of a run, which means that, for each gene in the initial population, a specified number of numerical constants, chosen from a certain range, are randomly generated. Then their circulation and mutation is enabled by the genetic operators.

Neural networks
An artificial neural network (ANN or NN) is a computational device that consists of many simple connected units or neurons. The connections between the units are usually weighted by real-valued weights. These weights are the primary means of learning in neural networks and a learning algorithm is usually used to adjust them.

Structurally, a neural network has three different classes of units: input units, hidden units, and output units. An activation pattern is presented at the input units and then spreads in a forward direction from the input units through one or more layers of hidden units to the output units. The activation coming into one unit from other unit is multiplied by the weights on the links over which it spreads. All incoming activation is then added together and the unit becomes activated only if the incoming result is above the unit's threshold.

In summary, the basic components of a neural network are the units, the connections between the units, the weights, and the thresholds. So, in order to fully simulate an artificial neural network one must somehow encode these components in a linear chromosome and then be able to express them in a meaningful way.

In GEP neural networks (GEP-NN or GEP nets), the network architecture is encoded in the usual structure of a head/tail domain. The head contains special functions/neurons that activate the hidden and output units (in the GEP context, all these units are more appropriately called functional units) and terminals that represent the input units. The tail, as usual, contains only terminals/input units.

Besides the head and the tail, these neural network genes contain two additional domains, Dw and Dt, for encoding the weights and thresholds of the neural network. Structurally, the Dw comes after the tail and its length dw depends on the head size h and maximum arity nmax and is evaluated by the formula:

 * $$d_{w} = hn_\max$$

The Dt comes after Dw and has a length dt equal to t. Both domains are composed of symbols representing the weights and thresholds of the neural network.

For each NN-gene, the weights and thresholds are created at the beginning of each run, but their circulation and adaptation are guaranteed by the usual genetic operators of mutation, transposition, inversion, and recombination. In addition, special operators are also used to allow a constant flow of genetic variation in the set of weights and thresholds.

For example, below is shown a neural network with two input units (i1 and i2), two hidden units (h1 and h2), and one output unit (o1). It has a total of six connections with six corresponding weights represented by the numerals 1–6 (for simplicity, the thresholds are all equal to 1 and are omitted):

This representation is the canonical neural network representation, but neural networks can also be represented by a tree, which, in this case, corresponds to:

where "a” and "b” represent the two inputs i1 and i2 and "D” represents a function with connectivity two. This function adds all its weighted arguments and then thresholds this activation in order to determine the forwarded output. This output (zero or one in this simple case) depends on the threshold of each unit, that is, if the total incoming activation is equal to or greater than the threshold, then the output is one, zero otherwise.

The above NN-tree can be linearized as follows:

where the structure in positions 7–12 (Dw) encodes the weights. The values of each weight are kept in an array and retrieved as necessary for expression.

As a more concrete example, below is shown a neural net gene for the exclusive-or problem. It has a head size of 3 and Dw size of 6:

Its expression results in the following neural network:

which, for the set of weights:

 * W = {−1.978, 0.514, −0.465, 1.22, −1.686, −1.797, 0.197, 1.606, 0, 1.753}

it gives:

which is a perfect solution to the exclusive-or function.

Besides simple Boolean functions with binary inputs and binary outputs, the GEP-nets algorithm can handle all kinds of functions or neurons (linear neuron, tanh neuron, atan neuron, logistic neuron, limit neuron, radial basis and triangular basis neurons, all kinds of step neurons, and so on). Also interesting is that the GEP-nets algorithm can use all these neurons together and let evolution decide which ones work best to solve the problem at hand. So, GEP-nets can be used not only in Boolean problems but also in logistic regression, classification, and regression. In all cases, GEP-nets can be implemented not only with multigenic systems but also cellular systems, both unicellular and multicellular. Furthermore, multinomial classification problems can also be tackled in one go by GEP-nets both with multigenic systems and multicellular systems.

Decision trees
Decision trees (DT) are classification models where a series of questions and answers are mapped using nodes and directed edges.

Decision trees have three types of nodes: a root node, internal nodes, and leaf or terminal nodes. The root node and all internal nodes represent test conditions for different attributes or variables in a dataset. Leaf nodes specify the class label for all different paths in the tree.

Most decision tree induction algorithms involve selecting an attribute for the root node and then make the same kind of informed decision about all the nodes in a tree.

Decision trees can also be created by gene expression programming, with the advantage that all the decisions concerning the growth of the tree are made by the algorithm itself without any kind of human input.

There are basically two different types of DT algorithms: one for inducing decision trees with only nominal attributes and another for inducing decision trees with both numeric and nominal attributes. This aspect of decision tree induction also carries to gene expression programming and there are two GEP algorithms for decision tree induction: the evolvable decision trees (EDT) algorithm for dealing exclusively with nominal attributes and the EDT-RNC (EDT with random numerical constants) for handling both nominal and numeric attributes.

In the decision trees induced by gene expression programming, the attributes behave as function nodes in the basic gene expression algorithm, whereas the class labels behave as terminals. This means that attribute nodes have also associated with them a specific arity or number of branches that will determine their growth and, ultimately, the growth of the tree. Class labels behave like terminals, which means that for a k-class classification task, a terminal set with k terminals is used, representing the k different classes.

The rules for encoding a decision tree in a linear genome are very similar to the rules used to encode mathematical expressions (see above). So, for decision tree induction the genes also have a head and a tail, with the head containing attributes and terminals and the tail containing only terminals. This again ensures that all decision trees designed by GEP are always valid programs. Furthermore, the size of the tail t is also dictated by the head size h and the number of branches of the attribute with more branches nmax and is evaluated by the equation:

 * $$t = h(n_\max-1)+1 \, $$

For example, consider the decision tree below to decide whether to play outside:

It can be linearly encoded as:

where “H” represents the attribute Humidity, “O” the attribute Outlook, “W” represents Windy, and “a” and “b” the class labels "Yes" and "No" respectively. Note that the edges connecting the nodes are properties of the data, specifying the type and number of branches of each attribute, and therefore don't have to be encoded.

The process of decision tree induction with gene expression programming starts, as usual, with an initial population of randomly created chromosomes. Then the chromosomes are expressed as decision trees and their fitness evaluated against a training dataset. According to fitness they are then selected to reproduce with modification. The genetic operators are exactly the same that are used in a conventional unigenic system, for example, mutation, inversion, transposition, and recombination.

Decision trees with both nominal and numeric attributes are also easily induced with gene expression programming using the framework described above for dealing with random numerical constants. The chromosomal architecture includes an extra domain for encoding random numerical constants, which are used as thresholds for splitting the data at each branching node. For example, the gene below with a head size of 5 (the Dc starts at position 16):

encodes the decision tree shown below:

In this system, every node in the head, irrespective of its type (numeric attribute, nominal attribute, or terminal), has associated with it a random numerical constant, which for simplicity in the example above is represented by a numeral 0–9. These random numerical constants are encoded in the Dc domain and their expression follows a very simple scheme: from top to bottom and from left to right, the elements in Dc are assigned one-by-one to the elements in the decision tree. So, for the following array of RNCs:

 * C = {62, 51, 68, 83, 86, 41, 43, 44, 9, 67}

the decision tree above results in:

which can also be represented more colorfully as a conventional decision tree:

Criticism
GEP has been criticized for not being a major improvement over other genetic programming techniques. In many experiments, it did not perform better than existing methods.

Commercial applications

 * GeneXproTools: GeneXproTools is a predictive analytics suite developed by Gepsoft. GeneXproTools modeling frameworks include logistic regression, classification, regression, time series prediction, and logic synthesis. GeneXproTools implements the basic gene expression algorithm and the GEP-RNC algorithm, both used in all the modeling frameworks of GeneXproTools.

Open-source libraries

 * GEP4J – GEP for Java Project: Created by Jason Thomas, GEP4J is an open-source implementation of gene expression programming in Java. It implements different GEP algorithms, including evolving decision trees (with nominal, numeric, or mixed attributes) and automatically defined functions. GEP4J is hosted at Google Code.

 * PyGEP – Gene Expression Programming for Python: Created by Ryan O'Neil with the goal to create a simple library suitable for the academic study of gene expression programming in Python, aiming for ease of use and rapid implementation. It implements standard multigenic chromosomes and the genetic operators mutation, crossover, and transposition. PyGEP is hosted at Google Code.

 * jGEP – Java GEP toolkit: Created by Matthew Sottile to rapidly build Java prototype codes that use GEP, which can then be written in a language such as C or Fortran for real speed. jGEP is hosted at SourceForge.

title: Gene expression programming


text:
Heinrich Barkhausen

Heinrich Georg Barkhausen (2 December 1881 – 20 February 1956), born in Bremen, was a German physicist.

Growing up in a patrician Bremen family, he showed interest in natural sciences from an early age. He studied at the Technical University of Munich (1901), TU Berlin (1902) and University of Munich (1903) and Berlin before obtaining a doctorate at the University of Göttingen in 1907.

He became professor of electrical engineering at the Technische Hochschule Dresden in 1911 at the age of 29, thus obtaining the world's first chair in this discipline.

In 1919, he discovered the Barkhausen effect (named after him), which provided evidence for the magnetic domain theory of ferromagnetism. When the magnetic field through a piece of ferromagnetic material like iron is changing, the magnetization of the material changes in a series of tiny discontinuous jumps, which can be heard as a series of clicks in a loudspeaker attached to a coil of wire around the iron. It was later determined that these jumps were caused by the movement of the magnetic domains in the iron, as the domain walls snap past defects in the crystal lattice. The energy lost in these dissipative events is responsible for the shape of the hysteresis curve of iron and other ferromagnets. This effect is widely used in research, and physics education as a simple experiment to demonstrate the reality of magnetic domains.

In 1920, he invented the Barkhausen–Kurz oscillator, with K. Kurz, the first vacuum tube electronic oscillator to use electron transit-time effects. It was the first vacuum tube oscillator that could operate at ultrahigh frequency, up to 300 MHz, and inspired later microwave transit-time tubes such as the klystron.

In 1921 he derived the first mathematical conditions for oscillation in electrical circuits, now called the Barkhausen stability criterion. They are widely used today in the design of electronic oscillators and general feedback amplifier circuits.

In 1933 Barkhausen signed the Loyalty Oath of German Professors to Adolf Hitler and the National Socialist State.

Publications
Four-volume textbook: Lehrbuch der Elektronenröhren, Elektronenröhren und ihre technischen Anwendungen.

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: Heinrich Barkhausen


text:
Richard Coyle

Richard Coyle (born 27 February 1972) is an English actor. He portrayed the lead role of Father Faustus Blackwood in Netflix series Chilling Adventures of Sabrina, and Jeff Murdock in the sitcom Coupling.

Early and personal life
Coyle was born in Sheffield, England. His father was a builder and he is the fourth of five sons. Coyle began his acting career after a stint working on a ferry entertaining passengers, where he was told by a theatre director that he had talent and should pursue it further. He graduated in Languages and Philosophy from the University of York in 1995 and was then accepted into the prestigious Bristol Old Vic Theatre School, graduating in 1998, the same year as his close friends Dean Lennox Kelly and Oded Fehr.

Coyle was married to actress Georgia Mackenzie but they divorced in 2010. From early 2011, he was in a relationship with actress Ruth Bradley, but by 2017 this had ended and he was seeing someone else.

Film and television work
He began by appearing in such television programmes as Lorna Doone, as John Ridd and Evelyn Waugh's wartime saga Sword of Honour, and in Mike Leigh's film Topsy-Turvy. He played Mr Coxe in 1999's BBC version of Wives and Daughters. In 2000, Coyle's big break arrived in the form of the character Jeff Murdock in the comedy Coupling. In 2003 he chose not to return to Coupling for its fourth series, and refused requests to return for a "goodbye episode". In a 2005 interview, Coyle stated this was to avoid typecasting:

"I'm very proud to have been part of Coupling and very grateful for the chance to play Jeff but I was very keen that that character didn’t stick with me forever. I’m an actor and I want to be an actor when I’m 60. It’s a lifelong process; why cut it off by boxing yourself into a little pigeonhole early on?"

He also starred in the short-lived 2002–2003 BBC show Strange, and had roles in the films Human Traffic, Franklyn, and A Good Year. He appeared in the new special episode of Cracker: Nine Eleven in October 2006 (TV) and starred in The Whistleblowers on ITV. He also starred in the 2001 version of Othello as Michael Cassio.

In 2004, Coyle played the role of Alcock, body servant to John Wilmot, 2nd Earl of Rochester, in The Libertine alongside Johnny Depp. He appeared in Mike Newell's 2010 film Prince of Persia: The Sands of Time, playing Jake Gyllenhaal's older brother, the ambiguous Crown Prince Tus.

He was cast as the lead role, Moist von Lipwig, in the film Going Postal, based on the book of the same name by Terry Pratchett. This was broadcast on television in May 2010.

Coyle had a leading role in Renny Harlin's film 5 Days of War, about the 2008 war between Russia and Georgia over the territory of South Ossetia. In September 2011, Coyle appeared as William Winthrop, in Madonna's feature-directorial debut W.E. about the Duke and Duchess of Windsor. He appeared as Garda Ciarán O'Shea in Grabbers, the Irish comedy monster film. Coyle also plays Wallace in Outpost: Black Sun, the sequel to the 2008 British horror film Outpost, and the lead of drug pusher Frank in the 2012 English-language remake of Nicolas Winding Refn's 1996 cult classic Pusher.

In 2012, Coyle joined the cast of the USA Network show Covert Affairs as Simon Fischer, an FSB agent and love interest for Piper Perabo's Annie Walker. His character recurred until halfway through season three.

In 2014, NBC began airing the series Crossbones, with Coyle as Tom Lowe, who is assigned to kill the pirate Blackbeard (played by John Malkovich).

In 2018, Coyle was cast as Father Faustus Blackwood, a high priest of the Church of Night and Dean of the Academy of the Unseen Arts in the Netflix series Chilling Adventures of Sabrina.

In January 2021, Coyle announced via Instagram that he has been cast in Fantastic Beasts: The Secrets of Dumbledore, scheduled to be released in 2022 but said he could not disclose whom he was playing. When the trailer came out that December, it was confirmed that he would be playing Aberforth Dumbledore.

Stage roles
He was cast as the lead in Peter Gill's 2002 stage premiere of The York Realist, and later in the Donmar Warehouse production of the play Proof, in London, alongside Gwyneth Paltrow, and on the success of this he was cast in Patrick Marber's reworking of August Strindberg's play After Miss Julie with Kelly Reilly and Helen Baxendale. From September to November 2004, Coyle played the title role in Michael Grandage's production of Friedrich Schiller's Don Carlos which then transferred to the West End from January to April 2005. The cast also included Derek Jacobi, Peter Eyre and Una Stubbs. The V&A theatre archive has a copy of a film of the production which can be privately viewed. He was in Peter Gill's production of John Osborne's Look Back in Anger at the Theatre Royal, Bath from August to September 2006. In 2008 Richard starred in Harold Pinter's The Lover and The Collection at the Comedy Theatre in London, alongside Charlie Cox and Gina McKee.

In 2010 he played John in Mark Haddon's play Polar Bears at the Donmar Warehouse, London.

His own theatre company was scheduled to debut at the refurbished Arcola Theatre in Dalston, London in March 2013, with Coyle starring alongside his friend and co-founder Rafe Spall in Simon Bent's play The Associate.

In 2014 he played MacDuff in the Kenneth Branagh and Rob Ashford directed Macbeth at the Park Avenue Armory, New York City.

Coyle originated the role of Larry Lamb in James Graham's new play Ink which opened at the Almeida Theatre directed by Rupert Goold before transferring to the Duke of York's Theatre in the West End. Coyle stars alongside Bertie Carvel who plays Rupert Murdoch.

From 10 March until 19 November 2022 Coyle starred in the role of Atticus Finch in the West End debut of Aaron Sorkin's adaptation of Harper Lee's American classic, To Kill a Mockingbird.

Starring as Henry in Player Kings on West End from 1 April to 22 June 2024.

Other media
Coyle played Keats in the game Folklore and has also narrated the following audio books: At The Mountains of Madness and The Shadow Over Innsmouth by H. P. Lovecraft, Resistance by Owen Sheers, and the H.I.V.E. series of novels by Mark Walden. He has also narrated the Discworld audiobooks Going Postal, Making Money, and Raising Steam, which feature the character Moist von Lipwig, for the Penguin series of re-recorded Discworld audiobooks released in February 2023.

title: Richard Coyle


text:
Talk:Song Fight!

Wikification
I've had a lot of experience with SF, and I vaguely recall the fuss on their boards when this article was posted and duly rejected. The original editor(s) didn't really "get" Wikipedia, I think, which isn't so much a problem in itself as it was a confrontation waiting to happen. I'll be working on this shortly, since it seems some NPOV matters need to be resolved (in addition to layout and just about everything else). The WP-significance of the site is indisputable to anyone familiar with it, I think, but it needs a lot of cleanup work. Fearwig 19:12, 5 June 2006 (UTC)
 * Okay, think that covers it for now. I'll probably add to it in time. Opinions? Fearwig 17:06, 8 June 2006 (UTC)

Live & Australia
When was there a SFL in Australia? I can't find any information about it anywhere. It hasn't happend since 2003 and before that I think there were two Australians so I don't know how it could have happened.

It would have been pre-2003, but not by much. It wasn't "official", but then I'm not sure there's anything official about an SFL in the first place, other than that all the "official" ones seem to go up on the site and have an "Song Fight X and Y"-style name. There were certainly more than two Australians at that time, though I can't say I ever paid much attention to SF forum demographics... Fearwig 05:34, 22 August 2007 (UTC)

Hi everyone. I updated the page to reflect the last couple years of SFLs. I also distinguished between SFLs and SFPs. In regards to Fearwig's comment above, the distinction is that the "official" SFL events are listed on the official pages. For the last many years they've been multi-day events as well... 76.176.118.18 (talk) 17:56, 10 September 2009 (UTC)

Narbotic's real name
I'm reasonably certain he spells his first name with two Ls. I took the liberty of correcting the spelling in the first paragraph after the Table of Contents. If anyone can find a source to prove me wrong, feel free to change it back. -Jon Eric (I don't have a Wikipedia account) —Preceding unsigned comment added by 70.124.63.193 (talk) 05:32, 19 February 2010 (UTC)

title: Talk:Song Fight!


text:
Category talk:Internet Standards

IETF standards
There are Internet standards which are not IETF standards (e.g. some WWW stuff). It might have been good to keep Category: IETF Standards and make it a subset of Internet standards. Noel 15:54, 24 Oct 2004 (UTC)

Capitalization
Why was this category moved from Internet standards to Internet Standards? As it is not a proper noun there is no reason to capitalize standards. Let's move it back. --EnOreg (talk) 12:31, 11 October 2013 (UTC)

future Internet standards
Having future Internet standards collected in a category namend just "Internet Standards" is confusing and not really Wikipedia-like, I'd say: Don't we usually refrain from documenting what the world will be in the future for obvious reasons?..--Flugaal (talk) 14:55, 14 October 2015 (UTC)

title: Category talk:Internet Standards


text:
People's Army (Poland)

The People's Army (AL; Armia Ludowa; ) was a communist partisan force of the Polish Workers' Party (PPR) active in Occupied Poland during World War II from January to July 1944. It was created on the order of the Soviet-backed State National Council to fight against Nazi Germany and support the Red Army against the German forces in Poland.

The Armia Ludowa was formed from the Gwardia Ludowa ("People's Guard") to aid the creation of a pro-Soviet communist government in Poland and, along with the National Armed Forces, refused to join the structures of the Polish Underground State and Home Army. It participated in a number of uprisings and supported Red Army offensives through Poland. The Armia Ludowa became part of the new Polish People's Army of the Soviet Polish Armed Forces in the East after seven months of existence.

The Armia Ludowa was heroized in the Polish People's Republic with its size and actions being exaggerated in propaganda in communist Poland. Since the fall of communism in Poland, the Armia Ludowa has been classified as a Soviet partisan movement rather than part of the Polish resistance due to their close affiliation with the Soviet Union which de facto controlled it and its predecessors.

Background
In September 1939, the Second Polish Republic was invaded by both Nazi Germany and the Soviet Union, one month after the signing of the Molotov-Ribbentrop Pact. On 1 September, the Germans launched their invasion of Poland from the west, considered the beginning of World War II. On 17 September, the Soviets launched their own invasion of Poland from the east. There was no formal declaration of war by either side, but Polish forces were defeated within a month and forced the Polish state to operate in exile and underground. Poland itself was divided into spheres of influence and annexed by the two powers roughly along the Curzon Line. The Polish government-in-exile established in London maintained contacts with the Polish Underground State, its representatives in Occupied Poland.

Following the German invasion of the Soviet Union in 1941, communist supporters in Poland, aided by Soviet advisers, had formed partisan units and created their own independent underground organization, whose aims were to support the Red Army against German forces. In 1943, following revelations about the Katyn massacre and the Polish government-in-exile's insistence on investigation, the Soviet Union broke off diplomatic relations and intended to establish a competing government for Poland. Communist Polish partisans became increasingly involved in the creation of a pro-Soviet communist government in Poland. In 1942, the communist Polish Workers' Party (PPR) created the Gwardia Ludowa (GL, "People's Guard") as a paramilitary force. The PPR was the favoured party of the Soviets in Poland and received the bulk of its aid. Along with a portion of the National Armed Forces, this communist-led underground was one of the military resistance organizations in Poland that refused to join the structures of the Polish Underground State, and its military arm, the Home Army (Armia Krajowa).

Creation
On 1 January 1944, the State National Council (Krajowa Rada Narodowa, KRN) replaced the Gwardia Ludowa with the People's Army (Armia Ludowa). The KRN intended to gain volunteers from other groups. Upon its establishment, the organization comprised some 10,000 members. By the end of July 1944, when much of Poland had been occupied by the Red Army, there were some 20,000–30,000 members, with 5,000 of them being Soviet nationals. Lower estimates quote about 14,000 as its peak strength, whereas high estimates double the middle number, up to 50,000–60,000. About 6,000 of them were active full-time partisans while the remainder were reservists. Whatever its exact size, the Armia Ludowa was much smaller than the Home Army, though it much better armed as a result of Soviet air drops; it might have even had a surplus of weaponry. It also had less strict discipline.

The commander of the Armia Ludowa was General Michał Rola-Żymierski, and the chief of staff was a member of the Central Committee of the Polish Workers' Party, Colonel Franciszek Jóźwiak.

Operations, propaganda and criticism
According to Armia Ludowa's claims, it carried out about 900 operations, killing 20,000 Germans, derailing 350 trains, and destroying 79 bridges. However, these exploits were significantly exaggerated by communist propaganda in the People's Republic of Poland. Historian Piotr Gontarczyk estimates that only about 5–10% of the actions really took place, and that most instances of fighting the German military were defending from German anti-partisan operations, with instances of attacking Germans on its own initiative being very rare. Rather than engaging military targets, it preferred softer targets such as German administration offices. That changed in 1944, when the GL/AL grew stronger and began engaging the German military more actively. According to the historian Mieczysław B. Biskupski, the Armia Ludowa was less concerned with fighting the Germans than with fighting the Home Army. According to Gontarczyk and Janusz Marszal, however, that was relatively uncommon, at least with regards to direct actions, but it would often pass anonymous tips about the Home Army to the Gestapo.

The Armia Ludowa took part in the Warsaw Uprising, with official claims holding that some 1,800 of its soldiers fought there, but modern research suggests the actual number to have been about 500. Although well armed, it struggled with a much poorer support network than the Home Army, which was supported by the Polish Underground State. Soviet air drops did not supply foodstuffs, often leading partisans to resort to forced requisitions, which is described by modern historians as "banditry". It often targeted mansions and churches, and there were also incidents of its soldiers murdering Jews or fighting among themselves. In one of its most secret and controversial actions, agents of the Armia Ludowa on 17 February 1944 seized an important document archive of the Polish Underground State. Documents of importance to the communist activists were taken, and the remainder was turned over to a Gestapo agent, who had been duped into participating in the operation. Seven members of the Polish Underground State were taken prisoner by the Germans in a cleanup operation and likely executed soon afterward.

Polish People's Army
On 21 July 1944, seven months after it came into existence, the Armia Ludowa was integrated into the Polish Military in the USSR and formed the new People's Army of Poland (Ludowe Wojsko Polskie, LWP). After the Red Army and the Soviet-organized 1st Polish Army entered Poland late in 1944 and early 1945, most People's Army members joined the communist 1st Polish Army. After the war, many of its members joined the ranks of the Ministry of Public Security of the Polish People's Republic, or the Milicja Obywatelska.

The Armia Ludowa were hailed as heroes in the Polish People's Republic and often the subject of early communist propaganda in Poland. State media exaggerated its size and role during the war, typically at the expense of the Home Army, who involvement was minimised and criticised. Although its size and actions were much smaller in number than the Home Army, propaganda espoused the myth that the reverse was the case. Since the fall of communism in Poland in 1989, the legacy of the Armia Ludowa has been reconsidered, mainly as its leadership took orders from the Soviet Union and represented Soviet, not Polish, interests. The Polish Institute of National Remembrance, in its official description of the Gwardia Ludowa/Armia Ludowa, goes so far as to declare the organisation as part of the Soviet partisans, rather than the Polish resistance.

title: People's Army (Poland)


text:
Talk:Orotic acid

Untitled
not enough info. mention:

1) orotic acid is an intermediate in pyrimidine synthesis (C, T)

2) multi-organ tumour promoter

74.111.2.51 02:10, 11 December 2006 (UTC) Prof. Larry Moran, PhD. University of Toronto, Department of Biochemistry

Wrong Lemma
It's not pyrimidinecarboxylic acid, the systematic name is 1,2,3,6-tetrahydro-2,6-dioxopyrimidine-4-carboxylic acid or uracil-6-carboxylic acid, but orotic acid is more common. -- 217.224.70.151 13:09, 26 July 2006 (UTC)

Vitamin?
The article states that "...it is not a vitamin, but is instead manufactured in the body by intestinal flora." By that definition, vitamin K wouldn't be a vitamin. --ἀνυπόδητος (talk) 11:39, 31 July 2009 (UTC)
 * Vitamin K is available via microbial action, but some humans still need supplements. Bearian (talk) 16:11, 2 October 2014 (UTC)

Orotic Acid Mutagen?
There is no proper citation of the rather serious claim that Orotic Acid, a necessary nutrient for humans to live, is a mutagenic compound. A google search pulled up nothing except a few abstracts about 5-Fluoro-Orotic Acid, a different compound altogether. — Preceding unsigned comment added by 65.190.21.85 (talk) 00:23, 26 December 2013 (UTC)

A Google search on 12/27/2014 turned up a materials safety data sheet for orotic acid, anhydrous (1,2,3,6-Tetrahydro-2,6-dioxo-4- pyrimidinecarboxylic Acid; 6-Uracilcarboxylic Acid) from ScienceLab.com that states: "Chronic Effects on Humans: MUTAGENIC EFFECTS: Mutagenic for mammalian somatic cells. Mutagenic for bacteria and/ or yeast." Also found this substance listed as having an RTECS class of Mutagen.

Tricreatine orotate
This article has been proposed for deletion. However, otherwise non-notable salts of an acid should be merged into the parent article when feasible. Bearian (talk) 16:12, 2 October 2014 (UTC)
 * ✅. The tricreatine orotate article was at best poorly sourced, but I claim no expertise in this area. Hopefully someone with a greater knowledge of chemistry can provide a decent source for the merged content. Euryalus (talk) 12:45, 11 October 2014 (UTC)

Pronunciation
Because of the unfortunate name of B¹³, I propose the correct pronunciation be added to the article to prevent confusion. 68.185.117.66 (talk) 15:04, 6 November 2022 (UTC)

 * Well it is an acid with a rather funny name, but the correct way to say it is Or-ot-ic acid. I have no idea of how to use the IPA system.If someone can transscribe the name it would be a great help. Cadmium (talk) 10:34, 7 February 2023 (UTC)

title: Talk:Orotic acid


text:
Lok Rajya Party

The Lok Rajya Party is a political party in the Indian state of Maharashtra. The LRP is based amongst the Backward Castes.

title: Lok Rajya Party


text:
Three Mountains of Dewa

The Three Mountains of Dewa (出羽三山) refer to the three sacred mountains of Mount Haguro, Mount Gassan and Mount Yudono, which are clustered together in the ancient province of Dewa (modern-day Yamagata Prefecture). Holy to the Japanese Shinto religion and especially the mountain ascetic cult of Shugendo, Dewa Sanzan are a popular pilgrimage site visited by many, including famed haiku poet Matsuo Bashō.

The Haguro Five-story Pagoda is a recognised national treasure of Japan.

It has three subshrines
 * 1) Mount Gassan with Gassan Shrine
 * 2) Mount Haguro with
 * 3) Mount Yudono with

History
The Dewa Sanzan mountains are particularly noteworthy as having the oldest history of mountain worship in Japan. The mountains were first opened as a religious centre over 1400 years ago in 593 by prince Hachiko, who was the first-born son of Emperor Sushun, the 32nd emperor of Japan and reigning emperor at the time. Prince Hachiko arrived in Dewa province in 593 after fleeing the Soga clan upon the assassination of his father. He then devoted the rest of his life to religious pursuits, eventually enduring difficult ascetic exercises and a period of penance, which led to his worship of Haguro Gongen, the deity of the mountain. Following this, the prince began worship at the Gassan and Yudono mountains, which led to the enshrinement of all three deities at the temple located on the summit of Mount Haguro.

Following the establishment of the Dewa Sanzan mountains as a center of ascetic religious beliefs, many people began to make yearly pilgrimages to the mountains to pay reverence, even arduously trekking thousands of miles to visit the shrines during the summer months. These pilgrimages held significance to many religions and the mountains served as a place of learning for various belief systems, but were most particularly important to shugendō. Several notable individuals made this pilgrimage to the Dewa Sanzan to include En no Gyōja, the founder of shugendō asceticism, as well as Kūkai, the founder of the Shingon Sect.

Following the Meiji Restoration in 1868, the Japanese government dissolved the pattern of Shintō-Buddhist amalgamation and Shintō was selected as the official state religion. Shugendō was adversely affected by this split and many shugendō priests returned to a secular life. Following the end of World War II however, shugendō was allowed to enjoy a status as a minor religious group. These changes in religious association also altered the designation of the shrines located on the Dewa Sanzan. In the Empire of Japan, and  were designated as kokuhei shosha, while Gassan Shrine on Mount Gassan was considered a kanpei taisha. Today all three are considered equal Beppyo shrines

Significance in Japanese religion
Folk religion has continued throughout the ages to be a standard part of the daily lives of the Japanese people, particularly the aspect of the association between religious beliefs and practices with sacred mountains. This practice of mountain worship holds a significant place in Japanese beliefs and had become widespread throughout Japan’s history. It has been observed that nearly every high mountain top has had its own dedicated shrine at one point, with some receiving pilgrimages every year from thousands of worshippers. This collection of diverse phenomena linking religious activities and beliefs with sacred mountains is referred to as sangaku shinkō.

The Dewa Sanzan are very holy to both the religions of Shintō and Buddhism, but in particular are very significant and sacred to the shugendō religious system of beliefs, as they represent great spiritual significance. Mount Haguro, Mount Gassan, and Mount Yudono each have their own shrine, though the primary shrine itself, Dewa Shrine, is located at the summit of Mount Haguro. The primary shrine is unique in that it venerates all three sacred mountains.

Every year, mountain ascetic devotees known as yamabushi - which are laymen practitioners of shugendo - pay reverence to the Dewa Sanzan. Mount Haguro is significant in this role as it serves as the entryway to Mount Gassan and Mount Yudono.

Though Mount Haguro is the smallest of the three mountains, it is the only mountain of Dewa that is accessible all throughout the year, as heavy snowfall prohibits pilgrimage to the other two mountains of Dewa during the winter months. It is the most well known of the three mountains of Dewa both locally and internationally, as it serves as the location of the Haguro Five-story Pagoda, one of Japan's national treasures.

Mount Gassan is the tallest of the three sacred mountains and is well known for its natural scenery and beauty, as it plays host to a variety of rare alpine plants and other marsh vegetation. The hiking path on Mt. Gassan leads all the way to its peak, the second highest point in the Shonai Region of Japan. Due to heavy snow however, it is often only accessible during late spring to the early fall.

Mount Yudono is viewed as being the heart of the three sacred mountains and is considered the most holy of ascetic disciplinary practice grounds. Many ascetics and yamabushi believe they have not completed their pilgrimage, and thus entered the holy land, until they have reached Mount Yudono. Mount Yudono is famous for its goshintai, a sacred object believed to be directly connected to a god. The shrine on Yudono is also revered as hallowed land which must be kept secret, and even today, photography and video recordings are prohibited.

title: Three Mountains of Dewa


text:
Talk:Manston Airport

Untitled
There is some serious POV in this article regarding the recent development. I am removing the most glaring examples and attempting to corroborate some of the other assertions. adamsan 16:06, 24 Oct 2004 (UTC)

"There are some reports of expanding the runway to handle heavy loaded 747-400s and maybe the A380F" - what does this mean? Has it been reported that the runway has been extended or merely that extension has been suggested? Who reported it? Who suggested it? Be specific. Earldelawarr (talk) 10:22, 15 August 2009 (UTC)

 * I think I'll remove that line as the runway is quite capable of that. It runs 747 heavy cargo planes all the time, and has had even the Antonov AN-124 and AN-225 take off from there. Canterbury Tail   talk  11:12, 15 August 2009 (UTC)

Article title
The article title should be the airport's name, not it's advertising slogan. This is part of the POV problem identified above. --Stfg (talk) 17:01, 20 June 2012 (UTC)
 * Strongly agree. Per WP:TITLE, "The most common name for a subject, as determined by its prevalence in reliable English-language sources, is often used as a title because it is recognizable and natural." Manston Airport, I guess. --Tagishsimon (talk) 14:20, 21 June 2012 (UTC)
 * Yes, I think so. A quick Google suggests that Manston Airport and Kent International Airport both seem about equally common. The current owners, Infratil, list it simply as Manston Airport. The slogan name actually does it no favours (pretentious unless it's deliberately humorous) and I think we'd be most sensible to use what the owners call it as the article title. --Stfg (talk) 14:50, 21 June 2012 (UTC)
 * I changed the name to 'Manston, Kent's International Airport' after contacting the airport's press office. They replied with the following message:

"Thanks for getting in touch.

We are known as Manston, Kent's International Airport."

Personally I'd prefer Manston Airport. Harrison49 (talk) 16:58, 21 June 2012 (UTC)
 * I am supporting Manston Airport as well.--Abuk SABUK (talk) 18:45, 4 September 2012 (UTC)

 * I've had the article renamed to Manston Airport. Cloudbound (talk) 15:21, 12 September 2012 (UTC)

Cargo Airlines

'''Please remove the link from Magma Aviation to the MK Airlines Wiki page. There is no assocication between the companies.''' — Preceding unsigned comment added by Taes8484 (talk • contribs) 18:15, 30 October 2012 (UTC)

discrepancies
The article states 7th longest runway in England. However, it lists Prestwick, which is not in England, but Scotland.

Do they mean "7th longest in the UK"? Or do they mean the 6th longest in EEngland?Halowithhorns89 (talk) 19:45, 13 May 2015 (UTC)

It has since been amended to say 11th longest, however the list still omits longer runways http://www.ukairfields.org.uk/runway-lengths.html If you include only active civilian runways then it is 14th on the list and if you are including a disused runway like Manston on the list, then surely you should also include other disused runways? — Preceding unsigned comment added by 2A02:3031:2E0:315:3872:3E97:7A98:AD80 (talk) 12:05, 25 February 2024 (UTC)

External links modified
Hello fellow Wikipedians,

I have just added archive links to 1 one external link on Manston Airport. Please take a moment to review my edit. If necessary, add after the link to keep me from modifying it. Alternatively, you can add to keep me off the page altogether. I made the following changes:
 * Added archive https://web.archive.org/20070915192846/http://www.gpia.co.uk:80/general/newsItem.asp?NewsItemID=295 to http://www.gpia.co.uk/general/newsItem.asp?NewsItemID=295

When you have finished reviewing my changes, please set the checked parameter below to true to let others know.

Cheers.—cyberbot II  Talk to my owner :Online 21:13, 7 January 2016 (UTC)

External links modified
Hello fellow Wikipedians,

I have just added archive links to 1 one external link on Manston Airport. Please take a moment to review my edit. If necessary, add after the link to keep me from modifying it. Alternatively, you can add to keep me off the page altogether. I made the following changes:
 * Added archive http://web.archive.org/web/20110713143512/http://www.kentinternationalairport-manston.com/cancellations.pdf to http://www.kentinternationalairport-manston.com/cancellations.pdf

When you have finished reviewing my changes, please set the checked parameter below to true or failed to let others know (documentation at ).

Cheers.—cyberbot II  Talk to my owner :Online 15:20, 28 February 2016 (UTC)

Subject name
There is a series of edits currently that wishes to change the name to Stone Hill Park for this article. I wish to bring a few issues regarding this.

Firstly the article subject is Manston Airport. The Stone Hill Park is about a redevelopment of the site into a residential development with some extras. I believe that since the original subject is no longer the issue that this Stone Hill park should be a separate article and the Manston Airport article, while it should be put into the past tense and link to this Stone Hill park or have it briefly mentioned, should remain as the Manston Airport.

Second. The references for the Stone Hill Park name, including the official website at use the work proposed. The first line on the official website for the development is "Stone Hill Park is the name of the proposed mixed use scheme for the former Manston Airport site in Thanet." This means there is nothing official about it, no signs have been changed and nothing has been confirmed. It's purely at this stage a proposal. And since Wikipedia is not a WP:Crystal ball we shouldn't be using the name. Canterbury Tail  talk  12:11, 1 September 2016 (UTC)

 * If Stony Hill Park is deemed encyclopedically noteworthy - which I doubt, there are thousands of development projects of that kind - it can have its own article. Referring to the grounds' previous use. Jan olieslagers (talk) 13:01, 1 September 2016 (UTC)

 * I cant see any reason to change the name of the article as this is an encyclopedia about notable things so articles about RAF Manston and the civil use after should be kept as a record. As Jan olieslagers has said if the development is notable it should have its own article with a couple of lines at then end of this article to show future use. MilborneOne (talk) 18:44, 1 September 2016 (UTC)

 * Again a user keeps changing the name to Stone Hill Park, despite this article is about the airport (or former airport) and not a housing development. Additionally even the official website for this Stone Hill Park mentions it is "proposed", yet the user insists on continually reinserting. They also add incidents that fail notability per WP:AIRCRASH. Canterbury Tail   talk  01:10, 7 September 2016 (UTC)

 * The entity of Manston Airport has not been renamed. The land that the former Manston Airport may have changed names (however the sources don't indicate it has officially changed as even the official website states it's proposed) but the historical entity of Manston Airport has not changed names. There is clearly no support for this edit in the article and it has been reverted by at least 3 different editors. Please detail the reasoning here for changing it to a name for a proposed housing development. Canterbury Tail   talk  23:00, 12 September 2016 (UTC)

Correct Subject name

 * Contrary to the claims made above, nobody has suggested changing the name of the article. The only correct edit that has been made, with citations, is that the ex airport is now known as Stone Hill Park. The "entity" that was Manston Airport no longer exists, it has no airport license, and is closed as a functioning airport. It's owners and indeed the county council now refer to the site as Stone Hill Park, as that is what it's new owners have decided to call it. It's not about a housing development (only partially true) it's about accuracy, not clinging to something you wish hadn't gone, but has. It is interesting that various "sock accounts" have been created, most within the Thanet area simply to try to make this factual correction go away. As regards notability, an event that lead to the banning of a whole airline from Europe I would think was notable, especially as the incident occured at the ex airfield. If wikipedia is to be viewed in encyclopedic terms, then the current situation when refering to an entity such as an ex airport is of course relevant, must be accurate and must be current, no matter how much those that wish it was still open would like that not to be the case. Again, the correction is NOT renaming the piece, merely adding information to makde the information box correct.:::  — Preceding unsigned comment added by Real world sanity (talk • contribs) 01:58, 13 September 2016 (UTC)

The Former Manston Airport - past, present and future.
'''Can we be mindful of the former airport's history by placing correct information for past, present and future. ''' There is so much history that is of great interest to many but bickering over the owners plans awaiting approval for Stone Hill Park's developments, the present and future for the former airport site is taking away the importance of the past.

Past, present and future from WIKI should be truthful, not adapted to appeal just to the extreme avaition supporters. — Preceding unsigned comment added by Factful Facts (talk • contribs) 02:33, 13 September 2016 (UTC)

 * I'm probably going to regret this - but I have absolutely no idea what you are trying to say. From the amount of reverting you and your alter ego are doing there is obviously something troubling you, please take a deep breath and try to explain what you want in simple precise words you are concerned about.  Andrewgprout (talk) 06:07, 13 September 2016 (UTC)
 * I too have no wish to be in the middle of the dispute. I would like to leave a brief comment.  It's not at all easy for an uninvolved editor to quickly figure out precisely who wants what here, i.e. the root of the dispute.  It would be helpful if both (or all) sides could calmly and clearly explain their positions and how they believe the article should look.  From my point of view, there is clearly some important history which must not simply be lost in the encyclopaedia's past, like the site will probably / possibly be lost to the developer's bulldozers.  The use through the different wars, other significant military events, and the important parts of its period of civil aviation must be properly and fully preserved.  Preserving good historical knowledge is generally a good thing.   Murph 9000  (talk) 08:38, 13 September 2016 (UTC)

I'll try to summarize. The core of the issue now seems to have boiled down to the addition of the text in the infobox beside the name "Manston Airport" of "now known as Stone Hill Park" a proposed housing development. There are several references provided for this but I don't believe they provide what they are actually being used to support. Since this article is about Manston Airport, an airport that has now closed, putting in the infobox that Manston Airport is now called Stone Hill Park is incorrect as Manston Airport as an entity was never renamed. This Stone Hill Park is a proposed reuse of the site, not a renaming/rebranding of the airport. Additionally the primary reference is the website for the development at stonehillpark.co.uk which states very clearly on it's front page that "Stone Hill Park is the name of the proposed mixed use scheme for the former Manston Airport site in Thanet.' Note the very clear word proposed. This is an idea for a development called Stone Hill, not an official name of the site. Since Wikipedia is not a crystal ball something proposed can't take such prominence as, with all such developments, the chances of it not coming to fruition is reasonable high. Even if it does come to fruition the name in the Infobox, I believe, should not be changed because the Stone Hill Park use is not the subject of the article. Canterbury Tail   talk  11:48, 13 September 2016 (UTC)

Let me correct your "summary".

Your summary is wildly inaccurate Canterbury Tale. your position in favour of recreating an airport where Manston used to be is clouding your judgement. Editors will note that if you examine the vandalisation of the posts made re the correct name being pointed out, Canterbury Tales has used a number of dubious excuses to attempt to remove information he doesn't like. 1st time was that the information wasn't verified, and when verification was provided from various sources, the excuse then came to be a highly fanciful guess as to what the intention was of the person who originally wrote the wiki. The facts are that the site at Stone Hill Park is no longer an airport, and it's owners have changed it's name to Stone Hill Park, as verified by the 4 sources posted. Manston Airport as an entity no longer exists, and the sites new name is Stone Hill Park, it is entierly relevant, accurate and indeed essencial that this current fact is available. You will note that I have never suggested that the name of the page be changed, nor have I ever changed the name of the page, that would appear to be an attempt to cloud the issue by Canterbury tales. Manston Airport no longer exists, and reference to the site's new name is pertinent, relevant and justified. Anf for clarity, I don;t have an alter ego, and it's interesting that the person to once again valdalise the correct information that was "undone" did so from an IP whose only contribution to Wikipedia seems to be the vandalisation of that comment. I wonder whose alter ego that was. Real world sanity (talk) 18:36, 13 September 2016 (UTC)

 * Please refrain from making WP:Personal attacks on other editors. Comment on edits not motives or the editor. For the record I have no favour of recreating an airport on the former Manston Airport site, and I have no other IP address edits so please refrain from implying that they were done by myself.
 * In the interests of clarity can you let us know what your involvement with this proposed development is? Per WP:COI. Also please note that the principal reference and official site claims that it is a proposal not a done deal. Canterbury Tail   talk  19:32, 13 September 2016 (UTC)

 * No personal attack was made, I simply described the process that Canterbury Tales has used in his attempts to find an excuse to justify the unwarrented removal of factual information, and this can of course be bourne out by even a cursory examination of the edit history of the site. I can only take your comments on face value, although the evidence seems to point in another dierection. I too have no other IP address edits, and I would invite you and other commenters on this page and elsewhere to refrain from implying otherwise. I have no connection with the owners of the site, developers, possible developers, builders or any other entity that is in any way involved with the Stone Hill Park site, or the ex airport. In the interests of clarity, can you please detail any pressure groups, Facebook groups or entities that you belong to that are campaigning to recreate an airport at Stone Hill Park? My citations are valid, hence why I posted several, sites name IS now Stone Hill Park. For further clarity, it must be noted that the ex airport is no longer an airport, as it is closed, and not in possesion of an airport/airfield licence. Real world sanity (talk) 20:15, 13 September 2016 (UTC)

 * No affiliations or access to any groups whatsoever, solely an affiliation to Wikipedia through many years of editing. Not sure how a pressure group could force a re-opening of a closed airport anyway, that's not how things tend to go. Canterbury Tail   talk  22:21, 13 September 2016 (UTC)

 * This article is about the airport and needs to remain about the airport. No one is saying your references are wrong or there is not a planned development. It is simply very very questionable that such detail as you are promoting belongs in an article about the now closed airport more than is currently mentioned.  No one is or will stop you from creating a new article on the Stone Hill Park development proposal (so long as it meets the notability guidelines) - this existing article is not the place for such detail.  Andrewgprout (talk) 21:48, 13 September 2016 (UTC)

 * I have to say I find your protestations somewhat dubious given your level of re-edtiting of factual posts on the site, and the evidence in the edit history, but can only take your claim at face value Canterbury Tales.Real world sanity (talk) 22:44, 13 September 2016 (UTC)

 * AndrewGprout, I couldn;t disagree more. The current staus and correct name of the area that used to be Manston is of course relevant to the story of the airport and it's failure. The facts are that it is no longer an airport, and it's legal owners have chosen to rename the site, these are factual events, no matter how much you may dislike them. An article about the development I have no doubt will appear at some stage, and will no doubt mention that it's on the site of an ex airfield, as that is just as relevant as informing the reader that the site that used to be called Manston Airport is now called Stone Hill park. It's a current fact about the site, and of course should be included in a fact box that claims to actually have some facts in it. As it is now, the reader could be fooled into believing that it's still open, even down to the fact I notice that any attempt to strikethrough now defunct airport codes is re edited. If there is going to be a site about Manston Airport, it needs to be accurate, not what some would LIKE to be accurate Real world sanity (talk) 22:44, 13 September 2016 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Manston Airport. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20150402100618/http://www.caa.co.uk/default.aspx?catid=80&pagetype=88&sglid=3&fld=2014Annual to http://www.caa.co.uk/default.aspx?catid=80&pagetype=88&sglid=3&fld=2014Annual

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 05:42, 1 June 2017 (UTC)

title: Talk:Manston Airport


text:
User:Mintywalker

Experimenting with math notation

$$\sum_{n=0}^\infty \frac{x^n}{n!}$$

x1 x2 x3

x1 x2 x3 or x¹ x² x³

$$\sin x + \ln y$$ sinx + lny

$$\mathbf{x} = 0$$ x = 0

title: User:Mintywalker


text:
Rufio

Rufio was an American rock band from Rancho Cucamonga, California, United States, in 2000. They released four studio albums: Perhaps, I Suppose (2001); MCMLXXXV (2003); The Comfort of Home (2005); and Anybody Out There (2010).

History
Rufio was formed when bassist Jon Berry was a freshman in college and the other three members, Scott Sellers, Mike Jimenez, and Clark Domae were in high school. Sellers and Domae had been acquainted for some time and found a shared talent in the guitar. Sellers met Berry and they began playing together in various groups and sessions. Around the same time, the two purchased a 4-track to record the songs they were writing. After Berry and Sellers began recording, they asked Jimenez to listen to their recordings and play drums with them. Domae joined shortly after and completed the official lineup. The band took their name from the character Rufio, leader of the Lost Boys in the absence of Peter Pan in the 1991 film Hook.

Rufio released its debut record, Perhaps, I Suppose..., in 2001 on The Militia Group label. In November 2001, the band signed to Nitro Records. In November and December 2002, the band supported the Ataris on their headlining US tour. Rufio released their self-titled EP through Nitro on February 25, 2003. MCMLXXXV was released on June 17, 2003, which was recorded with producer Nick Raskulinecz. Rufio went on to play on the Warped Tour that summer. In November, the band went on a US tour with Less Than Jake. In April and May 2004, the band went on the headlining US tour, with support from Senses Fail, Autopilot Off, and Don't Look Down. The band's third album, The Comfort of Home, was released in July 2005. The band embarked on a tour that fall, with MxPx and Relient K.

In late January 2006, Berry and Jimenez left Rufio, citing creative differences. Following the loss of two members, the band pulled out of their tour with No Use for a Name. While no official statement had then been made regarding a breakup, in a 2006 interview, No Use for a Name acknowledged as much.

Since leaving Rufio, Jimenez formed a new band called Science Fiction Theater. Sellers and Domae started a band called BigCity.

On April 5, 2007, the band announced on their MySpace page that they were to play an official farewell show on June 1, 2007, at The Glass House in Pomona, California, followed by a South American tour. The statement in full read:

"Farewell show and South American tour.

well... it's been a while friends... and we've finally decided that its time to do an official farewell show with all the members of Rufio on June 1. We thought it would be a good way to show our appreciation to all our hometown friends and fans who have supported us from the very beginning. We figured the Glasshouse would be a very appropriate venue to host the show and we hope to see ALLLL of you there! we'll be playing a variety of songs, and even oldies we rarely play! It's going to be a sad night but it also means the birth of new projects and new music! We're also going down to South America in June for one last hoorah. we're very excited about this. there are some shows posted right now, and more will be posted later. we cant wait to party with you crazy South Americans! come party with us one last time! Love, Rufio."

However, the band played a few gigs in 2008, and on December 27, 2009, drummer Terry Stirling Jr. announced the release of an EP to be titled The Loneliest.

Rufio announced it was recording an album that was slated for release in the summer of 2010, followed by worldwide touring.

In October 2010, Domae announced that he was leaving the band to pursue other projects.

In a YouTube video released by Stirling Jr. in April 2011, he announced that he had left Rufio to pursue other endeavors. In July 2012, the band responded to a fan comment, stating that they were breaking up. Sellers has moved on from Rufio and was involved with the production and guest vocals for the band The Lost Boys Club, which continues on the part of Rufio being the leader of The Lost Boys.

The band announced that they would be playing a one-off reunion show on June 18, 2015, at the Montebello Amnesia Rockfest.

Former members
Musicians
 * Scott Sellers – lead vocals, rhythm guitar (2000–2007, 2010–2012, 2015)
 * Nathan Walker – drums (2007)
 * Terry Stirling Jr. – drums (2010–2011)
 * Clark Domae – lead guitar, backing vocals (2000–2006, 2010–2011, 2015)
 * Mike Jimenez – drums (2000–2006, 2015)
 * Jeremy Binion – lead guitar, backing vocals (2007)
 * Taylor Albaugh – bass, backing vocals (2010–2012, 2015)
 * Jon Berry – bass, backing vocals (2000–2007)

Timeline

Albums

 * Perhaps, I Suppose... (2001, The Militia Group)
 * MCMLXXXV (2003, Nitro Records)
 * The Comfort of Home (2005, Nitro Records)
 * Anybody Out There (2010, The Militia Group)

Singles and EPs

 * Rufio demo (2000)
 * Rufio EP (2003, Nitro Records)
 * Split with Over It (2007, Stab Me Recordings)
 * Above Me (2007)
 * The Loneliest EP (2010)

Appearances

 * This One's For Kansas City (2001, The Militia Group)
 * Fastmusic Punk Compilation 2001 (2001, Fastmusic)
 * Punk Goes Pop (2002, Fearless Records)
 * Punkzilla The Compilation (2002, Nitro Records)
 * Vans Off The Wall Volume V (2002, Vans Records)
 * Food Not Bombs (2002, Silent Records & Entertainment)
 * Unite For Peta (2002, NH-N Records)
 * Pop Punk Loves You (2002, Wynona Records)
 * Because We Care: A Benefit For The Children's Hospital of Orange County (2002, Glue Factory Records)
 * H20 Winter Classic (2002)
 * Prieva Verano 2002 Vive El Grupo De La Milicia (2002, The Militia Group)
 * Vans Warped Tour (2003 Tour Compilation) (2003, SideOneDummy Records)
 * CMJ New Music Monthly Volume 116 September 2003 (2003, College Music Journal)
 * The Cornerstone Player 047 (2003, Cornerstone Promotion)
 * Punk Vs. Emo (2003, Mindset Records)
 * Take Action!, Vol. 3 (2003, Sub City Records)
 * Hometaping Vol. 3: Come Out And Play (2003, Kerrang!)
 * Punk Goes Acoustic (2003, Fearless Records)
 * This Is Your Establishment (2003, Lorelei Records)
 * AMP Sampler Volume 3 (2003, Amp Magazine)
 * What'd You Expect For Free (Vol. 16) (2003, Skratch Magazine)
 * Caddy of the Year 3 (2003, Below Par Records)
 * A Less Than Jake Limited Tour EP (2003, Fueled by Ramen)
 * Hello, We Are The Militia Group - Volume 1 (2004, The Militia Group)
 * Take Action! Volume 04 (2004, Sub City Records)
 * Punkzilla JPN Nitro Records Compilation Vol. 1 (2004, Nitro Records)
 * Vans Warped Tour '05 (2005 Tour Compilation) (2005, SideOneDummy Records)
 * Punk Rawk Explosion #21 (2005, Punk Rawk)
 * Nitro Records Cheapskate Tour CD (2005, Nitro Records)
 * Amp Sampler Volume 15 (2005, Amp Magazine)
 * Punkzilla JPN Nitro Records Compilation Vol. 2 (2005, Nitro Records)
 * Rock Sound Volume 88 (2005, Rock Sound)
 * Punk Goes 80's (2005, Fearless Records)
 * Our Music Our Label (2005, The Militia Group)
 * Take Action! Volume 5 (2006, Sub City Records)
 * Think Punk #1 (2006, Rude Records)
 * Indiebox Compilation Vol. 1: Punk Rock Riot (2006, IndieBox Music)
 * Pop Punk Loves You 4 (2009, Wynona Records)
 * Music 4 Cancer: The Cause (2010, Arnold Media)
 * Dubsteppers For Haiti: Volume 5 (2012, Betamorph Recordings)
 * Nitro Records $1 Tour CD | Vol. 1 (Nitro Records)

title: Rufio


text:
Talk:Irlam

Living In Irlam
I live in Irlam, Cant Say i am too over the moon to live here but its where i call home. so who else live in Irlam. I think the page is in need or a refresh anyone agree?? --Gocartsforelephants 19:17, 3 December 2006 (UTC)

Feel free Gocartsforelephants!

Does anybody live in Irlam? Yes

Does anybody want to live in Irlam? Obviously....wouldn't want to live in CadiSHED though! HA!!

Irlam Hypermarket
What are your opinions on the hypermaket in irlam?

its massive! like man city

I prefrerd the old tesco's better.

i liked the chips and gravy in the old ones cafe

Tesco Extra
Should references be cited to back up the claim that Tesco is Irlam's popular attraction?

To Be compleatly honest, i live in Irlam and it has NO attractions

the fair comes to town now and again

Youth of today
"Irlam was once looked on as one of the safer areas of Salford but crime and vandalism have rocketed over the past few years. Some people blame "New Labour" but it is more likely that the general attitude of the youth of today is to blame." - any references to back this up? More of an opinion than fact! --- now removed

you do live in irlam right!? look around you!!!! theres a cctv camera on a large pole at the bottom of fiddlers lanes for a start!

Yes, I do live in Irlam and I see cctv cameras almost everywhere!

in other areas maybe! but irlam had a long history of being crime free virtually!

Early employment
This section seems muddled. What's it actually supposed to be talking about? The price of houses in Irlam? Is the Tesco's hypermarket a major employer in the area? Hardly seems to encyclopedic. ---- Eric 23:28, 4 April 2007 (UTC) Tesco are brilliant for the UK economy — Preceding unsigned comment added by 146.87.6.36 (talk) 15:28, 27 February 2013 (UTC)

Rewrite
This article needs a complete rewrite,I believe some of it is directly copied from the salford city council website and I believe the old article was better.Anyone else agree? Aspeas 11:57, 24 May 2007 (UTC)

 * Almost all of it was copied from the Salford City Council web site. So I've rewritten it, with information from additional sources. I don't know which old article you mean, but I think the current article is a good enough starting point for expansion. The Latham family for instance. What exactly were their contributions to the life of Irlam, and is there any substance to the claim that Thomas Latham played some kind of important role in bringing William of Orange to the throne? ---- Eric 21:55, 28 June 2007 (UTC)

Irlam Indians Roller Hockey Club
This site claims that Irlam Indians "recently retired", so I removed it from the Sports section. If anyone knows different, then please feel free to restore it. --Malleus Fatuarum 22:15, 14 July 2007 (UTC)

Irlam and Cadishead Ancestry
Anyone living in Irlam or Cadishead, or ex pats who are interested in local history, local genealogy or general discussions regarding Irlam and Cadishead, log onto "Irlam and Cadishead Ancestry" at  oldirlamvillage.atfreeforum.com and share photos, memories and  stories

Irlam also has a high school called irlam and cadishead community high school —Preceding unsigned comment added by Giovinazzo lover (talk • contribs) 16:17, 10 March 2009 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 2 external links on Irlam. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20061126174227/http://www.salford.gov.uk/living/yourcom/salfordlife/aboutsalford/salfordlocalhistory/localhistory-irlcadi.htm to http://www.salford.gov.uk/living/yourcom/salfordlife/aboutsalford/salfordlocalhistory/localhistory-irlcadi.htm
 * Corrected formatting/usage for http://www.manchesteronline.co.uk/ewm/newsletter/ewm324a.html

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 22:06, 14 April 2017 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Irlam. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20080512022809/http://www.citynoise.org/article/4343 to http://www.citynoise.org/article/4343

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 17:32, 16 November 2017 (UTC)

title: Talk:Irlam


text:
User:XXXvelvetXXX

XXXvelvetXXX's user page

title: User:XXXvelvetXXX


text:
User:Thechuck

Thechuck (musician)

Boston

BM, Trombone Performance (UNT 2006)

MM, Brass Performance and Pedagogy (Ohio University 2009)

DMA, Bass Trombone Performance (Rutgers University 2015)

title: User:Thechuck


text:
Wikipedia:Articles for deletion/Back in the day

Back in the day
was proposed for deletion. This page is an archive of the discussion about the proposed deletion. This page is no longer live. Further comments should be made on the article's talk page rather than here so that this page is preserved as an historic record. The result of the debate was

Unnotable band. --jpgordon{gab} 16:12, 24 Oct 2004 (UTC) This page is now preserved as an archive of the debate and, like other '/delete' pages is no longer 'live'. Subsequent comments on the issue, the deletion or on the decision-making process should be placed on the relevant 'live' pages. Please do not edit this page.
 * Delete. One EP and a demo is not notable. --LeeHunter 17:03, 24 Oct 2004 (UTC)
 * Delete, vanity. Why, when I was your age, we had to trudge ten miles through the snow to get our rock band deletions. Ian Pugh 19:32, 24 Oct 2004 (UTC)
 * Delete: Back in the day, Manchester had the finest punk bands around, and American bands imitated them, not the other way around. See what house music has done to the town that gave the world the Buzzcocks and Joy Division and, above all, Wire?  Having a demo and an ep will not make one encyclopedic. Geogre 05:02, 25 Oct 2004 (UTC)