A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are more efficient than others. Efficient multiplication algorithms have existed since the advent of the decimal system.

Long multiplication
If a positional numeral system is used, a natural way of multiplying numbers is taught in  schools
as long multiplication, sometimes called grade-school multiplication, sometimes called the Standard Algorithm:
multiply the multiplicand by each digit of the multiplier and then add up all the properly shifted results. It requires memorization of the multiplication table for single digits.

This is the usual algorithm for multiplying larger numbers by hand in base 10. A person doing long multiplication on paper will write down all the products and then add them together; an abacus-user will sum the products as soon as each one is computed.

Example
This example uses long multiplication to multiply 23,958,233 (multiplicand) by 5,830 (multiplier) and arrives at 139,676,498,390 for the result (product).
       23958233
 ×         5830
 ———————————————
       00000000 ( =  23,958,233 ×     0)
      71874699  ( =  23,958,233 ×    30)
    191665864   ( =  23,958,233 ×   800)
 + 119791165    ( =  23,958,233 × 5,000)
 ———————————————
   139676498390 ( = 139,676,498,390)

Other notations
In some countries such as Germany, the above multiplication is depicted similarly but with the original product kept horizontal and computation starting with the first digit of the multiplier:

 23958233 · 5830
 ———————————————
    119791165
     191665864
       71874699
        00000000
 ———————————————
    139676498390

Below pseudocode describes the process of above multiplication. It keeps only one row to maintain the sum which finally becomes the result. Note that the '+=' operator is used to denote sum to existing value and store operation (akin to languages such as Java and C) for compactness.

multiply(a[1..p], b[1..q], base)                            // Operands containing rightmost digits at index 1
  product = [1..p+q]                                        // Allocate space for result
  for b_i = 1 to q                                          // for all digits in b
    carry = 0
    for a_i = 1 to p                                        // for all digits in a
      product[a_i + b_i - 1] += carry + a[a_i] * b[b_i]
      carry = product[a_i + b_i - 1] / base
      product[a_i + b_i - 1] = product[a_i + b_i - 1] mod base
    product[b_i + p] = carry                               // last digit comes from final carry
  return product

Usage in computers
Some chips implement long multiplication, in hardware or in microcode, for various integer and floating-point word sizes.  In arbitrary-precision arithmetic, it is common to use long multiplication with the base set to 2w, where w is the number of bits in a word, for multiplying relatively small numbers. To multiply two numbers with n digits using this method, one needs about n2 operations. More formally, multiplying two n-digit numbers using long multiplication requires Θ(n2) single-digit operations (additions and multiplications).

When implemented in software, long multiplication algorithms must deal with overflow during additions, which can be expensive. A typical solution is to represent the number in a small base, b, such that, for example, 8b is a representable machine integer. Several additions can then be performed before an overflow occurs.  When the number becomes too large, we add part of it to the result, or we carry and map the remaining part back to a number that is less than b.  This process is called normalization. Richard Brent used this approach in his Fortran package, MP.

Computers initially used a very similar algorithm to long multiplication in base 2, but modern processors have optimized circuitry for fast multiplications using more efficient algorithms, at the price of a more complex hardware realization. In base two, long multiplication is sometimes called "shift and add", because the algorithm simplifies and just consists of shifting left (multiplying by powers of two) and adding. Most currently available microprocessors implement this or other similar algorithms (such as Booth encoding) for various integer and floating-point sizes in hardware multipliers or in microcode.

On currently available processors, a bit-wise shift instruction is usually (but not always) faster than a multiply instruction and can be used to multiply (shift left) and divide (shift right) by powers of two. Multiplication by a constant and division by a constant can be implemented using a sequence of shifts and adds or subtracts. For example, there are several ways to multiply by 10 using only bit-shift and addition.
 ((x << 2) + x) << 1 # Here 10*x is computed as (x*2^2 + x)*2
 (x << 3) + (x << 1) # Here 10*x is computed as x*2^3 + x*2
In some cases such sequences of shifts and adds or subtracts will outperform hardware multipliers and especially dividers. A division by a number of the form  or  often can be converted to such a short sequence.

Algorithms for multiplying by hand

In addition to the standard long multiplication, there are several other methods used to perform multiplication by hand. Such algorithms may be devised for speed, ease of calculation, or educational value, particularly when computers or multiplication tables are unavailable.

Grid method

The grid method (or box method) is an introductory method for multiple-digit multiplication that is often taught to pupils at primary school or elementary school.  It has been a standard part of the national primary school mathematics curriculum in England and Wales since the late 1990s.

Both factors are broken up ("partitioned") into their hundreds, tens and units parts, and the products of the parts are then calculated explicitly in a relatively simple multiplication-only stage, before these contributions are then totalled to give the final answer in a separate addition stage.

The calculation 34 × 13, for example, could be computed using the grid:
  300
   40
   90
 + 12
 ————
  442

followed by addition to obtain 442, either in a single sum (see right), or through forming the row-by-row totals (300 + 40) + (90 + 12) = 340 + 102 = 442.

This calculation approach (though not necessarily with the explicit grid arrangement) is also known as the partial products algorithm.  Its essence is the calculation of the simple multiplications separately, with all addition being left to the final gathering-up stage.

The grid method can in principle be applied to factors of any size, although the number of sub-products becomes cumbersome as the number of digits increases. Nevertheless, it is seen as a usefully explicit method to introduce the idea of multiple-digit multiplications; and, in an age when most multiplication calculations are done using a calculator or a spreadsheet, it may in practice be the only multiplication algorithm that some students will ever need.

Lattice multiplication

Lattice, or sieve, multiplication is algorithmically equivalent to long multiplication. It requires the preparation of a lattice (a grid drawn on paper) which guides the calculation and separates all the multiplications from the additions. It was introduced to Europe in 1202 in Fibonacci's Liber Abaci. Fibonacci described the operation as mental, using his right and left hands to carry the intermediate calculations. Matrakçı Nasuh presented 6 different variants of this method in this 16th-century book, Umdet-ul Hisab. It was widely used in Enderun schools across the Ottoman Empire. Napier's bones, or Napier's rods also used this method, as published by Napier in 1617, the year of his death.

As shown in the example, the multiplicand and multiplier are written above and to the right of a lattice, or a sieve. It is found in Muhammad ibn Musa al-Khwarizmi's "Arithmetic", one of Leonardo's sources mentioned by Sigler, author of "Fibonacci's Liber Abaci", 2002.

During the multiplication phase, the lattice is filled in with two-digit products of the corresponding digits labeling each row and column: the tens digit goes in the top-left corner.
During the addition phase, the lattice is summed on the diagonals.
 Finally, if a carry phase is necessary, the answer as shown along the left and bottom sides of the lattice is converted to normal form by carrying ten's digits as in long addition or multiplication.

Example
The pictures on the right show how to calculate 345 × 12 using lattice multiplication. As a more complicated example, consider the picture below displaying the computation of 23,958,233 multiplied by 5,830 (multiplier); the result is 139,676,498,390.  Notice 23,958,233 is along the top of the lattice and 5,830 is along the right side.  The products fill the lattice and the sum of those products (on the diagonal) are along the left and bottom sides.  Then those sums are totaled as shown.

Russian peasant multiplication

The binary method is also known as peasant multiplication, because it has been widely used by people who are classified as peasants and thus have not memorized the multiplication tables required for long multiplication. The algorithm was in use in ancient Egypt. Its main advantages are that it can be taught quickly, requires no memorization, and can be performed using tokens, such as poker chips, if paper and pencil aren't available. The disadvantage is that it takes more steps than long multiplication, so it can be unwieldy for large numbers.

Description
On paper, write down in one column the numbers you get when you repeatedly halve the multiplier, ignoring the remainder; in a column beside it repeatedly double the multiplicand. Cross out each row in which the last digit of the first number is even, and add the remaining numbers in the second column to obtain the product.

Examples
This example uses peasant multiplication to multiply 11 by 3 to arrive at a result of 33.

 Decimal:     Binary:
 11   3       1011  11
 5    6       101  110
 2   12       10  1100
 1   24       1  11000
     ——         ——————
     33         100001

Describing the steps explicitly:

 11 and 3 are written at the top
 11 is halved (5.5) and 3 is doubled (6).  The fractional portion is discarded (5.5 becomes 5).
 5 is halved (2.5) and 6 is doubled (12).  The fractional portion is discarded (2.5 becomes 2).  The figure in the left column (2) is even, so the figure in the right column (12) is discarded.
 2 is halved (1) and 12 is doubled (24).
 All not-scratched-out values are summed: 3 + 6 + 24 = 33.

The method works because multiplication is distributive, so:

A more complicated example, using the figures from the earlier examples (23,958,233 and 5,830):

 Decimal:             Binary:
 5830  23958233       1011011000110  1011011011001001011011001
 2915  47916466       101101100011  10110110110010010110110010
 1457  95832932       10110110001  101101101100100101101100100
 728  191665864       1011011000  1011011011001001011011001000
 364  383331728       101101100  10110110110010010110110010000
 182  766663456       10110110  101101101100100101101100100000
 91  1533326912       1011011  1011011011001001011011001000000
 45  3066653824       101101  10110110110010010110110010000000
 22  6133307648       10110  101101101100100101101100100000000
 11 12266615296       1011  1011011011001001011011001000000000
 5  24533230592       101  10110110110010010110110010000000000
 2  49066461184       10  101101101100100101101100100000000000
 1  98132922368       1  1011011011001001011011001000000000000
   ————————————          1022143253354344244353353243222210110 (before carry)
   139676498390         10000010000101010111100011100111010110

Quarter square multiplication

This formula can in some cases be used, to make multiplication tasks easier to complete:

In the case where  and  are integers, we have that

because  and  are either both even or both odd. This means that

and it's sufficient to (pre-)compute the integral part of squares divided by 4 like in the following example.

Examples
Below is a lookup table of quarter squares with the remainder discarded for the digits 0 through 18; this allows for the multiplication of numbers up to .

If, for example, you wanted to multiply 9 by 3, you observe that the sum and difference are 12 and 6 respectively. Looking both those values up on the table yields 36 and 9, the difference of which is 27, which is the product of 9 and 3.

History of quarter square multiplication

In prehistoric time, quarter square multiplication involved floor function;  that some sources attribute to Babylonian mathematics (2000–1600 BC).

Antoine Voisin published a table of quarter squares from 1 to 1000 in 1817 as an aid in multiplication. A larger table of quarter squares from 1 to 100000 was published by Samuel Laundy in 1856, and a table from 1 to 200000 by Joseph Blater in 1888.

Quarter square multipliers were used in analog computers to form an analog signal that was the product of two analog input signals. In this application, the sum and difference of two input voltages are formed using operational amplifiers. The square of each of these is approximated using piecewise linear circuits. Finally the difference of the two squares is formed and scaled by a factor of one fourth using yet another operational amplifier.

In 1980, Everett L. Johnson proposed using the quarter square method in a digital multiplier. To form the product of two 8-bit integers, for example, the digital device forms the sum and difference, looks both quantities up in a table of squares, takes the difference of the results, and divides by four by shifting two bits to the right. For 8-bit integers the table of quarter squares will have 29−1=511 entries (one entry for the full range 0..510 of possible sums, the differences using only the first 256 entries in range 0..255) or 29−1=511 entries (using for negative differences the technique of 2-complements and 9-bit masking, which avoids testing the sign of differences), each entry being 16-bit wide (the entry values are from (0²/4)=0 to (510²/4)=65025).

The quarter square multiplier technique has benefited 8-bit systems that do not have any support for a hardware multiplier. Charles Putney implemented this for the 6502.

Computational complexity of multiplication

A line of research in theoretical computer science is about the number of single-bit arithmetic operations necessary to multiply two -bit integers. This is known as the computational complexity of multiplication. Usual algorithms done by hand have asymptotic complexity of , but in 1960 Anatoly Karatsuba discovered that better complexity was possible (with the Karatsuba algorithm).

Currently, the algorithm with the best computational complexity is a 2019 algorithm of David Harvey and Joris van der Hoeven, which uses the strategies of using number-theoretic transforms introduced with the Schönhage–Strassen algorithm to multiply integers using only  operations. This is conjectured to be the best possible algorithm, but lower bounds of  are not known.

Karatsuba multiplication

Karatsuba multiplication is an O(nlog23) ≈ O(n1.585) divide and conquer algorithm, that uses recursion to merge together sub calculations.

By rewriting the formula, one makes it possible to do sub calculations / recursion. By doing recursion, one can solve this in a fast manner.

Let  and  be represented as -digit strings in some base . For any positive integer  less than , one can write the two given numbers as

where  and  are less than . The product is then

where

These formulae require four multiplications and were known to Charles Babbage. Karatsuba observed that  can be computed in only three multiplications, at the cost of a few extra additions.  With  and  as before one can observe that

Because of the overhead of recursion, Karatsuba's multiplication is slower than long multiplication for small values of n; typical implementations therefore switch to long multiplication for small values of n.

General case with multiplication of N numbers

By exploring patterns after expansion, one see following:

Each summand is associated to a unique binary number from 0 to
, for example  etc. Furthermore; B is powered to number of 1, in this binary string, multiplied with m.

If we express this in fewer terms, we get:

, where  means digit in number i at position j. Notice that

History
Karatsuba's algorithm was the first known algorithm for multiplication that is asymptotically faster than long multiplication, and can thus be viewed as the starting point for the theory of fast multiplications.

Toom–Cook

Another method of multiplication is called Toom–Cook or Toom-3. The Toom–Cook method splits each number to be multiplied into multiple parts. The Toom–Cook method is one of the generalizations of the Karatsuba method. A three-way Toom–Cook can do a size-3N multiplication for the cost of five size-N multiplications.  This accelerates the operation by a factor of 9/5, while the Karatsuba method accelerates it by 4/3.

Although using more and more parts can reduce the time spent on recursive multiplications further, the overhead from additions and digit management also grows. For this reason, the method of Fourier transforms is typically faster for numbers with several thousand digits, and asymptotically faster for even larger numbers.

Schönhage–Strassen

Every number in base B, can be written as a polynomial:

Furthermore, multiplication of two numbers could be thought of as a product of two polynomials:

Because,for : ,
we have a convolution.

By using fft (fast fourier transformation) with convolution rule, we can get

 ● . That is;   ● , where
is the corresponding coefficient in fourier space. This can also be written as: fft(a * b) = fft(a) ● fft(b).

We have the same coefficient due to linearity under fourier transformation, and because these polynomials
only consist of one unique term per coefficient:

  and

Convolution rule:  ●

We have reduced our convolution problem
to product problem, through fft.

By finding ifft (polynomial interpolation), for each , one get the desired coefficients.

Algorithm uses divide and conquer strategy, to divide problem to subproblems.

It has a time complexity of O(n log(n) log(log(n))).

History

Algorithm were invented by Strassen (1968). The algorithm was made practical and theoretical guarantees were provided in 1971 by Schönhage and Strassen resulting in the Schönhage–Strassen algorithm.

Further improvements

In 2007 the asymptotic complexity of integer multiplication was improved by the Swiss mathematician Martin Fürer of Pennsylvania State University to n log(n) 2Θ(log*(n)) using Fourier transforms over complex numbers, where log* denotes the iterated logarithm.  Anindya De, Chandan Saha, Piyush Kurur and Ramprasad Saptharishi gave a similar algorithm using modular arithmetic in 2008 achieving the same running time.  In context of the above material, what these latter authors have achieved is to find N much less than 23k + 1, so that Z/NZ has a (2m)th root of unity. This speeds up computation and reduces the time complexity. However, these latter algorithms are only faster than Schönhage–Strassen for impractically large inputs.

In 2014, Harvey, Joris van der Hoeven and Lecerf gave a new algorithm that achieves a running time of , making explicit the implied constant in the  exponent. They also proposed a variant of their algorithm which achieves  but whose validity relies on standard conjectures about the distribution of Mersenne primes. In 2016, Covanov and Thomé proposed an integer multiplication algorithm based on a generalization of Fermat primes that conjecturally achieves a complexity bound of . This matches the 2015 conditional result of Harvey, van der Hoeven, and Lecerf but uses a different algorithm and relies on a different conjecture. In 2018, Harvey and van der Hoeven used an approach based on the existence of short lattice vectors guaranteed by Minkowski's theorem to prove an unconditional complexity bound of .

In March 2019, David Harvey and Joris van der Hoeven announced their discovery of an  multiplication algorithm. It was published in the Annals of Mathematics in 2021. Because Schönhage and Strassen predicted that n log(n) is the 'best possible' result Harvey said: "...our work is expected to be the end of the road for this problem, although we don't know yet how to prove this rigorously."

Lower bounds
There is a trivial lower bound of Ω(n) for multiplying two n-bit numbers on a single processor; no matching algorithm (on conventional machines, that is on Turing equivalent machines) nor any sharper lower bound is known. Multiplication lies outside of AC0[p] for any prime p, meaning there is no family of constant-depth, polynomial (or even subexponential) size circuits using AND, OR, NOT, and MODp gates that can compute a product. This follows from a constant-depth reduction of MODq to multiplication. Lower bounds for multiplication are also known for some classes of branching programs.

Complex number multiplication
Complex multiplication normally involves four multiplications and two additions.

Or

As observed by Peter Ungar in 1963, one can reduce the number of multiplications to three, using essentially the same computation as Karatsuba's algorithm. The product (a + bi) · (c + di) can be calculated in the following way.

k1 = c · (a + b)
k2 = a · (d − c)
k3 = b · (c + d)
Real part = k1 − k3
Imaginary part  = k1 + k2.

This algorithm uses only three multiplications, rather than four, and five additions or subtractions rather than two. If a multiply is more expensive than three adds or subtracts, as when calculating by hand, then there is a gain in speed. On modern computers a multiply and an add can take about the same time so there may be no speed gain. There is a trade-off in that there may be some loss of precision when using floating point.

For fast Fourier transforms (FFTs) (or any linear transformation) the complex multiplies are by constant coefficients c + di (called twiddle factors in FFTs), in which case two of the additions (d−c and c+d) can be precomputed. Hence, only three multiplies and three adds are required.  However, trading off a multiplication for an addition in this way may no longer be beneficial with modern floating-point units.

Polynomial multiplication
All the above multiplication algorithms can also be expanded to multiply polynomials. Alternatively the Kronecker substitution technique may be used to convert the problem of multiplying polynomials into a single binary multiplication.

Long multiplication methods can be generalised to allow the multiplication of algebraic formulae:

  14ac - 3ab + 2 multiplied by ac - ab + 1

  14ac  -3ab   2
    ac   -ab   1
  ————————————————————
  14a2c2  -3a2bc   2ac
         -14a2bc         3 a2b2  -2ab
                  14ac           -3ab   2
  ———————————————————————————————————————
  14a2c2 -17a2bc   16ac  3a2b2    -5ab  +2
  =======================================

As a further example of column based multiplication, consider multiplying 23 long tons (t), 12 hundredweight (cwt) and 2 quarters (qtr) by 47.  This example uses avoirdupois measures: 1 t = 20 cwt, 1 cwt = 4 qtr.

     t    cwt  qtr
    23     12    2
                47 x
  ————————————————
   141     94   94
   940    470
    29     23
  ————————————————
  1110    587   94
  ————————————————
  1110      7    2
  =================  Answer: 1110 ton 7 cwt 2 qtr

First multiply the quarters by 47, the result 94 is written into the first workspace.  Next, multiply cwt 12*47 = (2 + 10)*47 but don't add up the partial results (94, 470) yet.  Likewise multiply 23 by 47 yielding (141, 940).  The quarters column is totaled and the result placed in the second workspace (a trivial move in this case).  94 quarters is 23 cwt and 2 qtr, so place the 2 in the answer and put the 23 in the next column left.  Now add up the three entries in the cwt column giving 587.  This is 29 t 7 cwt, so write the 7 into the answer and the 29 in the column to the left.  Now add up the tons column.  There is no adjustment to make, so the result is just copied down.

The same layout and methods can be used for any traditional measurements and non-decimal currencies such as the old British £sd system.

See also
 Binary multiplier
 Dadda multiplier
 Division algorithm
 Horner scheme for evaluating of a polynomial
 Logarithm
 Mental calculation
 Number-theoretic transform
 Prosthaphaeresis
 Slide rule
 Trachtenberg system
  for another fast multiplication algorithm, specially efficient when many operations are done in sequence, such as in linear algebra
 Wallace tree

References

Further reading

  (x+268 pages)

External links

Basic arithmetic
 The Many Ways of Arithmetic in UCSMP Everyday Mathematics
 A Powerpoint presentation about ancient mathematics
 Lattice Multiplication Flash Video

Advanced algorithms
 Multiplication Algorithms used by GMP

Multiplication
Articles with example pseudocode

Multiplication algorithm


Peter de Salis, 3rd Count de Salis (28 June 1738 - 19 November 1807) was a soldier and official.

Early life and education
He was the second son of Jerome De Salis by his wife Mary, daughter of the first Viscount Fane. He was educated with his brothers, Charles and Henry, in the Grisons, in Chur where his tutor was Johann Heinrich Lambert, and then at Eton.

Career
He left Eton early in 1754 and was commissioned as an ensign in the 1st Regiment of Foot on 17 October 1754, which cost £900, subsequently he fought in the Seven Years' War, becoming a lieutenant on 27 October 1760. He left the army a captain.

Salis was Governor and Capitaine General of the Valtelline 1771–1773, and 1781–1783, where, it was said at the time, "with great munificence, insight and skill he hastened to relieve the poverty of the population of Chiavenna". Accordingly, in 1782 a statue was put up to him in a main square there. The statue was dismembered in 1797, but fragments survive.

Personal life
Salis was sent by his father to the Grisons where he married a second cousin in 1763, she died, morte avec une fille en couches a year later. In 1765 he married a first cousin, she died 18 months later. In 1769 he married a combined third and fourth cousin, she had two sons with him and outlived him 22 years.

In March 1785 he inherited his mother's half share of the Bourchier-Fane estates in counties Limerick and Armagh, (Ireland). On 13 November 1785 he returned to England, landing with his family at Dover. From then he styled himself Esquire and lived mostly at 19 Orchard Street, near Portman Square; 11 Great Cumberland Street; in Hayes; and then at Hillingdon Park, Hillingdon-heath, near Uxbridge, a fine villa which Joseph Bonomi designed for him c. 1795–1797.

He died 19 November 1809 at his house on Hillingdon-Heath.

He was succeeded in his British estates by his elder son, Jerome and his younger son John/Johann/Giovanni seems to have inherited his Grisons property.

References

 R. de Salis, Quadrennial di Fano Saliceorum, volume one, London, 2003
 Rachel Fane De Salis, De Salis Family : English Branch, Henley-on-Thames, 1934.
 manuscripts & muniments.
 The Times, notice of death, 26 November 1807, (page 3, column F).

1738 births
1807 deaths
18th-century Irish landowners
19th-century Irish landowners
Royal Scots officers
People educated at Eton College
British people of Swiss descent
Swiss-Italian people
Peter
de Salis-Soglio
People from Hillingdon
People from Marylebone
Counts de Salis-Soglio and Comtes de Salis-Seewis
Peter

Peter, 3rd Count de Salis


Charles T. Royer (born August 22, 1939) is an American news reporter and politician who served as the 48th mayor of Seattle, Washington from 1978 to 1990. After serving as mayor of Seattle, Royer became the director of the Harvard Institute of Politics.

Career as a reporter
A Medford, Oregon native, Royer worked as a reporter for KVAL-TV and KEZI-TV in Eugene, Oregon while attending the University of Oregon. He spent the seven years following his 1966 graduation from the School of Journalism as a reporter and news analyst. He reported first at KOIN and then at KING-TV in Seattle, where he shared a beat with his brother, Bob. In 1969, he received an award from the American Political Science Association for distinguished public affairs reporting. In 1975 he received the Sigma Delta Chi Distinguished Service award and the Edward R. Murrow award for editorializing on television. He was awarded a fellowship to study government and public policy at the Washington, D.C. Journalism Center. He was also a visiting associate at the Harvard-MIT Joint Center for Urban Studies from 1969 to 1970.

Mayor of Seattle

In 1977, Royer defeated 13 other candidates to become the mayor of Seattle. He served three four-year terms in that office, longer than any other mayor in the city's history. He oversaw a number of improvements in the city, including a recycling program that is recognized as the best in the nation. His administration tackled social issues such as poverty, teenage pregnancy and drugs. As President of the National League of Cities in 1983, he became a spokesperson for American cities on housing, healthcare, civil liberties, and the needs of children.

In 1989, Business Month named Seattle as one of the best-managed cities in the nation. Places Rated Almanac called it the nation's "Most Livable City," and the National Urban Coalition named Royer the Distinguished Urban Mayor of the Year.

Directorship at Harvard
In 1990, Royer succeeded Richard Thornburgh as director of the Harvard Institute of Politics at the John F. Kennedy School of Government. Democratic National Committee member Ronald H. Brown of the IOP's senior advisory committee stated, "Mayor Royer believes that people make the real difference in politics, and in bringing the people of his city together he has been one of the most innovative and artful city executives in the nation." Royer's appointment created recognition that, as The Seattle Times commented, "not all political savvy emanates from the East Coast."

From 1995 to 2006, Royer served as director of the National Program Office for the Urban Health Initiative, which is funded by the Robert Wood Johnson Foundation. UHI worked closely with five United States cities (Baltimore, Detroit, Oakland, Philadelphia, and Richmond, Virginia) to help improve the health and safety of children living in those areas.

Recent activities
In 2005, he established the non-profit Institute for Community Change to continue guiding work at the national level toward improving the health of communities. In 2007, Royer became founding partner in the consulting firm The Royer Group which provides professional consulting services in public policy development, governmental liaison, public finance, business and leadership development, marketing communications and program management. He was considered as a possible appointment as King County Executive, a position vacated in May 2009 when Ron Sims was appointed as Deputy Director of United States Department of Housing and Urban Development by the Obama administration.

Royer's son Jordan  ran unsuccessfully for Seattle City Council in 2009.

See also
 Timeline of Seattle, 1970s-1980s

References

External links

Politicians from Medford, Oregon
University of Oregon alumni
Harvard University faculty
Mayors of Seattle
1939 births
Living people
Washington (state) Independents

Charles Royer


Bluegrass music is a genre of American roots music that developed in the 1940s in the Appalachian region of the United States. The genre derives its name from the band Bill Monroe and the Blue Grass Boys. Like mainstream country music, it largely developed out of old-time string music, though in contrast, bluegrass is traditionally played exclusively on acoustic instruments and also has roots in traditional English, Scottish, and Irish ballads and dance tunes as well as in blues and jazz. Bluegrass was further developed by musicians who played with Monroe, including 5-string banjo player Earl Scruggs and guitarist Lester Flatt. Monroe characterized the genre as, "Scottish bagpipes and ole-time fiddlin'. It's a part of Methodist, Holiness and Baptist traditions. It's blues and jazz, and it has a high lonesome sound."

Bluegrass features acoustic stringed instruments and emphasizes the off-beat. Notes are anticipated, in contrast to laid back blues where notes are behind the beat, which creates the higher energy characteristic of bluegrass. In bluegrass, as in some forms of jazz, one or more instruments each takes its turn playing the melody and improvising around it, while the others perform accompaniment; this is especially typified in tunes called breakdowns. This is in contrast to old-time music, in which all instruments play the melody together or one instrument carries the lead throughout while the others provide accompaniment. Breakdowns are often characterized by rapid tempos and unusual instrumental dexterity and sometimes by complex chord changes.

Characteristics

Instrumentation
 The violin (also known as the fiddle), five-string banjo, guitar, mandolin, and upright bass (string bass) are often joined by the resonator guitar (also referred to as a Dobro) and (occasionally) harmonica or Jew's harp. This instrumentation originated in rural dance bands and is the basis on which the earliest bluegrass bands were formed.

The fiddle, made by Italians and first used in sixteenth century Europe, was one of the first instruments to be brought into America. It became popular due to its small size and versatility. Fiddles are also used in country, classical, cajun, and old time music.

Banjos were brought to America through the African slave trade. They began receiving attention from white Americans when minstrel shows incorporated the banjo as part of their acts. The "clawhammer", or two finger style playing, was popular before the Civil War. Now, however, banjo players use mainly the three-finger picking style made popular by banjoists such as Earl Scruggs.

Guitars are used primarily for rhythmic purposes. Other instruments may provide a solo on top of the guitar during breaks, guitarists may also provide these solos on occasion. The instrument originates from eighteenth century Spain, but there were no American-made models until the C.F. Martin Company started to manufacture them in the 1830s. The guitar is now most commonly played with a style referred to as flatpicking, unlike the style of early bluegrass guitarists such as Lester Flatt, who used a thumb pick and finger pick.

Bassists almost always play pizzicato, occasionally adopting the "slap-style" to accentuate the beat. A bluegrass bass line is generally a rhythmic alternation between the root and fifth of each chord, with occasional walking bass excursions.

Instrumentation has been a continuing topic of debate. Traditional bluegrass performers believe the "correct" instrumentation is that used by Bill Monroe's band, the Blue Grass Boys (guitar, mandolin, fiddle, banjo, and bass). Departures from the traditional instrumentation have included dobro, accordion, harmonica, piano, autoharp, drums, electric guitar, and electric versions of other common bluegrass instruments, resulting in what has been referred to as "new grass." Despite this debate, even Monroe himself was known to experiment with instrumentation; he once even used a string orchestra, choir, and pre-recorded bird-song track.

Vocals
Apart from specific instrumentation, a distinguishing characteristic of bluegrass is vocal harmony featuring two, three, or four parts, often with a dissonant or modal sound in the highest voice (see modal frame), a style described as the "high, lonesome sound." Commonly, the ordering and layering of vocal harmony is called the "stack". A standard stack has a baritone voice at the bottom, the lead in the middle (singing the main melody) and a tenor at the top, although stacks can be altered, especially where a female voice is included. Alison Krauss and Union Station provide a good example of a different harmony stack with a baritone and tenor with a high lead, an octave above the standard melody line, sung by the female vocalist. However, by employing variants to the standard trio vocal arrangement, they were simply following a pattern existing since the early days of the genre. Both the Stanley Brothers and the Osborne Brothers employed the use of a high lead with the tenor and baritone below it. The Stanleys used this technique numerous times in their recordings for both Mercury and King records. This particular stack was most famously employed by the Osborne Brothers who first employed it during their time with MGM records in the latter half of the 1950s. This vocal arrangement would become the trademark of the Osbornes' sound with Bobby's high, clear voice at the top of the vocal stack. Additionally, the Stanley Brothers also utilized a high baritone part on several of their trios recorded for Columbia records during their time with that label (1949–1952). Mandolin player Pee Wee Lambert sang the high baritone above Ralph Stanley's tenor, both parts above Carter's lead vocal. This trio vocal arrangement was variously used by other groups as well; even Bill Monroe employed it in his 1950 recording of "When the Golden Leaves Begin to Fall'. In the 1960s, Flatt and Scruggs often added a fifth part to the traditional quartet parts on gospel songs, the extra part being a high baritone (doubling the baritone part sung in the normal range of that voice; E.P. Tullock [aka Cousin Jake] normally providing the part, though at times it was handled by Curly Seckler).

Themes
Bluegrass tunes often take the form of narratives on the everyday lives of the people whence the music came. Aside from laments about loves lost, interpersonal tensions and unwanted changes to the region (e.g., the visible effects of mountaintop coal mining), bluegrass vocals frequently reference the hardscrabble existence of living in Appalachia and other rural areas with modest financial resources. Some protest music has been composed in the bluegrass style, especially concerning the vicissitudes of the Appalachian coal mining industry. Railroading has also been a popular theme, with ballads such as "Wreck of the Old 97" and "Nine Pound Hammer" (from the legend of John Henry).

History

Creation

Bluegrass as a distinct musical form developed from elements of old-time music and traditional music in the Appalachian region of the United States. The Appalachian region was where many Scottish American immigrants settled, bringing with them the musical traditions of their homelands. Hence the sounds of jigs and reels, especially as played on the fiddle, were innate to the developing style. Black musicians, meanwhile, brought the iconic banjo to Appalachia. Much later, in 1945, Earl Scruggs would develop a three-finger roll on the instrument which allowed a rapid-fire cascade of notes that could keep up with the driving tempo of the new bluegrass sound.

Settlers from Britain and Ireland arrived in Appalachia during the 18th century and brought with them the musical traditions of their homelands. These traditions consisted primarily of English and Scottish ballads—which were essentially unaccompanied narrative—and dance music, such as reels, which were accompanied by a fiddle. Many older bluegrass songs come directly from the British Isles. Several Appalachian bluegrass ballads, such as "Pretty Saro", "Pretty Polly", "Cuckoo Bird", and "House Carpenter", come from England and preserve the English ballad tradition both melodically and lyrically. Some bluegrass fiddle songs popular in Appalachia, such as "Leather Britches" and "Soldier's Joy", have Scottish roots. The dance tune "Cumberland Gap" may be derived from the tune that accompanies the Scottish ballad "Bonnie George Campbell".

The music now known as bluegrass was frequently used to accompany a rural dancing style known as buckdancing, flatfooting, or clogging. As the bluegrass sound spread to urban areas, listening to it for its own sake increased, especially after the advent of audio recording. In 1948, what would come to be known as bluegrass emerged as a genre within the post-war country/western-music industry, a period of time characterized now as the golden era or wellspring of "traditional bluegrass". From its earliest days, bluegrass has been recorded and performed by professional and amateur musicians alike. Although amateur bluegrass musicians and trends such as "parking-lot picking" are too important to be ignored, it is touring musicians who have set the direction of the style. Radio stations dedicated to bluegrass have also proved influential in advancing the evolution of the style into distinctive subgenres.

Classification
Bluegrass was initially included in the category of folk music and later changed to hillbilly. In 1948, bluegrass was placed under the country and western heading for radio airplay charting. All four of the seminal bluegrass authors - Artis, Price, Cantwell, and Rosenberg - described bluegrass music in detail as originating in style and form, in one form or another, between the 1930s and mid-1940s. However, the term "bluegrass" did not appear formally to describe the music until the late 1950s and did not appear in Music Index until 1965. The first entry in Music Index mentioning "bluegrass music" directed the reader to "see Country Music; Hillbilly Music". Music Index maintained this listing for bluegrass music until 1986. The first time bluegrass music had its own entries in Music Index was in 1987.

The topical and narrative themes of many bluegrass songs are highly reminiscent of folk music. Many songs that are widely considered to be bluegrass are in reality older works legitimately classified as folk or old-time music that are performed in the bluegrass style. The interplay between bluegrass and folk forms has been academically studied. Folklorist Neil Rosenberg, for example, shows that most devoted bluegrass fans and musicians are familiar with traditional folk songs and old-time music and that these songs are often played at shows, festivals, and jams.

Origin of name
"Bluegrass" is a common name given in America for the grass of the Poa genus, the most famous being Kentucky bluegrass. A large region in central Kentucky is sometimes called the Bluegrass region (although this region is west of the hills of Kentucky). Exactly when the word "bluegrass" was adopted is not certain, but is believed to be in the late 1950s. It was derived from the name of the seminal Blue Grass Boys band, formed in 1939 with Bill Monroe as its leader. Due to this lineage, Bill Monroe is frequently referred to as the "father of bluegrass".

The bluegrass style of music dates from the mid-1940s. In 1948, the Stanley Brothers recorded the traditional song "Molly and Tenbrooks" in the Blue Grass Boys' style, arguably the point in time that bluegrass emerged as a distinct musical form. Monroe's 1946 to 1948 band, which featured guitarist Lester Flatt, banjoist Earl Scruggs, fiddler Chubby Wise and bassist Howard Watts (also known as "Cedric Rainwater")sometimes called "the original bluegrass band"created the definitive sound and instrumental configuration that remains a model to this day. By some arguments, while the Blue Grass Boys were the only band playing this music, it was just their unique sound; it could not be considered a musical style until other bands began performing in a similar fashion. In 1967, "Foggy Mountain Breakdown" by Flatt and Scruggs, the instrumental banjo music, was introduced to a worldwide audience as a result of its frequent use in the movie "Bonnie and Clyde". But the functionally similar old-time music genre was long-established and widely recorded in the period of the film's events and later CD was released.
Ralph Stanley commented about the origins of the genre and its name.

Subgenres and recent developments

Traditional bluegrass
Traditional bluegrass emphasizes the traditional elements and form of the genre as laid out by Bill Monroe and his Blue Grass Boys band in the late 1940s. Traditional bluegrass musicians play folk songs, tunes with simple traditional chord progressions, exclusively on acoustic instruments, though it is common practice to "mic" acoustic instruments during stage performances before larger audiences. In most traditional bluegrass bands, the guitar rarely takes the lead, instead acting as a rhythm instrument, one notable exception being gospel-based songs. Melodies and lyrics tend to be simple, often in the key of G, and a I-IV-V chord pattern is common. In traditional bluegrass, instrumental breaks are typically short and played between sections of a song, conventionally originating as a variation on the song's melody. Also common are breakdowns, an instrumental form that features a series of breaks, each played by a different instrument. Particularly since the 1990s, a number of younger groups have attempted to revive the sound and structure of traditional bluegrass, a trend that has been dubbed Neo-traditional Bluegrass.

Progressive bluegrass
The group The Country Gentlemen is credited with setting the progressive bluegrass movement in motion with their 1960 album Country Songs, Old and New. The group combined traditional ballads such as "The Little Sparrow," "Weeping Willow," and "Ellen Smith" with the traditional bluegrass instrumentation and "bouncy" mandolin and banjo parts that were distinct from traditional players such as Monroe and Scruggs.

Due to the exposure traditional bluegrass acts received on alongside mainstream country music on radio and televised programs such as the Grand Ole Opry, a wave of young, and not exclusively southern musicians began to replicate the genre's format on college campuses and in coffeehouses amidst the American folk music revival of the early 1960s. These artists often incorporated songs, elements, and instruments from other popular genres, particularly rock and roll. Banjoist Earl Scruggs of Flatt and Scruggs had shown progressive tendencies since the group's earliest days, incorporating jazz-inspired banjo and bass duets and complicated chord progressions that progressed beyond the genre's original rigid and conservative structure. In the late 1960s, Scruggs experimented on duets with saxophonist King Curtis and added songs by the likes of counterculture icon Bob Dylan to the group's repertoire, while bandmate Lester Flatt, a traditionalist, opposed these changes resulting in the group's breakup in 1969.

New Grass Revival began utilizing electric instrumentation alongside songs imported from other genres to great popularity in the 1970s and 1980s and the term "newgrass" became synonymous with "progressive bluegrass". Throughout the '80s and '90s, progressive bluegrass continued to evolve, moving closer toward folk and rock in some quarters and closer to jazz in others, while festivals such as the Telluride Bluegrass Festival, RockyGrass in Lyons, Colorado, and MerleFest in Wilkesboro, North Carolina began to attract performing acts from outside the bluegrass tradition, merging the bluegrass community with other popular music scenes across America.

Following the death of Jerry Garcia, who had begun his career playing bluegrass, and the dissolution of the Grateful Dead, the blossoming "jam band" scene that followed in their wake embraced and included many acts that performed a style of progressive bluegrass that included extended, exploratory musical improvisation, often called "jamgrass." This style began to define many such acts whose popularity has grown in the 21st century such as Leftover Salmon, The String Cheese Incident, Yonder Mountain String Band, The Infamous Stringdusters, Railroad Earth, Greensky Bluegrass, and Billy Strings. In recent years, groups like the Punch Brothers, the Jon Stickley Trio, and Nickel Creek have developed a new form of progressive bluegrass which includes highly arranged pieces that resembles contemporary classical music played on bluegrass instruments. These bands feature complicated rhythms, chord schemes, and harmonics combined with improvised solos. At the same time, several popular indie folk and folk rock bands such as the Avett Brothers, Mumford & Sons, and Trampled by Turtles have incorporated rhythmic elements or instrumentation from the bluegrass tradition into their popular music arrangements.

Notes

References

 Artis, B. (1975). Bluegrass. NY: Hawthorne Books, Inc. .
 Cantwell, R. (1996). When we were good: The folk revival. Cambridge, MA: Harvard University Press. .
 Cantwell, R. (1984). Bluegrass breakdown: The making of the old southern sound. Chicago: University Illinois Press. .
 Kingsbury, Paul (2004). The Encyclopedia of Country Music: The Ultimate Guide to the Music. Oxford University Press. .
 Lornell, Kip (2020). Capital Bluegrass: Hillbilly Music Meets Washington, DC. Oxford University Press. .
 Lornell, Kip. Exploring American Folk Music : Ethnic, Grassroots, and Regional Traditions in the United States. University Press of Mississippi, 2012. .
 Newby, Tim (2015) Bluegrass in Baltimore. NC: McFarland. .
 Price, S. D. (1975). Old as the hills: The story of bluegrass music. NY: The Viking Press.

 van der Merwe, Peter (1989). Origins of the Popular Style: The Antecedents of Twentieth-Century Popular Music. Oxford: Clarendon Press. .
Trischka, Tony, Wernick, Pete, (1988) Masters of the 5-String Banjo, Oak Publications. .

American folk music
Country music genres
Old-time music

Culture of the Southern United States
Appalachian culture

Bluegrass music


Ikhtiyar al-Din Ai-Taq was an influential amir in western Khurasan following the decline of the Seljuks, and the ruler of Gurgan and Dihistan from 1161 until 1165.

Career

Ai-Taq had originally been one of the Seljuk sultan Sanjar's ghulams. When Sanjar was captured by rebellious Ghuzz bands in 1153, Ai-Taq built up an army and quickly established his influence in the western regions of Sanjar's empire.

Ai-Taq had not been the only individual to take advantage of Sanjar's overthrow. In Nishapur another of Sanjar's former ghulams, Mu'ayyid al-Din Ai-Aba, had taken power and had gained control of a significant portion of Khurasan. Relations between Ai-Taq and Ai-Aba quickly soured and by 1158 warfare had broken out among them. Ai-Taq received military assistance from Shah Ghazi Rustam, the Bavandid ruler of Tabaristan. Despite this, his forces were defeated by Ai-Aba and Sultan Mahmud Khan and he was forced to flee to Tabaristan. In the end he was compelled to sue for peace and had to pay off his opponents.

In around 1160 Ai-Taq was attacked by a force of Ghuzz under their chief Yaghmur. Despite Bavandid support, he was defeated and was forced to flee. He made his way to Khwarezm, where the Khwarezmshah Il-Arslan supplied him with assistance. This enabled him to establish himself in Gurgan and Dihistan, where he acknowledged the suzerainty of Il-Arslan. Unfortunately for him, however, he eventually lost the support of the shah, and a Khwarezmid army expelled him from Dihistan in 1165.

Notes

References
"Al-E Bavand." Encyclopaedia Iranica Online. Encyclopædia Iranica. 2 February 2008. <http://www.iranicaonline.org/articles/al-e-bavand>

"Il-Arslan, Abu'l-Fath." Encyclopaedia Iranica Online. 2004. Encyclopædia Iranica. 2 February 2008. <http://www.iranicaonline.org/articles/il-arslan>

Emirs
12th-century monarchs in Asia
History of Khorasan
Ghilman

Ikhtiyar al-Din Ai-Taq


The Canal de Marans à La Rochelle, also known as Canal de Marans, Canal de Rompsay () or Canal de La Rochelle depending on the location, is a French canal in the Charente-Maritime department connecting the city of La Rochelle with the town of Marans. It also connects the river of the Sèvre Niortaise to the harbour at La Rochelle. The canal goes through the communes of Dompierre-sur-Mer, Andilly and Sainte-Soulle. It is 24.5 km long, with 4 locks, and has a total level change of 1.7 m. It has a width of 5.2 m.

The canal was built in the 19th century in order to foster trade between the two cities. It was part of a great project of a North-South canal connecting the river Loire to the Adour. The project was ordered by imperial decision of Napoleon I on 17 July 1805, with the objective of connecting Niort with La Rochelle. It was started in 1806, but only open in 1875, and only reached La Rochelle in 1888. It was built with the forced labour of prisoners. When it was completed however, the advent of the train (with the establishment of a track between Nantes and La Rochelle) meant that the canal fell into disuse. Navigation on the canal was totally stopped after the Second World War. It is today not navigable. The canal allows for picturesque walks between the two cities. It is renowned for its flora and fauna.

The waters of the canal discharge into the Maubec reservoir at La Rochelle, just before the tidal bassin, and its waters contribute to scour the harbour and navigable channels.

Photos

See also
List of canals in France

Notes

References
 Service départemental de l'architecture et du patrimoine de Charente-Maritime.

Marans
Buildings and structures in Charente-Maritime
Tourist attractions in Charente-Maritime
Transport in Nouvelle-Aquitaine
Canals opened in 1875

Canal de Marans à La Rochelle


In Norse mythology, Sessrumnir (Old Norse: "seat-room" or "seat-roomer") is an enormous hall belonging to the goddess Freyja. There she receives half of those killed in battle, as chosen by the Valkyries. It is said to be very large and has many seats.

Norse mythology

Sessrumnir


Total Eclipse is a 1995 biographical-drama movie. This movie is about two 19th century French poets who become romantically involved with one another. Leonardo DiCaprio plays Arthur Rimbaud. The movie got some bad reviews not long after its release.

1990s biographical movies
1990s erotic movies
1995 LGBT movies
1995 drama movies
American biographical movies
American drama movies
American LGBT movies
American independent movies
Movies based on plays
French LGBT movies
French biographical movies
French drama movies
Belgian LGBT movies
Belgian biographical movies
Belgian drama movies
Movies directed by Agnieszka Holland
Movies set in the 19th century
Movies set in Belgium

Total Eclipse


Ohtana/Aapua FF is a Swedish football club located in Ohtanajärvi in Pajala Municipality and Aapua in Övertorneå Municipality, Norrbotten County.

Background
Ohtanajärvi/Aapua Fotbollsförening were formed in 1998 following the merger of the Ohtanajärvi IK and Aapua IF clubs. Ohtanajärvi IK was established on 20 June 1950 at a meeting in the school in Ohtanajärvi

Since their foundation Ohtana/Aapua FF has participated in the middle and lower divisions of the Swedish football league system.  The club currently plays in Division 3 Norra Norrland which is the fifth tier of Swedish football. They play their home matches at the Skolvallen in Ohtanajärvi and Byavallen in Aapua.

Ohtana/Aapua FF are affiliated to the Norrbottens Fotbollförbund. The club compete in the Midnattsolscupen (Midnight Sun Cup) and in 2010 reached the final where they lost on penalties to Stolitsa Moskva.

Recent history
In recent seasons Ohtana/Aapua FF have competed in the following divisions:
2013 Division III, Norra Norrland
2012 Division IV, Norrbotten Norra
2011 Division IV, Norrbotten Norra
2010	Division III, Norra Norrland
2009	Division III, Norra Norrland
2008	Division III, Norra Norrland
2007	Division III, Norra Norrland
2006	Division III, Norra Norrland
2005	Division IV, Norrbotten Norra
2004	Division III, Norra Norrland
2003	Division IV, Norrbotten Norra
2002	Division IV, Norrbotten Norra
2001	Division IV, Norrbotten Norra
2000	Division IV, Norrbotten Norra
1999	Division IV, Norrbotten Norra

Footnotes

External links
 Ohtana/Aapua FF – Official website

Football clubs in Norrbotten County
Association football clubs established in 1998
1998 establishments in Sweden

Ohtana/Aapua FF


The Carillon Neighborhood Historic District encompasses a residential area of western Richmond, Virginia, USA. It is located about  west of downtown Richmond, and is roughly bounded on the north and west by the Powhite Expressway and the Downtown Expressway, on the south by the Kanawha Canal, and on the east by Byrd Park. Although this area has a residential history dating back to the 19th century (when it was mainly country estates), its present architecture is reflective of its development first as a streetcar suburb, and then as a post-World War II housing development area.

The district was listed on the National Register of Historic Places in 2016.

See also
National Register of Historic Places listings in Richmond, Virginia

References

Historic districts on the National Register of Historic Places in Virginia
Buildings and structures in Richmond, Virginia
National Register of Historic Places in Richmond, Virginia

Carillon Neighborhood Historic District


Mushing is a sport or transport method powered by dogs. It includes carting, pulka, dog scootering, sled dog racing, skijoring, freighting, and weight pulling. Mushing suggests the use of one or more dogs to pull a sled, most commonly a specialized type of dog sled on snow, or a rig on dry land.

Sports involving animals
Working dogs
Winter sports

Mushing


Pepsi Invaders (erroneously identified as Coke Wins and Coke Invaders) is a non-commercially released 1983 fixed shooter video game developed by Atari, Inc. for the Atari 2600. It was commissioned by The Coca-Cola Company to be handed out to salespeople at their 1983 sales convention. A reskin of the system's version of Space Invaders, the player shoots down a flying formation of letters spelling "PEPSI", Coca-Cola's long-time rival. Only 125 copies were distributed.

Gameplay

The game is a modification of Space Invaders, with nearly identical gameplay, but with a number of tweaks. Instead of having limited lives and no time limit as in the original, Pepsi Invaders has unlimited lives and a three-minute time limit to complete as many waves of enemies as possible. If any invaders successfully traverse the lowest row, instead of the formation dropping to the ground and ending the game, it merely moves left and right until all the lowest row invaders are destroyed. It is therefore impossible to lose the game.

Primary graphic changes affected the invaders, each row of which consists of the letters "P E P S I" followed by a single alien, instead of the original six aliens per row. The letters move up and down as they march but do not otherwise animate. The UFO was changed to look like a flattened Pepsi logo in brand colors. A timer was added, displayed on the ground, which itself has been changed to a Coca-Cola-like brown color. An additional band of the same color frames the score at the top, with the word "COKE" prominently displayed to the left of the score. The player cannon now features two bands of the same brown color.

During the last 10 seconds, the timer and cannon limit indicators blink. When the time runs out, all invaders and UFOs disappear, the score changes to the word "WINS" (thus making the row read  "COKE WINS!"), and the player cannon and all texts flash rapidly. The player's final score can be seen in the attract mode after the game ends.

Development
Pepsi Invaders was commissioned by The Coca-Cola Company to be handed out to 125 executives at their 1983 sales convention along with an Atari 2600 console. It was developed by Atari, Inc. as a modification of the original Space Invaders cartridge. Due to the original Space Invaders Atari 2600 developer Rick Maurer leaving Atari over payment issues, Atari tasked designer Christopher Omarzu with hacking the original.

The game was delivered as a black cartridge with no label, in a plain white box with an "Atari goes better with Coke" sticker on the cover. The intent was to boost the morale of Coca-Cola's employees, but most of the cartridges were discarded by their recipients. Pepsi Invaders has been mistakenly labelled Coke Wins and Coke Invaders, to the confusion of Omarzu.

Legacy
Writer Matthew S. Eastin notes it as an early example of an advergame–an advertisement game–and discussed how it was more an attack on a competitor than an advertisement by the company who had it made. The Guardian included it in its list of the best product placement video games, similarly noting it as an early example of this and a "mischievous" marketing attempt. PC Format felt the marketing was smart, comparing it to The Apprentice. Retro Gamer was critical of Pepsi Invaders due to the letters not moving downward as the ships do in Space Invaders.

Copies of the game have sold for up to  on eBay.

See also
Advertising in video games

References

1983 video games
Advergames
Atari 2600 games
Fixed shooters
PepsiCo advertising campaigns
Promotional campaigns by Coca-Cola
Video games about food and drink
Video games developed in the United States

Pepsi Invaders


The Karlmann King is a low-production SUV that is manufactured in Italy and the United States.

The price starts at $1.85 million, for the standard version. It is the most expensive SUV in the world. It features a 6.8-liter V10 engine which produced 398 horsepower. However, because the Karlmann King weighs an abnormally-heavy 10,580 pounds (Without armor), its top speed is a mere 87 mph. The car features optional bullet proofing. Only 9 units will be built in Italy, however a larger, unknown number will be built in the United States in a modified and more standardized version. Other features include independent air conditioning for the front and rear, a coffee machine, neon sky lighting, a flat-screen TV, electric tables, air purification, a bar, a laptop and a fridge. All of the electric features can be controlled via an in and out-car app or a built-in control panel. Entertainment options include a Hi-Fi sound system, a PlayStation 4, phone projection, satellite TV and Wi-Fi.

References

Sport utility vehicles

Karlmann King


Señorita Panamá 1992, the tenth Señorita Panamá pageant, was held at the Teatro Anayansi of Atlapa Convention Centre in Panama City, Panama, on August 15, 1992, celebrating the foundation of the Old Panama City (Panamá La Vieja). The pageant was broadcast on August 24 through RPC Panamá. 15 contestants from all over the country competed for the prestigious crown. At the conclusion of the final gala, outgoing titleholder Ana Cecilia Orillac Arias crowned Giselle Amelia González Aranda as the new Señorita Panamá.

González went on to compete in the 42nd edition of the Miss Universe 1993 pageant, was held at Auditorio Nacional, Mexico City, Mexico on May 21, 1993.[1]. Michelle Harrington traveled to Sun City, South Africa, to take part in the Miss World 1992 competition.

Final Result

Contestants
These are the competitors who have been selected this year.

Candidates Notes

Elsa Jiménez Jiménez won the Miss Hispanidad 1993.

References

External links
  Señorita Panamá  official website

Señorita Panamá
1992 beauty pageants

Señorita Panamá 1992


John Eyre (January 1754 – 28/29 March 1803) was an English evangelical clergyman. He helped in establishing some of the major national evangelical institutions.

Early life
The son of John Eyre of Bodmin, he was born there in January 1754, and baptised on 25 February. He was educated in classics by the Rev. John Fisher, master of Bodmin grammar school, and in mathematics by the Rev. Joseph Thorpe, rector of Forrabury and Trevalga, Cornwall, in his private school at Forrabury. When fifteen years old he was apprenticed to Mr. Oliver, a clothier of Tavistock; and soon afterwards began preaching in the town. At the end of his apprenticeship he returned to his father's business at Bodmin, and preached in the town hall.

Eyre's father expelled him from home. Through a friend Eyre was able to enter Trevecca College, and with the Countess of Huntingdon's Connexion he ministered at Tregony, Cornwall, Lincoln, and Mulberry Gardens Chapel, London. Working among the dissenters, he also desired to take orders in the Church of England, and he matriculated at Emmanuel College, Cambridge, in 1778. On 30 May 1779 he was ordained deacon by Robert Lowth, and on 19 December 1779 he was advanced to the priesthood by Thomas Thurlow. He was curate at Weston in 1779, to Cecil at Lewes until 1781, then at Reading, and at Chelsea, serving in both places under Cadogan until 1785.

In Hackney
About the end of 1785 year Eyre was appointed minister of Homerton, often then called Ram's Chapel after its founder and he opened a school at Well Street, Hackney. Robert Aspland was one of his pupils, and Daniel Wilson another.

The Evangelical Magazine was planned by Eyre, and he edited and contributed to its volumes until 1802. It was a joint venture of Church of England and dissenting ministers, with the first number appearing in July 1793. He was one of the founders of the London Missionary Society (1794–5), and he encouraged Edward Hanson in establishing a dissenting academy at Idle, about 1800. A scheme originated in 1796 by Eyre and others to sending out evangelical preachers into the counties south of London, and from this arose Hackney Theological College, opened in 1803. William Jay noted how Eyre, a Calvinist in theology, was asked to preach at John Wesley's chapel in Moorfields, and gave no offence.

Death
After a long illness Eyre died on 28 or 29 March 1803, and was buried in a vault on the south side of the communion-table in Homerton Chapel, 5 April. His funeral sermon was preached by Rowland Hill. In November 1785 he had married Mary Keene, from near Reading, who died at Well Street, Hackney, 20 June 1827, aged 69, and was buried by her husband's side on 29 June.

Eyre's sermon at the opening of Cheshunt College was published, with related documents, in 1792. A memoir of Eyre by George Collison appeared in the Evangelical Magazine for June and July 1803.

References

Attribution

1754 births
English Christian religious leaders
English evangelicals
English Calvinist and Reformed ministers
1803 deaths
People from Bodmin

John Eyre (evangelical minister)


The Kawasaki GPZ1000RX (Ninja 1000R, model designation ZXT00A) was a motorcycle made by Kawasaki from 1986 to 1988. It had a  four-cylinder, 16-valve, twin cam engine.

The GPZ1000RX was to be the replacement for the original Ninja, the GPZ900R, but as it turned out the GPZ900R not only lived on alongside the GPZ1000RX, but outlived it. Just as the GPZ900R two years before, the 1000RX was the fastest production bike at the time. Until in 1988 the GPZ 1000RX was superseded by the ZX-10 "Tomcat". Yet still the GPZ900R remained, even beyond the 1990 release of Kawasaki's new flagship, the ZZ-R1100, until 2003.

References

GPZ1000RX
Sport bikes
Motorcycles introduced in 1986

Kawasaki GPZ1000RX


The Legal Framework Order, 2002 was issued by Pakistani president Parwez Musharraf in August 2002. It provided for the general elections of 2002 and the revival of the 1973 Constitution of Pakistan, and added numerous amendments to the Constitution. The following month, the Supreme Court overruled Musharraf, ruling that the amendments would have to be ratified by Parliament in the manner provided in the unamended 1973 Constitution—the amendments would have to be approved by two-thirds of both houses of the bicameral body.

After the October 2002 general elections, although Musharraf's supporters had a majority in Parliament, they did not have the required two-thirds supermajority to ratify the Legal Framework Order. Parliament was effectively deadlocked by strident opposition from Musharraf's opponents for over a year. In December 2003, a faction was persuaded to vote for a compromise amendment bill, the Seventeenth Amendment to the Constitution of Pakistan. With this amendment, parts of the Legal Framework Order were incorporated into the Constitution.

External links
 Text of Legal Framework Order, 2002

Constitution of Pakistan

Legal Framework Order, 2002


Dorothee Metlitzki (or Devora Metlitsky; July 27, 1914 – April 14, 2001) was a German-born, later American, author and professor of English at the University of California, Berkeley and, for most of her career, at Yale University. She was a specialist in medieval English literature and history, Arabic literature and language and of the author Herman Melville.

In addition she was a Zionist who played an important role in the foundation of the modern State of Israel.

Career

Dorothee Metlitzki obtained a BA and two MA degrees from the University of London, one in medieval English and one in classical Arabic. After helping found Hebrew University in Jerusalem's department of English she moved to the US to attend Yale University, graduating with a PhD in 1954.

She then took a position at the University of California, Berkeley's English department as lecturer and later, in 1964, as an associate professor, the department's second woman ever to be tenured. This was followed, in 1966, by teaching for 36 years at Yale University and also becoming the second woman ever to be tenured by that University's department of English as well.

She published several academic books dealing with her interests including Celestial Origin of Elpheta and Algarsyf in Chaucer's "Squire's Tale," Melville's "Orienda" and The Matter of Araby in Medieval England.

Personal life

Dorothee Metlitzki was born in 1914 in the city of Königsberg, (East Prussia)  but soon moved to Yekaterinburg, Russia, where her father worked as an international banker who is still waiting to be repaid by the King of Denmark.
Her father was imprisoned during the Russian Revolution and her mother moved the rest of the family to Lithuania, where her father rejoined them after his stay in prison.

Having left Lithuania for London following outbreaks of antisemitism, Metlitzki became an active Zionist in England, working with fellow Zionists Aubrey Eban, Golda Meir and Moshe Sharet on the development of the State of Israel. She moved to Jerusalem after World War II and spent 15 years there founding the English department at Hebrew University.

In 1943 she married the Arabist Paul Kraus who had come with his baby daughter from Cairo, after his wife's death at birth. Kraus left back to the University of Cairo alone, as Dorothee was ill at a Jerusalem hospital. Within several months Kraus was found dead, alleged to have committed suicide. She remarried the Jewish Egyptologist Bernhard Grdseloff in 1945, and the couple had a daughter, Ruth. In 1947 Grdseloff developed cancer, and was hospitalized in Cairo, before the family was able to leave for Palestine, towards the establishment of the State of Israel. Dorothee spent the next years traveling between Israel and Egypt - then enemy states, and tending to her husband, till his death in a Cairo hospital in 1950.

In 1953, she moved to Connecticut with her sole daughter, and worked at Yale University. There she had a short marriage with the Assyrologist Jacob Finkelstein, moving after him to Berkeley, California, but the two quickly parted, and she returned to Yale where she taught until her death.

Political and social activity
In the late 1930s, Before the establishment of the state of Israel, Metlitzki worked for advancing the Zionist movement, visiting various countries and speaking before Zionist women.

During the term of Golda Meir as Prime Minister of Israel, Metlitzki worked in the government there as a press officer for the Foreign Ministry and secretary for the affairs of Arab women in the Israeli Federation of Labor. Using her knowledge of the Arabic language and culture, she served the Arab women, protecting their rights, with the vision of a bi-lingual bi-cultural state.

References

Further reading
 Paul Kraus (Arabist) Metlitzki's first husband
 Her MA Thesis in London 1938 A study of Arabic influences on the literature and thought of the English Middle Ages.
 The Matter of Araby in Medieval England Metlitzki's most important book, Yale Press, () Reprint July 2005
 A tribute to Dorothee Metlitzky
 Newspaper clipping from the Canadian Jewish Review where Devorah Metlitzky, head of Arab Women's section in the Histadrut, is invited as guest speaker at a Zionist banquet.
 Melville's Orienda Book by Dorothee Metlitsky Finkelstein (), Yale Books, 1961
 Obituary of Berkeley University
 Eduard Said on Metlitzki (Hebrew) in his foreword for the Hebrew edition of his book.

1914 births
2001 deaths
Zionist activists
American academics of English literature
Writers from Königsberg
Alumni of the University of London
Jewish women writers
American Zionists
University of California, Berkeley faculty
Yale University faculty
Academic staff of the Hebrew University of Jerusalem
Historians of Arabic literature
Jewish American academics
20th-century American Jews
German emigrants to the United States

Dorothee Metlitzki


uh

how to install
im still trying yet I dont see it in my preferences Darbymarby (talk) 20:17, 29 July 2023 (UTC)
 Wikipedia:Twinkle#Quick info says:
 If your account is very new, you will not be able to use Twinkle. You need to be autoconfirmed (at least four days old and have ten edits) to enable the Twinkle gadget.
PrimeHunter (talk) 21:25, 29 July 2023 (UTC)
oh Darbymarby (talk) 21:33, 29 July 2023 (UTC)

Modifying existing or adding custom Twinkle templates?

Hi! I've been using Twinkle a lot and really value it- I couldn't be so efficient editing Wikipedia without it.

I really love all the various Welcome and Warning templates that we can auto-insert onto User Talk Pages. Is it at all possible to modify the wording of these templates (maybe to simply some of the language, make it a bit less cookie-cutter, etc) or even add new templates from custom text I have created? (check my User Page where I've written a bunch of generic messages I often use, it would be cool to be able to use some of them in Twinkle..)

Or, as I suspect, does Twinkle only work with the existing Wikipedia:Template index/User talk namespace templates?

Thanks! Qcne (talk) 15:52, 2 August 2023 (UTC)
@Qcne, I agree that Twinkle is awesome. For changes to warning/welcome templates, you'd want to start a discussion on the talk page for the specific template and get consensus to change any wording. You can create your own templates, and configure Twinkle to list your custom templates in the dropdown (for you). The instruction text for custom warning configuration in Twinkle says  Schazjmd (talk) 15:55, 2 August 2023 (UTC)
Awesome, thanks! Qcne (talk) 18:40, 4 August 2023 (UTC)

Didn't turn on CSD/PROD/XFD logging until late July. Is there a way to add my previous month's logs?

I love logs, and I love data! Thus, I was pleased to discover the logging features of Twinkle so I can easily see all my CSDs, PRODs, and XFDs in one place!

Unfortunately I only found out about this feature in late July, so a good months worth of these activities are missing.

Is there a way to easily add these earlier missed activities to my Twinkle logs? Qcne (talk) 18:42, 4 August 2023 (UTC)

Unfortunately not. There's a discussion above about turning this on by default (Wikipedia talk:Twinkle#csd/prod/xfd: turn on userspace logging by default), but it did not achieve consensus due to privacy concerns. –Novem Linguae (talk) 22:56, 4 August 2023 (UTC)
But you said it was possible to "gather this info". Nardog (talk) 23:07, 4 August 2023 (UTC)
Oh sorry, I thought the editor asked if there was an easy way to add them to their CSD log. If you just want an off-wiki list, this should do the trick: quarry:query/75658 –Novem Linguae (talk) 23:49, 4 August 2023 (UTC)

Add two file templates to the standard installations

The templates  and  would be useful to add to the standard installations for file tagging. I have added them to my own Twinkleoptions but I think more than me would find these templates useful.Jonteemil (talk) 15:09, 5 August 2023 (UTC)

How widespread is the Fake SVG issue? It should be possible to detect quite automatically. Also should we ever have NFCC images in a vector format? That is easily detectable and could become an automatically populated category through templates. I can't say I'm a fan of maybe free media without a reason either. For most of them it's not obvious why someone thought it may be free which makes it difficult to remove even if you disagree which makes it an almost unactionable backlog. Please note that I'm not particularly experienced with files an others may very well disagree --Trialpears (talk) 17:51, 5 August 2023 (UTC)
The thing is, Commons has always had both c:Template:Bad SVG (SVGs that mixes vector and raster graphics when it should be all vector) and c:Template:Fake SVG (SVGs that only has raster graphics, when it should be all vector), whereas Wikipedia, up until yesterday, only has had  (which is already in Twinkle's standard installation). I however have now created  here on Wikipedia as well since there is a usecase for it. The majority of the files tagged with  here on Wikipedia are really  but since the template hasn't existed until now people have used the Bad SVG template for bad as well as fake SVGs. How widespread it is, is hard to tell. There is probably a big dark figure of SVGs that haven't been tagged. If Wikipedia should host non-free SVGs or not is a completely different question which I'd say is irrelevant to this edit request to Twinkle. Jonteemil (talk) 23:02, 5 August 2023 (UTC)
 I'm not quite sure what you mean by this if you'd care to expand. Jonteemil (talk) 23:07, 5 August 2023 (UTC)
They are probably referring to the practice of reducing the resolution of fair use images to comply with fair use law. Vector images are very sharp compared to raster images and may need to be converted to raster to do this. So I think they are questioning if vector images should ever be allowed for fair use. Images hosted on enwiki rather than commons are quite likely to be fair use rather than more permissively licensed. –Novem Linguae (talk) 01:02, 6 August 2023 (UTC)
Okay, well, as I wrote that question should probably not be discussed here. Jonteemil (talk) 08:46, 6 August 2023 (UTC)
 should be used on files tagged as non-free that in fact might be free. I can agree that perhaps adding the file to WP:FFD is bettee but there are SO MANY files that uploaders without thinking mark as non-free and if each and everyone of those would go to FFD than that page would have the backlog of backlogs. It also takes some time to change the license of a file since you have to do it manually. Therefore the template serves a purpose when you find a non-free file, that you might think is free. Then you can add  and hope someone with more time can update the license or add it to FFD. The template is used on 12,151(!) files.Jonteemil (talk) 23:21, 5 August 2023 (UTC)

Feature request for a papercut: Support Template:Being deleted as if it were a CSD tag

Right now in the WP:TFD lifecycle, admins can either close things directly (mostly using XFDCloser), or any user can close a TFD as delete or similar result with further work to be completed, which lands the template on WP:TFDH. While the template of interest is listed there, it has a  tag on it. Then people work through those at some rate or another while using that page to track what needs to be done.

When the template gets done being worked through, the workflow is then to delete the template itself. A non-admin can either move the template to the final "ready to be deleted" section and tags the template with , or an admin can simply delete the template. Sometimes, the "move over there" doesn't happen, most often when it's an admin who has worked on removing the template's uses. This leaves the  template on the page.

Thus, the papercut: When I go to select CSD in the TW dialog, I have to do all the manual rigamarole (tag the bubble, cut-paste the link from  and then removing the rest of the URL). Instead, I'd like to see TW select the appropriate G6 summary (XFD) and autofill the name of the nomination page to present the erstwhile admin with an easy "delete" button. Izno (talk) 19:56, 5 August 2023 (UTC)
In other words, pull the  value from the template to pre-populate the G6 rationale location. Primefac (talk) 19:58, 5 August 2023 (UTC)
This can be done at the template level itself. Twinkle prefills the deletion rationale from the #delete-reason element if present on the page. This exists on all deletion templates. So the request boils down to including that in . – SD0001 (talk) 10:24, 10 August 2023 (UTC)
Super, I'll see about doing that. Primefac (talk) 11:36, 10 August 2023 (UTC)
. Primefac (talk) 11:44, 10 August 2023 (UTC)
Courtesy ping to , , and  as a few of the primary TFDH-cleaners. Primefac (talk) 19:52, 10 August 2023 (UTC)
Excellent. Izno (talk) 20:54, 10 August 2023 (UTC)

Request undeletion at WP:REFUND

It would be nifty to be able to request undeletions at WP:REFUND with directly at the page with Twinkle. Currently this is not possible; it has to be done manually. This function would be used in part at pages that have been deleted, to request its undeletion. The other usecase is for files. Non-free files are tagged with  and all but the most recent revision are hidden, see for example Special:Log/File:Manchester United FC crest.svg. Sometimes very simple files are originally, incorrectly, marked as non-free and when you correct the license to , you can't import the file to Commons unless all revisions are unhidden, so it would be very useful to add the file to WP:REFUND using Twinkle. Jonteemil (talk) 08:58, 6 August 2023 (UTC)

:File:IFK Trelleborg logo.svg would be a good example of a file, originally being licensed as non-free, while it actually was free and now the previous version needs to be unhidden. Jonteemil (talk) 09:02, 6 August 2023 (UTC)

Trying to bypass confirmation requirement

But it not work. Anyone have idea? MisDisUnIn (talk) 08:19, 8 August 2023 (UTC)
 Don't - the limit is there for a reason. KylieTastic (talk) 08:25, 8 August 2023 (UTC)

If you are referring to getting autoconfirmed, there is no way to "bypass" the 4 days requirement- and if there were, please don't try to game the system. The system exists for a reason.  For what reason do you need access to Twinkle immediately? 331dot (talk) 08:26, 8 August 2023 (UTC)

Addition of cleanup template

Hi, I was wondering if the templates Template:Cleanup colors and Template:Overcoloured could be included as options when tagging a page? Cheers! :3 F4U (they/it) 16:35, 8 August 2023 (UTC)

I want an easy way to request articles for merging in twinkle.

Doing it the conventional way is tedious, but I do not want to resort to using disruptive deletion nominations in order to get articles to be merged. Grandmaster Huon (talk) 21:42, 8 August 2023 (UTC)

You need to stop attempting to merge anything, per this discussion on your talk page. Find a stub and start editing instead. Izno (talk) 22:00, 8 August 2023 (UTC)

RM/TR error

Twice in the last few days, I've encountered an error when trying to propose uncontroversial technical move requests. The error message says "". It's prevented me entirely from using Twinkle to make these requests, leaving me to have to open discussions for them instead. I only first encountered the error at around 04:28, August 11, 2023, and again just now on multiple articles (one as a test). QuietHere (talk | contributions) 09:31, 13 August 2023 (UTC)

I'm sorry you're experiencing this inconvenience but please do not open RMs if you don't intend to. You can always list it on RMTR manually. Nardog (talk) 09:41, 13 August 2023 (UTC)
A very fair point. I haven't manually added to RM/TR in so long that I forgot about that option and just did it as discussions because it was the one Twinkle option available. Thank you for removing both discussions. QuietHere (talk | contributions) 09:45, 13 August 2023 (UTC)
 I believe Twinkle looks for a specific HTML comment to decode WP:RM/TR, so I have restored it to the version that was current when Twinkle last edited the page successfully. That may have fixed it. -- John of Reading (talk) 11:57, 13 August 2023 (UTC)
I'm getting a similar error from attempting to create a RM/TR with Twinkle. Certes (talk) 17:42, 13 August 2023 (UTC)
@Certes did you get it just then or was it before John of Reading's fix attempt? QuietHere (talk | contributions) 18:28, 13 August 2023 (UTC)
About 17:35 UTC today. Certes (talk) 18:29, 13 August 2023 (UTC)
The code that handles this was changed in this patch that deployed on August 10. Perhaps I broke something with the new code. Will do some tests and see what I find. This diff probably wasn't needed, the new code targets the level 4 heading "Requests to revert undiscussed moves". Hope this helps. –Novem Linguae (talk) 23:07, 13 August 2023 (UTC)
Should be fixed now. Patch. Thanks for reporting. –Novem Linguae (talk) 23:46, 13 August 2023 (UTC)

Gadget on Pawiki
Pawiki has twinkle gadget (files created in 2018-19) and then
I updated files from Wikipedia:Twinkle/Localisation
And now i tried the gadget for protection, deleting an arricle but its not working. Is it possible to delete all the files and try new method twinkle starter for localisation? Will it be done via phabricator? KuldeepBurjBhalaike (Talk) 06:47, 25 August 2023 (UTC)

@SD0001: If you have a minute, looks like a question about twinkle-starter. –Novem Linguae (talk) 14:41, 25 August 2023 (UTC)
Thanks for the ping. @Kuldeepburjbhalaike Feel free to give twinkle-starter a try. But due to low adoption, it has not been fully tested on real wikis, so many issues are likely to be encountered which would need to be looked at. – SD0001 (talk) 18:53, 25 August 2023 (UTC)
, thanks for the reply, if you please tell, what will be process to add twinkle in  pawiki? KuldeepBurjBhalaike (Talk) 03:21, 26 August 2023 (UTC)
Please see the README. Some familiarity with JavaScript is a prerequisite. – SD0001 (talk) 05:53, 26 August 2023 (UTC)
@Kuldeepburjbhalaike Just a note: you need to create a tag called twinkle by using Tag management settings. —MdsShakil (talk) 19:20, 26 August 2023 (UTC)
, Created the tag. KuldeepBurjBhalaike (Talk) 00:53, 27 August 2023 (UTC)
@Kuldeepburjbhalaike It's supposed to work now, but you need to localize it. —MdsShakil (talk) 03:11, 27 August 2023 (UTC)
thank you very much. are mediawiki twinkle gadget files required for twinkle starter? or it work diffrently? KuldeepBurjBhalaike (Talk) 03:22, 27 August 2023 (UTC)
I am not familiar with Twinkle Starter, so I can't confirm that. But for your wiki's current twinkle, they are required. —MdsShakil (talk) 06:17, 27 August 2023 (UTC)

Warning preview displays superscript as subscript

When I preview a warning on a user, all superscript text in the warning preview will be displayed as subscript. For example, my signature, which should be "– dudhhr talkcontribssheher", is displayed as "– dudhhr talkcontribssheher". Thanks, – dudhhr talkcontribssheher 07:37, 27 August 2023 (UTC)
It's because of this CSS used in twinkle that nullifies sub/sup vertical alignments. I'm not sure why that's even present. – SD0001 (talk) 08:12, 27 August 2023 (UTC)
Blame says 11 years ago by . Could try taking it out and see what happens. –Novem Linguae (talk) 08:38, 28 August 2023 (UTC)

Feature request: XfD bundle noms

Would it be possible to incorporate WP:BUNDLE nominations into Twinkle's XfD module? I imagine checking a box that says  and then inputting a list of pages, or something like that. All it would need to do would be to add the XfD tag to the other pages (without changing the link to the XfD discussion page). Thanks :) Actualcpscm scrutinize, talk 15:25, 31 August 2023 (UTC)

That would be a wonderful enhancement.  Bundling is awkward, and before I finish using Twinkle multiple times, someone has usually jumped in to comment on what looks to them like an isolated nomination.  (I tend to use a rationale of "Part of a bundle; please wait before commenting" then add the real rationale later, but that's not ideal.) Certes (talk) 17:07, 31 August 2023 (UTC)

Nomination for deletion of :Template:Welcome-unconstructive
:Template:Welcome-unconstructive has been nominated for deletion. You are invited to comment on the discussion at the entry on the Templates for discussion page. #prodraxis connect 14:06, 7 September 2023 (UTC)

"Thanks" template

I seem to remember an option in Twinkle to add a "Thanks" template to a user page. Is this still available, or is there another easy way to do this? —danhash (talk) 18:13, 8 September 2023 (UTC)

Perhaps you're thinking of WikiLove. Nardog (talk) 21:51, 8 September 2023 (UTC)

New user warning template

Per Wikipedia_talk:Template_index/User_talk_namespace#What_template_to_warn_editor_about_failed_verification? this discussion, I realized that there is no suitable template for editors who introduce failed verification issues, wether intentionally or unintentionally. Therefore, I created the new template Template:Uw-fv1. Is it possible to add it to Twinkle so that it's easier to find? I suggest the description "content that is not supported by the cited source". Thanks (t · c) buidhe 03:40, 13 September 2023 (UTC)

Twinkle RfD postings don't show the discussion on mobile (but do show the discussion when manually subst-ing)

Not quite sure where to post this, but I've always used Twinkle to start XfD discussions because it simplifies the workflow a lot. That being said, I found myself in need of nominating a bundle of redirects, (something I don't think Twinkle is able to do currently to my knowledge), and felt it would be best to just substitute the rfd template on all the redirect pages manually. However, the links between the twinkle-redirect nominations and the manual-redirect nomination seemed to be different shades of purple when clicked, which is something I hadn't experienced ever. Testing the two different versions on the Wikipedia mobile app, for some reason the RfD tag is invisible on mobile (which is what I had grown accustomed to for all RfDs I've seen), whereas the discussion box actually appeared for the redirects that I manually tagged.

This may not be a problem with Twinkle, and it could be something else that's an issue entirely (such as me subst-ing wrong). I did want to bring it up though because it doesn't look like Twinkle properly shows the RfD header on mobile whenever it XfDs a page, which I'm not sure why that might be. Utopes (talk / cont) 06:11, 14 September 2023 (UTC)

Got any diffs? Got a WP:STEPSTOREPRODUCE? Is the main problem that the links are different colors, or that one of the templates is completely hidden on mobile? By the way, different color links usually means that you already clicked one but hadn't clicked the other. Your browser will change the color of a previously clicked link a bit. –Novem Linguae (talk) 14:33, 14 September 2023 (UTC)

Multiple issues in body issue

I used Twinkle to try to add a  tag to the top of the article, and it ended up putting it in the middle of another tag in a  tag in an article section. See . I reported this issue before, so I guess it somehow broke again. voorts (talk/contributions) 22:59, 17 September 2023 (UTC)
The original issue never got fixed. Lack of volunteer developers to write patches. It has a ticket though so that's a good first step. Maybe myself or someone will get a burst of energy and write patches for a bunch of tickets someday. That's how I originally got involved in Twinkle... I went through all the tickets and wrote like 25 patches for the easy ones. –Novem Linguae (talk) 02:03, 18 September 2023 (UTC)
Thank you for letting me know. Hopefully it gets addressed soon. voorts (talk/contributions) 02:56, 18 September 2023 (UTC)

Nominating drafts for deletion

Hello. Please consider adding the following warning/notice when a user tries to nominate a draft for deletion at MfD:

Thank you. InfiniteNexus (talk) 00:50, 19 September 2023 (UTC)

Are there some recent noms that have caused problems? Got any diffs? In general, it is sometimes appropriate to MFD drafts, such as if an editor has exhausted the patience of AFC reviewers through various misbehaviors. –Novem Linguae (talk) 16:05, 19 September 2023 (UTC)
I have participated in numerous time-consuming MfDs of problematic but ultimately harmless drafts, so yes, this is very much a real issue. But to address your point:

InfiniteNexus (talk) 21:50, 19 September 2023 (UTC)

Protection template breaking AfD

I first noticed this when @Zoglophie fixed my error and I thought it was human, because we know I'm good at those.  However, I just noticed that it happens when Twinkle adds the PP. Can this be fixed so as not to break AfDs? Let me know if more information is needed. Star Mississippi 16:30, 22 September 2023 (UTC)
Yeap, looks like a bug. I created a ticket to get the process started. Thanks for reporting. –Novem Linguae (talk) 18:07, 22 September 2023 (UTC)
Thank you! Let me know if I can help further. Star Mississippi 01:33, 23 September 2023 (UTC)

WT:TW


José Feghali (March 28, 1961 – December 9, 2014,) was a Brazilian pianist, who, until his death, was an Artist-in-Residence at Texas Christian University's school of music in piano. He was the gold medalist winner of the Van Cliburn International Piano Competition in 1985.

The Van Cliburn Foundation and the Texas Christian University announced Feghali's death on December 9, 2014, by apparent suicide.

Education
José Feghali made his recital debut at the age of five and his concerto debut three years later with the Brazilian Symphony Orchestra. Feghali studied in London with Maria Curcio, then continued his studies at the Royal Academy of Music with Christopher Elton.

Professional career
Gold Medalist and winner of the Chamber Music prize at the Seventh Van Cliburn International Piano Competition, José Feghali was an Artist-in-Residence at TCU's School of Music in Fort Worth since 1990. He had appeared in over 1000 performances worldwide, including appearances with such orchestras as the Berlin Philharmonic, Concertgebouw of Amsterdam, Rotterdam Philharmonic, Gewandhaus of Leipzig, Royal Philharmonic, BBC Philharmonic, London Symphony, Birmingham Symphony, National Symphony of Spain, Warsaw Philharmonic, and the Shanghai and Beijing symphonies. In the US, he appeared in all the major cities and in virtually every state of the nation, including performances with the orchestras of Chicago, St. Louis, Dallas, Houston, Detroit, Atlanta, Baltimore, Pittsburgh and the National Symphony, and had worked with many eminent conductors including Kurt Masur, Christoph Eschenbach, Yuri Temirkanov and Leonard Slatkin. Recital appearances include performances at Carnegie Hall, Chicago Orchestra Hall, Kennedy Center, Ambassador Auditorium, Queen Elizabeth Hall, Wigmore Hall, Bass Hall and the Meyerson Symphony Center. Solo and concerto performances have taken him to Canada, Mexico, United Kingdom, France, Holland, Spain, Portugal, Austria, Germany, Italy, Switzerland, Poland, Bulgaria, Turkey, China, Singapore, Hong Kong and several countries in Latin America.

An avid chamber musician, José had appeared in several chamber festivals in the US and abroad, as well as in collaboration with James Galway, Truls Mørk, Antonio Meneses, Alisa Weilerstein, Edgar Meyer, David Shifrin, Olivier Charlier, Régis Pasquier, Tokyo String Quartet and John Vickers. He had been a judge at several international piano competitions, given regular masterclasses and was a member of the faculty at both the Piano Texas Piano Academy and Festival and the Mimir Chamber Music Festival in Fort Worth. His recordings are available on the Naxos, Koss and VAI labels.

José had worked as a producer, recording and mastering engineer in over 50 commercial and non-commercial audio recording projects, and was planning on releasing a number of CDs, including solo and chamber recitals. José was Coordinator of Internet Technologies for TCU's School of Music and was awarded the Mike Ferrari Award for his work at the School with Internet2 and conferencing related technology. He was invited to give a presentation at Internet2's 2009 Performing Arts Production Workshop on the application of Microsoft Research's ConferenceXP software in music and arts education after he discovered and corrected a flaw in the software that had until then made it incapable of high fidelity sound operation. ConferenceXP is an open-source software platform created by Microsoft Research used to deliver broadcast-quality audio and video for real-time distributed collaboration and distance learning environments. Unlike most video conferencing applications, sound quality is much more important than video quality for remote music pedagogical applications. José's changes to the ConferenceXP code has enabled the software to be one of the only software/hardware solutions available today with the capability of streaming compressed video simultaneously with CD-quality uncompressed audio, thus considerably reducing the bandwidth requirements for a successful distance learning music experience.

Death
Feghali's body was discovered on December 9, 2014, at his home in Fort Worth, Texas, an apparent suicide by gunshot.

See also
 Thirteenth Van Cliburn International Piano Competition

References

External links
José Feghali's Web Site

1961 births
2014 deaths
Alumni of the Royal Academy of Music
Brazilian classical pianists
Male classical pianists
Prize-winners of the Van Cliburn International Piano Competition
Brazilian expatriates in the United Kingdom
Brazilian expatriates in the United States
Pupils of Maria Curcio
Suicides by firearm in Texas
Texas Christian University faculty
20th-century classical pianists
2014 suicides

José Feghali


Pavel Grigorievich Egorov (; 8 January 1948 – 15 August 2017) was a Russian pianist and scholar.

He won the VI Robert Schumann Competition before graduating in 1975 from the Moscow Conservatory. He has performed widely at an international level since (ca. 3000 performances). He was a professor and the Head of the Piano Department at the Saint Petersburg Conservatory, where he taught from 1980 until his death.

Pavel Egorov was named a Meritorious Artist of the Russian Federation, and was a member of Saint Petersburg branch of the Russian Academy of Natural Sciences, and an Honorary Member at the Robert Schumann Society in Düsseldorf and the Saint Petersburg Philharmonic Society. The scientific editor of the first Russian edition of Robert Schumann's complete piano works (Muzyka, 1986), he was awarded the Robert Schumann Prize of the City of Zwickau in 1989.

He died of cancer  on 15 August 2017 at the age of 69.

References

External links
 Nikolay Rimsky-Korsakov Saint Petersburg State Conservatory
 Personalities of Saint Petersburg

1948 births
2017 deaths
Soviet classical pianists
Russian classical pianists
Male classical pianists
Academic staff of Saint Petersburg Conservatory
People's Artists of Russia
Moscow Conservatory alumni
Soviet music educators
Russian music educators
Musicians from Saint Petersburg

Pavel Egorov