the-french-artist/wikipedia_20220301.simple_sentence_embeddings huggingface dataset:
Valley Parade 
 Valley Parade, also known by its sponsored name of the Coral Windows Stadium is a football stadium in Bradford in England.
Levi Lincoln Sr. 
 He was a Minuteman at the beginning of the American Revolutionary War, a state legislator in Massachusetts, Governor of Massachusetts, Lieutenant Governor of Massachusetts, a U.S. Representative, Attorney General for President Thomas Jefferson and Acting Secretary of State.
James R. Schlesinger 
 James Rodney Schlesinger (February 15, 1929 - March 27, 2014) was United States Secretary of Defense from 1973 to 1975 under presidents Richard Nixon and Gerald Ford.
Simultaneous multithreading 
 Simultaneous multithreading, acronym SMT, is a technique for improving the overall efficiency of superscalar CPUs with Hardware multithreading.
Simultaneous multithreading 
 SMT permits multiple independent threads of execution to better utilize the resources provided by modern computer architectures.
Simultaneous multithreading 
 Multithreading is similar in concept to multitasking but is implemented at the thread level of execution in modern superscalar processors.
Simultaneous multithreading 
 In processor design, there are two ways to increase on-chip parallelism with less resource requirements:
Simultaneous multithreading 
 Superscalar technique: which tries to increase Instruction level parallelism (ILP) by executing multiple instructions at the same time (termed: simultaneously); by "simultaneously" dispatching instructions (termed: instruction dispatching) to multiple redundant execution units built inside the processor.
Simultaneous multithreading 
 Chip-level multithreading (CMT) technique: using Thread level parallelism (TLP) in order to executes instructions from multiple threads within one processor chip at the same time.
Simultaneous multithreading 
 Interleaved multithreading (IMT) : Interleaved issue of multiple instructions from different threads, also referred to as Temporal multithreading.
Simultaneous multithreading 
 It can be further divided into fine-grain multithreading or coarse-grain multithreading depending on the frequency of interleaved issues.
Simultaneous multithreading 
 Fine-grain multithreading issues instructions for different threads after every cycle, while coarse-grain multithreading only switches to issue  instructions from another thread when the current executing thread causes some long latency events (like page fault etc.).
Simultaneous multithreading 
 For processors with one pipeline per core, interleaved multithreading is the only possible way, because it can only issue up to one instruction per cycle.
Simultaneous multithreading 
 Chip-level multiprocessing (CMP or Multi-core processor): integrates two or more superscalar processors into one chip, each executes threads independently.
Simultaneous multithreading 
 The key factor to distinguish them is to look at how many instructions the processor can issue in one cycle and how many threads from which the instructions come.
Simultaneous multithreading 
 The Intel Pentium 4 was the first modern desktop processor to implement simultaneous multithreading, starting from the 3.06GHz model released in 2002, and since introduced into a number of their processors.
Simultaneous multithreading 
 Intel calls the functionality Hyper-Threading Technology (HTT), and provides a basic two-thread SMT engine.
Simultaneous multithreading 
 Intel claims up to a 30% speed improvement compared against an otherwise identical, non-SMT Pentium 4.
Simultaneous multithreading 
 The IBM POWER5, announced in May 2004, comes as either a dual core DCM, or quad-core or 8-core MCM, with each core including a two-thread SMT engine.
Simultaneous multithreading 
 IBM's implementation is more sophisticated than the previous ones, because it can assign a different priority to the various threads, is more fine-grained, and the SMT engine can be turned on and off dynamically, to better execute those workloads where an SMT processor would not increase performance.
Simultaneous multithreading 
 The Intel Atom, released in 2008, is the first Intel product to feature SMT (marketed as Hyper-threading) without supporting instruction reordering, speculative execution, or register renaming.
Simultaneous multithreading 
 LE Shar and ES Davidson, "A Multiminiprocessor System Implemented through Pipelining", Computer Feb 1974
Simultaneous multithreading 
 D.M. Tullsen, S.J. Eggers, and H.M. Levy, "Simultaneous Multithreading: Maximizing On-Chip Parallelism," In 22nd Annual International Symposium on Computer Architecture, June, 1995
Simultaneous multithreading 
 D.M. Tullsen, S.J. Eggers, J.S. Emer, H.M. Levy, J.L. Lo, and R.L. Stamm, "Exploiting Choice: Instruction Fetch and Issue on an Implementable Simultaneous Multithreading Processor," In 23rd Annual International Symposium on Computer Architecture, May, 1996
Out-of-order execution 
 In computer engineering, out-of-order execution, OoOE, is a technique used in most high-performance microprocessors to make use of cycles that would otherwise be wasted by a certain type of costly delay.
Out-of-order execution 
 The key concept of OoO processing is to allow the processor to avoid a class of delays (termed: "stalls ") that occur when the data needed to perform an operation are unavailable.
Out-of-order execution 
 OoO processors fill these "slots" in time with other instructions that are ready, then re-order the results at the end to make it appear that the instructions were processed as normal.
Out-of-order execution 
 The way the instructions are ordered in the original computer code is known as program order, in the processor they are handled in data order (the order in which the data, operands, become available in the processor's registers).
Out-of-order execution 
 Fairly complex circuitry is needed to convert from one ordering to the other and maintain a logical ordering of the output; the processor itself appears to be running the instructions in random order.
Out-of-order execution 
 The benefit of OoO processing grows as the instruction pipeline expands and the speed difference between main memory (or cache memory) and the processor increases.
Out-of-order execution 
 On modern machines, the processor runs many times faster than the memory, so during the time an in-order processor spends waiting for data to arrive, it could have processed a large number of instructions.
Out-of-order execution 
 If input operands are available (in registers for instance), the instruction is dispatched to the appropriate functional unit.
Out-of-order execution 
 If one or more operands is unavailable during the current clock cycle (generally because they are being fetched from memory), however, the processor stalls until they are available.
Out-of-order execution 
 Instruction dispatch to an instruction queue (also called instruction buffer or reservation stations).
Out-of-order execution 
 Only after all older instructions have their results written back to the register file, then this result is written back to the register.
Out-of-order execution 
 In the examples outlined above, the OoO processor avoids the stall that occurs in step (2) of the in-order processor when the instruction is not completely ready to be processed due to missing data.
Out-of-order execution 
 "Implementation of precise interrupts in pipelined processors", a paper by Smith and Pleszkun (1985).
Speculative execution 
 In computer science, speculative execution is the execution of code, before being sure if the result will be needed.
Speculative execution 
 The technique is used in most high-performance microprocessors to execute a complete instructions or parts of instructions before being sure whether this execution is required
Branch prediction 
 In computer architecture, a branch predictor is the part of a processor that determines whether a conditional branch (jump) in the instruction flow of a program is likely to be taken or not.
Branch prediction 
 Branch predictors are important in today's modern, superscalar processors for achieving high performance.
Branch prediction 
 They allow processors to fetch and execute instructions without waiting for a branch to be resolved.
Branch prediction 
 Almost all pipelined processors do branch prediction of some form, because they must guess the address of the next instruction to fetch before the current instruction has been executed.
Branch prediction 
 Many earlier microprogrammed CPUs did not do branch prediction because there was little or no performance requirements; for this reason there is no need for altering the flow of the instruction stream.
Branch prediction 
 Multiple-Block Ahead Branch Predictors" – demonstrates prediction accuracy is not impaired by indexing with previous branch address.
Branch prediction 
 Design Tradeoffs for the Alpha EV8 Conditional Branch Predictor" – describes the Alpha EV8 branch predictor.
Branch prediction 
 This paper does an excellent job discussing how they arrived at their design from various hardware constraints and simulation studies.
Branch prediction 
 Reconsidering Complex Branch Predictors" – describes the EV6 and K8 branch predictors, and pipelining considerations.
Aka 
 or aka ("also known as"), used to describe author pseudonyms, aliases, nicknames, stage names, working names, legalized names, pen names, maiden names, etc.
Key exchange 
 Key exchange is any method in cryptography by which cryptographic keys are exchanged between users, allowing use of a cryptographic system.
Key exchange 
 If two parties wish to exchange encrypted messages, each needs to know how to decrypt received messages and to encrypt sent messages.
Key exchange 
 If an asymmetric key cipher with the public/private key property, both will need the other's public key.
Key exchange 
 The key exchange problem is how to exchange whatever keys or other information needed so, in such a way, that no one else can obtain a copy.
Key exchange 
 With the arrival of (public key / private key) cipher algorithms, the encrypting key (aka, the public key) could be made public, since (at least for "high quality" ciphers) no one without the decrypting key (aka, the private key) could decrypt the message.
Key exchange 
 In principle, then, the only remaining problem was to be sure that a public key actually belonged to its claimed owner, this is not a problem easy to solve; specially when the two users involved have never met and know nothing about each other.
Key exchange 
 In 1976, Whitfield Diffie and Martin Hellman published a cryptographic protocol, (Diffie-Hellman key exchange), which allows users to establish secure channels in order to exchange keys, even if an attacker is monitoring that communication channel.
Key exchange 
 However, Diffie-Hellman key exchange did not address the "identity authentication" problem of being sure of the actual identity of the person or an entity.
Key exchange 
 In their most usual implementation, each user applies to a "certificate authority" for a digital certificate which serves for other users as a correct (termed: non-tamperable) authentication of identity.
Key exchange 
 Each user is responsible for verifying any certificate from another user before using that certificate to communicate with the user who claims to be associated with the particular public key in a certificate, (see digital signatures).
Key exchange 
 In particular, it has not yet been solved for the modern situation of two previously unknown users attempting to communicate electronically, as, for instance, in electronic commerce.
Secure channel 
 In cryptography, a secure channel is a way of transferring data that is very difficult (called resistant) to overhear or copy (called interception) and understand (called decrypt) or change (called tampering).
Secure channel 
 A confidential channel is a way of transferring data that is resistant to interception, but may not be resistant to tampering and may not be resistant to impersonation by someone else (called spoofing).
Secure channel 
 An authenticatable channel is a way of transferring data that is resistant to spoofing but may not be resistant to interception or tampering.
Terminology 
 Terminology studies the "labelling or designating of concepts" in one or more subject fields or areas of human activity.
Terminology 
 Terminology studies among other things how such terms of art come to be and their interrelationships within a culture.
La Bastidonne 
 It is found in the region Provence-Alpes-Côte d'Azur in the Vaucluse department in the south of France.
Flag of Oman 
 The national flag of Oman () has three stripes (white, green and red) with a red bar on the left that contains the national emblem of Oman.
Flag of Oman 
 The white stands for peace and prosperity, the green for fertility and the Green Mountains, and the red for battles against foreign invaders.
Flag of Oman 
 The red is also the colour of the former flag of the nation when it was known simply as the Sultanate of Muscat and Oman.
Flag of Oman 
 Bands of green and white were added to the fly, and the national emblem, the badge of the Albusaidi Dynasty, was placed in the canton.
Flag of Oman 
 White has been associated historically with the Imam, the religious leader of Oman and at times the political rival to the ruling Sultan.
Flag of Oman 
 Green is traditionally associated with the Jebel al Akhdar, or "Green Mountains," which lie toward the north of the country.
Coat of arms of Oman 
 The National Emblem of Oman () consists of a khanjar dagger in a sheath that is superimposed upon two crossed swords.
Coat of arms of Oman 
 It is found on numerous flags as well as the currency of Oman and on the planes of the Omani Air Force, among other locations.
Grambois 
 It is found in the region Provence-Alpes-Côte d'Azur in the Vaucluse department in the south of France.
Malemort-du-Comtat 
 The name Malemort means "bad death" and was probably used after the destruction of the village by the Franks.
Malemort-du-Comtat 
 When wine making started again in medieval times, the Archbishop of Carpentras gave his monks a vineyard in Malemort du Comtat in 882.
Mérindol 
 Protected by the Luberon, a mountain range, the town is sheltered from the mistral, a cold dry wind that blows from the north.
Mérindol 
 In the late Middle Ages, Louis II of Provence sold the land to the lords of Abacus-Cental and Rocca Sparviera.
Mérindol 
 They were part of a group, known as the Vaudois or Waldensians, who had separated from the Catholic Church in 1170.
Mérindol 
 In 1530, a Dominican priest, Jean de Roma, began a campaign against the Vaudois because he said they were heretics.
Mérindol 
 In 1540, de Roma arrested a flour miller from Mérindol, took his mill, and then burned the man at the stake.
Mérindol 
 On November 18 1540, 19 more people were sentenced to death by burning at the stake, and the town was ordered to be completely destroyed.
Mérindol 
 On April 18 1545, the village was completely burned and about 12 of the Vaudois still living there were killed.
Mérindol 
 Over one week there were attacks on 11 other small villages, and it is thought that about 3000 people were killed.
Mérindol 
 In 1977, members of Vaudois organizations in Germany, France and Italy built a path in memory of the people who had been killed for their religious beliefs.
Voice over Internet Protocol 
 Voice over Internet protocol (or VoIP) is a term used for a number of protocols that are used to carry voice data over packet switched networks.
Voice over Internet Protocol 
 Carrying voice data needs a service guarantees (mostly in the form of "throughput", and "response time").
Voice over Internet Protocol 
 Most telephony network provide the possibility to operate a phone, even when the power is lost in the area.
Voice over Internet Protocol 
 The encoding schemes used for voice calls are not good choices for fax or other uses of the telephony network.
Voice over Internet Protocol 
 SIP :- SIP, or also known as session initiation protocol, has become the standard for multimedia sessions on the internet.
Voice over Internet Protocol 
 The Engineering Task Force thinks of this protocol as the standard for audio, video and even instant messaging solutions.
Voice over Internet Protocol 
 This task force is simply a large, international community, composed of anyone involved in the networking evolution online.
Voice over Internet Protocol 
 Depending on the type of data your business is wishing to transmit, your SIP deployment will need to be designed specifically for this.
Voice over Internet Protocol 
 With that being said, VoIP and IM communications will need to work around these aspects, and be designed for one total approach.
Voice over Internet Protocol 
 H.323 :- This protocol has become the international standard for all communication over packet-switched networks.
Voice over Internet Protocol 
 H.323 is considered an umbrella that includes all types of standards, which is what the internet is based on.
Voice over Internet Protocol 
 H.323 focuses on voice, video, and data communications, designed specifically to operate over IP networks.
Voice over Internet Protocol 
 At this point, this protocol has become the world market leader for voice and voice communications over IP networks.
Voice over Internet Protocol 
 H.323 was developed by the international telecommunications union, which is the organization responsible for building the public telephone network.
Vaucluse 
 The Vaucluse () is a department in the southeast of France in the Provence-Alpes-Côte d'Azur region.
Vaucluse 
 The name Vaucluse comes from the Latin Vallis Clausa ("closed valley") as the valley here ends in a cliff from which rises a spring.
Vaucluse 
 Vaucluse was not one of the 83 French departments made during the French revolution, on 4 March 1790.
Vaucluse 
 It was created on 12 August 1793 with  four districts: Apt, Orange, Ouvèze (Carpentras), Vaucluse (Avignon); its capital was Avignon.
Vaucluse 
 In 1800, with the creation of the arrondissements in France, the districts were changed into arrondissements: Avignon, Apt, Carpentras and Orange.
Vaucluse 
 After the Battle of Waterloo (18 June 1815), the department was occupied by the Austrian army from June 1815 to November 1818.
Vaucluse 
 On 10 September 1926, the arrondissement of Orange was eliminated and the subprefecture of Apt was moved to Cavaillon but went back to Apt in 1933.
Vaucluse 
 The department has an exclave to the north, the canton of Valréas, surrounded completely by Drôme department.
Vaucluse 
 The are several chains of mountains in the Vaucluse department, mainly in the eastern half; from northeast to southeast, they are:
Vaucluse 
 Dentelles de Montmirail, a small chain of small mountains; the highest point is Crête de Saint-Amand,  high.
Vaucluse 
 It stands alone to the north of the Luberon range, separated by the Vaucluse Mountains, and just to the eastern base of the Dentelles de Montmirail.
Vaucluse 
 It is to the south and the west of the Mont Ventoux and has the Rhône river to the west, the Durance river to the south and the Vaucluse Mountains to the east.
Vaucluse 
 The climate in Avignon, at an altitude of , is of the subtype Csa (Mediterranean climate) in the Köppen climate classification.
Vaucluse 
 The following is a list of the 17 cantons of the Vaucluse department (with their INSEE codes), following the French canton reorganisation which came into effect in March 2015:
Vaucluse 
 The most important produces in the department are fruits (melons, cherries, strawberrys, apples, grapes and others) and vegetables (tomatoes).
Diffie-Hellman key exchange 
 The Diffie-Hellman key exchange (sometimes called an Exponential key exchange) is a protocol used to secretly share information with keys.
Diffie-Hellman key exchange 
 In 1976, Whitfield Diffie and Martin Hellman invented a way for people to encrypt data and send it over an open channel.
Diffie-Hellman key exchange 
 Diffie and Hellman wanted to make Transport Layer Security (TLS), a secure way of computers communicating, more safe to perform.
Diffie-Hellman key exchange 
 For example, while you can use a password to keep a file safe, if you need to tell the password to somebody there is a risk of the password being seen by third parties.
Diffie-Hellman key exchange 
 Diffie-Hellman key agreement itself is an anonymous (non-authenticated) key-agreement protocol: people involved in the trade do not need to prove who they are, but both people need to use their secret keys to fully decrypt the data.
Diffie-Hellman key exchange 
 Alice and Bob both start at the same number (10) and both do half of a sum, which means they both get the same result without seeing what the other person added (15 and 30).
Diffie-Hellman key exchange 
 This is useful in cryptography because Alice and Bob do not share their private numbers, which means a third party cannot spy on the result (55) unless they can find both private numbers; even if a third party knows Alice sent 10 + 15 = 25, they don't know the result is 55 unless they also know Bob sent 30.
Diffie-Hellman key exchange 
 Since only Alice and Bob know their private numbers, this is a good way of sending secure information if the numbers are very big and the calculations are difficult.
Diffie-Hellman key exchange 
 Since computers can use very complicated math to encrypt things, this stops people from trying a brute force attack to guess the numbers until it works.
Diffie-Hellman key exchange 
 One example of how big calculations are made this way is the original version of Diffie-Hellman, which used both multiplicative group of integers modulo n and primitive root modulo n.
Diffie-Hellman key exchange 
 Alice and Bob do not need to prove who they are to swap their information, which means there is a risk that Charlie can look at the information while it is being swapped, and can even pretend to be Alice or Bob to try and figure out their keys.
Diffie-Hellman key exchange 
 One way this is avoided is to use authentication, where people perform extra steps to prove who they are.
Diffie-Hellman key exchange 
 New Directions in Cryptography W. Diffie and M. E. Hellman, IEEE Transactions on Information Theory, vol.
Diffie-Hellman key exchange 
 Singh, Simon (1999) The Code Book: the evolution of secrecy from Mary Queen of Scots to quantum cryptography New York: Doubleday
Diffie-Hellman key exchange 
 An Overview of Public Key Cryptography  Martin E. Hellman, IEEE Communications Magazine, May 2002, pp:42-49. (
Diffie-Hellman key exchange 
 Leading cryptography scholar Martin Hellman discusses the circumstances and fundamental insights of his invention of public key cryptography with collaborators Whitfield Diffie and Ralph Merkle at Stanford University in the mid-1970s.
Diffie-Hellman key exchange 
 Summary of ANSI X9.42: Agreement of Symmetric Keys Using Discrete Logarithm Cryptography (64K PDF file) (Description of ANSI 9 Standards )
British royal family 
 The British royal family is the group of close relatives (family) of the monarch, currently Elizabeth II, of the United Kingdom.
British royal family 
 https://www.ancestry.com/family-tree/person/tree/155209306/person/302050214240/story For HRH Blake Royall Shaner
MQV 
 MQV (Menezes-Qu-Vanstone) is an authenticated protocol for key agreement based on the Diffie-Hellman scheme.
MQV 
 Laurie Law, Alfred Menezes, Minghua Qu, Jerry Solinas, Scott A. Vanstone, An Efficient Protocol for Authenticated Key Agreement.
MQV 
 Peter J. Leadbitter, Nigel P. Smart: Analysis of the Insecurity of ECMQV with Partially Known Nonces.
MQV 
 A. Menezes, M. Qu, and S. Vanstone, Some new key agreement protocols providing implicit authentication, Preproceedings of Workshops on Selected Areas in Cryptography (1995).
Cher (department) 
 The department is one of the 83 French departments made during the French revolution, on 4 March 1790.
Cher (department) 
 The new department had seven districts: Aubigny, Sancerre, Sancoins, Saint-Amand, Châteaumeillant, Bourges and Vierzon.
Cher (department) 
 In 1800, with the creation of the arrondissements in France, the seven districts were changed into three arrondissements: Bourges, Saint-Amand-Mont-Rond and Sancerre.