text:
Friday the 13th

Friday the 13th is considered an unlucky day in Western superstition. It occurs when the 13th day of the month in the Gregorian calendar falls on a Friday, which happens at least once every year but can occur up to three times in the same year. For example, 2015 had a Friday the 13th in February, March, and November, which will happen again in 2026; 2017 through 2020 had two Friday the 13ths, as did 2023; 2016, 2021 and 2022 had just one Friday the 13th, as will 2025, 2027, and 2028; 2024 will have two Friday the 13ths.

A month has a Friday the 13th if and only if it begins on a Sunday.

Unluckiness of "13"
One source mentioned for the unlucky nature of the number "13" is a Norse myth about 12 gods having a dinner party in Valhalla. The trickster god Loki, who was not invited, arrived as the 13th guest, and arranged for Höðr to shoot Balder with a mistletoe-tipped arrow. Dossey: "Balder died, and the whole Earth got dark. The whole Earth mourned. It was a bad, unlucky day." This major event in Norse mythology caused the number 13 to be considered unlucky.

Christian associations
The superstition seems to relate to various things, like the story of Jesus' Last Supper and crucifixion in which there were 13 individuals present in the Upper Room on the 13th of Nisan Maundy Thursday, the night before his death on Good Friday.

In conjunction with Friday
While there is evidence of both Friday and the number 13 being considered unlucky, there is no record of the two items being referred to as especially unlucky in conjunction before the 19th century.

The Knights Templar

Some cite the arrest of the Knights Templar on Friday, October 13, 1307 by officers of King Philip IV of France as the origin of the Friday the 13th superstition, but it is agreed the origins remain murky.

19th century
In France, Friday 13th might have been associated with misfortune as early as the first half of the 19th century. A character in the 1834 play Les Finesses des Gribouilles states, "I was born on a Friday, December 13th, 1813 from which come all of my misfortunes".

An early documented reference in English occurs in H. S. Edwards' biography of Gioachino Rossini, who died on Friday 13th of November 1868:
 * "Rossini was surrounded to the last by admiring friends; and if it be true that, like so many Italians, he regarded Fridays as an unlucky day and thirteen as an unlucky number, it is remarkable that on Friday 13th of November he passed away."

Dissemination
It is possible that the publication in 1907 of T. W. Lawson's popular novel Friday, the Thirteenth, contributed to popularizing the superstition. In the novel, an unscrupulous broker takes advantage of the superstition to create a Wall Street panic on a Friday the 13th.

Similar dates
Similar dates are prevalent in many cultures, although it is unclear whether these similarities are in any way historically connected or only coincidental.

Tuesday the 13th in Hispanic and Greek culture
In Spanish-speaking countries, instead of Friday, Tuesday the 13th (martes trece) is considered a day of bad luck.

The Greeks also consider Tuesday (and especially the 13th) an unlucky day. Tuesday is considered dominated by the influence of Ares, the god of war (or Mars, the Roman equivalent). The fall of Constantinople to the Fourth Crusade occurred on Tuesday 13 April 1204, and the Fall of Constantinople to the Ottomans happened on Tuesday 29 May 1453, events that strengthen the superstition about Tuesday. In addition, in Greek the name of the day is Triti (Τρίτη) meaning the third (day of the week), adding weight to the superstition, since bad luck is said to "come in threes".

There is a Tuesday the 13th in months that begin on a Thursday.

Friday the 17th in Italy
In Italian popular culture, Friday the 17th (and not the 13th) is considered a bad luck day. The origin of this belief could be traced in the writing of the number 17, in Roman numerals: XVII. By shuffling the digits of the number one can get the Latin vīxī ("I have lived", implying death at present), an omen of bad luck. In fact, in Italy, 13 is generally considered a lucky number, although some people may consider 13 an unlucky number as well due to Americanization.

The 2000 parody film Shriek if You Know What I Did Last Friday the Thirteenth was released in Italy with the title Shriek – Hai impegni per venerdì 17? ("Shriek – Do You Have Something to Do on Friday the 17th?").

There is a Friday the 17th in months starting on Wednesday.

Social impact
According to the Stress Management Center and Phobia Institute in Asheville, North Carolina, an estimated 17–21 million people in the United States are affected by a fear of this day, making it the most feared day and date in history. Some people are so paralyzed by fear that they avoid their normal routines in doing business, taking flights or even getting out of bed. It has been estimated that US$ 800–900 million is lost in business on this day. Despite this, representatives for both Delta Air Lines and Continental Airlines (the latter now merged into United Airlines) have stated that their airlines do not suffer from any noticeable drop in travel on those Fridays.

In Finland, a consortium of governmental and nongovernmental organizations led by the Ministry of Social Affairs and Health promotes the National Accident Day (kansallinen tapaturmapäivä) to raise awareness about automotive safety, which always falls on a Friday the 13th. The event is coordinated by the Finnish Red Cross and has been held since 1995.

Rate of accidents
A study by Scanlon, Luben, Scanlon, & Singleton (1993) attracted attention from popular science literature, as it concluded that "the risk of hospital admission as a result of a transport accident may be increased by as much as 52 percent on the 13th"; however, the authors clearly state that "the numbers of admissions from accidents are too small to allow meaningful analysis". Subsequent studies have disproved any correlation between Friday the 13th and the rate of accidents.

On 12 June 2008 the Dutch Centre for Insurance Statistics stated to the contrary, that "fewer accidents and reports of fire and theft occur when the 13th of the month falls on a Friday than on other Fridays, because people are preventatively more careful or just stay home. Statistically speaking, driving is slightly safer on Friday the 13th, at least in the Netherlands; in the last two years, Dutch insurers received reports of an average 7,800 traffic accidents each Friday; but the average figure when the 13th fell on a Friday was just 7,500."

Distribution
Each 400 year Gregorian solar cycle contains 146,097 days (with 97 leap days) or exactly 20,871 weeks. Each cycle contains the same pattern of days of the week and therefore the same pattern of Fridays that are on the 13th. The 13th day of the month is very slightly more likely to be a Friday than any other day of the week.

 * {| class=wikitable style="margin-left: auto; margin-right: auto; border: none;"

! Day of the week ! Monday || Tuesday || Wednesday || Thursday || Friday || Saturday || Sunday ! Occurrences
 * + Distribution of the 13th day per weekday over 4,800 months (400 years)
 * - style="vertical-align:center; text-align:center"
 * - style="text-align:center;"
 * 685 || 685 || 687 || 684 || 688 || 684 || 687
 * }

Any month that starts on a Sunday contains a Friday the 13th, and there is at least one Friday the 13th in every calendar year. The months with a Friday the 13th are determined by the Dominical letter (G, F, GF, etc.) of the year. Years which begin on the same day of the week and are of the same type (i.e. common year or leap year), will have a Friday the 13th in the same months.

This sequence, given here for 1900–2099, follows a 28-year cycle from 1 March 1900 to 28 February 2100:

Frequency
Although there is always at least one Friday the 13th per calendar year, it can be as long as 14 months between two Friday the 13ths. The longest period that occurs without a Friday the 13th is 14 months, either from July to September the following year being a common year starting on Tuesday (F) (e.g. 2001–02, 2012–13 and 2018–19), or from August to October the following year being a leap year starting on Saturday (BA) (e.g. 1999–2000 and 2027–28). The shortest period that occurs with a Friday the 13th is just one month, from February to March in a common year starting on Thursday (D) (e.g. 2009, 2015 and 2026).

On average, there is a Friday the 13th once every 212.35 days. Friday the 13ths occurs with an average frequency of 1.7218 per year or about 3477 since the year 1 CE.

Frequency within a single year
There can be no more than three Friday the 13ths in a single calendar year; either in February, March, and November in a common year starting on Thursday (such as 2009, 2015, or 2026) (D), or January, April, and July in a leap year starting on Sunday (such as 1984, 2012, or 2040) (AG).

In the 2000s, there were three Friday the 13ths in 2009, and two Friday the 13ths in 2001, 2002, 2006, and 2007. In the 2010s, there were three Friday the 13ths in 2012 and 2015, and two in 2013, 2017, 2018, and 2019. In the 2020s, there were two Friday the 13ths in 2020 and 2023. There will also be three Friday the 13ths in 2026, and two in 2024, and 2029. The remaining years all have at least one Friday the 13th.

For the details see the table below; this table is for the Gregorian calendar and / for :

 * {| class="wikitable" style="margin-left: auto; margin-right: auto; border: none;"

! Year modulo 28 || || 1700 2100 || 1800 2200 || 1900 2300 || Year modulo 28
 * - style="vertical-align:center; text-align:center"
 * 06   17 23 || Jan Oct ||  Aug || Jun ||  Apr Jul ||  06    17 23
 * 01 07 18    ||  Apr Jul || May || Feb Mar Nov || Sep Dec || 01 07  18
 * 02   13 19  || Sep Dec || Jan Oct ||  Aug || Jun || 02    13 19
 * 03 14    25 || Jun ||  Apr Jul || May || Feb Mar Nov || 03  14    25
 * 09 15 26 || Feb Mar Nov || Sep Dec || Jan Oct ||  Aug ||    09 15  26
 * 10   21 27 ||  Aug || Jun ||  Apr Jul || May ||  10    21 27
 * 05 11 22    || May || Feb Mar Nov || Sep Dec || Jan Oct || 05 11  22
 * }
 * 09 15 26 || Feb Mar Nov || Sep Dec || Jan Oct ||  Aug ||    09 15  26
 * 10   21 27 ||  Aug || Jun ||  Apr Jul || May ||  10    21 27
 * 05 11 22    || May || Feb Mar Nov || Sep Dec || Jan Oct || 05 11  22
 * }
 * 05 11 22    || May || Feb Mar Nov || Sep Dec || Jan Oct || 05 11  22
 * }
 * }

title: Friday the 13th


text:
Red slender loris

The red slender loris (Loris tardigradus) is a small, nocturnal strepsirrhine primate native to the rainforests of Sri Lanka. This is No. 6 of the 10 focal species and No. 22 of the 100 EDGE mammal species worldwide considered the most evolutionarily distinct and globally endangered. Two subspecies have been identified, L. t. tardigradus and L. t. nycticeboides.

Taxonomy

 * Genus Loris
 * Red slender loris, Loris tardigradus
 * Horton Plains slender loris or mountain loris, Loris tardigradus nycticeboides
 * Dry zone slender loris or lowland loris, Loris tardigradus tardigradus
 * Gray slender loris, Loris lydekkerianus

The ears are less prominent in Loris tardigradus tardigradus compared to Loris lydekkerianus. The ears of Loris tardigradus nycticeboides are almost invisible.

Description
This small, slender primate is distinguished by large forward-facing eyes used for precise depth perception, long slender limbs, a well-developed index finger, the absence of tail, and large prominent ears, which are thin, rounded and hairless at the edges. The soft dense fur is reddish-brown color on the back, and the underside is whitish-grey with a sprinkling of silver hair. Its body length on average is 7 –, with an average weight of a mere 3 –. This loris has a four-way grip on each foot. The big toe opposes the other 4 toes for a pincer-like grip on branches and food. It has a dark face mask with central pale stripe, much like the slow lorises.

L. tardigradus tardigradus is reddish brown in the back and creamy yellow below, while L. tardigradus nycticeboides is dark brown dorsally and very light brown in upperparts.

Behavior
The red slender loris favors lowland rainforests (up to 700 m in altitude), tropical rainforests and inter-monsoon forests of the south western wet-zone of Sri Lanka. Masmullah Proposed Forest Reserve harbors one of few remaining red slender loris populations, and is considered a biodiversity hotspot. The most common plant species eaten was Humboldtia laurifolia, occurring at 676 trees/ha, with overall density at 1077 trees/ha. Humboldtia laurifolia is vulnerable and has a mutualistic relationship with ants, providing abundant food for lorises. Reports from the 1960s suggest that it once also occurred in the coastal zone, however it is now thought to be extinct there.

The red slender loris differs from its close relative the gray slender loris in its frequent use of rapid arboreal locomotion. It forms small social groups, containing adults of both sexes as well as young animals. This species is among the most social of the nocturnal primates. During daylight hours the animals sleep in groups in branch tangles, or curled up on a branch with their heads between their legs. The groups also undertake mutual grooming and play at wrestling. The adults typically hunt separately during the night. They are primarily insectivorous but also eat bird eggs, berries, leaves, buds and occasionally invertebrates as well as geckos and lizards. They forage, and while doing so, ants may stick to the back of their hands. As this occurs, the red slender loris is able to consume these ants. To maximize protein and nutrient uptake they consume every part of their prey, including the scales and bones. They make nests out of leaves or find hollows of trees or a similar secure place to live in.

Reproduction
Females are dominant. The female reaches her sexual maturity at 10 months and is receptive to the male twice a year. This species mates while hanging upside down from branches; individuals in captivity will not breed if no suitable branch is available. The gestation period is 166–169 days after which the female will bear 1–2 young which feed from her for 6–7 months. The lifespan of this species is believed to be around 15–18 years in the wild.

Threats
This slender loris is an endangered species. Habitat destruction is a major threat. It is widely trapped and killed for use in supposed remedies for eye diseases and is preyed upon by snakes, dogs, and some fish. Other threats include electrocution on live wires, road accidents and capture for the pet trade.

Conservation
The red slender loris was identified as one of the top-10 "focal species" in 2007 by the Evolutionarily Distinct and Globally Endangered (EDGE) project.

One early success has been the rediscovery of the virtually unknown Horton Plains slender loris (Loris tardigradus nycticeboides). Originally documented in 1937, there have been only four known encounters in the past 72 years, and for more than 60 years until 2002 the sub-species had been believed to be extinct. The sub-species was rediscovered in 2002 by a team led by Anna Nekaris in Horton Plains National Park. The late 2009 capture by a team working under the Zoological Society of London's EDGE programme has resulted in the first detailed physical examination of the Horton Plains sub-species and the first-ever photographs of it. The limited available evidence suggests there may be only about 100 animals still existing, which would make it among the top five most-threatened primates worldwide.

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

title: Red slender loris


text:
Cray-1

The Cray-1 was a supercomputer designed, manufactured and marketed by Cray Research. Announced in 1975, the first Cray-1 system was installed at Los Alamos National Laboratory in 1976. Eventually, eighty Cray-1s were sold, making it one of the most successful supercomputers in history. It is perhaps best known for its unique shape, a relatively small C-shaped cabinet with a ring of benches around the outside covering the power supplies and the cooling system.

The Cray-1 was the first supercomputer to successfully implement the vector processor design. These systems improve the performance of math operations by arranging memory and registers to quickly perform a single operation on a large set of data. Previous systems like the CDC STAR-100 and ASC had implemented these concepts but did so in a way that seriously limited their performance. The Cray-1 addressed these problems and produced a machine that ran several times faster than any similar design.

The Cray-1's architect was Seymour Cray; the chief engineer was Cray Research co-founder Lester Davis. They would go on to design several new machines using the same basic concepts, and retained the performance crown into the 1990s.

History
From 1968 to 1972, Seymour Cray of Control Data Corporation (CDC) worked on the CDC 8600, the successor to his earlier CDC 6600 and CDC 7600 designs. The 8600 was essentially made up of four 7600s in a box with an additional special mode that allowed them to operate lock-step in a SIMD fashion.

Jim Thornton, formerly Cray's engineering partner on earlier designs, had started a more radical project known as the CDC STAR-100. Unlike the 8600's brute-force approach to performance, the STAR took an entirely different route. The main processor of the STAR had lower performance than the 7600, but added hardware and instructions to speed up particularly common supercomputer tasks.

By 1972, the 8600 had reached a dead end; the machine was so incredibly complex that it was impossible to get one working properly. Even a single faulty component would render the machine non-operational. Cray went to William Norris, Control Data's CEO, saying that a redesign from scratch was needed. At the time, the company was in serious financial trouble, and with the STAR in the pipeline as well, Norris could not invest the money.

As a result, Cray left CDC and started Cray Research very close to the CDC lab. In the back yard of the land he purchased in Chippewa Falls, Cray and a group of former CDC employees started looking for ideas. At first, the concept of building another supercomputer seemed impossible, but after Cray Research's Chief Technology Officer travelled to Wall Street and found a lineup of investors willing to back Cray, all that was needed was a design.

For four years Cray Research designed its first computer. In 1975 the 80 MHz Cray-1 was announced. The excitement was so high that a bidding war for the first machine broke out between Lawrence Livermore National Laboratory and Los Alamos National Laboratory, the latter eventually winning and receiving serial number 001 in 1976 for a six-month trial. The National Center for Atmospheric Research (NCAR) was the first official customer of Cray Research in 1977, paying US$8.86 million ($7.9 million plus $1 million for the disks) for serial number 3. The NCAR machine was decommissioned in 1989. The company expected to sell perhaps a dozen of the machines, and set the selling price accordingly, but ultimately over 80 Cray-1s of all types were sold, priced from $5M to $8M. The machine made Seymour Cray a celebrity and his company a success, lasting until the supercomputer crash in the early 1990s.

Based on a recommendation by William Perry's study, the NSA purchased a Cray-1 for theoretical research in cryptanalysis. According to Budiansky, "Though standard histories of Cray Research would persist for decades in stating that the company's first customer was Los Alamos National Laboratory, in fact it was NSA..."

The 160 MFLOPS Cray-1 was succeeded in 1982 by the 800 MFLOPS Cray X-MP, the first Cray multi-processing computer. In 1985, the very advanced Cray-2, capable of 1.9 GFLOPS peak performance, succeeded the first two models but met a somewhat limited commercial success because of certain problems at producing sustained performance in real-world applications. A more conservatively designed evolutionary successor of the Cray-1 and X-MP models was therefore made by the name Cray Y-MP and launched in 1988.

By comparison, the processor in a typical 2013 smart device, such as a Google Nexus 10 or HTC One, performs at roughly 1 GFLOPS, while the A13 processor in a 2019 iPhone 11 performs at 154.9 GFLOPS, a mark supercomputers succeeding the Cray-1 would not reach until 1994.

Background
Typical scientific workloads consist of reading in large data sets, transforming them in some way and then writing them back out again. Normally the transformations being applied are identical across all of the data points in the set. For instance, the program might add 5 to every number in a set of a million numbers.

In simple computers the program would loop over all million numbers, adding five, thereby executing a million instructions saying. Internally the computer solves this instruction in several steps. First it reads the instruction from memory and decodes it, then it collects any additional information it needs, in this case the numbers b and c, and then finally runs the operation and stores the results. The end result is that the computer requires tens or hundreds of millions of cycles to carry out these operations.

Vector machines
In the STAR, new instructions essentially wrote the loops for the user. The user told the machine where in memory the list of numbers was stored, then fed in a single instruction. At first glance it appears the savings are limited; in this case the machine fetches and decodes only a single instruction instead of 1,000,000, thereby saving 1,000,000 fetches and decodes, perhaps one-fourth of the overall time.

The real savings are not so obvious. Internally, the CPU of the computer is built up from a number of separate parts dedicated to a single task, for instance, adding a number, or fetching from memory. Normally, as the instruction flows through the machine, only one part is active at any given time. This means that each sequential step of the entire process must complete before a result can be saved. The addition of an instruction pipeline changes this. In such machines the CPU will "look ahead" and begin fetching succeeding instructions while the current instruction is still being processed. In this assembly line fashion any one instruction still requires as long to complete, but as soon as it finishes executing, the next instruction is right behind it, with most of the steps required for its execution already completed.

Vector processors use this technique with one additional trick. Because the data layout is in a known format — a set of numbers arranged sequentially in memory — the pipelines can be tuned to improve the performance of fetches. On the receipt of a vector instruction, special hardware sets up the memory access for the arrays and stuffs the data into the processor as fast as possible.

CDC's approach in the STAR used what is today known as a memory-memory architecture. This referred to the way the machine gathered data. It set up its pipeline to read from and write to memory directly. This allowed the STAR to use vectors of length not limited by the length of registers, making it highly flexible. Unfortunately, the pipeline had to be very long in order to allow it to have enough instructions in flight to make up for the slow memory. That meant the machine incurred a high cost when switching from processing vectors to performing operations on non-vector operands. Additionally, the low scalar performance of the machine meant that after the switch had taken place and the machine was running scalar instructions, the performance was quite poor. The result was rather disappointing real-world performance, something that could, perhaps, have been forecast by Amdahl's law.

Cray's approach
Cray studied the failure of the STAR and learned from it. He decided that in addition to fast vector processing, his design would also require excellent all-around scalar performance. That way when the machine switched modes, it would still provide superior performance. Additionally he noticed that the workloads could be dramatically improved in most cases through the use of registers.

Just as earlier machines had ignored the fact that most operations were being applied to many data points, the STAR ignored the fact that those same data points would be repeatedly operated on. Whereas the STAR would read and process the same memory five times to apply five vector operations on a set of data, it would be much faster to read the data into the CPU's registers once, and then apply the five operations. However, there were limitations with this approach. Registers were significantly more expensive in terms of circuitry, so only a limited number could be provided. This implied that Cray's design would have less flexibility in terms of vector sizes. Instead of reading any sized vector several times as in the STAR, the Cray-1 would have to read only a portion of the vector at a time, but it could then run several operations on that data prior to writing the results back to memory. Given typical workloads, Cray felt that the small cost incurred by being required to break large sequential memory accesses into segments was a cost well worth paying.

Since the typical vector operation would involve loading a small set of data into the vector registers and then running several operations on it, the vector system of the new design had its own separate pipeline. For instance, the multiplication and addition units were implemented as separate hardware, so the results of one could be internally pipelined into the next, the instruction decode having already been handled in the machine's main pipeline. Cray referred to this concept as chaining, as it allowed programmers to "chain together" several instructions and extract higher performance.

Performance
In 1978, a team from the Argonne National Laboratory tested a variety of typical workloads on a Cray-1 as part of a proposal to purchase one for their use, replacing their IBM 370/195. They also planned on testing on the CDC STAR-100 and Burroughs Scientific Computer, but such tests, if they were performed, were not published. The tests were run on the Cray-1 at the National Center for Atmospheric Research (NCAR) in Boulder, Colorado. The only other Cray available at the time was the one at Los Alamos, but accessing this machine required Q clearance.

The tests were reported in two ways. The first was a minimum conversion needed to get the program running without errors, but making no attempt to take advantage of the Cray's vectorization. The second included a moderate set of updates to the code, often unwinding loops so they could be vectorized. Generally, the minimal conversions ran roughly the same speed as the 370 to about 2 times its performance (mostly due to a larger exponent range on the Cray), but vectorization led to further increases between 2.5 and 10 times. In one example program, which performed an internal fast Fourier transform, performance improved from the IBM's 47 seconds to 3.

Description
The new machine was the first Cray design to use integrated circuits (ICs). Although ICs had been available since the 1960s, it was only in the early 1970s that they reached the performance necessary for high-speed applications. The Cray-1 used only four different IC types, an ECL dual 5-4 NOR gate (one 5-input, and one 4-input, each with differential output), another slower MECL 10K 5-4 NOR gate used for address fanout, a 16×4-bit high speed (6 ns) static RAM (SRAM) used for registers and a 1,024×1-bit 48 ns SRAM used for the main memory. These integrated circuits were supplied by Fairchild Semiconductor and Motorola. In all, the Cray-1 contained about 200,000 gates.

ICs were mounted on large five-layer printed circuit boards, with up to 144 ICs per board. Boards were then mounted back to back for cooling (see below) and placed in twenty-four 28 in racks containing 72 double-boards. The typical module (distinct processing unit) required one or two boards. In all the machine contained 1,662 modules in 113 varieties.

Each cable between the modules was a twisted pair, cut to a specific length in order to guarantee the signals arrived at precisely the right time and minimize electrical reflection. Each signal produced by the ECL circuitry was a differential pair, so the signals were balanced. This tended to make the demand on the power supply more constant and reduce switching noise. The load on the power supply was so evenly balanced that Cray boasted that the power supply was unregulated. To the power supply, the entire computer system looked like a simple resistor.

The high-performance ECL circuitry generated considerable heat, and Cray's designers spent as much effort on the design of the refrigeration system as they did on the rest of the mechanical design. In this case, each circuit board was paired with a second, placed back to back with a sheet of copper between them. The copper sheet conducted heat to the edges of the cage, where liquid Freon running in stainless steel pipes drew it away to the cooling unit below the machine. The first Cray-1 was delayed six months due to problems in the cooling system; lubricant that is normally mixed with the Freon to keep the compressor running would leak through the seals and eventually coat the boards with oil until they shorted out. New welding techniques had to be used to properly seal the tubing.

In order to bring maximum speed out of the machine, the entire chassis was bent into a large C-shape. Speed-dependent portions of the system were placed on the "inside edge" of the chassis, where the wire-lengths were shorter. This allowed the cycle time to be decreased to 12.5 ns (80 MHz), not as fast as the 8 ns 8600 he had given up on, but fast enough to beat CDC 7600 and the STAR. NCAR estimated that the overall throughput on the system was 4.5 times that of the CDC 7600.

The Cray-1 was built as a 64-bit system, a departure from the 7600/6600, which were 60-bit machines (a change was also planned for the 8600). Addressing was 24-bit, with a maximum of 1,048,576 64-bit words (1 megaword) of main memory, where each word also had eight parity bits for a total of 72 bits per word. Memory was spread across 16 interleaved memory banks, each with a 50 ns cycle time, allowing up to four words to be read per cycle. Smaller configurations could have 0.25 or 0.5 megawords of main memory. Maximum aggregate memory bandwidth was 638 Mbit/s.

The main register set consisted of eight 64-bit scalar (S) registers and eight 24-bit address (A) registers. These were backed by a set of sixty-four registers each for S and A temporary storage known as T and B respectively, which could not be seen by the functional units. The vector system added another eight 64-element by 64-bit vector (V) registers, as well as a vector length (VL) and vector mask (VM). Finally, the system also included a 64-bit real-time clock register and four 64-bit instruction buffers that held sixty-four 16-bit instructions each. The hardware was set up to allow the vector registers to be fed at one word per cycle, while the address and scalar registers required two cycles. In contrast, the entire 16-word instruction buffer could be filled in four cycles.

The Cray-1 had twelve pipelined functional units. The 24-bit address arithmetic was performed in an add unit and a multiply unit. The scalar portion of the system consisted of an add unit, a logical unit, a population count, a leading zero count unit and a shift unit. The vector portion consisted of add, logical and shift units. The floating point functional units were shared between the scalar and vector portions, and these consisted of add, multiply and reciprocal approximation units.

The system had limited parallelism. It could issue one instruction per clock cycle, for a theoretical performance of 80 MIPS, but with vector floating-point multiplication and addition occurring in parallel theoretical performance was 160 MFLOPS. (The reciprocal approximation unit could also operate in parallel, but did not deliver a true floating-point result - two additional multiplications were needed to achieve a full division.)

Since the machine was designed to operate on large data sets, the design also dedicated considerable circuitry to I/O. Earlier Cray designs at CDC had included separate computers dedicated to this task, but this was no longer needed. Instead the Cray-1 included four six-channel controllers, each of which was given access to main memory once every four cycles. The channels were 16 bits wide and included three control bits and four bits for error correction, so the maximum transfer speed was one word per 100 ns, or 500 thousand words per second for the entire machine.

The initial model, the Cray-1A, weighed 10500 lb including the Freon refrigeration system. Configured with 1 million words of main memory, the machine and its power supplies consumed about 115 kW of power; cooling and storage likely more than doubled this figure. A Data General SuperNova S/200 minicomputer served as the maintenance control unit (MCU), which was used to feed the Cray Operating System into the system at boot time, to monitor the CPU during use, and optionally as a front-end computer. Most, if not all, Cray-1As were delivered using the follow-on Data General Eclipse as the MCU.

The reliability of the CRAY-1A was very low by today's standards. At the European Centre for Medium-Range Weather Forecasts, which was one of the first customers, the mean time between hardware faults was reported to be 96 hours in 1979. Seymour Cray deliberately made design decisions that sacrificed reliability for speed, but improved his later designs after being questioned on this matter. Similarly, the Cray Operating System (COS) was fairly rudimentary, hardly tested and updated weekly or even daily in the early days.

Cray-1S
The Cray-1S, announced in 1979, was an improved Cray-1 that supported a larger main memory of 1, 2 or 4 million words. The larger main memory was made possible through the use of 4,096 x 1-bit bipolar RAM ICs with a 25 ns access time. The Data General minicomputers were optionally replaced with an in-house 16-bit design running at 80 MIPS. The I/O subsystem was separated from the main machine, connected to the main system via a 6 Mbit/s control channel and a 100 Mbit/s High Speed Data Channel. This separation made the 1S look like two "half Crays" separated by a few feet, which allowed the I/O system to be expanded as needed. Systems could be bought in a variety of configurations from the S/500 with no I/O and 0.5 million words of memory to the S/4400 with four I/O processors and 4 million words of memory.

Cray-1M
The Cray-1M, announced in 1982, replaced the Cray-1S. It had a faster 12 ns cycle time and used less expensive MOS RAM in the main memory. The 1M was supplied in only three versions, the M/1200 with 1 million words in 8 banks, or the M/2200 and M/4200 with 2 or 4 million words in 16 banks. All of these machines included two, three or four I/O processors, and the system added an optional second High Speed Data Channel. Users could add a Solid-state Storage Device with 8 to 32 million words of MOS RAM.

Software
In 1978, the first standard software package for the Cray-1 was released, consisting of three main products:
 * Cray Operating System (COS) (later machines would run UNICOS, Cray's UNIX flavor)
 * Cray Assembly Language (CAL)
 * Cray FORTRAN (CFT), the first automatically vectorizing Fortran compiler

The United States Department of Energy funded sites from Lawrence Livermore National Laboratory, Los Alamos Scientific Laboratory, Sandia National Laboratories and the National Science Foundation supercomputer centers (for high-energy physics) represented the second largest block with LLL's Cray Time Sharing System (CTSS). CTSS was written in a dynamic memory Fortran, first named LRLTRAN, which ran on CDC 7600s, renamed CVC (pronounced "Civic") when vectorization for the Cray-1 was added. Cray Research attempted to support these sites accordingly. These software choices had influences on later minisupercomputers, also known as "crayettes".

NCAR has its own operating system (NCAROS).

The National Security Agency developed its own operating system (Folklore) and language (IMP with ports of Cray Pascal and C and Fortran 90 later)

Libraries started with Cray Research's own offerings and Netlib.

Other operating systems existed, but most languages tended to be Fortran or Fortran-based. Bell Laboratories, as proof of both portability concept and circuit design, moved the first C compiler to their Cray-1 (non-vectorizing). This act would later give CRI a six-month head start on the Cray-2 Unix port to ETA Systems' detriment, and Lucasfilm's first computer generated test film, The Adventures of André & Wally B..

Application software generally tends to be either classified (e.g. nuclear code, cryptanalytic code) or proprietary (e.g. petroleum reservoir modeling). This was because little software was shared between customers and university customers. The few exceptions were climatological and meteorological programs until the NSF responded to the Japanese Fifth Generation Computer Systems project and created its supercomputer centers. Even then, little code was shared.

Partly because Cray were interested in the publicity, they supported the development of Cray Blitz which won the fourth (1983) and fifth (1986) World Computer Chess Championship, as well as the 1983 and 1984 North American Computer Chess Championship. The program, Chess, that dominated in the 1970s ran on Control Data Corporation supercomputers.

Museums
Cray-1s are on display at the following locations:
 * Bradbury Science Museum in Los Alamos, New Mexico
 * Chippewa Falls Museum of Industry and Technology in Chippewa Falls, Wisconsin
 * The Cray Inc. offices at Cray Plaza in St. Paul, Minnesota
 * Computer History Museum in Mountain View, California
 * Computer Museum of America in Roswell, Georgia has four Cray-1s, plus other Cray computers
 * DigiBarn Computer Museum
 * Deutsches Museum in Munich
 * ETH Zurich - Eidgenössische Technische Hochschule Zürich, Switzerland
 * Living Computers: Museum + Labs in Seattle, Washington
 * National Center for Atmospheric Research in Boulder, Colorado
 * National Air and Space Museum in Washington, D.C.
 * Musée Bolo in Lausanne, Switzerland
 * The National Museum of Computing at Bletchley Park
 * Science Museum in London
 * Swedish National Museum of Science and Technology in Stockholm, Sweden
 * System Source Computer Museum in Hunt Valley, Maryland has a Cray-1, a Cray 1-s, and other Cray computers
 * Valladolid Science Museum in Spain.

title: Cray-1


text:
Lars Onsager

Lars Onsager (November 27, 1903 – October 5, 1976) was a Norwegian American physical chemist and theoretical physicist. He held the Gibbs Professorship of Theoretical Chemistry at Yale University. He was awarded the Nobel Prize in Chemistry in 1968.

Education and early life
Lars Onsager was born in Kristiania (now Oslo), Norway. His father was a lawyer. After completing secondary school in Oslo, he attended the Norwegian Institute of Technology (NTH) in Trondheim, graduating as a chemical engineer in 1925. While there he worked through A Course of Modern Analysis, which was instrumental in his later work.

Career and research
In 1925 he arrived at a correction to the Debye-Hückel theory of electrolytic solutions, to specify Brownian movement of ions in solution, and during 1926 published it. He traveled to Zürich, where Peter Debye was teaching, and confronted Debye, telling him his theory was wrong. He impressed Debye so much that he was invited to become Debye's assistant at the Eidgenössische Technische Hochschule (ETH), where he remained until 1928.

Johns Hopkins University
In 1928 he went to the United States to take a faculty position at the Johns Hopkins University in Baltimore, Maryland. At JHU he had to teach freshman classes in chemistry, and it quickly became apparent that, while he was a genius at developing theories in physical chemistry, he had little talent for teaching. He was dismissed by JHU after one semester.

Brown University
On leaving JHU, he accepted a position (involving the teaching of statistical mechanics to graduate students in chemistry) at Brown University in Providence, Rhode Island, where it became clear that he was no better at teaching advanced students than freshmen, but he made significant contributions to statistical mechanics and thermodynamics. His graduate student Raymond Fuoss worked under him and eventually joined him on the Yale chemistry faculty. His statistical mechanics course was nicknamed "Sadistical Mechanics" by the students.

His research at Brown was concerned mainly with the effects on diffusion of temperature gradients, and produced the Onsager reciprocal relations, a set of equations published in 1929 and, in an expanded form, in 1931, in statistical mechanics whose importance went unrecognized for many years. However, their value became apparent during the decades following World War II, and by 1968 they were considered important enough to gain Onsager that year's Nobel Prize in Chemistry.

In 1933, when the Great Depression limited Brown's ability to support a faculty member who was only useful as a researcher and not a teacher, he was let go by Brown. He traveled to Austria to visit electrochemist Hans Falkenhagen. He met Falkenhagen's sister-in-law, Margrethe Arledter. They were married on September 7, 1933, and had three sons and a daughter.

Yale University
After the trip to Europe, he was hired by Yale University, where he remained for most of the rest of his life, retiring in 1972.

At Yale, he had been hired as a postdoctoral fellow, but it was discovered that he had never received a Ph.D. While he had submitted an outline of his work in reciprocal relations to the Norwegian Institute of Technology, they had decided it was too incomplete to qualify as a doctoral dissertation. He was told that he could submit one of his published papers to the Yale faculty as a dissertation, but insisted on doing a new research project instead. His dissertation laid the mathematical background for his interpretation of deviations from Ohm's law in weak electrolytes. It dealt with the solutions of the Mathieu equation of period $$4\pi$$ and certain related functions and was beyond the comprehension of the chemistry and physics faculty. Only when some members of the mathematics department, including the chairman Einar Hille (who also liked A Course of Modern Analysis), insisted that the work was good enough that they would grant the doctorate if the chemistry department would not, was he granted a Ph.D. in chemistry in 1935.

Even before the dissertation was finished, he was appointed assistant professor in 1934, and promoted to associate professor in 1940. He quickly showed at Yale the same traits he had at JHU and Brown: he produced brilliant theoretical research, but was incapable of giving a lecture at a level that a student (even a graduate student) could comprehend. He was also unable to direct the research of graduate students, except for the occasional outstanding one. His two courses on statistical mechanics were nicknamed "Advanced Norwegian I" and "Advanced Norwegian II" for being incomprehensible.

During the late 1930s, Onsager researched the dipole theory of dielectrics, making improvements for another topic that had been studied by Peter Debye. However, when he submitted his paper to a journal that Debye edited in 1936, it was rejected. Debye would not accept Onsager's ideas until after World War II. During the 1940s, Onsager studied the statistical-mechanical theory of phase transitions in solids, deriving a mathematically elegant theory which was enthusiastically received. In what is widely considered a tour de force of mathematical physics, he obtained the exact solution for the two dimensional Ising model in zero field in 1944.

In 1960 he was awarded an honorary degree, doctor techn. honoris causa, at the Norwegian Institute of Technology, later part of Norwegian University of Science and Technology.

In 1945, Onsager was naturalized as an American citizen, and the same year he was awarded the title of J. Willard Gibbs Professor of Theoretical Chemistry. This was particularly appropriate because Onsager, like Willard Gibbs, had been involved primarily in the application of mathematics to problems in physics and chemistry and, in a sense, could be considered to be continuing in the same areas Gibbs had pioneered. In 1947, he was elected to the National Academy of Sciences, the American Academy of Arts and Sciences in 1949, and in 1950 he joined the ranks of Alpha Chi Sigma.

After World War II, Onsager researched new topics of interest. He proposed a theoretical explanation of the superfluid properties of liquid helium in 1949; two years later the physicist Richard Feynman independently proposed the same theory. He also worked on the theories of liquid crystals and the electrical properties of ice. While on a Fulbright scholarship to the University of Cambridge, he worked on the magnetic properties of metals. He developed important ideas on the quantization of magnetic flux in metals. He was awarded the Lorentz Medal in 1958, Willard Gibbs Award in 1962, and the Nobel Prize in Chemistry in 1968. He was elected a member of the American Philosophical Society in 1959 and a Foreign Member of the Royal Society (ForMemRS) in 1975.

After Yale
In 1972 Onsager retired from Yale and became emeritus. He then became a member of the Center for Theoretical Studies, University of Miami, and was appointed Distinguished University Professor of Physics. At the University of Miami he remained active in guiding and inspiring postdoctoral students as his teaching skills, although not his lecturing skills, had improved during the course of his career. He developed interests in semiconductor physics, biophysics and radiation chemistry. However, his death came before he could produce any breakthroughs comparable to those of his earlier years.

Exact solution of the 2D Ising model
To solve the 2D Ising model, Onsager began by diagonalizing increasingly large transfer matrices. He said that it's because he had a lot of time during WWII. He began by computing the 2 × 2 transfer matrix of the 1D Ising model, which is already solved by Ising himself. He then computed the transfer matrix of the "Ising ladder", meaning two 1D Ising models side-by-side, connected by links. The transfer matrix is then 4 × 4. He repeated this for up to six 1D Ising models, resulting in transfer matrices of up to 64 × 64. He diagonalized all of them and found that all the eigenvalues were of a special form, so he guessed that the algebra of the problem was an associative algebra (later called the Onsager algebra ).

The solution involved generalized quaternion algebra and the theory of elliptic functions, which he learned from A Course of Modern Analysis.

Personal life
He remained in Florida until his death from an aneurysm in Coral Gables, Florida in 1976. Onsager was buried next to John Gamble Kirkwood at New Haven's Grove Street Cemetery. While Kirkwood's tombstone has a long list of awards and positions, including the American Chemical Society Award in Pure Chemistry, the Richards Medal, and the Lewis Award, Onsager's tombstone, in its original form, simply said "Nobel Laureate". When Onsager's wife Gretel died in 1991 and was buried there, his children added an asterisk after "Nobel Laureate" and "*etc." in the lower right corner of the stone.

Legacy
The Norwegian Institute of Technology established the Lars Onsager Lecture and The Lars Onsager Professorship in 1993 to award outstanding scientists in the scientific fields of Lars Onsager; Chemistry, Physics and Mathematics. The American Physical Society established Lars Onsager Prize in statistical physics in 1993. In 1997 his sons and daughter donated his scientific works and professional belongings to NTNU (before 1996 NTH) in Trondheim, Norway as his alma mater. These are now organized as The Lars Onsager Archive at the Gunnerus Library in Trondheim.

Archival collections

 * The Lars Onsager Online Archive at Universitetsbiblioteket/Gunnerus Library in Trondheim. (Norwegian University of Science And Technology)
 * Alvin M. Saperstein student notes on lectures by Lars Onsager and Cecil T. Lane, 1952-1953, Niels Bohr Library & Archives
 * George O. Zimmerman collection of lecture notes by Gregory Breit and Lars Onsager, circa 1960-1961, Niels Bohr Library & Archives
 * Lars Onsager papers, Manuscripts and Archives Department Yale University Library

title: Lars Onsager


text:
User talk:Taw

pl:Dyskusja Wikipedysty:Taw

I'm not active these days other than an occasional minor fix, so if you want to reach me, it's better to email me at Tomasz.Wegrzanowski@gmail.com

Old
Taw, there's a complete list of all TeX/LaTeX/AmsLaTeX symbols at http://wso.williams.edu/how/lshort2e/node61.html AxelBoldt 19:31 Jan 8, 2003 (UTC)

see my question at Wikipedia_talk:TeX_markup --user_talk:hfastedge Im sure its as simple as an argument to an imagemagick script or something...

You changed "Lower Oder Valley National Park" to "Lower Odra National Park", as well as other occurrences of the word "Oder" in several articles. That is okay by me, and I don't mind. I'm quite upset about your comment "One more user:H.J. fix". I created that article, and I am not identical with that user:H.J. person, nor do I have any sympathy with her. Please be aware, that not everyone calling a river by its German name is necessarily a Nazi. Regards -- Cordyph 17:21 Feb 15, 2003 (UTC)

Taw, why on earth did you change every reference to the Oder river to "Odra"? In case you weren't aware, we have a policy of using English name on the English Wikipedia. The English name for this river is "Oder". I fully realise that this is also the German name, but that unfortunately cannot be helped. The name "Oder" is in overwhelming use in English: every major English encyclopedia uses it, as do news organisations and even the English page on the Szczecin city website uses it.

Your assertion that these are "user:H.J. fixes" and that you're removing "German propaganda" is grossly unfair and highly POV I would say. As Cordyph above pointed out, this has nothing to do with user:H.J.'s antics, but with Wikipedia policy. You have also changed Oder-Neisse line to "Odra-Nysa line", a title virtually unknown in English. Please revert your changes. Thanks. -Scipius 00:51 Feb 17, 2003 (UTC)

Or, why don't we just wait a couple more months until the "official English name" changes to the original "ODRA" and everybody's happy? Let's look into the future! Space Cadet 14:21 Feb 18, 2003 (UTC)

If the "official English name" agrees with user:H.J., than obviously, there is something wrong with the "official English name"! 167.83.96.20 17:51 Feb 18, 2003 (UTC)

Why are all of you talking about user:H.J.? I really become furious about this. user:H.J. wrote revanchist, right-wing propaganda. The articles cited above did not contain anything of her disgusting POV. The only "crime" committed in these articles were to use the name, which is the valid name of the river on its western side - this river is partially Polish and partially German, and the name "Oder" is the German name and not the Nazi name of the river. If someone calls this "German propaganda", he must be blinded with ultra-nationalism, as it seems to be in your case. I repeat, that I do not mind, if we decide to call this river "Odra" on Wikipedia. You may call it whatever you want, but stop annoying the Non-user:H.J.-contributors to these articles with wrong and unfair accusations! I have taken this subject to the mailing list, so please join us and discuss it there, and try to discuss fairly! Good night -- Cordyph 21:30 Feb 18, 2003 (UTC)

I placed a compromise proposal on the Oder/Odra talk page. Please continue the discussion there. Thank you. -- Cordyph 18:45 Feb 19, 2003 (UTC)

Hey, please don't confuse fascism with being from the United States. Some of us recognize irony in Bush's intent to disregard the U.N. so he can punish Iraq (punishing it supposedly for disregarding the U.N.) Some of us even hate imperialism, though our court-appointed "leader" doesn't want to hear about it. ^_^ Cheers,  Koyaanis Qatsi

I'm not saying every American is fascist but this one who wrote that certainly was one. Taw 15:19 Feb 20, 2003 (UTC)

 * Ah. m (_ _) m  Koyaanis Qatsi

- Why is it inappropriate to move information on the People's Republic of China to the China page? 172

Hi Taw, why did you delete Arnold Schwarzeneggers Image? Did you not read the discussion page? Fantasy 15:19 30 May 2003 (UTC)

 * I've seen it but you can't put "fair use" images (well, it wasn't even really "fair use") into GFDL articles. Taw 16:38 2 Jun 2003 (UTC)

 * Image use policy does not say so. It is not yet decided, if we can or not, see "copyrighted image - may only be used under "fair use" rules". And a Book cover is "fair use" for me and Zoe, why should it not be? Fantasy 17:07 2 Jun 2003 (UTC)

It is not ok to blank the China article. Fred Bauder 22:38 12 Jun 2003 (UTC)

Taw, it was agreed after an exhaustive (and exhausting!) discussion on the w-list and various pages not to turn China into a disambigulation page. The article does need a lot of work but because of the sheer number of links and references, and because any move is guaranteed to provoke edit wars, and for a number of other reasons, that was the clear consensus reached. I thought maybe you didn't realise that. Mav put a comment to that effect explaining that on the relevant talk page and on that basis I reverted to the previous version by Fred Bauder. I hope that clears up any confusion. :-) FearÉIREANN 00:30 13 Jun 2003 (UTC)

Your input is requested at Talk:U.S. occupation of Iraq. MB 00:26 3 Jul 2003 (UTC)

Just thought I'd drop a line to say that the work you're doing on AG mapping looks great! I don't know a lot about cartography in general, but if this mapping thing happens, it would be a fantastic service to many people. Maybe it could be the start of a WikiMap thing, where it can become the main repository of maps for everything from maps of the known universe down to maps of the street and suburb I live in. Great stuff and huge potential! Neolux 19:06, 31 Aug 2003 (UTC)

Do you consider it a good idea to edit a protected page, that is so heavily disputed? Your edit was not only affecting a typo, but one of the highly disputed parts. Just a friendly advice: reverse your edit, otherwise some of the participants could question your sysop status. This is not meant as a threat - I won't do it, but I fear, that others could. -- Baldhur 13:36, 7 Dec 2003 (UTC)

Why are you changing Oder to Odra and Neisse to Nysa. The former are the more common english names. For example in english:

Maximus Rex 17:57, 7 Dec 2003 (UTC)
 * "Oder River" 4,640
 * "Odra River" 2,690

Odra and Nysa are correct names in English. Oder and Niesse are just German borrowings of the Slovian name (of course German may use whatever names they want). 58 years is enough time for a switch. Taw 18:00, 7 Dec 2003 (UTC)

No they are not. English uses Oder and Neisse. Polish uses the spellings you prefer. Secretlondon 18:01, Dec 7, 2003 (UTC)

I agree with Oder-Neisse. This name is in britannica online. And that argument is pointless. Should we, Poles, use London instead of Londyn since over 500 years is enough time for a switch? And there is also a Vistula river that does not makes any objections from you. Are the only sin of Oder-Neisse name is it's German origin? Przepla 21:01, 7 Dec 2003 (UTC)

 * Just a little note: We go through all this almost every year. In February Taw had last time the idea to change all occurrences of Odra to Oder, making comments like now ("this river is called Odra and not Oder"), not at all responding to the common sense, that a river may bear more than one name, which may both be correct. At that time we had not as many partisans as now, and it was possible to settle a compromise (see Talk:Odra). Unfortunately it did not last long. -- Baldhur 22:31, 7 Dec 2003 (UTC)

--- Yes, Tomasz! The name is still Oder, not Odra. As soon as it changes we WILL redirect!

Space Cadet 15:20, 8 Dec 2003 (UTC) --- Taw - there is no consensus to delete images used with permission. As image deletion is permanent can I ask you to stop it? Secretlondon 22:15, Feb 19, 2004 (UTC)

Further, there a process for deleting copyrighted images. It is Possible copyright infringements. Please go via this in future. Morwen 22:17, Feb 19, 2004 (UTC)

Dolly
Undeleted. That image was fine per our current policy. See Copyrights. I suggest that you do not use your sysop user rights unilaterally again. --mav

I don't know how you do things on the Polish Wikipedia, but here on en:, pages (including image pages and copyright violations) have to go through due process on Votes for deletion before being deleted. Please respect this process, or I will have to revoke your sysop privileges.—Eloquence 00:47, Feb 20, 2004 (UTC)

It's not like there's any doubt these were non-free images:
 * Maveric149 (Photo of Dolly the sheep owned by Roslin Institute obtained from http://www.roslin.ac.uk/library/ . This image "...may be used free of charge by education, public sector or non-profit making groups

Unless the freedom on Wikipedia became subject of voting, I don't feel obliged to put it there.

And I'm going to use any means necessary to keep Wikipedia free. Taw 00:59, 20 Feb 2004 (UTC)

 * While I agree with you that this particular image should not be used under the conditions given, this is also a good candidate for fair use as it is clearly historically valuable and not reproducible by other means. In any case, this matter has not been settled in consensus, and it is not for you to take any unilateral actions or use "any means necessary" to enforce your point of view.—Eloquence 01:07, Feb 20, 2004 (UTC)

 * So far not taking any action resulted in a lot of unilateral action by those who prefer to dilute the freeness of Wikipedia. There is no consensus to upload "fair-use" images, and even less to upload those explicitely for "noncommercial use". Taw 01:13, 20 Feb 2004 (UTC)

 * That doesn't make any sense. Certainly an image that is explicitly licensed for noncommercial use is easier to defend as fair use (including for commercial use!) than one which is copyrighted without any permission whatsoever. And fair use is a well accepted doctrine on Wikipedia for images which are not obtainable by other means.

 * I have restored one of the two images and added a fair use notice to it. From this point on, the matter should be discussed reasonably without any unilateral actions from either party. I have temporarily suspended your sysop status, but will reinstate it if you pledge not to re-delete this image unilaterally.—Eloquence 01:16, Feb 20, 2004 (UTC)

 * Taw, I've restored your sysop status. --Brion 02:15, 20 Feb 2004 (UTC)

 * And I will remove it again if Taw starts deleting pages without discussion again.—Eloquence 02:24, Feb 20, 2004 (UTC)
 * I have access to the database too. Taw 02:39, 20 Feb 2004 (UTC)

 * Now you have edited a protected page. This is way over the line, Taw. Both your sysop and developer status are at risk.—Eloquence 02:40, Feb 20, 2004 (UTC)

 * Assuring freeness of the Wikipedia is much more important than my sysop or any other powers here. Taw 02:52, 20 Feb 2004 (UTC)

 * Taw, while I agree with you that the image in question shouldn't be used without clearer permission that we have right now, and I disagree strongly with Erik's unilateral desysoppings, there is a process here. I've listed the image on VfD and would prefer to let things go through at a reasonable pace. While the page is protected please let it be. --Brion 02:44, 20 Feb 2004 (UTC)

Taw, if you care about Wikipedia's freeness, please concentrate your wrath on the 36,000 odd untagged images, and people who upload untagged images, rather than the tagged ones. Otherwise you're going to discourage people from being honest about the images they upload, and that is in none of our interests. Martin 02:23, 21 Feb 2004 (UTC)

Poland's betrayal by the Western Allies please vote to keep it. Cautious 20:48, 23 Mar 2004 (UTC)

It's a small world eh? I was just voting on Poland's betrayal by the western allies, and could have guessed you'd vote the same. :-) Kim Bruning 14:41, 28 Mar 2004 (UTC)

Accomodation at 21C3
Hello Tomasz,

I'll give you accommodation in Berlin at the 21C3 (if you still need/want). You 'll need a sleeping bag. You are allowed to trink but not to smoke in my flat :-). Please tell me here if you accept :). --Koethnig 13:57, 23 Nov 2004 (UTC)

Article Licensing
Hi, I've started a drive to get users to multi-license all of their contributions that they've made to either (1) all U.S. state, county, and city articles or (2) all articles, using the Creative Commons Attribution-Share Alike (CC-by-sa) v1.0 and v2.0 Licenses or into the public domain if they prefer. The CC-by-sa license is a true free documentation license that is similar to Wikipedia's license, the GFDL, but it allows other projects, such as WikiTravel, to use our articles. Since you are among the top 2000 Wikipedians by edits, I was wondering if you would be willing to multi-license all of your contributions or at minimum those on the geographic articles. Over 90% of people asked have agreed. For More Information:
 * Multi-Licensing FAQ - Lots of questions answered
 * Multi-Licensing Guide
 * Free the Rambot Articles Project

To allow us to track those users who muli-license their contributions, many users copy and paste the " " template into their user page, but there are other options at Template messages/User namespace. The following examples could also copied and pasted into your user page:

 * Option 1
 * I agree to multi-license all my contributions, with the exception of my user pages, as described below:

OR
 * Option 2
 * I agree to multi-license all my contributions to any U.S. state, county, or city article as described below:

Or if you wanted to place your work into the public domain, you could replace " " with "  ". If you only prefer using the GFDL, I would like to know that too. Please let me know what you think at my talk page. It's important to know either way so no one keeps asking. -- Ram-Man (comment| talk)

texvc
Hi Tomasz, not sure if this is the best place to reach you. Would you mind having a look at a proposed change I filed against texvc on bugzilla? While you're at it, there is another issue which I don't know how to fix. Thanks! --MarkSweep 00:39, 26 Feb 2005 (UTC)

Voting
Please vote: Votes for deletion/Anti-Semitism in Poland. --Ttyre 14:33, 14 July 2005 (UTC)

Servant of God
Is a title. Its given to those being considered for being decalared a saint - --ClemMcGann 23:56, 15 August 2005 (UTC)

Let us follow wikipedia conventions. I'm not endorsing them. Just following them. If you want them changed - and you could have a point - it would be better to discuss them first. Rightly or wrongly we say His Holiness Pope Benedict XVI. Rightly or wrongly we say Servant of God of those considered for sainthood. --ClemMcGann 14:13, 16 August 2005 (UTC)

Clem is correct re styles and titles. I guess it is not an area you have written about here. If you had you would be aware that styles and titles are used at the start of articles on wikipedia and long have been. It is covered in detail in the MoS and the naming conventions. FearÉIREANN\(caint) 21:01, 16 August 2005 (UTC)

Image:Radical human.png has been listed for deletion

 * I have no interest in keeping this image. If you are still interested in the image, please move to the Commons (I don't mess with the Commons much), find an article to link it to or vote to keep on the ifd page. --Nv8200p (talk) 19:53, 26 October 2005 (UTC)

CheckUser list up
A peer review and discussion list for those with the checkuser power (five new ones on the en: arbcom). I am particularly interested in how you perform requests (apart from actually looking things up on Special:CheckUser). Please send me your email address and I'll send you an invitation to it - David Gerard 14:19, 15 November 2005 (UTC)

It seems that links to roseta wiki are broken (at least part of them). countryhacker 14:26, 18 December 2005 (UTC)

 * 1) There are more images I made for wikipedia - complete list is on my page on Polish wikipedia in directory http://wiki.rozeta.com.pl/img/taw/

First one is giving 404 not found for me. countryhacker 20:39, 18 December 2005 (UTC)

Pantone page
Please see Talk:Pantone. Please do not continue this revert war, the point is important and should be dealt with by consensus. Notinasnaid 09:44, 30 January 2006 (UTC).

 * I asked you NOT to revert without discussion. Please participate in the discussion. Because of the three revert war I cannot today restore the important information you deleted, but I do intend to; it is sourced. Notinasnaid 09:56, 30 January 2006 (UTC)

Please don't accuse
Please don't accuse me of being rude without knowing why i reverted moshe's edits and called it vandalism. It is also considered rude to call fellow editors rude without knowing anything about the matter. If you had read the talk page of tha article you would see that there were in fact no agreement by anyone, and that he keep vandalizing many pages every day until he reaches his, he even times his reverts so he will not get blocked for 3RR. He is a well known vandalizer from what i have heard in my few editing days. Please refrain from calling people rude in the future without a cause. Thank you for your cooperation --Darkred 00:36, 26 April 2006 (UTC)

Blokowanie
Czy mógłbyś mnie odblokować na polskiej Wikipedii? Zostałem zablokowany bez żadnego ostrzeżenia i podania przyczyny przez Wikipedystę:Szwedzki i od wczoraj nie mogę nic na polskijej Wiki zrobić (myślę, że zablokowano moje IP gdyż ktoś z podobnego adresu dokonywał wandalizmó, lecz to tylko moje domysły). pl:user:Aotearoa 04:15, 30 May 2006 (UTC)

Air
Greetings, how is Air coming along? -- Cat out 23:05, 19 June 2006 (UTC)

Image:Kanji strokes frequency.png listed for deletion
An image or media file that you uploaded, Image:Kanji strokes frequency.png, has been listed at Images and media for deletion. Please look there to see why this is (you may have to search for the title of the image to find its entry), if you are interested in it not being deleted. Thank you.
 * Sorry, I didn't see any note that the image was on Commons now. Thanks Nv8200p talk 03:45, 20 June 2006 (UTC)

Straw Poll for List of Air episodes
There is a straw poll in hopes of quickly resolving the dispute over List of Air episodes. Talk:List of Air episodes. Thought you might want to comment. -- Cat out 19:16, 22 June 2006 (UTC)

Polish politician stubs
I am kindly requesting you operate your bot to sort them into Category:Polish politician stubs so stub sorters don't have to do it themselves. Roy A.A. 18:57, 3 July 2006 (UTC)

Thanks
Hi Taw,

I noticed your posting to the Wikipedia mailing list here and I just wanted to thank you for presenting the viewpoint of many Wikipedians who do not wish to register their e-mail address. I believe as a group we make a valuable contribution to the Wiki, a contribution that will be lost if this proposal goes ahead. More of my feelings on the issue are expressed in my comment to Michael Snow that I posted here.

Thank you,

Cedars 02:50, 5 July 2006 (UTC)

Deletes of DVD covers
For people who may be annoyed by my deletes of DVD covers:

I feel that decorating lists of episodes is not a good enough reason to have significant numbers of fair use DVD cover pictures. I think Fair_use point 8 and common sense agree with me here.

If you think that a particular picture was used also for actual important informational purposes somewhere else (for example to illustrate how a particular character looks like), feel free to undelete it, ask some admin to undelete it, or reupload it. Taw 19:14, 7 July 2006 (UTC)

Re: Block of User:Tha Bomba Mann lol and stuff like that
Ok... That user is blocked indefinitely because it's a blatant attack account and I believe that it's not from an ArbCom case. That template seems to be okay for usage in this case, since it says: "per ruling of administrators, Jimbo Wales and/or the Arbitration Committee." In this case, User:Antandrus blocked it due to it being a vandalism-only account. G . H e  01:05, 8 July 2006 (UTC)

 * Good idea. By the way, I further modified the template so that if is not given, it will automatically refer to the talk page. :)  G . H  e  01:25, 8 July 2006 (UTC)

Tawbot
I've approved your request to expand Tawbot's scope; let me know if it still needs a bot-flag and I'll set it for you. Essjay (  Talk  •  Connect  )  07:16, 8 July 2006 (UTC)

IRC
Please be online :) -- Cat out 10:41, 8 July 2006 (UTC)

Image:Efedryna.png listed for deletion
An image or media file that you uploaded, Image:Efedryna.png, has been listed at. Please look there to see why this is (you may have to search for the title of the image to find its entry), if you are interested in it not being deleted. Thank you. Fritz S. (Talk) 16:00, 8 July 2006 (UTC)

Image:Aldehyd.png listed for deletion
An image or media file that you uploaded, Image:Aldehyd.png, has been listed at. Please look there to see why this is (you may have to search for the title of the image to find its entry), if you are interested in it not being deleted. Thank you. Fritz S. (Talk) 16:00, 8 July 2006 (UTC)

Jandek album covers
Good sir,

You have deleted the cover of nearly every Jandek album on Wikipedia, saying no cover significantly contributes to the article. Is it possible to discuss this? First of all, Jandek album covers are a significant part of the appeal of the albums, and are discussed on the Wikipedia page itself. Second, could you please just remove the image from the page, and keep the image on Wikipedia. There are no copyright issues with them, and it's a lot of work to get them back online again. Please respond to my inquiries, since I find your actions rather rude and would continue doing so if I don't receive a reply from you.

Thank you. --Leo44 (talk) 13:07, 9 July 2006 (UTC)

 * Ahum. Excuse my rather angry tone. I wasn't aware of the ease with which images can be restored. And you're right about the Jandek article missing information on his unusual album covers. I still think most (if not all) of the covers should be here, but the articles will need proper description of all of them first.

 * I'm not sure what to think of your idea of getting rid of all the albums covers on wikipedia. It's true that most of them are just decorative, but they often make albums recognizable and are an important part of popular music. Anyway, thanks. I won't get mad at you again. ;) --Leo44 (talk) 14:52, 9 July 2006 (UTC)

Amarantine cover undeleted
I've undeleted the cover of Amarantine. It was used inappropriately in the Enya article, but it is accepted practice to illustrate articles about albums with fair use covers.--Eloquence* 15:44, 10 July 2006 (UTC)

3RR
Please refrain from undoing other people's edits repeatedly. If you continue, you may be blocked from editing Wikipedia under the three-revert rule, which states that nobody may revert a single page more than three times in 24 hours. (Note: this also means editing the page to reinsert an old edit. If the effect of your actions is to revert back, it qualifies as a revert.) Thank you.

Image:Fat.png listed for deletion
An image or media file that you uploaded or altered, Image:Fat.png, has been listed at. Please look there to see why this is (you may have to search for the title of the image to find its entry), if you are interested in it not being deleted. Thank you. Fritz S. (Talk) 08:57, 7 October 2006 (UTC)

Melvin Jones
What's wrong with CSD G12 as a justification? Do you disagree that this is a copyvio? (no opinion on that from me...) - CrazyRussian talk/email 18:37, 23 October 2006 (UTC)

 * see WP:AN#Plagiarism_Detector_Bot.Geni 19:04, 23 October 2006 (UTC)

Fair use images in lists
Hello, I see you have contributed your thoughts to Wikipedia talk:Fair use/Fair use images in lists. It's been dead for a while, but I have archived it and taken a new fresh start. I hope this time we will be able to achieve something as I have summarized the main points of both sides (feel free to improve them) and I call you to express your support or oppose on the concrete proposal that I have formulated. Thanks, Renata 02:22, 28 October 2006 (UTC)

Texvc
I heard from TimStarling, that yuo where the one to talk to. I need your input to 7774. → Aza Toth 11:16, 3 November 2006 (UTC)

Oberon article tangle
Please see my comment at talk:Oberon-1 (at least it was Oberon-1 when I left it moments ago). We really need to settle on something here, or WP will become far to dizzy making. We're sliding into the soup... ww 03:35, 4 November 2006 (UTC)

This is a automated to all bot operators
Please take a few moments and fill in the data for your bot on Bots/Status Thank you Betacommand (talk • contribs • Bot) 19:49, 12 February 2007 (UTC)

Automated message to bot owners
As a result of discussion on the village pump and mailing list, bots are now allowed to edit up to 15 times per minute. The following is the new text regarding bot edit rates from Bot Policy: "Until new bots are accepted they should wait 30-60 seconds between edits, so as to not clog the recent changes list and user watchlists. After being accepted and a bureaucrat has marked them as a bot, they can edit at a much faster pace. Bots doing non-urgent tasks should edit approximately once every ten seconds, while bots who would benefit from faster editing may edit approximately once every every four seconds." Also, to eliminate the need to spam the bot talk pages, please add Bot owners' noticeboard to your watchlist. Future messages which affect bot owners will be posted there. Thank you. --Mets501 05:10, 22 February 2007 (UTC)

Tawbot deflagged
Your bot, Tawbot which was approved and flagged some time ago has now been deflagged due to inactivity. If you wish to run your bot again, feel free to return to the requests for bot approval page where you can reapply for your bot's task and flag. If you have any questions, please do not hesitate to contact a member of the BAG or myself. WjBscribe 01:54, 1 December 2007 (UTC)

AfD nomination of Thinspiration
I have nominated Thinspiration, an article you created, for deletion. I do not feel that this article satisfies Wikipedia's criteria for inclusion, and have explained why at Articles for deletion/Thinspiration. Your opinions on the matter are welcome at that same discussion page; also, you are welcome to edit the article to address these concerns. Thank you for your time. h i s  s p a c e   r e s e a r c h 18:50, 7 December 2007 (UTC)

Wojciech Jaruzelski.
Do you know anything about Wojciech Jaruzelski?

Like, what was it like in Poland during his leadership?

He is Roman Catholic, so there should have been no

religious suppression at all, unless he was pressured

by the other Eastern Bloc countries. —Preceding unsigned comment added by Chamaoloan (talk • contribs) 08:09, 20 March 2008 (UTC)

Articles for deletion nomination of Texvc
I have nominated Texvc, an article that you created, for deletion. I do not think that this article satisfies Wikipedia's criteria for inclusion, and have explained why at Articles for deletion/Texvc. Your opinions on the matter are welcome at that same discussion page; also, you are welcome to edit the article to address these concerns. Thank you for your time.Please contact me if you're unsure why you received this message. Pcap ping  04:45, 21 February 2010 (UTC)

Categories for discussion nomination of Category:Ekumen
Category:Ekumen, which you created, has been nominated for discussion. If you would like to participate in the discussion, you are invited to add your comments at the category's entry on the Categories for discussion page. Thank you. Mercurywoodrose (talk) 07:51, 13 January 2012 (UTC)

Invitation to join the Ten Year Society
Dear Tomasz,

I'd like to extend a cordial invitation to you to join the Ten Year Society, an informal group for editors who've been participating in the Wikipedia project for ten years or more.

Best regards, — Hex    (❝  ?!  ❞)   11:17, 22 November 2012 (UTC).

Notification of pending suspension of administrative permissions due to inactivity
Following a community discussion in June 2011, consensus was reached to provisionally suspend the administrative permissions of users who have been inactive for one year (i.e. administrators who have not made any edits or logged actions in over one year). As a result of this discussion, your administrative permissions will be removed pending your return if you do not return to activity within the next month. If you wish to have these permissions reinstated should this occur, please post to the Bureaucrats' noticeboard and the userright will be restored per the re-sysopping process (i.e., as long as the attending bureaucrats are reasonably satisfied that your account has not been compromised and that your inactivity did not have the effect of evading scrutiny of any actions which might have led to sanctions). This removal of access is procedural only, and not intended to reflect negatively upon you in any way. We wish you the best in future endeavors, and thank you for your past administrative efforts. MadmanBot (talk) 00:30, 1 September 2013 (UTC)

Notification of imminent suspension of administrative permissions due to inactivity
Following a community discussion in June 2011, consensus was reached to provisionally suspend the administrative permissions of users who have been inactive for one year (i.e. administrators who have not made any edits or logged actions in over one year). As a result of this discussion, your administrative permissions will be removed pending your return if you do not return to activity within the next several days. If you wish to have these permissions reinstated should this occur, please post to the Bureaucrats' noticeboard and the userright will be restored per the re-sysopping process (i.e., as long as the attending bureaucrats are reasonably satisfied that your account has not been compromised and that your inactivity did not have the effect of evading scrutiny of any actions which might have led to sanctions). This removal of access is procedural only, and not intended to reflect negatively upon you in any way. We wish you the best in future endeavors, and thank you for your past administrative efforts. MadmanBot (talk) 00:30, 25 September 2013 (UTC)

Suspension of administrative permissions due to inactivity
Following a community discussion in June 2011, consensus was reached to provisionally suspend the administrative permissions of users who have been inactive for one year (i.e. administrators who have not made any edits or logged actions in over one year). As a result of this discussion, your administrative permissions have been removed pending your return. If you wish to have these permissions reinstated, please post to the Bureaucrats' noticeboard and the userright will be restored per the re-sysopping process (i.e. as long as the attending bureaucrats are reasonably satisfied that your account has not been compromised, that your inactivity did not have the effect of evading scrutiny of any actions which might have led to sanctions, and that you have not been inactive for a three year period of time). If you remain inactive for a three year period of time, including the present year you have been inactive, you will need to request reinstatement at WP:RFA. This removal of access is procedural only, and not intended to reflect negatively upon you in any way. We wish you the best in future endeavors, and thank you for your past administrative efforts. WJBscribe (talk) 22:42, 1 October 2013 (UTC)

This is perfectly fine :-) Taw (talk) 13:02, 6 August 2014 (UTC)

Your user page
Hi,

I ran into your user page because of https://gerrit.wikimedia.org/r/#/c/228457/.

I loved The Proposal in the end of your user page! I'll do my best to adapt it. --Amir E. Aharoni (talk) 15:25, 1 August 2015 (UTC)

Proposed deletion of 3Delight

The article 3Delight has been proposed for deletion  because of the following concern:
 * Searches only found several passing mentions such as Books, News, browsers and especially Highbeam but nothing outstandingly better for this article.

While all constructive contributions to Wikipedia are appreciated, content or articles may be deleted for any of several reasons.

You may prevent the proposed deletion by removing the notice, but please explain why in your edit summary or on |the article's talk page.

Please consider improving the article to address the issues raised. Removing will stop the proposed deletion process, but other deletion processes exist. In particular, the speedy deletion process can result in deletion without discussion, and articles for deletion allows discussion to reach consensus for deletion. SwisterTwister  talk  07:24, 8 December 2015 (UTC)

Nomination for deletion of Template:Hainish Cycle
Template:Hainish Cycle has been nominated for deletion. You are invited to comment on the discussion at the template's entry on the Templates for discussion page. Vanamonde93 (talk) 21:42, 24 June 2016 (UTC)

Just to let you know
You have been mentioned at Missing Wikipedians. Ottawahitech (talk) 22:00, 7 October 2016 (UTC)please ping me

I've actually been editing all the time, just couldn't be bothered to log in.

Proposed deletion of Cell Cycle (journal)

The article Cell Cycle (journal) has been proposed for deletion because of the following concern: "hard to see notability here..."

While all constructive contributions to Wikipedia are appreciated, pages may be deleted for any of several reasons.

You may prevent the proposed deletion by removing the notice, but please explain why in your edit summary or on the article's talk page.

Please consider improving the page to address the issues raised. Removing will stop the proposed deletion process, but other deletion processes exist. In particular, the speedy deletion process can result in deletion without discussion, and articles for deletion allows discussion to reach consensus for deletion. Nomoskedasticity (talk) 08:25, 3 December 2017 (UTC)

Speedy deletion nomination of Polska Grupa Badawcza

A tag has been placed on Polska Grupa Badawcza requesting that it be speedily deleted from Wikipedia. This has been done under section A7 of the criteria for speedy deletion, because the article appears to be about a company, corporation or organization that does not credibly indicate how or why the subject is important or significant: that is, why an article about that subject should be included in an encyclopedia. Under the criteria for speedy deletion, such articles may be deleted at any time. Please read more about what is generally accepted as notable.

If you think this page should not be deleted for this reason, you may contest the nomination by visiting the page and clicking the button labelled "Contest this speedy deletion". This will give you the opportunity to explain why you believe the page should not be deleted. However, be aware that once a page is tagged for speedy deletion, it may be deleted without delay. Please do not remove the speedy deletion tag from the page yourself, but do not hesitate to add information in line with Wikipedia's policies and guidelines. If the page is deleted, and you wish to retrieve the deleted material for future reference or improvement, then please contact the.  SITH   (talk)   18:29, 27 March 2019 (UTC)

Invitation to join the Fifteen Year Society
Dear ,

I'd like to extend a cordial invitation to you to join the Fifteen Year Society, an informal group for editors who've been participating in the Wikipedia project for fifteen years or more.

Best regards, Urhixidur (talk) 19:47, 6 June 2019 (UTC)

Proposed deletion of Adam Ołdakowski

The article Adam Ołdakowski has been proposed for deletion because it appears to have no references. Under Wikipedia policy, this biography of a living person will be deleted after seven days unless it has at least one reference to a reliable source that directly supports material in the article.

If you created the article, please don't be offended. Instead, consider improving the article. For help on inserting references, see Referencing for beginners, or ask at the help desk. Once you have provided at least one reliable source, you may remove the prod blp/dated tag. Please do not remove the tag unless the article is sourced. If you cannot provide such a source within seven days, the article may be deleted, but you can when you are ready to add one. Donald D23  talk to me  22:25, 24 April 2023 (UTC)

Proposed deletion of Pixie (renderer)

The article Pixie (renderer) has been proposed for deletion because of the following concern: "No reliable or significant sources after seventeen years - I couldn't find any on Google either beyond WP:PASSING mentions. Doesn't seem notable."

While all constructive contributions to Wikipedia are appreciated, pages may be deleted for any of several reasons.

You may prevent the proposed deletion by removing the notice, but please explain why in your edit summary or on the article's talk page.

Please consider improving the page to address the issues raised. Removing will stop the proposed deletion process, but other deletion processes exist. In particular, the speedy deletion process can result in deletion without discussion, and articles for deletion allows discussion to reach consensus for deletion. HappyWith (talk) 19:17, 30 November 2023 (UTC)

Good article reassessment for Kraków
Kraków has been nominated for a good article reassessment. If you are interested in the discussion, please participate by adding your comments to the reassessment page. If concerns are not addressed during the review period, the good article status may be removed from the article. AirshipJungleman29 (talk) 14:02, 19 January 2024 (UTC)

title: User talk:Taw