Duel
A duel is an arranged engagement in combat between two individuals, with matched weapons in accordance with agreed-upon rules.
Duels in this form were chiefly practiced in early modern Europe, with precedents in the medieval code of chivalry, and continued into the modern period (19th to early 20th centuries) especially among military officers.
During the 17th and 18th centuries (and earlier), duels were mostly fought with swords (the rapier, later the smallsword), but beginning in the late 18th century in England, duels were more commonly fought using pistols; fencing and pistol duels continued to co-exist throughout the 19th century.
The duel was based on a code of honour. Duels were fought not so much to kill the opponent as to gain "satisfaction", that is, to restore one's honour by demonstrating a willingness to risk one's life for it, and as such the tradition of duelling was originally reserved for the male members of nobility; however, in the modern era it extended to those of the upper classes generally. On rare occasions, duels with pistols or swords were fought between women; these were sometimes known as petticoat duels.
Duel (Morganne Matis song)
"Duel" is a song by Morganne Matis and was her first official single.
It was released in March, 2004 not long after Morganne was voted out of the French TV talent show Star Academy (France) peaking the fifth position. Duel was successful both commercially and musically peaking No.23 on French official singles charts and remaining in the top 40 for 12 weeks. It also peaked No.20 in Belgium (Wallonia) and remained in charts for 4 weeks.
It was later added to the artist's full length album Une fille de l'ere which released in 2006.
Chart performance
References
External links
Duel (1971 film)
Duel is a 1971 television (and later full-length theatrical) thriller film directed by Steven Spielberg and written by Richard Matheson, based on Matheson's short story of the same name. It stars Dennis Weaver as a terrified motorist stalked on a remote and lonely road by the mostly unseen driver of a mysterious tanker truck.
Plot
David Mann is a middle-aged salesman driving on a business trip. On a two-lane highway in the California desert, he encounters a grimy tanker truck, traveling slower than the speed limit and expelling sooty diesel exhaust. Mann overtakes, but the truck roars past him and slows down again. Mann overtakes again; the truck blasts its horn and Mann leaves it in the distance.
After arriving at a gas station Mann phones his wife, who is upset with him after an argument the previous night. The gas station attendant refills Mann's car and mentions that it needs a new radiator hose, but Mann refuses the repair.
Back on the road, the truck, which had stopped next to Mann at the gas station catches up and blocks Mann’s path each time he attempts to pass. After antagonising Mann for some time, the unseen driver waves him past indicating it is safe to overtake, but when Mann attempts to pass he almost strikes an oncoming vehicle. Realising the truck driver was trying to trick him into a fatal collision, Mann passes the truck again, using an unpaved turnout next to the highway.
RLP
RLP may refer to:
Medicine and chemistry
Computing
RL (complexity)
Randomized Logarithmic-space (RL), sometimes called RLP (Randomized Logarithmic-space Polynomial-time), is the complexity class of computational complexity theory problems solvable in logarithmic space and polynomial time with probabilistic Turing machines with one-sided error. It is named in analogy with RP, which is similar but has no logarithmic space restriction.
The probabilistic Turing machines in the definition of RL never accept incorrectly but are allowed to reject incorrectly less than 1/3 of the time; this is called one-sided error. The constant 1/3 is arbitrary; any x with 0 < x < 1 would suffice. This error can be made 2−p(x) times smaller for any polynomial p(x) without using more than polynomial time or logarithmic space by running the algorithm repeatedly.
Sometimes the name RL is reserved for the class of problems solvable by logarithmic-space probabilistic machines in unbounded time. However, this class can be shown to be equal to NL using a probabilistic counter, and so is usually referred to as NL instead; this also shows that RL is contained in NL. RL is contained in BPL, which is similar but allows two-sided error (incorrect accepts). RL contains L, the problems solvable by deterministic Turing machines in log space, since its definition is just more general.
