the-french-artist/wikipedia_20220301.simple_sentence_split huggingface dataset:
It is part of the intercommunality Vichy Communauté.
Wilhelmshaven, Lower Saxony, Germany
Bad Tölz, Bavaria, Germany
Logroño, La Rioja, Spain
San Giuliano Terme, Tuscany, Italy
Ville de Vichy council website
Official Website of the Tourist Office of Hydrotherapy and Vichy
Communes in Allier
Peninsular Malaysia (comprising the southern end of the Malay peninsula but not any of the Malay islands)
Myanmar (formerly known as Burma, Monip and Potiop.)
Thailand (formerly Siam and Furom)
It has 6 neighborhoods with inhabitants of 18,000 people.
There is a highway under construction which will connect it with Aswan in Egypt and via Dongola with Khartoum.
in 1964 when the Aswan Dam was built, the old city of Wadi Halfa was flooded and Nubians were forced to relocate in New Halfa.
Now there is a huge number of Nubians are immigrating back to their mother land.
When a given amount of mechanical energy is transferred (such as when throwing a ball, lifting a box, crushing a soda can, or stirring a beverage) it is said that this amount of mechanical work has been done.
Both mechanical energy and mechanical work are measured in the same units as energy in general.
It is usually said that a component of a system has a certain amount of "mechanical energy" (i.e. it is a state function), whereas "mechanical work" describes the amount of mechanical energy a component has gained or lost.
The conservation of mechanical energy is a principle which states that under certain conditions, the total mechanical energy of a system is constant.
This rule does not hold when mechanical energy is converted to other forms, such as chemical, nuclear, or electromagnetic.
However, the principle of general conservation of energy is so far an unbroken rule of physics - as far as we know, energy cannot be created or destroyed, only changed in form ..
Vitiligo is a skin disease that causes the skin to lose its color.
It occurs when the melanocytes, cells that give skin their color, die or do not work.
This is a problem because these cells protect against the light from the sun.
How is it caught?
The exact cause of vitiligo is complex and not fully understood.
It may be caused by the immune system, genetic, and environmental factors.
People over 20 years old rarely develop this disease.
These patches often occur to both sides symmetrically and may change shape.
Effects of vitiligo
color of the skin is lighter because there are no pigments
purple or golden brown patches on and around the eyes, nose, and mouth
puffiness of the middle layer of the eye
quicker graying of hair
more sensitive to sun
Curing it
As of 2020, doctors do not understand what causes the disease, so right now, it can not be cured.
Some things can be done to fight its effects, though.
Makeup or cosmetics can cover up the parts of the skin with vitiligo.
Also, staying out of the sun to prevent tanning is good.
But the treatment given by most skin doctors is cortico steroid cream.
Famous people with vitiligo
Michael Jackson told Oprah in a 1993 interview that he had vitiligo.
He is the most well known person to have had the disease.
A lot of people thought that he was lying.
He died in 2009, and his autopsy found that he was telling the truth.
Apparently, when it got past the point where makeup could have hidden it, he chose to have the rest of the pigment removed.
Jon Hamm got vitilgo when he was filmed acting for Mad Men because of stress.
Virtue (Latin virtus; Greek ἀρετή) is a kind of behaviour which is thought to be good.
The adjective is "virtuous".
Someone who lives a virtuous life is someone who leads a good moral life, doing things that society thinks are good.
The opposite of virtue is vice.
Philosophers throughout the ages have written their ideas about what they think virtue is.
The Ancient Greek philosophers from Plato onwards said that virtue consisted of four things: Justice, Courage, Wisdom, and Moderation.
In the Christian religion the three virtues  were Faith, Hope and Charity.
These are mentioned in the Bible in the First Epistle to the Corinthians chapter 13 verse 13.
These virtues are also very important in the Judaic and Muslim traditions.
Greyhound Lines (commonly called Greyhound) is a company in the United States that runs bus services between cities.
It was founded in 1914.
Its parent company is on the London Stock Exchange.
The buses use air brakes and hold over 200 gallons of diesel.
In 1997, the NIST announced for competition to choose a successor to DES to be known as AES, Twofish was one of the five finalists of the Advanced Encryption Standard competition, but was not selected as a standard.
Twofish is related to the earlier block cipher Blowfish.
Twofish's main features are the use of pre-computed key-dependent S-boxes, and a relatively complex key schedule.
One half of an n-bit key is used as the actual encryption key and the other half of the n-bit key is used to modify the encryption algorithm (key-dependent S-boxes).
Twofish uses some elements from other designs; for example, the pseudo-Hadamard transform (PHT) from the SAFER family of ciphers.
Twofish uses the same Feistel structure as the DES.
Twofish was designed by Bruce Schneier, John Kelsey, Doug Whiting, David Wagner, Chris Hall, and  Niels Ferguson; the "extended Twofish team" who met to made further cryptanalysis of Twofish and other AES competitors included Stefan Lucks, Tadayoshi Kohno, and Mike Stay.
Twofish algorithm is free for anyone to use without any restrictions whatsoever.
The Twofish cipher has not been patented and the software example of its specification has been placed in the public domain.
However, Twofish is not widely used like the Blowfish, which has been available for a longer period of time.
As of 2008, the best published cryptanalysis on the Twofish block cipher is a truncated differential cryptanalysis of the full 16-round version.
The paper claims that the probability of truncated differentials attacks is 2-57.3 per block and that it will take about 251 chosen plaintexts (32 PiB worth of data) to find a good pair of truncated differentials.
Bruce Schneier responds in a 2005 blog entry that this paper does not present a full cryptanalytic attack, but only some hypothesized differential characteristics: "But even from a theoretical perspective, Twofish is not even remotely broken.
There have been no extensions to these results since they were published" in 2000.
Twofish web page with full specifications, free source code, and other Twofish resources.
David Wagner's sci.crypt post recommending AES over Twofish  — Wagner was one of the designers of Twofish.
SCAN's entry for Twofish
List of products using TwoFish
In cryptography, truncated differential cryptanalysis is a generalization of differential cryptanalysis, an attack model against block ciphers.
In 1994 Lars Knudsen designed the technique, during this period ordinary differential cryptanalysis analyzes the full difference between two texts, the truncated version considers differences that are only determined to some extent.
It has been applied to SAFER, IDEA, Skipjack, E2, Twofish, Camellia, CRYPTON, and the stream cipher Salsa20 as well.
The Fatimid Caliphate was ruled by the al-Fātimiyyūn () dynasty  from 5 January 909 to 1171.
It was an Arab Shi'a dynasty It ruled the fourth and final Arab caliphate.
In different times different areas of the Maghreb, Egypt, and the Levant belonged to the caliphate.
Egyptian city of Cairo was made the capital.
The term Fatimite is sometimes used to refer to the citizens of this caliphate as well.
The ruling elite belonged to the Ismaili branch of Shi'ism.
The leaders were also Shia Ismaili Imams.
They had a religious significance to Ismaili Muslims.
They are also part of the chain of holders of the office of Caliph, as recognized by most Muslims, the only period in which the Shia Imamate and the Caliphate were united to any degree.
There was only one other exception: the Caliphate of Ali himself.
Rise of the Fatimids
The Fatimids came from Ifriqiya, modern-day Tunisia and eastern Algeria.
The dynasty was founded in 909 by , who legitimised his claim through descent from Muhammad by way of his daughter Fātima as-Zahra and her husband , the first  Imām, hence the name al-Fātimiyyūn "Fatimid".
Decay and fall
In the 1040s, the Zirids (governors of North Africa under the Fatimids) declared their independence from the Fatimids and their conversion to Sunni Islam, which led to the devastating Banū Hilal invasions.
After about 1070, the Fatimid hold on the Levant coast and parts of Syria was challenged first by Turkic (Seljuk) invasions, then the Crusades, so that Fatimid territory shrank until it consisted only of Egypt.
After the decay of the Fatimid political system in the 1160s, the Zengid ruler Nūr ad-Dīn had his general, Shirkuh, seize Egypt from the vizier Shawar in 1169.
Shirkuh died two months after taking power, and the rule went to his nephew, Saladin.
This began the Kurdish Ayyubid Dynasty.
Fatimid caliphs
(909-934) founder Fatimid dynasty
(934-946)
(946-953)
(953-975) Egypt is conquered during his reign
(975-996)
(996-1021)
(1021-1036)
(1036-1094)
(1094-1101) Quarrels over his succession led to the Nizari split.
(1101-1130) The Fatimid rulers of Egypt after him are not recognized as Imams by Mustaali Taiyabi Ismailis.
(1130-1149)
(1149-1154)
(1154-1160)
(1160-1171).
Fatimids entry in the Encyclopaedia of the Orient.
909 establishments
12th-century disestablishments in Africa
1171 disestablishments
The Maghreb ( ) is the western part of the Arab world.
It is in North Africa.
The term is generally applied to all of Mauritania, Western Sahara, Morocco, Algeria, Tunisia, and Libya, but in older Arabic usage meant only the area of the three countries between the high ranges of the Atlas Mountains and the Mediterranean Sea (Morocco, Algeria and Tunisia).
Historically, some writers also included Muslim ruled regions in Spain, Portugal, Sicily and Malta in the definition.
Malta, in particular, still speaks a language based on its own Maghrebi Arabic variety: Maltese.
Politics, economics, and human affairs analysis in the Maghhreb
Radio Online of the Maghreb
Before computers, plaintext meant text in the language of the communicating parties.
Since computers, the definition has been expanded.
It now includes not only the electronic representation of text, such as emails and word processor documents, but also the computer representation of speech, music, pictures, videos, ATM and credit card transactions, sensor data, and so forth.
That is basically any information which the communicating parties might wish to hide from others.
The plaintext is the normal representation of the data before any action has been taken to hide it.
The plaintext is used as input to an encryption algorithm; the output is termed ciphertext.
Some systems, however, use a cascade of layers of encryption (called 'rounds') in which case the ciphertext output of one encryption algorithm becomes the plaintext input to the next.
Triple DES is an example.
In cryptography, ciphertext (or cyphertext) refers to the output of the encryption process.
Plaintext is turned into ciphertext using an algorithm (cipher).
This makes it unreadable to anyone except those who own unique information about it, usually referred to as a key.
Decryption is the reverse process of encryption.
It takes the unreadable ciphertext as an input and makes it readable again in the form of plaintext.
Azad Kashmir Day celebrates the 67th day of the Azad Jammu Kashmir government, created on 24 October 1947.
However, most people celebrate it on 26 October as they class it as a lucky day once all the papers were signed and settled.
In cryptography, a stream cipher is a symmetric key cipher where plaintext bits are combined with a pseudorandom cipher bit stream (keystream) using an exclusive-or (xor) operation.
In a stream cipher the Plaintext digits are encrypted one at a time, and the transformation of successive digits varies during the encryption state.
An alternative name is a state cipher, as the encryption of each digit is dependent on the current state.
In practice, the digits are typically single bits or bytes.
Stream ciphers represent a different approach to symmetric encryption from block ciphers.
Block ciphers operate on large blocks of fixed length.
Stream ciphers typically execute at a higher speed than block ciphers and have lower hardware requirements.
However, stream ciphers can be susceptible to serious security problems if used incorrectly; for example, in particular, the same starting state must never be used twice.
A stream cipher makes use of a much smaller and more convenient cryptographic key, for example 128 bits keys.
Based on this key, it generates a pseudorandom keystream which can be combined with the plaintext digits in a similar way to the one-time pad encryption algorithm.
However,  because the keystream is pseudorandom, and not truly random, the security associated with the one-time pad cannot be applied and it is quite possible for a stream cipher to be completely insecure.
Types of stream ciphers
A stream cipher generates successive elements of the keystream based on an internal state.
This state is updated in two ways:
If the state changes independently of the plaintext or ciphertext messages, the cipher is classified as a synchronous stream cipher.
If the state is updated based on previous changes of the ciphertext digits, the cipher is classified as a self-synchronising stream ciphers.
Synchronous stream ciphers
In a synchronous stream cipher a stream of pseudo-random digits is generated independently of the plaintext and ciphertext messages, and then combined with the plaintext (to encrypt) or with the ciphertext (to decrypt).
In the most common form, binary digits(bits) are used, and the keystream is combined with the plaintext using the exclusive or operation (XOR).
In a synchronous stream cipher, the sender and receiver must be in  synchronous for decryption to be successful.
If digits are added or removed from the message during transmission, synchronisation is lost.
To restore synchronisation, various offsets can be tried systematically to obtain the correct decryption.
Another approach is to mark the ciphertext with markers at regular points in the output.
If, however, a digit is corrupted in transmission, rather than added or lost, only a single digit in the plaintext is affected and the error does not propagate to other parts of the message.
This property is useful when the transmission error rate is high; however, it makes it less likely that the error would be detected without further mechanisms.
Moreover, because of this property, synchronous stream ciphers are very susceptible to active attacks — if an attacker can change a digit in the ciphertext, he might be able to make predictable changes to the corresponding plaintext bit; for example, flipping a bit in the ciphertext causes the same bit to be flipped(Toggled) in the plaintext.
Self-synchronizing stream ciphers
Self-synchronizing stream ciphers is another technique that uses part of the previous N ciphertext digits to compute the keystream.
Such schemes are known also as asynchronous stream ciphers or ciphertext autokey (CTAK).
The idea of self-synchronization was patented in 1946, and has the advantage that the receiver will automatically synchronise with the keystream generator after receiving N ciphertext digits, making it easier to recover if digits are dropped or added to the message stream.
Single-digit errors are limited in their effect, affecting only up to N plaintext digits.
It is somewhat more difficult to perform active attacks on self-synchronising stream ciphers rather than synchronous counterparts.
Linear feedback shift register-based stream ciphers
Binary stream ciphers are often constructed using linear feedback shift registers (LFSRs) because they can be easily implemented in hardware and can be quickly analysed mathematically.
However, the use of LFSRs only is insufficient to provide good security.
Various schemes have been designed to increase the security of LFSRs.
Non-linear combining functions
Because LFSRs are inherently linear, one technique for removing the linearity is to feed the outputs of a group of parallel LFSRs into a non-linear Boolean function to form a combination generator.
Various properties of such a combining function are important for ensuring the security of the resultant scheme, for example, in order to avoid correlation attacks.
Clock-controlled generators
Normally LFSRs are stepped regularly.
One technique to introducting non-linearity is to have the LFSR clocked irregularly, controlled by the output of a second LFSR.
The stop-and-go generator (Beth and Piper, 1984) consists of two LFSRs.
One LFSR is clocked if the output of a second is a "1", otherwise it repeats its previous output.
This output is then (in some versions) combined with the output of a third LFSR clocked at a regular rate.
The shrinking generator uses a different technique.
Two LFSRs are used, both clocked regularly in the following way:
If the output of the first LFSR is "1", the output of the second LFSR becomes the output of the generator.
If the output of the first LFSR "0", the output of the second is discarded, and no bit is output by the generator.
This technique suffers from timing attacks on the second generator, since the speed of the output is variable in a manner that depends on the second generator's state.
This can be improved by buffering the output.
Filter generator
Another approach to improving the security of an LFSR is to pass the entire state of a single LFSR into a non-linear filtering function.
Other designs
Instead of a linear driving device, one may use a nonlinear update function.
For example, Klimov and Shamir proposed triangular functions (T-Functions) with a single cycle on n bit words.
To be secure, the period of the keystream (the number of digits output before the stream repeats itself)  needs to be large enough.
If the sequence repeats, then the overlapping ciphertexts can be aligned against each other "in depth", and there are techniques which allow extraction of the plaintext form ciphertexts generated using these methods.
Stream ciphers are often used in applications where plaintext comes in quantities of unknowable length as in secure wireless connections.
If a block cipher were to be used in this type of application, the designer would need to choose either transmission efficiency or implementation complexity, since block ciphers cannot directly work on blocks shorter than their block size.
For example, if a 128-bit block cipher received separate 32-bit bursts of plaintext, three quarters of the transmitted data need padding.
Block ciphers must be used in ciphertext stealing or residual block termination mode to avoid padding, while stream ciphers eliminate this issue by operating on the smallest transmitted unit (usually bytes).
Another advantage of stream ciphers in military cryptography is that the cipher stream can be generated by an encryption device that is subject to strict security measures then fed to other devices, e.g. a radio set, which will perform the xor operation as part of their function.
The other device can be designed for used in less securely environments.
Comparison Of Stream Ciphers
Matt J. B. Robshaw, Stream Ciphers Technical Report TR-701, version 2.0, RSA Laboratories, 1995 (PDF) .
Thomas Beth and Fred Piper, The Stop-and-Go Generator.
EUROCRYPT 1984, pp 88–92.
RSA technical report on stream cipher operation.
Analysis of Lightweight Stream Ciphers (thesis by S. Fischer).
Nyon is a municipality in the district of Nyon in the canton of Vaud in Switzerland.
It is found 25 kilometers north of Geneva, and is part of the Geneva metropolitan area.
The town has (as of 2006) 17,267 people.
Nyon was built by the Romans between 50 BCE and 44 BCE, and was called "Colonia Iulia Equestris" or "Colonia Equestris Noiodunum".
It grew to be one of the most important Roman colonies in modern-day Switzerland, with a forum, a basilica and an amphitheater that was discovered in 1996.
Modern Day Nyon
Official website of the town (available in French, English and German)
Web site of the Roman Museum of Nyon (same languages as above link)
Paléo Festival
Rugby Club Nyon
Ultimate Frisbee Club, Les Mange-Disques de Nyon
La Redoute, Popular neighbourhood of Nyon
Letterkenny () is a town in County Donegal of the Ireland.
It is  on the River Swilly and has a population of 17,586.
In 1824, when the first description of Letterkenny as a modern town was written, it was stated that: "Within half a mile is the Port of Ballyraine, whither vessels of 100 tons bring iron, salt and colonial produce and whence they export hides and butter".
Nothing is left of the port now except the warehouses.
Thalwil was originally four Wachten, or hamlets:
Ludretikon, the oldest hamlet (mentioned in 915), bordering Rüschlikon
Oberdorf (Upper Village), the area around the church
Unterdorf (Lower Village), the area roughly south of the railway station
Langnau am Albis, (which separated from Thalwil around 1713)
Thalwil also has the oldest wood corporation in the Canton of Zurich, the Bannegg-Waldung.
It was first mentioned in 1483.
Modern day Thalwil
Today, the economy of Thalwil is mostly some small and medium-sized businesses, and a wide range of shops.
Most of the shops are located around Gotthardstrasse- the town centre.
The main source of Thalwil's wealth lies with its 7,000 commuters.
These people live in Thalwil, but work in Zurich city.
Today, Thalwil has left most of its farming past behind in exchange for a town of commuters, with its public transportation links, low tax and good quality of life.
Official website of the Thalwil Gemeinde
Blog about life in Thalwil
Thalwiler Anzeiger newspaper
A hearth (har-th) is a brick or stone lined fireplace or oven that is used for cooking and heating.
Historically, the hearth was the center of the home, as it provided heat for the house.
Its Latin name is focus.
That is why "focus" is used for many kinds of central point.
In more modern times, the hearth may be section of the fireplace that can be seen.
This often includes tiles around the base of the fireplace and the floor.
A Jack-o'-lantern is a carved pumpkin, turnip, beet, or potato.
In the 19th and 20th centuries people in Scotland and Ireland carved Halloween lanterns from large yellow turnips.
This custom has become less prevalent in recent years as supermarkets have begun selling the larger and easier-to-carve American pumpkins.
In Irish lore, the Jack-o'-lantern is from the story of Stingy Jack.
Jack was a clever man who cheated the devil several times.
Once when Jack was leaving hell, the devil threw him a glowing coal to light his way.
Jack put the coal in a hollowed-out turnip to make the first "Jack-o'-lantern".
Lore says Jack can still be seen wandering the world with his turnip lantern, especially around All Saints Day, November 1.
In the United States, the carved pumpkin was first associated with the harvest season in general, long before it became an emblem of Halloween.
In 1900, an article on Thanksgiving entertaining recommended a lit Jack-o'-lantern as part of the festivities.
To make a Jack-o'-lantern, the top of the pumpkin surrounding the stump of the vine is cut off.
This top will be used as a "lid" when the Jack-o'-lantern is completed.
The seeds and pulp inside the pumpkin are scooped out using a spoon or one's hands.
The seeds may be roasted in a hot oven, and then salted to make a snack.
Once the inside of the pumpkin is clean, a face is carved into one side of the pumpkin.
The eyes and nose are usually triangles.
The mouth is usually filled with jagged teeth.
A candle, devotional candle in a candle-holder, or a flashlight is put inside the Jack-o'-lantern and lit.
The "lid" is replaced.
The lid may be placed slightly askew to keep the candle alit.
In the United States, a completely carved and lit Jack-o'-lantern is put on the porch, the porch steps, or in a window to welcome trick-or-treaters on Halloween.
Once the pumpkin is carved, it is good for nothing else and lasts only a day or two before it starts to rot.
Pumpkins used to make Jack-o'-lanterns are inedible.
In the United States, mischief-makers steal the Jack-o'-lanterns of their neighbors.
The pumpkins are smashed in the street, dropped from a bridge, or otherwise destroyed.
The lakes of Titan, a moon of Saturn, are made of liquid methane.
The lakes were found by the Cassini-Huygens space probe.
The larger lakes are known as maria (seas) and the smaller ones as lacūs (lakes).
The Cassini mission proved there are liquid lakes on Titan, but not at first.
When the probe arrived in the Saturnian system in 2004, scientists hoped that hydrocarbon lakes or oceans might be seen in reflected sunlight from the surface, but no reflections were found.
Scientists still believed that liquid ethane and methane would be found near Titan's poles, where they expected to find lots of liquid.
At Titan's south pole, a large dark area named Ontario Lacus was the first lake identified, possibly created by rain as clouds are often seen in the area.
A possible shoreline was also identified at the pole in radar images.
As the Huygens-Cassini probe flew by on July 22, 2006, its radar took pictures of the northern part of the planet (which was in its winter), a number of large, smooth areas were found on the surface near the northern pole.
Based on this data, scientists announced "definitive evidence of lakes filled with methane on Saturn's moon Titan" in January 2007.
The Cassini–Huygens team decided that the smooth areas are the hydrocarbon lakes they had been searching for, the first lakes found off Earth.
Some valleys appear to have rivers.
The satellite was not able to show pictures of lakes moving in the wind.
The heavy moisture and clouds of methane near Titan’s surface could be a sign of evaporation from lakes.
The lakes cover 0.002–0.02% of Titan's surface.
The Cassini-Huygens probe flew by in February, 2007, taking radar and camera pictures of some large areas near the north pole that may be large areas of liquid methane and/or ethane, including one sea larger than 100,000 km² (larger than Lake Superior), and another area similar in size to the Caspian Sea.
Pictures taken near Titan's southern pole in October 2007 showed similar, but far smaller, areas that look like lakes.
[[Image:Huygens shoreline.jpg|thumb|Picture of Titan taken during Huygens''' landing, showing hills, rivers and beaches.]]
The Cassini-Huygens probe, flew very close to Titan in December 2007, and took infrared pictures of the chemicals on the surface and found a lake called Ontario Lacus near the south pole.
Scientists studying the infrared pictures decided that one or more of the large lakes in the pictures of Saturn's moon Titan does hold liquid and that the liquid is made of hydrocarbons.
They have also found ethane on Titan.
This mission proves Titan to be the only other planet known to have liquid on its surface.
The lakes make Titan a very important planet for studying weather science.
Liquids, gases and temperatures are at play on Titan.
This should help the science of weather forecasting.
Lakes were not found near near Titan's center of Titan which was studied on January 14, 2005.
A part of the Huygens-Cassini probe landed there.
The pictures taken by the probe as it fell showed no open areas of liquid, but showed rivers that had dried.
It was at first thought that dark areas near the center of Titan could be a lake of a liquid or tar-like substance, but the probe landed on the dark area, and it is solid without any liquid.
A device known as a penetrometer studied the surface as the probe landed and seemed to find wet clay.
Scientists believe that the penetrometer may have landed on a large pebble, and they say that the surface is similar to sand made of ice.
Pictures taken after the probe landed show a  large flat area covered in pebbles.
The pebbles may be made of water ice and are partly rounded, which indicates fluids.
On February 13, 2008, scientists said that Titans polar lakes contain "hundreds of times more natural gas and other hydrocarbons than all the known natural gas on Earth."
The desert near the center of the planet are not liquid but do have more organics than Earth.
In June 2008, Cassini's Visible and Infrared Mapping Spectrometer confirmed the presence of liquid ethane beyond doubt in a lake in Titan's southern hemisphere.
Names of Titans lakes and seas
Titanian maria (large hydrocarbon seas) are named after sea monsters of Earth.
Areas named Lacus'' are believed to be methane lakes.
They are named after lakes on Earth.
The West Coast blues is a type of blues music related to jazz and jump blues, with lots of piano sounds and jazz guitar solos, which originated from Texas blues musicians that moved to California in the 1940s.
West Coast blues also uses smooth, honey-toned vocals, often sounding similar to urban blues.
The best known West Coast blues musicians may be guitarist T-Bone Walker, famous for the song "Call It Stormy Monday (But Tuesday Is Just As Bad)", originally from Texas, he had made his first recordings in the late 1920s.
During the early 1940's Walker moved to Los Angeles, where he recorded a lot of music for Capital, Black & White, and Imperial.
Walker an electric guitar sound to the blues, prossibly doing more to make the use of electric guitar popular in blues than anyone else.
Much of his material had a jazzy jump blues feel, which is typical of popular blues from California in the 1940s and 1950s.
Other Texas bluesmen followed: Pianist/songwriter Amos Milburn, singer Percy Mayfield, famous for the song "Hit the Road Jack", and Charles Brown moved to Los Angeles.
Guitarist Pee Wee Crayton divided his time between Los Angeles and San Francisco, while Lowell Fulson, from Texas by way of Oklahoma, moved to Oakland.
Artist/Musicians
Bay Area Blues Society
A grammatical person, he, she, and they in many languages
Third-person narrative, a perspective in story-telling
Third-person view, a point-of-view in film, television, and video games that is shown outside any of the actors or characters.
Third-person shooter, a genre of 3D computer and video games in which the onscreen character is seen at a distance from a number of different possible angles
Third Person, a New York City improvising trio
Second person (disambiguation)
Sir Frederick William Pottinger, 2nd Baronet (1831–1865), police inspector, was born on April 27, 1831, in India.
He became famous for leading the New South Wales police in their hunt for the bushrangers Ben Hall, John Gilbert, Frank Gardiner and John Dunn.
He was the son of Lieutenant-General Sir Henry Pottinger of the British East India Company, and his wife Susanna Maria, née Cooke, of Dublin.
Henry Pottinger was the first Governor of Hong Kong.
Frederick went to Eton from 1844 to 1847.
Between 1850 and 1854, Pottinger was an officer in the Grenadier Guards in England.
He lost a lot of his mother's money gambling on horse races.
In 1856 he took the place of his father as second baronet.
He soon gambled away all his money.
He owed people a lot of money.
He went to Australia to search for gold.
He joined the New South Wales police force as a mounted trooper.
He was an excellent horse rider and spent the next few years working on the gold escort between Gundagai and Goulburn.
Pottinger kept his title secret but in 1860 the inspector-general of police, John McLerie, found out.
He was quickly given better jobs.
In November he became clerk of petty sessions at Dubbo and on October 1, 1861, assistant superintendent of the Southern Mounted Police Patrol.
He wanted to do a good job in the police, but he got into a drunken brawl at Young on 20–21 December 1861.
He was a publicly warned about his bad behaviour.
He was sent to the Lachlan River area.
He showed he was a busy but unlucky hunter of bushrangers.
In 1862 Pottinger was made an inspector of police for the Western District of New South Wales.
In April 1862 he arrested Ben Hall at Forbes on a charge of robbery.
Hall he was released because there was not enough evidence to prove he was a robber.
Soon afterward Hall joined Frank Gardiner's gang.
On June 15, 1862, they robbed the Lachlan gold escort of some £14,000 at Eugowra.
Pottinger was able to capture two of the bushrangers quickly.
They escaped several days later in a gun battle.
Pottinger got back some of the stolen gold.
People thought Pottinger made a lot of mistakes.
He was in trouble for not having enough police guards on the gold escort and letting his prisoners escape.
On the night of August 9,  Pottinger and a group of police surrounded the house of Gardiner's mistress, Kate Brown.
The bushranger escaped when Pottinger's pistol fired accidentally.
They arrested a young boy who they thought was a friend of the bushrangers.
When he died from a fever in gaol in March 1863, this was seen to be caused by Pottinger's cruelty.
In February 1862 Pottinger was in court at Yass for assault.
During a game of billiards he had been called a cheat, a liar and a scoundrel.
He hit the person with the billiard cue and smashed his head through a window.
On September 27, 1862, Pottinger had appeared before a Bathurst court on a charge of assault.
In February 1863 Pottinger went to Sydney for the trial of the escort robbers.
He was pushed in the street by people in the crowd.
He also threatened a Member of Parliament, J. J. Harpur, with his whip.
He didn't like things that Harpur had said about him.
The bushrangers in his area became more active.
He captured Patrick Daley.
On August 17, 1864, he nearly caught James Alpin McPherson.
In May 1863 the inspector-general told police to think of new ways to catch the bushrangers.
Early in January 1865 Pottinger rode a horse in the Wowingragong races.
This was against the rules of the police force.
He was sacked (lost his job) on February 16, 1865.
Pottinger said that he was just trying to get Ben Hall and John Dunn to come out of hiding.
His plan worked and the bushrangers went to the races, only Pottinger didn't see them.
Protest meetings against his sacking were held on the gold diggings and in the towns.
People signed petitions for him to get his job back.
He was regarded as a brave and tireless policeman.
Pottinger went to Sydney to try and get back his job.
On March 5, 1865, at Wascoe's Inn in the Blue Mountains Pottinger accidentally shot himself in the stomach while trying to get onto a moving coach.
He was moved to the Victoria Club in Sydney where he died on April 9, 1865.
His brother Henry became the 3rd Baronet.
He was buried at St Jude's Anglican Church, Randwick.
Photographs of Sir Frederick Pottinger at the National Library of Australia
Australian police officers
A bushfire is a wildfire that happens mostly in the Australian bush.
Bush is the word for scrub, woodland or grassland of Australia and New Zealand.
In south east and south west of Australia, bushfires are most common in the summer and early autumn.
In the north of Australia, bushfires usually happen during winter which is the dry season.
Many Australian plants burn easily.
Eucalyptus trees have a high oil content which makes them burn.
Over the last 40 years, Australian bushfires have cost around 2.5 billion Australian dollars.
In the same period, Australian bushfires caused the death of around 250 people and the destruction of 4,554 homes.
But these figures do not include the 173 people who died and the 2000 homes destroyed in the 2009 Victorian bushfires.
They can also kill wildlife including rare koalas.
Artificial selection is the intentional breeding of plants or animals.
It means the same thing as selective breeding and is an ancient method of genetic engineering.
Selective breeding is a technique used when breeding domesticated animals, such as dogs, pigeons or cattle.
Some of these animals may have traits that a breeder will want to carry over to the next generation.
The breeder will therefore select those animals to breed which have that quality, rather than those that do not.
Inbreeding is a particular kind of selective breeding, designed to produce a population which is genetically virtually identical.
Such populations are rarely viable outside the laboratory.
They lose fertility.
To control this, most breeds are outcrossed or backcrossed to wild-type individuals, or at least less inbred stock.
The details differ from breed to breed.
The improvement when outcrossing is done is called hybrid vigour.
Charles Darwin used the example of artificial selection to introduce his idea of natural selection.
Artificial selection may be contrasted with the process of natural selection.
In natural selection, the differential reproduction of organisms with certain traits happens.
This is because some variations help the organism to have better survival and reproduction.
The process maintains or enhances the fitness of a population in its natural habitat.
A selectable marker is a reporter gene introduced into a cell along with a gene insert.
What this means is, the experimenter can tell the right gene is in the cell because the marker can be seen or detected.
Most often, this is used for  bacteria or for cells in culture.
Selectable markers show the success of a transfection or other procedure meant to introduce foreign DNA into a cell.
It is a technique in gene targeting and gene knockout.
Selectable markers are often antibiotic resistance genes; bacteria that have been subjected to a procedure to introduce foreign DNA are grown on a medium containing an antibiotic.
The antibiotic knocks out cells which do not have the resistant marker.
Those bacterial colonies that can grow have successfully taken up and expressed the introduced genetic material.
Beta-lactamase which confers ampicillin resistance to bacterial hosts.
Neo gene from Tn5, which confers antibiotic resistance to kanamycin in bacteria and to geneticin in eukaryote cells.
Mutant FabI gene (mFabI) from E. coli genome, which confers triclosan resistance to the host.
In Computer Science, especially in artificial intelligence, evolutionary algorithms are a kind of algorithm that simulate evolution to optimise something.
Each generation of solution is subjected to some kind of fitness function; those that survive are then recombined in some way to make the next generation of solution.
This is done until a certain level of fitness is reached, or a determined number of generations have been used.
Artificial life (commonly Alife or alife) is a field of study which examines systems related to life, its processes, and its evolution.
This is done with simulations using computer models, robotics, and biochemistry.
There are three main kinds of alife, named for their approaches:  soft, from software; hard, from hardware; and wet, from biochemistry.
Artificial life imitates traditional biology by trying to recreate biological phenomena.
The term "artificial life" is often used to specifically refer to soft alife.
Nils Aall Barricelli (24 January 1912 – 27 January 1993) was a Norwegian-Italian mathematician.
Barricelli's early computer-assisted experiments in symbiogenesis and evolution are considered pioneering in artificial life research.
Barricelli, who was independently rich, held an unpaid residency at the Institute for Advanced Study in Princeton, New Jersey in 1953, 1954.
and 1956.
He later worked at the University of California, Los Angeles, at Vanderbilt University (until 1964), in the Department of Genetics of the University of Washington, Seattle (until 1968) and then at the Mathematics Institute of the University of Oslo.
Barricelli published in a variety of fields including virus genetics, DNA, theoretical biology, space flight, theoretical physics and mathematical language.
Barricelli's Universe (make-digital.com)
George Dyson TED talk discusses Barricelli
Norwegian mathematicians
A genetic algorithm is an algorithm that imitates the process of natural selection.
They help solve optimization and search problems.
Genetic algorithms are part of the bigger class of evolutionary algorithms.
Genetic algorithms imitate natural biological processes, such as inheritance, mutation, selection and crossover.
The concept of genetic algorithms is a search technique often used in computer science to find complex, non-obvious solutions to algorithmic optimisation and search problems.
Genetic algorithms are global search heuristics.
Natural evolution can be modeled as a game, in which the rewards for an organism that plays a good game of life are the passing on of its genetic material to its successors and its continued survival.
In natural evolution, how well an individual performs depends on its who it works with and who it competes with, as well as the environment.
Genetic algorithms are a simulation of natural selection on a population of candidate solutions to an optimization problem (chromosomes, individuals, creatures, or phenotypes).
Candidates are evaluated and crossbred in an attempt to make good solutions.
Such solutions may take a lot of time and are not obvious to a human.
An evolutionary phase is started with a population of randomly generated beings.
In each generation, the fitness of every individual in the population is evaluated.
Some are randomly selected from the current population (based on their fitness) and modified (recombined and possibly randomly mutated) to form a new population.
The cycle repeats with this new population.
The algorithm ends either after a set number of generations have passed, or a good fitness level has been reached for the population.
If the algorithm has ended due to reaching a maximum number of generations, it does not necessarily mean a good fitness level has been obtained.
Programming this on a computer
Initialization: Some possible solutions are created; very often these will have random values
Evaluation: A fitness function scores each solution; the score will be a number that tells how well this solution solves the problem.
The following steps are run until the requirement to stop is met:
Selection: Pick the solutions/individuals for the next iteration
Recombination: Combine the solutions picked
Mutation: Randomly change the newly created solutions
Evaluation: Apply the fitness function, see step 2.
If the requirement to stop is not met, re-start with the selection step.
The above description is abstract.
A concrete example helps.
Genetic algorithms are good at solving problems that include timetabling and scheduling.
They have also been applied to engineering.
They are often used to solve global optimization problems.
As a general rule of thumb, genetic algorithms might be useful in problem domains that have a complex fitness landscape as mixing is designed to move the population away from local optima that a traditional hill climbing algorithm might get stuck in.
Commonly used crossover operators cannot change any uniform population.
Mutation alone can provide ergodicity of the overall genetic algorithm process (seen as a Markov chain).
In his Algorithm Design Manual, Skiena advises against genetic algorithms for any task: "It is quite unnatural to model applications in terms of genetic operators like mutation and crossover on bit strings.
The pseudobiology adds another level of complexity between you and your problem.
Second, genetic algorithms take a very long time on nontrivial problems. [...]
The analogy with evolution—where significant progress require [sic] millions of years—can be quite appropriate.
[...] I have never encountered any problem where genetic algorithms seemed to me the right way to attack it.
Further, I have never seen any computational results reported using genetic algorithms that have favorably impressed me.
Stick to simulated annealing for your heuristic search voodoo needs."
Board games are a very relevant part of the area of genetic algorithms as applied to game theory problems.
Much of the early work on computational intelligence and games was directed toward classic board games, such as tic-tac-toe, chess, and checkers.
Board games can now, in most cases, be played by a computer at a higher level than the best humans, even with blind exhaustive search techniques.
Go is a noted exception to this tendency, and has so far resisted machine attack.
The best Go computer players now play at the level of a good novice.
Go strategy is said to rely heavily on pattern recognition, and not just logical analysis as with chess and other more piece-independent games.
The huge effective branching factor required for finding high quality solutions heavily restricts the look-ahead that can be used within a move sequence search.
The genetic algorithm can be used in computer games to create artificial intelligence (the computer plays against you).
This allows for a more realistic game experience; if a human player can find a sequence of steps which always lead to success even when repeated in different games, there can be no challenge left.
Conversely if a learning technique such as a genetic algorithm for a strategist can avoid repeating past mistakes, the game will have more playability.
A method for representing the challenge in terms of the solution (e.g. routing soldiers in an attack in a strategy game)
A fitness or evaluation function in order to determine the quality of an instance (e.g. a measurement of damage done to an opponent in such an attack).
The fitness function accepts a mutated instantiation of an entity and measures its quality.
This function is customized to the problem domain.
In many cases, particularly those involving code optimization, the fitness function may simply be a system timing function.
Once a genetic representation and fitness function are defined, a genetic algorithm will instantiate initial candidates as described before, and then improve through repetitive application of mutation, crossover, inversion and selection operators (as defined according to the problem domain).
Repeated fitness function evaluation for complex problems is often the most limiting segment of artificial evolutionary algorithms.
Finding the optimal solution to complex problems often requires very expensive fitness function evaluations.
In real world problems such as structural optimization problems, a single function evaluation may require several hours to several days of complete simulation.
Typical optimization methods cannot deal with such types of problem.
It is often necessary to use approximation, as calculating the exact solution takes too long.
Genetic algorithms sometimes combine different approximation models to solve complex real life problems.
Genetic algorithms do not scale well.
That is, where the number of elements which are exposed to mutation is large there is often an exponential increase in search space size.
This makes it extremely difficult to use the technique on problems such as designing an engine, a house or a plane.
To use genetic algorithms with such problems,  they must be broken down into the simplest representation possible.
For this reason, we see evolutionary algorithms encoding designs for fan blades instead of engines, building shapes instead of detailed construction plans, and airfoils instead of whole aircraft designs.
The second problem of complexity is the issue of how to protect parts that have evolved to represent good solutions from further destructive mutation, particularly when their fitness assessment requires them to combine well with other parts.
The "better" solution is only in comparison to other solutions.
As a result, the stop criterion is not clear in every problem.
In many problems, genetic algorithms have a tendency to converge towards local optima or even arbitrary points rather than the global optimum of the problem.
This means that the algorithm does not "know how" to sacrifice short-term fitness to gain longer-term fitness.
The likelihood of this occurring depends on the shape of the fitness function: certain problems make it easy to find the global optimum, others may make it easier for the function to find the local optima.
This problem may be lessened by using a different fitness function, increasing the rate of mutation, or by using selection techniques that maintain a diverse population of solutions.
A common technique to maintain diversity is to use a "niche penalty": any group of individuals of sufficient similarity (niche radius) have a penalty added, which will reduce the representation of that group in the following generations, permitting other (less similar) individuals to be kept in the population.
This trick, however, may not be effective, depending on the landscape of the problem.