text:
User:Satej.j9502/sandbox

== Matthew Steven LeBlanc == Matthew Steven LeBlanc was born July 25, 1967. He is an American actor and comedian. 1994–2004: Friends LeBlanc found success in the role of Joey Tribbiani on Friends, and went on to play this character for 12 years — 10 seasons of Friends and two seasons of Joey. Friends was wildly successful, and LeBlanc, along with his co-stars, gained wide recognition among viewers. This ensemble situation comedy became a major hit for NBC, airing on Thursday nights for ten years.

For his performance, LeBlanc received three Primetime Emmy Award nominations, three Golden Globe award nominations, and one Screen Actors Guild Award. During this time he also appeared in the films Lookin' Italian, Ed, Lost in Space, Charlie's Angels, and its sequel, Charlie's Angels: Full Throttle.

title: User:Satej.j9502/sandbox


text:
Wikipedia:Articles for deletion/List of Weebl and Bob cartoons (2nd nomination)

The result was delete. Tone 21:55, 25 August 2020 (UTC)

List of Weebl and Bob cartoons
AfDs for this article:
 * – ( View AfD View log  Stats )

Excessive, unsourced trivia about a borderline-notable web series. It's been correctly tagged as unsourced original research for over a decade. There's nothing that can be merged since none of it is referenced. Reyk YO! 12:51, 18 August 2020 (UTC)
 * Note: This discussion has been included in the list of Comics and animation-related deletion discussions. Shellwood (talk) 12:57, 18 August 2020 (UTC)
 * Note: This discussion has been included in the list of Lists-related deletion discussions. Shellwood (talk) 12:57, 18 August 2020 (UTC)

 * Delete - Lists of names and dates provide little context to the general reader. This is not a television series. It's just a bunch of nonsensical internet shorts. Adding summaries would be pointless given the subject matter, so there's no information actually worth cataloging. This is information for a fan wiki at best. Here, it's just a list for the sake of having a list. TTN (talk) 20:47, 18 August 2020 (UTC)
 * Delete. Fails WP:GNG. EverybodyEdits (talk) 03:46, 20 August 2020 (UTC)

source: wikimedia

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


text:
Message-Passing Interface

This guide assumes you have previous knowledge about C programming and will present you Message-Passing Interface (MPI) by several examples.

What is MPI ?
MPI is a standardized and portable message-passing system. Message-passing systems are used especially on distributed machines with separate memory for executing parallel applications. With this system, each executing process will communicate and share its data with others by sending and receiving messages. MPI is the specification resulting from the MPI-Forum which involved several organizations designing a portable system (that can allow programs to work on a heterogeneous network).

Since the data can only be shared by exchanging messages, this standard is not intended for use on shared-memory systems, like a multiprocessor computer (although it will work, it is not the primary goal and there are more powerful alternatives, for instance, OpenMP). Basically, MPI includes point-to-point communication, collective communication (over a network of processes), process groups, bindings for Fortran and C and other advanced functions. On the other hand, the standard does not specify explicit shared-memory operations, debugging facilities, explicit support for threads, I/O functions.

The current version is 2.0, although 1.1 is still used.

Documentation
The volume Using MPI: Portable Parallel Programming with the Message-Passing Interface by William Gropp, Ewing Lusk and Anthony Skjellum is recommended as an introduction to MPI. For more complete information, read MPI: The Complete Reference by Snir, Otto, Huss-Lederman, Walker and Dongarra. Also, the standard itself can be found at or. For other Internet references, such as tutorials, see the Open Directory Project or the List of Tutorials at the Argonne National Laboratory.

Implementation
Currently, there are two principal implementations: MPICH and LAM. The official web-site of the latter contains much information about LAM and also about MPI.

Supplementary library
Additionally libraries exist for solving numerical problem or for using I/O functions on a distributed machine. We can mention: the ScaLAPACK library, FFTW (a portable C FFT library), the PETSc Scientific Computing Libraries. A more complete list can be found on the site

Compilers
Each implementation provides a compiler or at least a front-end to an existing compiler.

Debugging
As MPI doesn't specify debugging facilities, some program can be used to this purpose: XMPI is a run/debug GUI for LAM/MPI; MPI-CHECK is a debugger for Fortran; Etnus, Inc. offers a version of the Totalview debugger that supports MPICH (as well as some other MPI implementations); and, Streamline Computing's Distributed Debugging Tool works with several MPI implementations, include MPICH and LAM/MPI.

Benchmarks
Mpptest, SKaMPI and MPBench measure the performance of MPI implementations. They can be used to decide what implementation to use, how to implement portable and efficient MPI programs and also for predicting the performance of MPI programs.

Famous and popular MPI benchmark includes NASA Parallel Benchmark, SpecMPI 2007 and HPCC benchmark suite.

Applications
It can be used on large heterogeneous parc.

Sum of an array
The point of this first simple example is to calculate the sum of all the value stored in an array. In C programming, the sequential version will be as below:

First version - Basic point-to-point communications
MPI implementations allow a user to launch several processes which will each have a defined numerical identifier, its rank. Conventionally, we will consider that the master is the process which has the rank '0'. All other processes are slaves. In this program, the master divides the array into sub-arrays and sends these to each slave. Each slave will then calculate the sum of its sub-array. In the case where the size of the array is not an even multiple of the number of slaves, the master will finish the remaining work by calculating the sum of the last values of the array (see figure below).

For each process, the source code of the program is identical and thus the executable code is, also. The code therefore must contain both the slave and the master parts. The part that will be executed depends on the rank of the process.

In this first version, the work is divided into just two parts:

This program will be explained step by step.

First, for using MPI functions, we must include the file  which contains the prototypes of the required functions. The size of the array is next defined by. and  will be used by the   and the   functions. Two prototypes of functions are declared. These functions contain the code for the master process and for the slave processes, respectively.

The main function chooses whether it should execute the master part (if the process rank is 0) or the slave part (for any other process rank.) The function begins with the  routine that must be called before any other MPI functions. This routine performs various initialization functions. Next, the rank of the process is obtained by calling the  function and, depending on the result, the master part or the slave part is executed. At the end of the computation, the final routine  is called. It performs various administrative tasks associated with ending the use of MPI.

Two declarations not found in the sequential version of the program are included in the master: the variable, which will store the result in each of the two slaves, and the   variable (whose type is defined by MPI), which is needed by the   function.

The computation part is now replaced by two calls to  and. The arguments of the  function are the address of the first element to send, the number of elements to send, their type (the more common MPI types are ,  ,  ,  , ...), the rank of the receiver, the tag of the message, and the communicator. In the simplest usage, the communicator would be, which includes all the processes sharing in the execution of the program. The arguments of the  function are the address of the receive buffer, the maximum number of elements to receive, their type, the rank of the sender, the tag of the message, communicator, and the status. For a common message, the type, the tag and the communicator must be the same (see figure below).

The first half of the array is sent to the first slave and the second half of the array is sent to the second. In each case, the size of the sub-array is. Next, the result is received from the slaves, stored, and added to the final sum.

Before it can receive the computed sums from the slaves, however, each slave must first sum the elements of the sub-array it has received from the master. The slave then sends the result back to the master.

When several messages are sent to the same process in an arbitrary order, the tag argument allow this process to distinguish between these messages and to receive them.

For execute this program with a lam implementation, the lam daemon must be started:

$ lamboot

Next, mpicc and mpirun are used for the compilation and the execution:

$ mpicc ./source.c $ mpirun -np 3 ./a.out

The option -np specifies the number of processes to launch. In this example, it must be three (one master, two slaves). The program  creates an MPI environment, copying   to all three processors and running each one with the appropriate processor number set.

Second version - Adaptiveness to the number of processes
This basic program has two problems:
 * The program needs two slaves for running correctly and cannot adapt it-self to the number of processes available
 * The master receives the data in a predefined order (the first slave and then the second). However the second slave can finish before the first

This leads to this second version:

For the first issue, the master needs the number of processes to determinate the size of the sub-array (which will be stored in the step variable). The  function gives this indication in the size variable, so   is divided by the number of slaves, namely   −1. The array is next sent to slave and while the slave will compute, the master will finish the work if it is necessary. It will then receive the result and add these to the final sum. For solving the second issue, the master will receive result from any source. This leads to the use of MPI_ANY_SOURCE in the  function in place of the rank of the process.

The slave does not need to know the number of processes but does the size of the sub-array that it has received. For this we will use the status argument. Actually, status is a structure that contains three data: the source of the message (useful if  is used), the tag of the message (if   is used), and the error code. Additionally, we can access to the real length of the received data by using the  function and the status argument. The count variable is the length of the sub-array.

This version of the program can be used with any number of processes, even 1. In this special case, the master will do all the calculations.

Unfortunately, this program is not adapted to MPI because, there is a lot of data transfer and a little computation. While MPI is designed for non-shared memory operation, there must be more computation than data transferring for losing the less possible time in message. We could improve this program by sending only the first number and the last to sum (and to add all integer between these), but in this case only geometric sum can be calculated.

Integration by the Simpson method
The purpose of this program is to calculate the integral of a given function by the Simpson method. This example is more adapting to MPI, because it requires more computation and less data-transferring than previously. The mathematical equation is:

$$\lim_{n\rightarrow\infty}\int_{a}^{b}f\left(x\right)dx=\frac{b-a}{3n}\left[f\left(x_{0}\right)+4f\left(x_{n-1}\right)+f\left(x_{n}\right)+2\sum_{k=1}^{\frac{n}{2}-1}\left[2f\left(x_{2k-1}\right)+f\left(x_{2k}\right)\right]\right]$$

In C programming, the sequential version is:

First version - User-defined type
The work to be done is a sum like in the precedent example (an array with different coefficient to each boxes). The work will be divided as shown in the figure below.

The sum is divided and calculated by the slave and the master calculate the other values and complete the work if necessary as before.

The domain of the sum will be sent to each slave and they will evaluate several return values of the function and sum these. The information that will be sent are the beginning of the sum (begin), the difference between each value (step) and the number of value for which the function must be evaluated (two double and one integer). However, the data send by the  routine must have the same type. Then, for minimizing the number of message to send and so for optimizing the program, a MPI type will be created and used for sending these data.

Generally, the data to send must be grouped and minimized for reducing the time wasted in communication (sending the minimum of message and with the minimum of data). So, two integer must be stored in a array and sent in a unique message rather than sent in two different messages.

Since the division of the work is faster than the work it-self, when a few processes are used, the master will wait a relatively long time for the result of the slaves. In this program, when there is less than a defined number of processes (LIMIT_PROC), the master will participate to the computation (namely, the work will be divided by the number of processes rather than the number of slave).

All the routine used for creating the MPI type are regrouped in the function Init_Type_Domain for simplifying the code. The function  is used for creating the new type and store it in Domain. This function need 5 arguments: the number of blocks that the new type will contain (in this case two doubles and one integer); the number of each elements of these blocks in an array (one double, another double and one integer); an array of the displacement of each block in the message; an array of these types; and, the address of the variable which will contain the structure. The displacement of each blocks is obtained by the use of the  function which give the length of a. It is the equivalent to the  function in C. The length of a MPI type is store in a   variable.

An other possibility would be to declare a structure that contains a array of two doubles and a integer:

Second version
Two different methods have been used for determining the number of operations that the slave must realize. In the first example, the slave use the status argument of the  function. In the second, this number was directly sent with the data. An other way is to obtain this by the same way that the master fixed this data, namely with the number of processes. For minimizing the quantity of data-transfer, we will use this last method (this version is just a optimization):

Product of a vector and a matrix
The point of this program is to calculate the product of a vector and a matrix. In C programming, the sequential version is:

First version - Broadcast
For parallelizing this program, the matrix will be divide by groups of lines and each part will be sent to a different slave while the vector will be sent to every slave (see figure below).

Sending the same data to each slave can be done by broadcasting these data with the  function which must be called by all the processes.

The  function requires fewer arguments than the   and the   functions. The  function requires the address of the buffer that contains or will contain the broadcasting data, the number of entries in the buffer, these type, the rank of the broadcast root (the process that will send the data) and the communicator. There are neither tag nor status arguments because they serve to differentiate messages and to give information about the receiving data and in this case, all processes are involved in the broadcast message (so, there is no need to differentiate message) and the information stored in status are known (the source is the broadcast root, the length is the number of entries and there is no tag).

When the master receive the data, it must reorder it because the order of receiving is not specified. For this purpose, the status structure contains the source of the message which is used for reordering and composing the vector.

In this example, the matrix is stored in a one-dimensional array in place of a conventional two-dimensinal array. It is possible to send a multi-dimensional array with MPI, but it must be carefully allocated. Namely, the array must be stored contiguously because the first argument of sent functions is the address of the starting buffer, and the second argument specifies the number of the following values that will be sent. Then the static and dynamic allocation are:

Second version - Scatter and gather
The MPI specification provides collective communication functions, and the  function is one of these. The next version of this program will use the "scatter" and "gather" functions which, respectively, send different data to everyone and receive different data from everyone (see figure below).

Thus, the work will be divided a little differently, namely, the master will also participate in the computation.

The call to the functions MPI_SCATTER and MPI_GATHER is the same for the master as for the slaves (emphasized arguments are ignored by the slaves). The arguments are:

Note that in the first case, the master sends data to itself and in the second, it receives data from itself. In this example, the matrix is divided by the number of processes and the master sends the first part to itself, the second part to the first slave, etc. Afterwards the master receives the first part of the resulting vector from itself, the second from the first slave, etc.

Cellular automata
In this example, we will code a cellular automata. A cellular automata is the evolution of a matrix on which we execute a defined function until there is convergence or cyclic phenomena. The function return a value for each point of the matrix depending of the value of his four neighbors. The border of the matrix will have the same value than the border of there opposite side. The resulting matrix will be a torus. In C programming, the sequential version is:

First version - Deadlock
The matrix will be divided by group of lines like in the figure [fig:vect]. For calculating the new part of the matrix, the functions applied need the values of points that belong to other parts of the matrix and then, each process will calculate the new matrix and exchange the first line and the last line with its two neighbors (see figure below).

While the processes share their data, a dead-lock can occur. A deadlock is a blocking state of a program due to the fact that one process is waiting for a specific action to be taken by another process, but the latter process is waiting for a specific action to be taken by the former process. This phenomena leads to a permanent waiting state (see figure below).

A deadlock can occur in this code because the MPI_SEND and MPI_RECV functions block the program until they are completed, namely, until the receiver receives the message sent or the sender sends the message to be received. If all the processes perform the same code (excluding the master), process one will send data to process two, process two will send data to process three, etc. Process one will wait until process two receives its data, but this will never happen because process two is also waiting until process three receives its data. Because the communication is cyclic, the program is blocked. As a first solution, we can change the order of sending and receiving on each even process.

In this example, the master and the slave have almost the same code, so it is not necessary to divide the code in two functions (the code specific to the master is simply be preceded by a condition on the rank).

While the master wait for data from the process 1, the process 1 send data to the master. Then it wait for data from the master while this one send data to its. The code will have the same behavior for all processes and thus is safe.

Second version - Non-blocking send and receive
A second solution is to use non-blocking send and receive: these functions are called and give immediately the hand to the process. Then, the process can make some computation and when the data of the message need to be accessed, it can completed it by calling some appropriate functions. Program using non-blocking communication functions can be faster. In this second version, all the functions will be completed just after that all send and all receive are begun.

In the previous example, the dimension of the matrix should be a multiple of the number of processes because the remaining lines were not send to any process. In this version, the master send these lines to the last process and receive the resulting line separately.

The MPI_Isend and the MPI_Irecv (I means immediate) functions need a supplementary argument: the address of a MPI_Request variable which will identify the request for a later completion. The status argument will be given to the completion functions. MPI_WAIT is used for complete the call to the previous functions (identified by the first argument) and will wait until the functions are effectively completed.

Third version - Sendrecv
The next version use a send-receive function: it is equivalent to call a send and a receive function in parallel. Only the while loop differ:

The MPI_SENDRECV function need arguments which are essentially the same that are required by the MPI_SEND and MPI_RECV functions.

Fourth version - Ring topology
This last version is radically different, in which that the topology used is a ring topology. A new matrix is calculated on the process 0 and then is sent to the process 1. After one iteration, this process send it to the process 2, which calculate the new matrix and send it again to the next process. The last process will return the matrix to the master and the cycle will continue until the number of iteration reach a defined constant (see figure below).

With this topology, several different data can be computed in the same time. Although in this example the operation applied on the data are the same, the processes can carry out different kinds of operation. Only one matrix will be sent in the ring. It is however possible (and it is the advantage of this structure) to send a second matrix just after.

The number of iterations is stored with the matrix, in an additional element. It will serve to determine when to stop the loop. When one process will reach the maximum number of iterations, the matrix will then be transferred on all the other processes. It is indeed necessary for stopping these properly because else, they will continue their loop and never stop.

The MPI_SENDRECV_REPLACE function is similar to the MPI_SENDRECV function, though it use the same buffer for sending and receiving the data.

Differentiation
This program will calculate the numerical value of the derivate of a functions in multiple points by using the finite elements method. The equation is: $$f''\left(x\right)=\lim_{h\rightarrow0}\frac{f\left(x+h\right)-f\left(x-h\right)}{2h}$$

However, it is numerically difficult to divide by 0 and h must not be chosen arbitrary (see figure below).

The optimal value of h is unknown and thus, the algorithm will decrease a started value of h until that the precision began to decrease (the difference between two derivate calculated with different h must decrease). In C programming, the sequential version is:

First version - Farming topology
Since the number of loop is variable, the time of execution cannot be predicted. This program send a derivate to calculate to each processes and when one have finish (not necessarily the first), he resend immediately data to this one. These data and the result are gathered into two arrays (deriv[] and result[]).

Second version - Completion of send and receive
The second topology illustrated looks like to a ring topology and introduce a new routine: MPI_REQUEST_FREE. The master will always send data to the process 1 and receive the result from any others processes (see figure below).

Since the code of the slave is similar to that of the cellular automata (in the version using a ring topology), only the master function will be described. For avoiding deadlock, only non-blocking send will be used (the non-blocking receive is used here for improving performance).

When the master finish to send enough data (for all processes), it execute a new loop. It receive a result and initialize a new data simultaneously and next, it complete the send of the data that lead to the result that it just receive and he resend in the ring a new data. Actually, if the master receive the result of a data, this means that the send of this data is completed and there is no need to complete the send. The MPI_REQUEST_FREE function allow to free a buffered request without checking when this request is logically completed.

Communicators and groups
The collective communications (like MPI_BCAST, MPI_SCATTER and MPI_GATHER) send data on the processes that belong to a same group. MPI provide functions for managing groups and communicators. This allows to use collective communications on specified processes and thus to divide a network into groups which can execute different task.

For example, different operations can occurred on a matrix (trace, transpose, inversion, diagonalizing). For each operations, a group will be defined and each processes will communicate with the other processes of its groups by using collective communication without disturbing other groups.

A communicator is a object which specifies a communication domain. It is associated to a group. A group is created from existing groups and the initial group is the group of the communicator MPI_COMM_WORLD which contains all processes.

First version - Creation of communicator from a group
The first method for creating new communicators is to create groups from this first group and then to create the communicators of these groups.

In this program, data are broadcast only on the even-ranked processes. This is achieved by creating a communicator which will contain the group of the even-ranked processes. First, the initial group of MPI_COMM_WORLD is given by the MPI_COMM_GROUP routine. The new created group contains the $$\frac{\left(size+1\right)}{2}$$ processes that have a even rank in the initial group. The MPI_GROUP_INCL function required an array of the ranks of the processes of the first group that will belong to the new group. Then, MPI_COMM_CREATE create the communicator of the new group and if the process have a odd rank, it participates to the broadcast. The group is free by MPI_GROUP_FREE.

The MPI_GROUP_SIZE and the MPI_COMM_RANK functions are similar to MPI_COMM_SIZE and MPI_GROUP_RANK. These last are just shortcut:

However, if the process that call MPI_GROUP_RANK don't belong to the group specified in argument to the function, the value return in rank will be MPI_UNDEFINED whereas a call to MPI_COMM_RANK will not work and will stop the program.

Second version - Creation of communicator from a communicator
One communicator can also be creating without using group, directly by splitting a existing communicator.

All the processes will be classified in a new communicator, depending of his color. Namely, if two processes have a color equal to 1 and one process have a color equal to 2, two communicators will be created, one for each groups. The third argument required by MPI_COMM_SPLIT is used for ordering the processes in the new communicator (this will change the rank of the new processes). Here, the same value is given for all processes.

Environmental management
Finally, environmental management functions exist for getting the name of the node on which a process run or for measuring the time taken by a part of a program (for example).

Other possibilities
There is many other functions that are not mentioned: there is different kinds of point-to-point communication functions; MPI allow user to define datatype by a lot of different functions; there is also other collective communication and reduction functions; and, more functions for using communicators and groups.

MPI defines many useful constant, among those,  ,  , ...

MPI can also be used in an advanced way for managing process topologies. Namely, the MPI implementation can exploit the specificity of a physical network (for heterogeneous network) by privileging for example the transfer of message on the fastest connection.

Prototype of basic functions
For more information on these MPI functions, report to the man page:

int MPI_Init(int *argc, char ***argv); int MPI_Finalize(void); int MPI_Comm_rank(MPI_Comm comm, int *rank); int MPI_Comm_size(MPI_Comm comm, int *size); int MPI_Send(void* buf, int count, MPI_Datatype datatype, int dest, int tag, MPI_Comm comm); int MPI_Recv(void* buf, int count, MPI_Datatype datatype, int source, int tag, MPI_Comm comm, MPI_Status *status); int MPI_Get_count(MPI_Status *status, MPI_Datatype datatype, int *count); int MPI_Type_extent(MPI_Datatype datatype, MPI_Aint *extent); int MPI_Type_struct(int count, int *array_of_blocklengths, MPI_Aint *array_of_displacements, MPI_Datatype *array_of_types, MPI_Datatype *newtype); int MPI_Bcast(void* buffer, int count, MPI_Datatype datatype, int root, MPI_Comm comm); int MPI_Scatter(void* sendbuf, int sendcount, MPI_Datatype sendtype, void* recvbuf, int recvcount, MPI_Datatype recvcount, int root, MPI_Comm comm); int MPI_Gather(void* sendbuf, int sendcount, MPI_Datatype sendype, void* recvbuf, int recvcount, MPI_Datatype recvtype, int root, MPI_Comm comm); int MPI_ISend(void* buf, int count, MPI_Datatype datatype, int dest, int tag, MPI_Comm comm, MPI_Request *request); int MPI_Irecv(void* buf, int count, MPI_Datatype datatype, int source, int tag, MPI_Comm comm, MPI_Request *request); int MPI_Sendrecv(void* sendbuf, int sendcount, MPI_Datatype datatype, int dest, int sendtag, void* recvbuf, int recvcount, MPI_Datatype recvtype, int source, int recvtag, MPI_Comm comm, MPI_Status *status); int MPI_Sendrecv_replace(void* buf, int count, MPI_Datatype datatype, int dest, int sendtag, int source, int recvtag, MPI_Comm comm, MPI_Status *status); int MPI_Wait(MPI_Request *request, MPI_Status *status); int MPI_Request_free(MPI_Request *request); int MPI_Group_rank(MPI_Group group, int *rank); int MPI_Group_size(MPI_Group group, int *size); int MPI_Comm_group(MPI_Comm comm, MPI_Group *group); int MPI_Group_free(MPI_Group *group); int MPI_Group_incl(MPI_Group *group, int n, int *ranks, MPI_Group *newgroup); int MPI_Comm_create(MPI_Comm comm, MPI_Group group, MPI_Comm *newgroup); int MPI_Comm_split(MPI_Comm comm, int color, int key, MPI_Comm *newcomm); int MPI_Wtime(void); int MPI_Get_processor_name(char *name, int *resultlen);

As usual in the C programming language, the "address of an array" is really the address of the first element of the array.

Prerequisites

 * knowledge about C programming: C programming language, Wikibooks:C Programming

title: Message-Passing Interface


text:
Category talk:Television journalists

Julie Chen isn't on this list. If you click "edit this page", the categories come up, but it's impossible to add a link to Wikipedia's page about her.

title: Category talk:Television journalists


text:
Talk:World History

http://en.wikibooks.org/wiki/World_History:An_Age_of_Empires_-_Rome%2C_Han_China%2C_and_the_Silk_Road has been split into two different chapters (The Roman Empire needs it's own chapter for sure) but the links are now broken. Planned Stages of Development
 * 1) Humble Beginnings- Intial exploratory action and structural plans Accomplished
 * 2) Operation: Blank Check- Finalization of structure and basic articles- See The Rise of Dictatorship and Totalitarianism for an example of the type of article completeness desired Current
 * 3) Exapand-a-lot- Addition of information concerning cultural, artistic, architectural, and societal conditions/achievements for cultures, especially noting the interactions between them, pointing out little known phenomen (i.e. North-South trade patterns are often ignored versus the ever-prevalent East-West trade)
 * 4) It's a fixer-upper- Error-proofing, addition of multiple-choice review to each article and to the entire project, addition of material and accuracy checking
 * 5) The Home Stretch- Final accuaracy checking, error-proofing, etc.
 * 6) Exit Stage-Left- The completion of the project and advertising- contacting AP World History teachers, the College Board, etc. and turning the project into a regular source of information to students, teachers, and interested persons

Old talk (pre-Standard change)

Oh what fun, I've now added a section the Weimar Republic (it seems appropriate here) tomorrow I'll spruce up ol' Mussolini and finish up Hitler. Then on to World War II! Oh, I think I'll tackle some ancient history tomorrow as well. But where to put the Great Depression? I guess it's own article is the way to go. And since I'm the only big contributor for a month...I am kind of giving myself free reign to take the reins (inline assonance intentional :-) of power for the time being. I think however, I will begin to aim for AP World History standards (I achieved a 5, so I will call myself well-qualified for the task) rather than the very regional California standards (although they provide an excellent baseline) I will give a week's notice before I unilaterally make the standards change. Please comment--Naryathegreat 04:13, 6 Nov 2004 (UTC)

So what'd I get done today? Let's see, I redid much of the structure of the historical contents page and moved some pages around. I added potential sections. I added info on the AP World History Standard. I added a disclaimers page and a Golden Rule, to help keep us on track. As soon as the Standard change is official, I'm taking the California standards out of the articles and will probably replace them with the appropriate AP World History Standard material. I redid ol' Mussolini and made the Maya something to be proud of, as well as restructuring the Precolumbian page. It now takes into account all the cultures likely you'll want to know about. You personally probably haven't heard of them, and I've got some more, if we get to that eventuality. I created World History 101, a clever introduction and explanation that should help streamline the process of getting FAQs out of the way. I mean it about rapid progression over the next month. I beleive by that time it will be at least half finished, and worthy of an "orange" two-block recognition. You deserve commendation for putting the project into place and giving it some initial vitality. But now, it's time to get moving, abandon the regional standard, and I pray, make it a good enough page that I'm not just always talking to thin air.--Naryathegreat 23:51, 6 Nov 2004 (UTC)

Okay, well, I'm back after my extended leave of abscence for personal reasons. Actually I've been back for a while but I just haven't done major edits. I added a large amount to the Roman Republic part of that article and I plan to add some more to other parts over the next few weeks. A few people have shown actual interest in helping now so I hope this project becomes further advanced. Thanks for you interst in our project if you're reading this! Also, I choose to stay with the AP World History Standard for now because whoever it was that was upset a few months back never turned up again or spoke to me personally so...Anwyway, if you want to help and don't know where to start, then drop me a line and I'll give you some starting places. We don't just need contributors-- we need proofreaders and reviewers too (reviewers check for consistency and smooth transition of ideas, all that sort of thing). I'd love your help!--Naryathegreat

Naming convention
Hi, I assembled the Top active list of Wikibooks. Unfortunately, World History does not follow any naming convention, so the contributions can not be attributed easily to a book. If somebody is still working on this book, please consider a consistent naming convention, so that all pages belonging to World History can be recognized by a computer script.

It is up to you to choose either World History World History:Ancient Civilizations

or the more modern version (since subpages have been activated on Wikibooks recently) World History World History/Ancient Civilizations

(subpages give additional navigational advantages, e.g. an automatic link to the parent page, etc.)

Logged in users can easily move pages by the "move" command. Thanks! --Andreas 06:09, 12 Mar 2005 (UTC)

Frustration
I'm dissapointed. A WikiProject entitled WORLD history turns out to be exclusivley HUMAN history. Were this a fair and balanced representation of the history of our species, I'd be satisfied. However, this project is culturally-one sided.

This project dismisses the first 99.5% of human history in 1 'chapter', less than 20 sentances. This summary effectivley throws out the overwhelming majority of the history of our species as trash: not worth writing about, not worth reading about, not worth learning about. More or less, this project makes this point:

"Around 10,000 years ago agriculture... effectivly started civilization and the begining of the nation-state."

Which implies:

"Nothing worthwhile happened until agriculture was developed 10,000 years ago"

and

"The initial 99% of the history of our species was spent building UP to our civilized state."

Honestley.

The 'history' book you are writing has been written before, in every text book across the globe. This in an opportunity to BREAK THE MOLD, and write a history of our species that does not dismiss "prehistory" as worthless. You guys are throwing this opportunity away.

 * Don't view this as the 'final essay'. If you have information to add--add it!  Wiki projects like this are ongoing and information is only available as people add it.  Obviously, there is an overwhelming amount of data that needs to be added.  So contact whatever history experts you know and have them insert the missing data!  Don't complain about it--fix it. That's what Wiki is all about.

 * To add on - If you honestly feel the need to have a difference in perspective, it would be beneficial to all for you to include it within the book's framework (or as a totally new wikibook). However, the standards that wikibooks should aspire to should still be maintained, especially with regards to facuality and NPOV.I do not believe the original author(s) intended this to be a totally biased POV article; it's just that, humans have only seen history from our own POV, and even then records of ancient times have been badly maintained if at all. Certainly if you have insights to the areas you mentioned, I believe wikibooks will welcome your contributions (within reasons, of course). Lynx7725 17:19, 21 Jun 2005 (UTC)

 * If you want anthropology, write and anthropology book. Don't get your shorts in a wad because you can't change definitions to suit your prejudices.  History is a record of HUMAN events, particularly human WRITTEN events. we need to make this like the U.S. history book

 * Isn't this supposed to be a HISTORY book? Pre-history is not history at all, and the first chapter really should be scrapped. It might be ok in a Science book, or anthropology, or mythology, or something--but the fact remains it's really not history! It can't be history unless we have written records.--Linesdata 17:54, 31 October 2007 (UTC)

First chapter on China started
I'm new to editing Wikibooks, but after reading some of them - specifically this one - and noticing missing content, I decided to do some personal research. As a result, I typed up "The Mythical Period" in Chapter 5: The First Chinese Dynasties. I'm not sure if it conforms to AP standards, but I hope it fits well. Thanks!

--Ccny930

Christian first chapter
How about having an optional first chapter that has origins from a Christian perspective, so that this can be developed as homeschoole friendly, and the instructor can choose which chapter to use.?

All Wiki's are written from a non buyist perspective and therefore the most scientific perspective (except for the buyist wikis of course) It would be extremely inappropiate to write a christian point of view because the bible states that the Earth is only  about 5000 years old. your best bet would be to come up with your own first chapter, skip it, or use an entirely different source of information.

I believe I can speak for a great number of people who would also find it totally unacceptable to write any history from a specifically Christian perspective. Does "homeschoole(sic)friendly" mean that children who are homeschooled are mostly being taught history, and other subjects, from a "Christian perspective?" Does this mean they are being sheltered from "non-Christian" education in public schools? If this is the case, I don't think you are going to find a great deal of "creationist" literature or other media on Wikibooks in Wikimedia, unless it is to explain creationism. I'm sure Wiki-people come from all backgrounds, but I believe we all agree that the scientific method is one construct of reality from which learning materials in "academic" topics are best oriented. Of course, I am not saying that religious topics should or would be kept out of Wikibooks or Wikimedia at all.

Brazil content
Brazilian History page up for deletion can you use it in this project? ChessCreator (talk) 16:53, 15 February 2008 (UTC)

Some remarks regarding structure of project
I notice that material regarding early chinese dynasties is duplicated in Ancient Civilisations and The First Chinese dynasties. Also the structure of Ancient Civilisations could do with some tidying up; The Hittites,Kassites and Assyrians should be moved into the Mesopotamian section as there is a clear linear sequence between these civilisations and events in southern Mesopotamia. Besides, should the Kassites be seen as an independent civilisation.

Material regarding the Persians should be moved from the Ancient Civilisations section and moved to the Greek Section where it is contemporaneous, (also alter the title of the Greek section as well to include Persians). The Persians signify the end of Mesopotamian dominance and therefore should not be included in that section, they are not as ancient as the New Babylonians.

I would like to contribute to this project but until the overall structure is decided upon, I don't know whether my work is duplicated or not, or whether it will be eventually deleted. I read a chapter on Mesopotamian history and made copious notes on the Amorites,Kassites,Hittites and Assyrians without realising the text had information on them at the end of the Ancient Civilisations section. I might add something at another time.

I hesitate on making the changes myself without some discussion beforehand.

Also see my remarks in the talk page of Ancient Civilisations.

Zfishwiki (talk) 18:19, 28 April 2010 (UTC)

anyone still here
if no one else seems to be active I have some big ideas which involve moving/creating/combing chapters and other large structural changes. I received a five on the AP exam myself and know a few of its secrets.

If their is no opposition I propose a new table of contents that i believe better fits AP standards and flows better
 * 1) Ancient civilizations
 * 2) Migrations and complications
 * 3) The Axial Age
 * 4) Greece and Persia
 * 5) Rome
 * 6) Classical Asia
 * 7) Islam
 * 8) Darkness in Europe
 * 9) The golden age of Asia
 * 10) Hemispheric interaction
 * 11) Mongols and aftermath
 * 12) The ancient Americas
 * 13) Empires of Gunpowder
 * 14) Global transformation: Early modern interactions
 * 15) The European transformation
 * 16) The Russian emergence
 * 17) Asia and Africa in transition
 * 18) The enlightenment  and revolution
 * 19) The revolution of everyday life, the industrial revolution
 * 20) The European world order
 * 21) The Japanese reaction
 * 22) Into the trench: World War one
 * 23) Depression and dictators
 * 24) The War of the world
 * 25) The cold war
 * 26) Latin America
 * 27) The African emergence
 * 28) The New Asia
 * 29) Globalization

Plagiarism
I was suspicious that large amounts of this were not original content I am right, copying and pasting random paragraphs of this book into google I found that most of them were cut and paste out of other books and never did a see a citation, therefore the majority of this book should be removed for copyright violations it seems.

Format of textbook
The entire format of the textbook is probably outdated and it doesn't match the 2016 AP World History course format. For example,other then Egypt, most of Africa doesn't play a big role in ancient river valley civilizations. The AP exam focuses much more on the Indus, Chinese, Egypt and Mesopotamia civilizations. But there is still an entire section about the African continent that was in the beginning of the textbook. So I will try to rearrange the sections to make it unanimous with the AP World History course format.RenaissanceMan2144 (discuss • contribs) 03:07, 7 December 2016 (UTC)

title: Talk:World History


text:
Talk:David Raven (footballer)

Youth International caps
I've removed David Raven's England U21 details as there appears to be no references to support this. Certainly, he's been capped at various youth international age-groups, so these have been updated. The 'best' source I can find is the Liverpool site which has a record of his National caps whilst on their books. http://www.liverweb.org.uk/intcaps.asp Obviously, theses details can again be amended if further confirmed statistics come to light. Woodlandscaley (talk) 12:12, 14 September 2014 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 2 one external links on David Raven (footballer). 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/20110719122212/http://www.tranmererovers.co.uk:80/page/NewsDetail/0,,10365~2394019,00.html to http://www.tranmererovers.co.uk/page/NewsDetail/0,,10365~2394019,00.html?
 * Added archive https://web.archive.org/web/20120511045214/http://www.tranmererovers.co.uk/page/NewsDetail/0,,10365~2762894,00.html to http://www.tranmererovers.co.uk/page/NewsDetail/0,,10365~2762894,00.html

Cheers.— InternetArchiveBot  (Report bug) 09:57, 8 December 2016 (UTC)

A Commons file used on this page has been nominated for speedy deletion
The following Wikimedia Commons file used on this page has been nominated for speedy deletion: You can see the reason for deletion at the file description page linked above. —Community Tech bot (talk) 22:37, 18 March 2019 (UTC)
 * David Raven ICT.jpg

title: Talk:David Raven (footballer)


text:
Talk:Richard Masters (football executive)

Richard Masters Picture
Not really sure why this image was removed from the article. It's fair use for the reasons I explained on the image's description page, and there haven't been any disputes of this on the image's talk page.

I agree a free use image would be ideal, but having spent many hours searching for one, this image is the only available option for this article. Dandy Andy 920 (talk) 21:52, 8 February 2021 (UTC)

Promotional content
I have removed several paras concerning NUFC and Covid (here and here) as they were were irrelevant to the subject or excessively detailed in describing the favourable achievements/acts of the subject. The weighting came off as promotional and potentially violated WP:NPOV. Solipsism 101 (talk) 19:21, 3 August 2021 (UTC)


text:
Talk:Dawn Primarolo

Bristol Wiki Meetup
You are invited to the Bristol Wiki Meetup which will take place at The Commercial Rooms, 43-45 Corn Street, Bristol BS1 1HT on Sunday 28 July 2013 from 1.00 pm. If you have never been to one, this is an opportunity to meet other Wikipedians in an informal atmosphere for Wiki and non-Wiki related chat and for beer or food if you like. Experienced and new contributors are all welcome. This event is definitely not restricted just to discussion of Bristol topics. Bring your laptop if you like and use the free Wifi or just bring yourself. Even better, bring a friend! Click the link for full details. Looking forward to seeing you. Philafrenzy (talk) 11:30, 20 June 2013 (UTC)

External links modified
Hello fellow Wikipedians,

I have just added archive links to 3 one external links on Dawn Primarolo. 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/20090301203342/http://politics.guardian.co.uk:80/person/0,,-4266,00.html to http://politics.guardian.co.uk/person/0,,-4266,00.html
 * Added archive https://web.archive.org/20070407044356/http://www.citizensadvice.org.uk:80/index/pressoffice/press_index/press-050622.htm to http://www.citizensadvice.org.uk/index/pressoffice/press_index/press-050622.htm
 * Added archive https://web.archive.org/20100821070328/http://timesonline.typepad.com:80/comment/2010/06/heres-a-candidate--the-search-for-labours-worst-minister-might-lead-one-to-look-only-among-those-forced-out-of-office-or-dro.html to http://timesonline.typepad.com/comment/2010/06/heres-a-candidate--the-search-for-labours-worst-minister-might-lead-one-to-look-only-among-those-forced-out-of-office-or-dro.html

Cheers. —cyberbot II  Talk to my owner :Online 01:49, 19 October 2015 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 2 external links on Dawn Primarolo. 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/20101008003706/http://www.thisisbristol.co.uk/news/Blair-Cherie-shouldn-t-bought-city-flats/article-2597751-detail/article.html to http://www.thisisbristol.co.uk/news/Blair-Cherie-shouldn-t-bought-city-flats/article-2597751-detail/article.html
 * Added archive https://web.archive.org/web/20111112163406/http://www.thisisbristol.co.uk/Bristol-South-MP-Dawn-Primarolo-stand-2015/story-13818490-detail/story.html to http://www.thisisbristol.co.uk/Bristol-South-MP-Dawn-Primarolo-stand-2015/story-13818490-detail/story.html

Cheers.— InternetArchiveBot  (Report bug) 10:31, 11 December 2017 (UTC)

Life peerages & infoboxes
Please do come along and discuss at: Wikipedia talk:WikiProject Politics of the United Kingdom DBD 18:54, 13 April 2018 (UTC)

title: Talk:Dawn Primarolo


text:
Incarnate (The Obsessed album)

Incarnate is a compilation album by American doom metal band The Obsessed. It consists of tracks taken from a number of rare and unreleased sources, namely their Sodden Jackal and Altamont Nation 7"s, the Hellhound Records What the Hell! compilation, and some unreleased demos. There are also two cover songs -- "On the Hunt" (originally by Lynyrd Skynyrd) and "Inside-Looking Out" (originally by The Animals and later covered by Grand Funk Railroad). The track "Streetside" is a video clip.

The album was re-released on double vinyl, digipak CD and digital by Blues Funeral Recordings on October 23, 2020, as part of Record Store Day. All formats included two bonus tracks, demos of "No Blame" and "Neatz Brigade", the final versions of which appeared on the Lunar Womb and The Church Within albums respectively.

Track listing

 * 1) "Yen Sleep" – 4:26
 * 2) "Concrete Cancer" – 3:05
 * 3) "Peckerwood Stomp" – 2:12
 * 4) "Inside-Looking Out" (John Avery Lomax, Alan Lomax, Eric Burdon, Chas Chandler) – 6:17
 * 5) "Mental Kingdom" – 2:55
 * 6) "Sodden Jackal" – 4:15
 * 7) "Iron & Stone" – 2:58
 * 8) "Indestroy" – 1:29
 * 9) "Streetside" – 4:24
 * 10) "Mourning" – 3:54
 * 11) "Spirit Caravan" – 3:09
 * 12) "Skybone" – 4:09
 * 13) "On the Hunt" (Allen Collins, Ronnie Van Zant) – 5:00
 * 14) "River of Soul" (live) – 4:30
 * 15) "Climate of Despair" – 3:04
 * 16) "Decimation" – 4:18
 * 17) "Fears Machine" – 3:40
 * 18) "Field of Hours" – 8:09
 * 19) "Streetside" (video) – 7:32

Personnel

 * Scott Weinrich – vocals, guitar
 * Scott Reeder – bass
 * Guy Pinhas – bass
 * Greg Rogers – drums
 * Mark Laue – bass
 * Dale Crover – drums, background vocals
 * Ed Gulli – drums

title: Incarnate (The Obsessed album)


text:
List of compositions by Kaija Saariaho

This is a list of compositions by the composer Kaija Saariaho.

Saariaho's compositions were published by Chester Music and Edition Wilhelm Hansen.

title: List of compositions by Kaija Saariaho


text:
Frioul archipelago

The Frioul archipelago is a group of four islands located off the Mediterranean coast of France, approximately 4 km from Marseille. The islands of the archipelago cover a total land area of approximately 200 hectares. According to the 2015 census, the population was 146.

The islands of Pomègues and Ratonneau are connected by a mole, Digue de Berry, built in 1822.

title: Frioul archipelago


text:
Bodil Special Award

The Bodil Special Award (Sær-Bodil, Special Bodil) is one of the awards at the annual Bodil Awards presented by the Danish Film Critics Association. While the Bodil Awards as such were established in 1948, the Special Award was first presented in 2008, and has been given annually to a person or an organization who has done something special for Danish cinema.

Recipients

 * 2008: Ghost Digital Production House for the effects in Island of Lost Souls
 * 2009: Kåre Bjerkø for the score to What No One Knows, Terribly Happy, and Little Soldier (film)
 * 2010: Kristian Eidnes Andersen for sound design in Antichrist
 * 2011: Tobias Lindholm for the scripts for R and Submarino
 * 2012: Distributor Jes Graversen from Miracle Film
 * 2013: Joshua Oppenheimer for the hybrid film The Act of Killing
 * 2014: Copenhagen International Documentary Festival headed by Tine Fischer
 * 2015: Molly Malene Stensgaard, film editor, for editing Nymphomaniac and Nymphomaniac Director's Cut
 * 2016: Tonmeister Peter Albrechtsen
 * 2017: Christina Rosendahl for her film work as chairman of the Danish Film Directors
 * 2018: The Animation Workshop, Copenhagen Bombay, and VOID – International Animation Film Festival
 * 2019: Translator Henrik Thøgersen
 * 2020: Stumfilm.dk, the silent movie streaming service of the Danish Film Institute
 * 2021: Director and Producer Katja Adomeit for her innovation and for bringing New Zealander Daniel Borgman, Swedish Anna Eborn, Afghan Shahrbanoo Sadat, and Danish Annika Berg to light.

title: Bodil Special Award


text:
Handbook of Descriptive Statistics/Measures of Statistical Variability/Variance

Description

 * Brief description of what it is and what its used for.
 * Mathematical formula
 * Link to a Wikipedia article on it.

Usages
Describe in detail here data sets and purposes on which it is most useful. Describe also data sets for which it may give misleading results.

Distributions

 * Include standard values for common distributions, if they exist. For example, a normal distribution always has a skew and kurtosis of zero.
 * Include standard error for normal distribution, and for other distributions also if possible.
 * Sampling distribution.

Calculation
A formula for calculating the variance σ2 of a population of size N is:
 * $$\sigma^2 = \frac 1N \sum_{i=1}^N (x_i - \mu)^2 = \frac 1N\sum_{i=1}^N x_i^2 - \mu^2 $$

Where:

 * $$\mu = \frac 1N \sum_{i=1}^N x_i$$

stands for the population mean.

A formula for calculating the sample variance s2, the unbiased estimation of the population variance, from a sample of size n, is:
 * $$s^2 = \frac 1{n-1} \sum_{i=1}^n (x_i - \bar{x})^2 = \frac {\sum_{i=1}^n x_i^2 - n \bar{x}^2}{n-1}$$

Where:

 * $$\bar{x} = \frac 1n \sum_{i=1}^n x_i$$

stands for the sample mean.

Algorithm
Therefore a simple algorithm to calculate variance can be described by the following pseudocode: double sum; double sum_sqr; double variance; long n = data.length; // the number of elements in the data array (the actual syntax is language-specific)

for i = 0 to n sum += data[i]; sum_sqr += ( data[i] * data[i] ); end for

variance = ((n * sum_sqr) - (sum * sum))/(n*(n-1));

Algorithm
Another algorithm which avoids large numbers in sum_sqr while summing up double avg; double var; long n = data.length; // number of elements

for i = 0 to n avg = (avg*i + data[i]) / (i + 1); if (i > 0) var += (var * (i - 1) + (data[i] - avg)*(data[i] - avg)) / i; end for

return var; // resulting variance

Another Algorithm
'corrected two pass algorithm' of Chan, Golub, Leveque (American Statistician, 1983, page 242): avg=0 for all i  avg=avg+data[i] end for avg=avg/n

sum=0 sum2=0 for all i   sum2=sum2+(data[i]-avg)^2 sum=sum+(data[i]-avg) end for var=(sum2-sum/n)/(n-1)

return var

Analysis of Algorithms
It is important, when dealing with large data sets or large numbers, on computers, to choose an algorithm which minimizes error due to approximate calculations by the computer. Merge in below discussion of the above algorithms.

It is actually the first formula that has precision problems when dealing with limited-precision arithmetic. If the difference between measurements and the mean is very small, then the first formula will yield precision problems, as information will be lost in the (xi - µ) operation. There is no such loss of significance in the intermediate operations of the second formula.

In fact, the second formula is the one more commonly beset with problems. The first can have problems when the mean is very large relative to the variance, but this is relatively rare in practice and this problem also affects the second formula. Much more common is the situation where you have comparable mean and variance and a very large number of observations. In this case, the second formula will result in the subtraction of two very large numbers whose difference is relatively small (by a factor roughly equal to the number of observations). If you have one million observations, you lose roughly six significant figures with the second formula if you use ordinary floating point arithmetic.

The problem may occur To be precise we have to specify the instrument and the nature of the data.
 * 1) when the deviations are very small relative to the mean or
 * 2) when they are small relative to the representational capacity of the arithmetic instrument (floating point computer, fixed point calculator, paper and pencil).

What do you mean by ordinary floating point arithmetic? Are talking about precision with respect to register width, or is there an implicit reference to some "non-ordinary" scheme, that is, non-IEEE? Thanks. I thought the reference was pretty explicit. I didn't mean, however, to imply the use of non-standard but still floating point arithmetic. I had in mind systems that were entirely different. A simple example is a system that uses rationals based on unlimited precision integers. Another system might be fixed point arithmetic. The first would not lose precision in the computation while the second would lose more or less precision than I quote depending on the values in question and the characteristics of the fixed point system. You could also imagine an optimizer that noted that you might be adding up large numbers of very small numbers and would re-order the addition to avoid most of the round-off error by using log N temporary values to perform the addition.

Software
Include how it is accessed in common statistical packages, if known. Can also provide links to source code samples for calculating it, etc.


text:
Interlopers (novel)

Interlopers is a 2001 science fiction novel by American writer Alan Dean Foster. The story centers on Cody Westcott, a young archaeologist, who returns from a dig at Apachetarimac having studied the Chachapoyansthat race. In an attempt to reconstruct an ancient potion whose ingredients he discovers in the dig, his friend is murdered and he ends up drinking the only sample. He discovers that he can "see" strange creatures inhabiting the world, and that these creatures harm humans and cause feelings of hate and anger upon which they feed and multiply. These "Interlopers" or "Those Who Abide" also realize he can see them at the same time, and begin to conspire against him in order to stop his interruption of their feeding. They go so far as infesting his wife with numerous powerful Interlopers, and Cody must ally with an ancient society and visit several sites of mythical power in order to free her and bring a halt to the Interlopers' plans.

Interlopers has also been produced as an audio book, released on CD in November 2004 by Buzzy Multimedia, in an unabridged edition narrated by Ben Browder.

Reception
Don D'Amassa, in his review for Science Fiction Chronicle said "I've enjoyed almost every book I've ever read by Foster, so I sat down with this new one expecting an enjoyable read. For a while, it was exactly that, but then the internal logic of the story just fell apart for me."

title: Interlopers (novel)


text:
Talk:David Adams Richards

Senate
WUT?! Bearcat (talk) 16:42, 30 August 2017 (UTC)
 * CBC says "the Fredericton-based author was chosen by the prime minister's new independent, merit-based appointments process, which was set up shortly after the Liberal government took office." I suppose this is better than having Duffy appointed to the Senate. sikander (talk) 18:23, 31 August 2017 (UTC)
 * I got that, I'm just surprised is all. Yeah, it's definitely better than Duffy — but it's still not something I would have expected to happen. Bearcat (talk) 20:11, 31 August 2017 (UTC)

title: Talk:David Adams Richards


text:
Wikipedia:Articles for deletion/M&A Today

The result was delete. Tone 08:19, 25 August 2020 (UTC)

M&A Today

 * – ( View AfD View log  Stats )

Promo for a journal whose only function is promo. Redirect to M&A Source would be of dubious value since I'm not convinced that's notable either. AleatoryPonderings (talk) 03:37, 18 August 2020 (UTC)
 * Note: This discussion has been included in the list of News media-related deletion discussions. AleatoryPonderings (talk) 03:37, 18 August 2020 (UTC)
 * Note: This discussion has been included in the list of Business-related deletion discussions. AleatoryPonderings (talk) 03:37, 18 August 2020 (UTC)

 * Delete: Obviously promotional. Aasim 05:38, 18 August 2020 (UTC)
 * Delete, promotional, as above. Third reference is a dead link. --Whiteguru (talk) 08:04, 18 August 2020 (UTC)
 * Delete the article seems to be promotional and lacks the multiple in-depth reliable secondary sources that it would need to be notable. --Adamant1 (talk) 11:33, 18 August 2020 (UTC)


text:
Toophan

The Toophan ( "typhoon", rarely Toofan) is an Iranian SACLOS anti-tank guided missile reverse-engineered from the American BGM-71 TOW missile. The Toophan 1, an unlicensed copy of the BGM-71A TOW missile, began mass production in 1988 and the Toophan 2, a BGM-71C ITOW variant, was publicly shown in 2000.

The Toophan comes in at least 11 variants, many of which are poorly documented, including variants with laser guidance, thermobaric warheads, and tandem-warheads with increased penetration. The Toophan is manufactured jointly by the Aerospace Industries Organization of Iran and Iran Electronics Industries.

It is normally deployed from ground-based tripods, but can also be mounted on fighting vehicles and helicopters. Like the BGM-71 TOW missile, the Toophan is a large, rugged, powerful, and reliable anti-tank guided missile deployed by small teams against tanks, armored vehicles, buildings, and other targets. The Toophan forms the backbone of the Iranian Armed Forces' ATGM inventory and is procured in large quantities in a variety of variants.

The Toophan has been exported to the governments of Iraq and Syria and to a large number of non-state actors in the Middle East, and has been used in the Iran–Iraq War, the 2006 Lebanon War and the Iraqi, Syrian, and Yemeni Civil Wars.

Development
Iran was among the earliest countries to import the TOW missile, as far back as 1971. Extensive repair and assembly facilities were set up at the Iran Electronics Industries (IEI) by the Texas-based Emerson Energy Systems, as well as Hughes Missile Systems, to repair TOW and FGM-77A Dragon missiles.

In May 1975, negotiations between Iran and Hughes Missile Systems on co-production of TOW and AGM-65 Maverick missiles stalled over disagreements in the pricing structure. Hughes set the royalty and initial investment costs for Iran at $20 million for the TOW and $25 million for the Maverick. The subsequent Iranian Revolution in 1979 ended all plans for such co-production.

The Iran–Iraq war lead to Iran having an acute need for anti-tank guided missiles to counter Iraq's massive armored formations, leading Iran to import thousands more TOW missiles, as well as Soviet AT-3 Sagger ATGMs. Attempts at local production of both systems began in the first half of the war, with the TOW missile being prioritized due to its better performance. The earliest prototype version was ready in mid-1985, but performance was disappointing compared to Iran's US-made TOW missiles, which received widespread praise in Iran at the time. Following about a year and a half more of R&D work, the Toophan was tested against Iraqi tanks and showed better performance. The missile was shown on an Iranian TV show on March 21, 1987, and production of what would be named the Toophan 1 began by early 1988. R&D and production work continued through the 1990s. The missile was not publicly revealed until 2000, when the Toophan 1 and Toophan 2 were publicly unveiled at the same time. The Toophan has since become Iran's primary anti-tank guided missile. In addition to Toophan missiles, Iran also produces reverse engineered tripod launchers, guidance sets, and storage boxes, all of which bear the Toophan name. Toophan missiles can be fired from TOW launchers, and their components are generally interchangeable. A number of sources say that the Toophan's quality is inferior to that of original American-made TOW missiles, but is still robustly capable.

In 2014 Iran showed a Toophan/TOW simulator they built for helicopter-launched missiles. In a December 2016 military exercise Iran used the missile against naval targets. In 2018 Iran showed off thermal-sights which can be used with the Toophan. The Toophan can be mounted on Boragh APCs, ATVs, or Safir jeeps. Toophan missiles can be repaired by Iran's Shiraz Electronics Industries.

The Toophan was later developed into the Sadid-1, an ambitious project to build a competitor to the Israeli Spike-ER fire-and-forget missile for attack helicopters and drones. The Sadid-1 had limited success, but was used to develop the successful Sadid-345 glide bomb, which in turn spun off a smaller counterpart, the Qaem air-to-ground munition.

In 2018, it's reported that the Toophan can have the “RU244TK” and “RU150TK” thermal imaging cameras attached.

Iran–Iraq War
Prototype versions of the Toophan-1 were used in the tail end of the Iran–Iraq War.

2006 Lebanon War
Hezbollah received Toophan missiles in the early 2000s and used them against Israeli Merkava tanks and other vehicles during the 2006 Lebanon War.

Syrian Civil War
The Toophan missile has seen extensive use in the Syrian Civil War. Hezbollah has used Toophan missiles in the war and is one of the missile's most prominent users. The missiles have also been provided to the Syrian Army and Iranian-backed Shiite militias in Syria. Toophan missiles first appeared in Syria reportedly in October 2015. Overall the Toophan missile's use in Syria is poorly documented, but Toophan-1 missiles seem to be the most common. Furthermore, the Kurdish YPG militia has used Toophan 1 missiles as well. The missiles have since proliferated to a wide range of non-state actors operating in Syria. In addition, Toophan missiles have been captured by groups fighting the Syrian government, including ISIS and al-Nusra.

Iraqi Civil War
The first known Iraqi group to receive Toophans was Asaib-Ahl-Al-Haq in 2014. The Badr Organization obtained Toophans in 2015 and the Toophan has since been provided to other Shiite militias organized under the Popular Mobilization Units. Iraq's Federal Police have also been delivered Toophans.

Yemen Civil War
Iran has shipped Toophan missiles to the Houthis in Yemen as well, where they have been used in combat. The first video of Houthis using a Toophan missile was published in November 2018.

Identification

Given that the Toophan is reverse-engineered from the US TOW missile, the identification of Toophan missiles versus TOW missiles is difficult. The Toophan ATGM is very similar to the American BGM-71 TOW ATGM from which it is reverse-engineered. Toophan missiles, launchers, control units, and crates are essentially interchangeable with their American counterparts and are regularly mixed together. The many variations of TOW and Toophan missiles also poses challenges.

Toophan missiles can often be identified by their turquoise bands installed by Iran's Defense Industries Organization or by a faint black band on the rear end of the launcher. Toophan missiles, on their packaging, are instead labeled as TOW missiles; for example a Toophan 2M is labeled as a "TOW 2M".

Modern TOW tripods have black rings, while Toophan tripods have yellow rings. Internally, Toophan missiles have different screw placement and cylindrical launch motor nozzles.

Operators

 * Islamic Revolutionary Guard Corps
 * Iranian Army
 * Ground Forces
 * Syrian Arab Army
 * YPG
 * Popular Mobilization Units
 * Palestine
 * Al-Quds Brigades
 * Houthis
 * 🇱🇧 Lebanon
 * Hezbollah
 * Houthis
 * 🇱🇧 Lebanon
 * Hezbollah
 * Hezbollah

title: Toophan


text:
The Revival (film)

The Revival is a 2017 American romantic drama film directed by Jennifer Gerber, written by Samuel Brett Williams and starring Zachary Booth, David Rysdahl, Stephen Ellis, and Lucy Faust. The plot follows a secret love affair between a southern Baptist preacher and a young drifter that challenges the equilibrium of a growing church.

Plot
Eli, a preacher in Hot Springs, Arkansas who inherited his father's Baptist church after his death, has watched the once thriving congregation and church's funds dwindle down to nearly nothing. Emmanuel Baptist, the competing church in Hot Springs, boasts high congregation numbers and the minister, “Brother Aaron”, even has his sermons broadcast on the local radio. After Eli's sermon one service, he notices a drifter, Daniel, in attendance for the church's free pot-luck afterwards. Eli introduces himself and his pregnant wife June to Daniel. Daniel is initially standoffish and abruptly leaves when Eli does not offer him a place to stay after he asks.

Eli's friend Trevor invites him to go hunting. He tells Eli that the congregation have been talking about replacing him with a different pastor. Trevor has invited the Southern Baptist Board of Churches to what he calls the Revival, a church service they will sell tickets to with food, singing, dancing, and plenty of evangelical preaching from Eli and Eli reluctantly accepts. Later, Eli finds Daniel waiting outside the church because he is hungry and invites him in. In Eli's office, Daniel opens up to him when Eli offers his own lunch to him. Daniel notices a Marcel Proust collection on a bookshelf and the two men connect over the author. When Daniel's finished eating, Eli brings Daniel to his father's cabin in the woods—a place Eli's father kept secret as a way to deal with Eli's alcoholic mother's erratic behavior (before she also died) away from the eyes of the city and his parish. Eli cleans and re-bandages a wound on Daniel's hand when he embraces Eli and the two almost kiss before Eli leaves.

The next day, another parishioner, Jimmy, visits Eli at his office because he is feeling sexually attracted to his cousin, Missy. Eli does little to help Jimmy, but listens to him. Meanwhile, Daniel buys ingredients to make meth. Trevor invites Eli over for a meal to discuss the Revival. He reveals that Brother Aaron has been doctoring his attendance records and the Southern Baptist Board will be removing him from his position at Emmanuel Baptist. In the meantime, the church's congregation will need somewhere to go and Trevor convinces Eli to try to bring them to the Revival. Over their meal, it is also revealed that Trevor is a recovering alcoholic, nearly a year sober. That night, Eli brings Daniel more food and they eventually have a sexual encounter, Eli accidentally spending the night. Upon returning home, June is upset but Eli appeases her when he washes her feet, although she is aware of his happy attitude. At his office, Eli is again visited by Jimmy about his feelings for his cousin, which Eli advises him against. June hosts a luncheon prayer circle with the women in the congregation and at the cabin, Daniel cooks meth. That night, Eli's visit to the cabin again lasts late into the night and he and Daniel have sex, but Eli returns home.

Trevor books Eli a radio interview to promote the Revival and he makes an impassioned statement. That night, June confronts him with an exposing picture of Daniel and Eli together and they fight. The next day, Daniel throws away the meth he cooked after Eli implored him to stop, Jimmy watches Missy at her job, and Trevor struggles with his sobriety, while parenting his daughter, who he recently gained custody over. At the cabin that night, Eli tries ending things with Daniel, who confesses his feelings for Eli, but Eli leaves. In his next sermon, Eli begins to utilize more flamboyant, evangelical preaching methods and is finally able to excite his congregation until Daniel shows up and confesses his homosexuality in front of them. Eli takes the opportunity to “heal” Daniel with a blessing in front of the parishioners and Daniel plays along. After the sermon, Eli drives Daniel to the cabin, insisting he pack up and leave but Daniel refuses. Eli returns home where he learns the “healing” has caused the Revival to sell out. June reveals that she took the photo of Eli. He tells June that Daniel will not leave so she tells Eli she is going to “clean up his mess”.

Eli drinks heavily and wanders the town drunk, eventually ending up at the church. June goes to the cabin and first threatens Daniel with an allegory, but he still refuses to leave. She exits the cabin as Trevor enters. He beats Daniel unconscious and hogties him. He has Jimmy watch Daniel, telling him they will put him on the next bus out of the city, and leaves. Eli decides to leave the church and go to the cabin, heavily intoxicated. He hits a deer but eventually arrives at the cabin finding the brutalized, barely conscious Daniel and tells Jimmy to leave. Eli lights some newspaper on fire and uses it to burn the cabin down with Daniel inside. As church choir music swells, he watches the cabin burn from his car, Trevor drinks from a whisky bottle and sobs at home, looking over his daughter, and Jimmy finally has sex with Missy. Later, Eli sits on the church stage as an enthusiastic Baptist choir performs for a completely full congregation. When they finish, Eli walks to the pulpit to begin his Revival sermon.

Cast

 * David Rysdahl as Eli
 * Zachary Booth as Daniel
 * Raymond McAnally as Trevor
 * Lucy Faust as June
 * Stephen Ellis as Jimmy
 * Vivian Norman as Miss Martha
 * Kathleen Suit as Missy
 * Josh Williams as Radio Host
 * David Carl as Radio Preacher (Brother Aaron)

Critical response
On review aggregator Rotten Tomatoes, the film has an approval rating of 78% based on nine reviews, with an average score of 6.54/10, and on Metacritic, the film has three positive reviews from three critics.

In a positive review Gary Goldstein of Los Angeles Times wrote, "The often difficult squaring of religious fervor and sexual longing receives poignant, powerful treatment in the film." writing for The Hollywood Reporter Jon Frosch said, "With an attention-grabbing hook and two riveting central performances, Jennifer Gerber's feature directorial debut The Revival holds you in its grip even when it stumbles." Craig Mathieson of The Sydney Morning Herald said, "[It] doesn't just capture the community dynamics of a southern church and the contradictory pressures, he allows Eli to be seen not as a hypocrite but someone who has genuinely tried to serve their faith and not their heart." Dan Mecca of The Film Stage stated, "It's a true character piece about a character worth exploring."

title: The Revival (film)


text:
User:Karri nikhil866

'karri nikhil was born on 17 - 08 - 1997 in khammam, andhrapradesh , india.His parents was karri  madhu  , karri neelamma. His father was a rural secretary in mrps ( maagiga rashtra poraata samithi ). His loss his mom by birth. He had a sister her name is nirmala.He was grown at his grand mother & father in laws. He starts his education in 2002 in little roses public school at thirumalaya palem, khammam ,Andhra pradesh. His studied 1st to 5 th in that school. After that he joined in 2008 - 2013. Apswreies school in palvancha( socila welfare residential school / jr.college ). He passed his ssc in 2012 - 2013 with 5.3 grade (320/ 600). Then, he wants to join in private college .But , his family was forced him to join again in residential school. He had no chance to convince them & joined again in residential school2013 - 2015. In intermediate he took m.p.c.. He was very poor in maths. That's why he was failed in intermediate. He stopped his study for one year. He write supplementary exams & pass intermediate in 2016 - 2017 with 574/1000.After the completion his intermediate he joined B.com ( ca ) in degree course in k.m.d.c ( Kavitha memorial degree college ).for 2016 - 2019.He was more interested in watching movies from his child hood. He also go for movies without permission when ne was in his school & college life. He was caught by watch men & punished by his superoir on 2 times.His is the big fan of ramcharan tej & Mahesh Babu. His favorite movie was 1nenokkadine starring Mahesh Babu & kritisanon, directed by sukumar in 2013. The film was become big disoster in Mahesh career.'

title: User:Karri nikhil866


text:
Deng Hongkui

Deng Hongkui is a Chinese immunologist and stem cell researcher. He is a Changjiang Professor, the Boya Chair Professor, and Director of the Institute of Stem Cell Research at Peking University. He was awarded US$1.9 million by the Bill & Melinda Gates Foundation for his research on vaccines for HIV and hepatitis C. In 2017, he and Chen Hu engineered resistance to HIV in mice using CRISPR gene editing, and for the first time used the technique on an AIDS patient.

Biography
Deng Hongkui entered Wuhan University in 1980, where he earned his B.Sc. in 1984. He then studied at Shanghai Second Medical College and earned his master's degree in 1987. In 1990, he moved to the United States to study at the University of California, Los Angeles, where he earned his Ph.D. in 1995, under the supervision of Eli Sercarz. From 1995 to 1998 he was an Aaron Diamond Postdoctoral Fellow at the New York University School of Medicine, where he conducted research under Dan Littman. From 1998 to 2001, he worked as research director of ViaCell, a stem cell biotech company based in Boston.

In 2001, Deng was awarded the prestigious Changjiang Professorship by the Chinese government, and returned to China to work at Peking University. He initially worked on treating diabetes using human embryonic stem cells. During the SARS outbreak, he conducted research on SARS treatment and vaccine. In 2006, he was awarded US$1.9 million by the Grand Challenges In Global Health initiative of the Bill & Melinda Gates Foundation, for his research on vaccines for HIV and hepatitis C. He became Director of Peking University's Institute of Stem Cell Research in 2013 and was appointed the Boya Chair Professor in 2016.

In 2017, Deng and his collaborator, Chen Hu of the 307 Hospital, used CRISPR gene editing to transplant human hematopoietic stem cells with the edited CCR5 gene to mice, and conferred HIV resistance to the animals. They subsequently used the technique to treat an AIDS patient who suffered from acute lymphoblastic leukemia (ALL). It was the first time CRISPR was used on a human HIV patient. 19 months later, the patient's ALL was in complete remission. Their research demonstrated the safety of CRISPR for humans, although the therapy was not effective for curing AIDS as only 5% to 8% of the patient's bone marrow cells carried the edited CCR5 gene, much lower than the ideal 100%. Their findings were published in The New England Journal of Medicine in September 2019.

title: Deng Hongkui


text:
Cookbook:Rissoles

| Cuisine of Australia | Meat Recipes

Rissoles (ris·sole) is an extremely popular traditional Australian dish, similar to the American meatloaf.

Ingredients

 * 1 kg (2.2 lb) regular grade beef mince (ground beef)
 * ½ cup (40 g / 1.4 oz) breadcrumbs
 * 2 eggs
 * Gravy powder or flour
 * Various herbs

Procedure

 * 1) Place beef mince in mixing bowl with eggs, breadcrumbs and your favourite meat herbs and seasonings.
 * 2) Mix thoroughly. When fully mixed, remove one handful and mould into a the shape of a very thick hamburger patty.
 * 3) Roll the rissole in either flour or gravy powder (depending on your preferences).
 * 4) Cook in the oven, on a grill, or in a frying pan on a medium level of heat until cooked through and outer layer is crunchy.
 * 5) Serve with vegetables, hot chips, salad or by themselves on bread or toast to make rissole burgers.

title: Cookbook:Rissoles


text:
Dimitar Dimitrov (curler)

Dimitar Dimitrov (Дими́тър Димитро́в) is a Bulgarian male curler and coach.

title: Dimitar Dimitrov (curler)


text:
Allan Leonard Frederick Stevens

Allan Leonard Frederick Stevens (August 30, 1919 – July 15, 2011) was a farmer and political figure in Saskatchewan, Canada. He represented Rosetown from 1960 to 1964 in the Legislative Assembly of Saskatchewan as a Co-operative Commonwealth Federation (CCF) member.

Stevens was born in Saskatoon, Saskatchewan, the son of William Albert Stevens and Helen Isabel McMann, and was educated in Harris. During World War II, Stevens served overseas with the Royal Canadian Army Service Corps in the Netherlands, Belgium and Germany. In 1945, he married Emily Steinun Strong. Stevens lived in Harris and served as a school trustee and as a member of the village council for Harris. He was defeated by George Loken when he ran for reelection to the provincial assembly in 1964.

title: Allan Leonard Frederick Stevens


text:
Speed Center

Speed Center was a motor sports news program on Speed Channel. Debuting on February 13, 2011, it was anchored by Adam Alexander with Jeff Hammond and Sam Hornish Jr. as analysts on Sunday episodes. Ricky Rudd was the analyst for the first two races at Daytona and Phoenix.

History
Speed Center and its predecessors were a staple of Speed Channel since the network opened as SpeedVision in 1996. Among the names were Speedvision News RaceWeek (1996 – February 2002), Speed News (February 2002 – July 30, 2006), and The Speed Report (August 6, 2006 – January 30, 2011). The show was first known as SpeedVision News Race Week featuring anchors such as Dave Despain and Bob Varsha. Prior to The Speed Report arriving in August 2006, the show was called Speed News, with anchors including Bob Varsha, Ralph Sheheen, Bob Jenkins, Connie LeGrand, and Krista Voda. On January 23, 2008, it was announced that Manske was leaving Speed Channel to become the new host of NASCAR Now on ESPN. Drew Johnson also had his last day with Manske on January 27, 2008. For the 2008 season, the new hosts were Bob Varsha and on a part-time basis, Leigh Diffey and Krista Voda. In 2011, the program's name was changed to Speed Center. The first episode took place on February 13, 2011, with Adam Alexander hosting. The final episode of Speed Center aired on August 11, 2013, as the show was canceled on June 25, 2013, due to the transition of Speed into Fox Sports 1 on August 17, 2013.

Former hosts

 * Adam Alexander – Host (2011–2013)
 * Sam Hornish Jr. – Color Co-Host (2012–2013)
 * Ray Evernham – Color Co-Host (2011 only)
 * Dave Despain
 * Drew Johnson
 * Connie LeGrand – 2002 to June 25, 2006
 * Bob Jenkins – March 2005 to May 2006
 * Nicole Manske – July 2, 2006 to January 27, 2008
 * Ralph Sheheen – c. 2004
 * Bob Varsha – Part-time when Alexander was hosting NASCAR on TNT
 * Krista Voda

title: Speed Center


text:
Wikipedia:WikiProject Spam/LinkReports/data2.manualslib.com

Links

 * data2.manualslib.com resolves to [//<IP_ADDRESS> <IP_ADDRESS>]
 * Link is not on the blacklist.
 * Link is not on the domainredlist.
 * Link is not on the Monitorlist.
 * None of the mentioned users is on the blacklist.
 * Link is not on the whitelist.
 * Link is not on the monitor list.
 * Link is not on the whitelist.
 * Link is not on the monitor list.

Additions

 * Displayed all 6 additions.


text:
Talk:Special relativity (MIT)

I've got a question about Special Relativity in my user page. Thanks --Jorge 17:17, 3 February 2007 (UTC)

title: Talk:Special relativity (MIT)


text:
User:Pemdas

Jason Payne

Hello. My name is Pemdas which is an acronym. I am brand new here. I'll be looking at and adding to the mathematics and physics materials to understand them better. I am unhappy with my current knowledege. I went so far as studying calculus II and elementary differential equations in college, and beside a little independent study have forgotten much of what I had learned.

I think that Wikiversity is a good thing.

Wow thanks to a helpful user I have learned what Wikiversity-L is!

Calculus

Algebra

Physics

title: User:Pemdas


text:
Wikipedia:Articles for deletion/Miss Trans Star Internacional

The result was   no consensus. More like no discussion. No prejudice against speedy renomination — Crisco 1492 (talk) 02:04, 4 August 2012 (UTC)

Miss Trans Star Internacional

 * – ( View AfD View log  •  Stats )
 * Note: This debate has been included in the list of Sexuality and gender-related deletion discussions.  Cliff  Smith 06:31, 12 July 2012 (UTC)
 * Note: This debate has been included in the list of Sexuality and gender-related deletion discussions.  Cliff  Smith 06:31, 12 July 2012 (UTC)

This came up on the CSD circuit, but I feel that there is just enough notability in the page that it should not be speedily axed, so here we are. I have no opinion on the article staying or going, I just feel that this should be given a chance to live. TomStar81 (Talk) 05:44, 12 July 2012 (UTC)
 * Note: This debate has been included in the list of Fashion-related deletion discussions.  • Gene93k (talk) 14:49, 12 July 2012 (UTC)

 * Relisted to generate a more thorough discussion so a clearer consensus may be reached.

 * Please add new comments below this notice. Thanks, The Bushranger One ping only 01:11, 19 July 2012 (UTC)

 * Procedural keep - Nominator does not advance a reason for deletion. - The Bushranger One ping only 01:11, 19 July 2012 (UTC)
 * Relisted to generate a more thorough discussion so a clearer consensus may be reached.

 * Please add new comments below this notice. Thanks, — Crisco 1492 (talk) 06:48, 27 July 2012 (UTC)

 * Relisting comment - Nominator seems to have misspoken. It seems s/he meant "indication of importance" and not "notability". Note that the article was originally tagged for CSD. — Crisco 1492 (talk) 06:51, 27 July 2012 (UTC)
 * Delete. Can't find any evidence that it meets WP:GNG, no significant coverage in independent reliable sources. Jenks24 (talk) 07:42, 3 August 2012 (UTC)


text:
Johannes Theodor Reinhardt

Johannes Theodor Reinhardt (3 December 1816, in Copenhagen – 23 October 1882, in Frederiksberg) was a Danish zoologist and herpetologist. He was the son of Johannes Christopher Hagemann Reinhardt.

Biography
He participated as botanist in the first Galathea Expedition (1845—1847). In 1848 he became a curator at the Kongelige Naturhistoriske Museum in Copenhagen (now University of Copenhagen Zoological Museum). He taught classes in zoology at the Danmarks Tekniske Universitet (1856–1878) and at the University of Copenhagen (1861–1878). In 1854 he received the title of professor.

During the 1840s and 1850s he periodically worked in Brazil as an assistant to palaeontologist Peter Wilhelm Lund (1801–1880). He was an early supporter of Charles Darwin’s theory of evolution, and from his research of extinct species, was critical of George Cuvier's concept of "anti-evolutionary catastrophism".

With Christian Frederik Lütken (1827–1901), he was co-author of Bidrag til Kundskab om Brasiliens Padder og Krybdyr (Contributions to the knowledge of Brazilian amphibians and reptiles).

He described 25 new species of reptiles, some with Lütken.

In 1848, Hermann Schlegel named the Calabar "python", Calabaria reinhardtii, in his honor. Reinhardt's caecilian, Mimosiphonops reinhardti, was named for him in 1992, more than 100 years after he had collected the holotype.

title: Johannes Theodor Reinhardt


text:
Template:Did you know nominations/Paul Steenstrup Koht

Paul Steenstrup Koht

 * ... that Norwegian Paul Steenstrup Koht, the father of the future Foreign Minister Halvdan Koht, was mayor of both Tromsø and Skien?
 * ALT1:... that the Norwegian politician Paul Steenstrup Koht threatened to withdraw the Skien Labour Party from the central party, should the latter exclude the universal suffrage from its party programme?
 * ALT2:... that the Norwegian educator and politician Paul Steenstrup Koht espoused radical views during his political career, despite coming from a conservative family?
 * ALT3:... that the Norwegian educator and politician Paul Steenstrup Koht taught classical languages concurrently with his pursuing of his political career?
 * Reviewed: Psilocybe makarorae

Created/expanded by Eisfbnore (talk). Self nom at 15:59, 11 July 2012 (UTC)

 * Pictogram voting keep.svg Date, length (expansion) and sourcing OK. The main source is an offline biographical lexicon that I have no problem with accepting. None of the hooks are particularly interesting, IMHO, but I'd go with the first one, which also meets the other requirements, but it should read: "...the Norwegian politician..." to provide some context. No apparent policy problems, though copyvio/plagiarism can't be checked due to the offline source. The image is free and QPQ is done.  Sandstein   16:48, 15 July 2012 (UTC)

authors: ಮಲ್ನಾಡಾಚ್ ಕೊಂಕ್ಣೊ


text:
Béla Lengyel

Béla Lengyel (born 29 October 1990) is a Hungarian attacking midfielder who plays for Budaörs.

Career statistics
. Source

title: Béla Lengyel


text:
User:Ardonik

User:Ardonik ♦ Wiktionary:User:Ardonik ♦ Wikipedia:User:Ardonik ♦ Wikisource:User:Ardonik ♦ Meta:User:Ardonik

title: User:Ardonik


text:
Talk:Dietmar Bruck

External links modified
Hello fellow Wikipedians,

I have just added archive links to 1 one external link on Dietmar Bruck. 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/20080309012418/http://www.leamingtonfc.co.uk:80/history/s-1985-1986.php to http://www.leamingtonfc.co.uk/history/s-1985-1986.php

Cheers.—cyberbot II  Talk to my owner :Online 19:39, 16 January 2016 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 2 external links on Dietmar Bruck. 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 tag to http://www.coventrytelegraph.net/coventry-city-fc/coventry-city-fc-news/2009/08/29/jeffers-enters-top-ten-of-coventry-city-youngsters-92746-24558509/
 * Added archive https://web.archive.org/web/20090703074413/http://www.coventrytelegraph.net/news/coventry-news/2009/06/25/ex-coventry-star-dietmar-bruck-runs-fun-day-at-ricoh-arena-tesco-92746-23973200/ to http://www.coventrytelegraph.net/news/coventry-news/2009/06/25/ex-coventry-star-dietmar-bruck-runs-fun-day-at-ricoh-arena-tesco-92746-23973200/
 * Added archive https://web.archive.org/web/20110725113438/http://www.geh.nhs.uk/news/news-items/donation-brightens-up-day/ to http://www.geh.nhs.uk/news/news-items/donation-brightens-up-day/

Cheers.— InternetArchiveBot  (Report bug) 08:33, 25 May 2017 (UTC)

title: Talk:Dietmar Bruck


text:
Category:Adobe Creative Suite

Adobe Creative Suite is a bundle of productivity programs that can be used for image editing and creation as well as for print and web publishing.

title: Category:Adobe Creative Suite


text:
Talk:Dung beetle

Useful Details
I would be interested to read more about the evolutionary history of dung beetles, especially how dung feeding behavior diversified over time. This could provide readers with further insight into the functional purposes the roles served during evolutionary history. Furthermore, while the article broadly discusses the ecological niche the dung beetle serves in the environment, readers could benefit from more details on the dung beetle’s interactions with other organisms and their impact on ecosystem dynamics and species survival. --User: JacksonPanWashU 12:20, 15 February 2024

Dung beetle separate from Scarabaeidae
Part of this article is from the Scarabaeidae article. I've made Dung Beetle independent from Scarabaeidae because: Therefore, it seems inappropriate to simply equal Scarabaeidae with dung beetles. Hope it has not caused confusion.--K.C. Tang 00:48, 21 March 2006 (UTC)
 * 1) Most of the dung beetles belong to the subfamilies Scarabaeinae and Aphodiinae of the family Scarabaeidae, but these are only two of the subfamilies of the family.
 * 2) On the other hand, there are dung-feeding beetles which belong to families other than Scarabaeidae, consider e.g. Geotrupidae.

dung beetles love
I love dung beetles and my mom —Preceding unsigned comment added by <IP_ADDRESS> (talk • contribs) 08:00, 22 May 2006

How about dung bettles in fiction (especially movies) where they are used as punishment by entombing people with them. I know they eat dung but would there be any possibilty that they eat carcass too? —Preceding unsigned comment added by <IP_ADDRESS> (talk • contribs) 19:58, 22 May 2006
 * I know what you are thinking (The Mummy and The Mummy Returns) and the answer is no. Scarabs (while it makes for really fun imagery) don't eat meat of any kind.  The details of the ones shown in the films were mixed with both scarab beetles and rhinoceros beetles, but dung beetles really are nothing more than dung-eaters that push big balls of poo up.--<IP_ADDRESS> (talk) 03:05, 9 May 2009 (UTC)

Acknowledgement
Thanks User:Robth very much for tracing the elusive quote from Plutarch!--K.C. Tang 03:27, 7 August 2006 (UTC)

Khepri is god of the rising sun!
I tried to correct a mistake on the page.

Kepri is god of the rising sun. Not the setting sun.

You can also read it on the associated page of Khepri: Khepri was identified as the aspect of Ra which constitutes only the dawning sun (i.e the sun when it comes into being).

Dawning sun is Rising. Not setting....! Also it makes no sence that the god of the setting sun is known as He who comes into being.... So lets please change it to rising sun

<IP_ADDRESS> 18:41, 19 January 2007 (UTC) Van de Ven

Quote?
There is a quote under the Ecology and behavior section, It's not in english and I can't tell if it has anything reason there, can someone remoe it, or add a connetation? Sephiroth storm 04:03, 21 October 2007 (UTC) Question Were did king tut get buried? —Preceding unsigned comment added by <IP_ADDRESS> (talk) 00:14, 11 May 2011 (UTC)

Question
Can you tell more in your paragraph how scarabs are related to ancient Egyptian curses? Just thought it would be interesting! —Preceding unsigned comment added by <IP_ADDRESS> (talk) 00:17, 11 May 2011 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Dung beetle. 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 tag to http://www.ermanz.govt.nz/BertDocs/ERMA200599_Application%20summary%20ERMA200599%20FINAL.pdf
 * Added archive https://archive.is/20130414001314/http://www.fwplus.co.nz/article/experts-dump-on-dung-beetle?p=6 to http://www.fwplus.co.nz/article/experts-dump-on-dung-beetle?p=6

Cheers.— InternetArchiveBot  (Report bug) 20:36, 14 September 2017 (UTC)

"Scarab in ancient Egypt" section
This really is a content fork of that article and should be merged back into it.--Kintetsubuffalo (talk) 05:27, 26 May 2018 (UTC)

reincarnation
Chri Ye (talk) 21:42, 13 February 2024 (UTC)deleted because did not have a neutral tone

title: Talk:Dung beetle