text:
Jude Kuring

Judith Kuring (born 23 November 1948) known Jude Kuring is an Australian actress who appeared in theatre, film and television during the late 1970s and early 80s. She remains best known for her stint as the recurring character of petty criminal Noeline Bourke in the soap opera Prisoner in 1979 until 1980.

Kuring had small roles in films including The Singer and the Dancer, Journey Among Women, Newsfront, The Journalist, ...Maybe This Time and Prisoner Queen.

Television and film
Although making her first appearance on the police drama Homicide in 1971, Kuring would not begin television acting for another four years until being cast in a minor role in the 1975 television movie They Don't Clap Losers. During the next few years, she was seen on the television series Alvin Purple as well as playing various characters on comedy shows including Wollongong the Brave.

In 1977, Kuring made her film debut in The Singer and the Dancer as Mrs Herbert, the nagging daughter of Mrs Bilson (Ruth Cracknell). Later that year, she appeared in her breakout role as Grace in the cult film Journey Among Women. She had supporting roles in Newsfront and The Journalist.

She was subsequently cast as Noeline Bourke in the soap opera Prisoner.

Noeline was largely portrayed as a lower class thief and the head of a small family of petty thieves, Bourke was introduced to the series as an inmate emerging to fight Monica Ferguson (Lesley Baker) for position of "top dog" while Bea Smith (Val Lehman) is recovering in hospital. One of the subplots during the first and second seasons of the series focused on her criminal family, and in one episode, her dimwitted brother Col is killed by police during a hostage situation. Her character was released shortly after, however she was again caught breaking into a warehouse with her daughter Leanne and returned to Wentworth where she served another brief stint.

Taking time off from the series, Kuring appeared in the 1980 film Maybe This Time for which she was nominated for Best Actress in a Supporting Role by the Australian Film Institute.

Kuring reappeared on the series, her character being reintroduced shortly after the death of her daughter Leanne, who had been killed during a protest at the prison. After being accepted into the prison's work release program, she is coerced to help one of the employees, Kay White (Sandy Gore), by using her family to steal fabric from the factory. She is set up by White however and, with the work release canceled, she is transferred to Barnhurst (another prison) for her own protection.

After guest appearing on Waterloo Station in 1983, Kuring subsequently moved away from acting.

Kuring after a long tenure away from acting, once more returned to her former career in 2013 to play a prominent role in the movie Prisoner Queen, which centred on an obsessed fan of the Prisoner television series.

In 1995, Jude featured in the pilot of an LGBTQI+ sitcom called Buck House, playing the lead role of Phyllis Buck. Originally filmed before a live studio audience at the Australian Film, Television & Radio School, Buck House underwent considerable rewrites following its initial popularity. A new 8-episode series was created for streaming on the internet in 1997. That series and the 1995 pilot starring Jude Kuring can be viewed on https://aussiegaysitcom.com

In 2013, she appeared in film The House Cleaner and in 2017 7 from Etheria.

Theatre roles
Kuring, has also worked in theatre having started her acting career in that genre in 1968, when she joined the Australian Performing Group in Melbourne in the early 1970s,performing in a number of plays, variety shows and other stage productions, written by David Williamson and Jack Hibberd. Roles include Romeo and Juliet and McBeth

in 1981, alongside Chris Westwood, Kuring formed a women's group as a subgroup of APG, they had been discussing the lack of roles for women in local theatre, rekegated to the "hooker with a heart" or mother, and began organising memberss at the Nimrod Theatre, they were given a 110.000 grant from Limited Life Project" which they utillised for play readings and a series of workshops and included a seminar on women, comedy and music.

title: Jude Kuring


text:
Organic Chemistry/Stereochemistry

Organic Chemistry table of contents > Stereochemistry

=Stereoisomerism=

Stereoisomers are compounds that have the same connectivity (constitution) and the same chemical formula, but are isomers because they differ in the spacial arrangement of the atoms attached to the stereocenters (chirality centers) throughout the molecule. All stereoisomers are unique and possess their own physical, chemical and biological properties (with the exception of meso compounds).

To illustrate the importance of stereoisomerism in organic chemistry, let's consider the well-known substance methamphetamine, which has two enantiomers: (R)-N-methyl-1-phenylpropan-2-amine and (S)-N-methyl-1-phenylpropan-2-amine. The S enantiomer, commonly called D-methamphetamine is a controlled substance in most countries worldwide. It is highly psychoactive, giving users an intense rush of euphoria when ingested. Use of D-methamphetamine often leads to severe drug dependence and even death in chronic users. By contrast, the R enantiomer of methamphetamine, commonly called L-methamphetamine is a non-psychoactive substance that is legal to possess in most jurisdictions. While not very psychoactive, L-methamphetamine is an excellent sympathomimetic vasoconstrictor and can be found in some OTC medications used to relieve nasal congestion caused by the common cold or allergic sinusitis, often under the name "levmetamfetamine".

Types of Stereoisomers
Enantiomers are chiral molecules with non-superimposable mirror images. When comparing stereoisomers, the enantiomer is always the isomer without any internal planes of symmetry and that has had each of its stereogenic centers flipped. In other words, each stereocenter has gone from an R-configuration to an S-configuration.

In this example, the two molecules are enantiomers of one another because (1) this molecule lacks any internal plane of symmetry and (2) all of its stereocenters have been flipped. The molecule on the right is (1S,3S)-3-chloro-1-ethylcyclohexane, while the molecule on the left is (1R,3R)-3-chloro-1-ethylcyclohexane.

Diastereomers are also chiral molecules, but differ from enantiomers in that they are not mirror images of each other due to some but not all of the chirality centers being flipped.

The following two molecules are diastereomers of one another because (1) they are not mirror images, and (2) only one of the stereocenters has been flipped. The molecule on the left is (1R,3S)-3-chloro-1-ethylcyclohaxane while the molecule on the right is (1S,3R)-3-chloro-1-ethylcyclohexane.

Meso compunds are achiral molecules that contain stereogenic centers. They are achiral molecules because their mirror images are superimposable onto each other as they possess an internal plane of symmetry, meaning that meso compounds are identical molecules with identical properties.

A common mistake is thinking that these two molecules are enantiomeric due to both stereogenic centers having been flipped. However, upon closer inspection these two molecules are not enantiomeric because by manipulating this molecule in space it could be superimposed on top of its mirror image due to it possessing an internal plane of symmetry.

 * Configurations
 * Enantiomers
 * Optical activity
 * R-S notational system
 * Meso compounds

 * Diastereomers

<< Alkanes and cycloalkanes | Stereochemistry | Haloalkanes >>

source: wikimedia

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

title: Organic Chemistry/Stereochemistry


text:
Electrification and controls technology

Electrification and controls technology are devices that control, service and enhance productivity of industrial handling. Controls interface with hardware such as receivers, cranes and hoists, through a network in order to ensure that equipment operates safely and effectively. Almost every business, including the food, chemical, and automobile industries, uses controls. Some examples of these gadgets are:

 * Remote controls
 * Festooning
 * Drives
 * Motors
 * Conductor bars
 * Anti-collision devices
 * Weighing devices
 * Brakes
 * Resistors
 * Cabling

Industry definitions
Conductor bar: Insulated energized rails that safely provide power, control and data to moving equipment from a fixed source, much like electric rails on a model train.

Festoon system: A cable management system of rolling trolleys that properly support power, control and data cables to moving equipment from a fixed source.

Cable reel: A cable management device designed to spool and store electrical power, control or data cable, as the equipment moves along its path of motion.

Variable-frequency drive: A type of static controller that safely drives an electric motor by varying the frequency and voltage the motor is supplied. This device minimizes the wear and tear of the mechanical system while allowing precise control and maximizing operator safety.

Radio remote control: Allows an operator to control different types of moving equipment and cranes, meanwhile, providing the operator the best vantage point to the load or operation and physical position for a safe working area.

Load brake: A device used to safely stop linear or rotating motion of equipment through the use of power or friction.

title: Electrification and controls technology


text:
Cuntz algebra

In mathematics, the Cuntz algebra $$\mathcal{O}_n $$, named after Joachim Cuntz, is the universal C*-algebra generated by $$n$$ isometries of an infinite-dimensional Hilbert space $$\mathcal{H}$$ satisfying certain relations. These algebras were introduced as the first concrete examples of a separable infinite simple C*-algebra, meaning as a Hilbert space, $$\mathcal{O}_n $$ is isometric to the sequence space
 * $$l^2(\mathbb{N})$$

and it has no nontrivial closed ideals. These algebras are fundamental to the study of simple infinite C*-algebras since any such algebra contains, for any given n, a subalgebra that has $$\mathcal{O}_n $$ as quotient.

Definitions
Let n ≥ 2 and $$\mathcal{H}$$ be a separable Hilbert space. Consider the C*-algebra $$\mathcal{A}$$ generated by a set

 * $$\{S_i\}_{i=1}^n$$

of isometries (i.e. $$S_i^*S_i = 1$$) acting on $$\mathcal{H}$$ satisfying

 * $$\sum_{i=1}^n S_i S_i^* = 1.$$

This universal C*-algebra is called the Cuntz algebra, denoted by $$\mathcal{O}_n $$.

A simple C*-algebra is said to be purely infinite if every hereditary C*-subalgebra of it is infinite. $$\mathcal{O}_n $$ is a separable, simple, purely infinite C*-algebra. Any simple infinite C*-algebra contains a subalgebra that has $$\mathcal{O}_n$$ as a quotient.

Classification
The Cuntz algebras are pairwise non-isomorphic, i.e. $$\mathcal{O}_n $$ and $$\mathcal{O}_m $$ are non-isomorphic for n ≠ m. The K0 group of $$\mathcal{O}_n$$ is $$\mathbb{Z}/(n-1)\mathbb{Z}$$, the cyclic group of order n − 1. Since K0 is a functor, $$\mathcal{O}_n $$ and $$\mathcal{O}_m $$ are non-isomorphic.

Relation between concrete C*-algebras and the universal C*-algebra
Theorem. The concrete C*-algebra $$\mathcal{A}$$ is isomorphic to the universal C*-algebra $$\mathcal{L}$$ generated by n generators s1... sn subject to relations si*si = 1 for all i and ∑ sisi* = 1.

The proof of the theorem hinges on the following fact: any C*-algebra generated by n isometries s1... sn with orthogonal ranges contains a copy of the UHF algebra $$\mathcal{F}$$ type n∞. Namely $$\mathcal{F}$$ is spanned by words of the form

 * $$s_{i_1}\cdots s_{i_k}s_{j_1}^* \cdots s_{j_k}^*, k \geq 0.$$

The *-subalgebra $$\mathcal{F}$$, being approximately finite-dimensional, has a unique C*-norm. The subalgebra $$\mathcal{F}$$ plays role of the space of Fourier coefficients for elements of the algebra. A key technical lemma, due to Cuntz, is that an element in the algebra is zero if and only if all its Fourier coefficients vanish. Using this, one can show that the quotient map from $$\mathcal{L}$$ to $$\mathcal{A}$$ is injective, which proves the theorem.

The UHF algebra $$\mathcal{F}$$ has a non-unital subalgebra $$\mathcal{F}'$$ that is canonically isomorphic to $$\mathcal{F}$$ itself: In the Mn stage of the direct system defining $$\mathcal{F}$$, consider the rank-1 projection e11, the matrix that is 1 in the upper left corner and zero elsewhere. Propagate this projection through the direct system. At the Mnk stage of the direct system, one has a rank nk − 1 projection. In the direct limit, this gives a projection P in $$\mathcal{F}$$. The corner

 * $$P \mathcal{F} P = \mathcal{F'}$$

is isomorphic to $$\mathcal{F}$$. The *-endomorphism Φ that maps $$\mathcal{F}$$ onto $$\mathcal{F}'$$ is implemented by the isometry s1, i.e. Φ(·) = s1(·)s1*. $$\;\mathcal{O}_n $$is in fact the crossed product of $$\mathcal{F}$$ with the endomorphism Φ.

Cuntz algebras to represent direct sums
The relations defining the Cuntz algebras align with the definition of the biproduct for preadditive categories. This similarity is made precise in the C*-category of unital *-endomorphisms over C*-algebras. The objects of this category are unital *-endomorphisms, and morphisms are the elements $$a\in A$$, where $$a:\rho\to\sigma$$ if $$a\rho(b)=\sigma(b)a$$ for every $$b\in A$$. A unital *-endomorphism $$\rho:A\to A$$ is the direct sum of endomorphisms $$\sigma_1, \sigma_2, ..., \sigma_n$$ if there are isometries $$\{S_k\}_{k=1}^n$$ satisfying the $$\mathcal{O}_n$$ relations and

 * $$\rho(x) = \sum_{k=1}^n S_k\sigma_k(x)S_k^*, \forall x\in A.$$

In this direct sum, the inclusion morphisms are $$S_k:\sigma_k\to \rho$$, and the projection morphisms are $$S_k^*:\rho\to\sigma_k$$.

Generalisations
Cuntz algebras have been generalised in many ways. Notable amongst which are the Cuntz–Krieger algebras, graph C*-algebras and k-graph C*-algebras.

Applied mathematics
In signal processing, a subband filter with exact reconstruction give rise to representations of a Cuntz algebra. The same filter also comes from the multiresolution analysis construction in wavelet theory.

title: Cuntz algebra


text:
Introduction to Programming/Control Structures

Up to this point, the programs that we have looked at are very simple and serial in nature. Obviously computers can do more, but how?

Say, for example, that you write a small program that calculates how many seconds are in a given year. This is clearly a pretty trivial program, but it does have one interesting wrinkle—the number of days in a year isn't a constant. So how do we write a program that uses different values depending on the year? There are many different ways that this can be accomplished, but one of the most straightforward is to have a piece of code that is only executed if some condition is true—if, say, the year in question is a leap year then set the number of days to 366 instead of 365.

The If Statement
Up to this point, everything that we've covered involved simple, linear execution of every line of code. In the seconds in a year example from above, we could have a line that declared a variable daysInYear and initialized it to 365.

int daysInYear = 365;

That is the end of what we know how to do so far.

What we need now, is some way to say that, in the event that the year is a leap year, assign the value 366 to the variable daysInYear. One way to do this is with an if statement.

In most programming languages, an if statement contains three parts. The first part is a keyword that tells the computer that it's an if statement (some languages may have an equivalent structure that uses a different key word). The second part is a boolean expression. The third part is a statement or group of statements.

The way that the computer executes an if statement is that, first it evaluates the boolean expression. If the expression evaluates to false, it skips the third part, the statement(s), completely as if they weren't even there. On the other hand, if the expression evaluates to true, then the statement(s) are executed.

In a Java/C/C++ environment, where there was a boolean variable isLeapYear, you would write code that would look something like this:

int daysInYear = 365; if (isLeapYear) {       daysInYear = 366; }

It may not be the most interesting code ever written, but it is simple, direct and produces the correct result.

Variations Of If Statements
An alternate way to set the number of days in a year might be:

int daysInYear; if (isLeapYear) {       daysInYear = 366; }   if (! isLeapYear) {       daysInYear = 365; }

This form seems kind of awkward and it requires the condition to be evaluated twice. Many programming languages allow an extension of the if statement, an else clause. It would look something like this:

int daysInYear; if (isLeapYear) {       daysInYear = 366; }   else {       daysInYear = 365; }

An if statement may be followed by exactly zero or one else statements. If the if statement evaluates as true, then its group of statements (in this case "daysInYear = 366;") are run. If the if statement evaluates as false the else clause's statements are executed (in this case "daysInYear = 365;").

Sample Problem: Checking an Error Condition
One of the more common uses for the if statement is checking error conditions.

Let us suppose that we are working on a piece of code that performs a divide in a calculator program. We have three variables dividend, divisor and quotient. We want to divide dividend by divisor putting the result into quotient, unless divisor is equal to 0 in which case we want to report an error message. Assume that there is a statement ReportErrorMessage that does exactly that and write some code that performs the divide operation.

answer

Loops
A loop is a program structure that executes the same piece of code zero or more times. A loop consists of a group of statements (called a block in many languages) to be executed and a boolean expression, called a condition. Every time the computer executes the statements in the loop (called an iteration), the condition is evaluated. The computer continues to iterate as long as the condition evaluates to true.

In some programming languages a while loop looks something like this:

int counter = 1; int sum = 0;

while (counter < 10) {   sum += counter; print sum;

counter += 1; }

This is the style of while loop used in Java, C and C++. The code of the block is delineated in this example by a matched pair of curly braces. The condition is inside the parenthesis that follows immediately after the keyword while. The sample while loop given above will execute nine times with the value of the variable counter starting at one. With each iteration through the loop, the value of counter is incremented by one. When the value of counter reaches ten, the condition will evaluate to false and the loop will not be executed. With each iteration, the program will print out the sum of the first N integers with N equal to counter.

Exercise: Fibonacci numbers
Using the above loop as a template, create a block of code that will print out the first 10 Fibonacci numbers.

answer

Pre-conditions versus post-conditions
The while loop shown above is an example of a loop structure where the condition is checked before the code is executed. This is known as a pre-condition. The block is not executed at all if the pre-condition is false when reaching the loop.

In Java, C and C++, there is a structure that is called a do-while loop that is nearly identical to a while loop, except that it uses a post-condition. Because the condition is checked at the end of the loop, post-condition loops are guaranteed to execute at least once.

int counter = 1; int sum = 0;

do {   sum += counter; print sum;

counter += 1; } while (counter < 10)

 * Next Lesson
 * Previous Lesson


text:
Veli-Pekka Lehtola

Veli-Pekka Lehtola is a North Sámi historian and academic. He is professor of Sámi culture at the Giellagas Institute of the University of Oulu, Finland. He is known for his research in Sami culture. He is also politically active, promoting a narrow definition of Sámi groups towards the Finnish government.

title: Veli-Pekka Lehtola


text:
Bargędzino railway station

Bargędzino is a non-operational PKP railway station in Bargędzino (Pomeranian Voivodeship), Poland.

title: Bargędzino railway station


text:
sit on it

Verb

 * 1)  shove it up your ass (up yours) or back off.
 * Regarding the proposal, the boss said to sit on it and I tend to agree: it is too soon to begin.
 * Regarding the proposal, the boss said to sit on it and I tend to agree: it is too soon to begin.

Translations

 * French: se le mettre bien profond, s'enfiler ça

title: sit on it


text:
Inkeri

Etymology 1
Derived from, the name of the river ; see it for more. According to folk etymology, named after, who was supposedly given the Ingrian lands as a marriage gift.

Proper noun

 * 1) Ingria

Etymology 2
, akin to 🇨🇬.

Etymology

 * Possibly named after . Alternatively, from the river (compare ). Akin to 🇨🇬.

title: Inkeri


text:
詐称

Noun

 * 1) misrepresentation, false statement regarding one's name, address, career, etc.

Verb

 * 1) misrepresent oneself

title: 詐称


text:
egosyntonic

Adjective

 * 1)  In harmony with or acceptable to the needs and goals of the ego, or consistent with one’s ideal self-image.

Translations

 * Finnish: egosyntoninen
 * German:
 * Russian:
 * Spanish: egosintónico
 * Turkish: egosintonik

title: egosyntonic


text:
User:Annanyya Kashyap/sandbox

Annanyya Kashyap is an Indian film actress who works in  Assamese film industry since 2008.

title: User:Annanyya Kashyap/sandbox


text:
Wikipedia:WikiProject Spam/Local/singapore-visa-online.com

Links

 * singapore-visa-online.com resolves to [//<IP_ADDRESS> <IP_ADDRESS>]
 * Link is not on the blacklist.
 * Link is not on the domainredlist.
 * Link is not on the Monitorlist.
 * None of the mentioned users is on the blacklist.
 * Link is not on the whitelist.
 * Link is not on the monitor list.
 * Link is not on the whitelist.
 * Link is not on the monitor list.

Selected additions

 * Displayed 21 additions out of 21 total.	 For more info see WikiProject_Spam/LinkReports/singapore-visa-online.com

Entry
Log entry for the MediaWiki:Spam-blacklist:

\bsingapore-visa-online\.com\b# ADMINNAME # see [[Wikipedia:WikiProject_Spam/Local/singapore-visa-online.com ]]

Discussion
See COIBot report for more details.

New data reported. --COIBot (talk) 06:28, 10 February 2015 (UTC)

New data reported. --COIBot (talk) 07:43, 10 February 2015 (UTC)

New data reported. --COIBot (talk) 07:53, 10 February 2015 (UTC)

New data reported. --COIBot (talk) 08:04, 10 February 2015 (UTC)

New data reported. --COIBot (talk) 09:13, 10 February 2015 (UTC)


text:
Masagana 99

Masagana 99 was an agricultural program of then Philippine President Ferdinand Marcos to increase rice production among Filipino farmers. The program was launched in 1973 at a time the country was experiencing a rice supply shortage. By promoting high yield varieties, chemical fertilizers, and herbicides, the program initially allowed the Philippines to attain self-sufficiency in 1975–1976, and export rice to its neighboring Asian countries in 1977–1978. By 1980, however, problems with the credit scheme rendered the loans accessible only to rich landowners while leaving poor farmers in debt. The program was also noted to have become a vehicle of political patronage.

By 1984, the Marcos administration shifted its focus away from Masagana 99 and towards different programs.

Etymology
"Masagana" is a Filipino term for "bountiful" while 99 refers to the number of sacks of rice targeted as the yield per hectare of land in every harvest season.

Concept development
Masagana 99 was conceived by the administration of then Philippine President Ferdinand Marcos as way to cope with a nationwide rice shortage arising from the various natural disasters and pest inverstations in 1972.

Launched on May 21, 1973, its goal was to promote Philippine rice self-sufficiency by raising the Philippines' average palay crop yield from 40 cavans (a unit of measure equivalent to 60 kilograms of rice) per hectare to 99 cavans per hectare. The program planned to achieve this by pushing farmers to use newly developed technologies including high-yielding variety (HYV) seeds, low-cost fertilizer, and herbicides.

The program included a supervised credit scheme, which was supposed to provide farmers with the funds needed to pay for the program's technology package. The Central Bank designed subsidized rediscounting facilities for public and private credit institutions throughout the country, encouraging them to give loans to farmers without collateral or other usual borrowing requirements.

Initial success
The program achieved initial success by encouraging farmers to plant new "Miracle Rice" (IR8) variety of rice which the International Rice Research Institute had been developing since 1962, during the administration of President Carlos P. Garcia.

The program was launched at the time the country was experiencing a shortage of supply on rice and was credited for the launching of the Philippine Green Revolution in 1973 which allowed the country to export rice to other Asian countries. The highlights of its short-lived success happened when the Philippines finally attained self-sufficiency in 1975–1976, and was able to export rice to its neighbors in Asia in 1977–1978. But costly subsidies and failure of many farmers-borrowers to repay the loans led to the program benefiting only 3.7% of the country's small rice farmers by 1980.

Problems with the credit scheme
Economists generally acknowledge Masagana 99 to have failed because the supervised credit scheme it offered to farmers proved unsustainable. The program is said to have catered to rich landowners and has been criticized for leaving poor farmers in debt and for having become a vehicle of political patronage. The program is also said to have benefited big agribusiness and transnational corporations to the detriment of the welfare of peasants.

Negative environmental impact
Aside from the problems of its credit scheme, however, Masagana also had a negative impact on the environment and on traditional agricultural methods. Masagana 99's package of technological interventions in the form of synthetic fertilizers, herbicides, pesticides, and other chemicals imported from other countries. This resulted in the devastation of indigenous plants and animals, and the eradication of certain pest species only led to the dominance of other pests.

The use of chemicals also depleted the groundwater and saturated rice lands with chemicals, which would eventually lead to lower rice yields. Some farmers also suffered diseases from exposure to pesticides.

Masagana 99 was responsible for convincing the majority of the Philippines' irrigated rice farmers to adopt the use of chemical fertilizers. It also led the Bureau of Plant Industry to focus on chemical fertilizers to eliminate pests such as the rice stemborer because pesticides were cheaper - abandoning a pre-existing Integrated Pest Management approach which used Trichogramma to control stemborer populations.

Discontinuation
National Scientist and former University of the Philippines President Emil Q. Javier notes that by 1980, "Masagana 99 ceased to be of consequence as only 3.7 percent of the small rice farmers were able to borrow." By 1981, the program's problems were apparent enough that Southeast Asian news outlets noted that Masagana 99 and its aquaculture equivalent, Biyayang Dagat, were lacking in funds due to low loan repayment rates. By 1984, the Marcos administration shifted its focus away from Masagana 99 and towards a new program, the Intensified Rice Production Program (IRPP), which like Masagana 99 succeeded in temporarily increasing rice production, but ultimately left its beneficiary-farmers in debt.

Aftermath
According to Carlos Dominguez III who was the agriculture secretary under the administration of President Corazon Aquino, the successor of Marcos, from 1987 to 1989, the program caused about 800 rural banks to go bankrupt, never boosted rice production sufficiently for the country to be able to export rice, and left poor farmers in debt, because the program was used as a vehicle of political patronage.

Proposed revival
President Rodrigo Duterte expressed his interest to revive the program in October 2016. The plan met opposition from MASIPAG, a group of farmers and scientists, saying that revival of the program will bring back issues such as debt, replacement of traditional varieties with newer ones, and the promotion of pesticide use which they say will harm animals, farmers and crops and insisted that only large firms benefited from the program. The Department of Agriculture notes that the old variety used in the Masagana 99 program is already phased out and the Masagana 99 can use newer varieties of rice and insists that environmentally friendly pesticides will be promoted under the potentially revived Masagana 99.

title: Masagana 99


text:
Seethalakshmi Ramaswami College

Seethalakshmi Ramaswami College (SRC) is an autonomous Arts and Science college, located in Tiruchirappalli district of Tamil Nadu, India. This women’s institution affiliated to Bharathidasan University., Tiruchirappalli was conferred the autonomy status in 1987. SRC is one among the first seven Higher Educational Institutions (HEIs) of India, to be accredited by the National Assessment and Accreditation Council (NAAC). The college, spread around a campus of 24 acres, is a part of the Padmabhushan Sri N. Ramaswami Ayyar Educational Complex.

History
In 1951, N. Ramaswami Ayyar, the founding father of SRC, started the institution. He believed in the cause of promoting women’s empowerment through education, nurturing values and discipline in the background of Indian tradition and culture. The college had its beginning with 11 students.

The institution gives access to education to first generation women learners to pursue tertiary education and research, at an affordable cost. The Community college of the institution offers special entrepreneurial courses and vocational programmes to women students belonging to the socially and economically marginalized sections of the society.

Academics
The college offers 24 UG, 17 PG, 7 M.Phil., 8 Ph.D., 1 Community College programme and 3 B.Voc. programmes and more than 100 short term certificate courses. The curriculum is designed under OBE - CBCS framework.

The college was awarded DBT Star College status, recognizing the Life Sciences departments and the DST-FIST grant was awarded to the Postgraduate Physical Sciences departments.

Research
SRC encourages its stakeholder’s participation in core, interdisciplinary, multidisciplinary and collaborative research. There are 8 research departments. The college publishes a biannual in-house journal.

Extension activities
NCC unit at SRC was established in 1957 and the NCC cadets regularly participate in the Republic Day Parade at Red Fort, New Delhi. The institution is the first women’s college in Tamil Nadu to establish a separate Air Wing unit under NCC called D2 flight. The college is a participant in Unnat Bharat Abiyan scheme, the flagship programme of Human Resource Development. The institution participates in Swachh Bharat activities and has received the Swachhatha Hi Seva and Swachh Survekhsan awards.

Notable alumnae

 * Nirmala Sitharaman - Minister of Finance and Corporate Affairs, Govt. of India.

title: Seethalakshmi Ramaswami College


text:
1966 Kansas Jayhawks football team

The 1966 Kansas Jayhawks football team represented the University of Kansas in the Big Eight Conference during the 1966 NCAA University Division football season. In their ninth and final season under head coach Jack Mitchell, the Jayhawks compiled a 2–7–1 record (0–6–1 against conference opponents), tied for last place in the Big Eight Conference, and were outscored by opponents by a combined total of 188 to 106. They played their home games at Memorial Stadium in Lawrence, Kansas.

The team's statistical leaders included Donnie Shanklin with 732 rushing yards, Halley Kampschroeder with 278 receiving yards and Bob Skahan with 299 passing yards. Jerry Barnett and Bill Wohlford were the team captains.

title: 1966 Kansas Jayhawks football team


text:
halun

Etymology
From, from.

Noun

 * 1) slave; servant

Etymology
From. Cognate with 🇨🇬.

Noun

 * 1) long rolling wave
 * 2) swell of the sea

Etymology
From, from.

Noun

 * 1) slave; servant

title: halun


text:
User:JKizzieHumanities/Donna Freitas

Donna Freitas is a scholar, writer, and author of adult and young adult fiction. One of her works of young adult fiction, The Possibility of Sainthood, is listed in Booklist's 1000 Best Young Adult Books since 2000. Many of her non-fiction works deal with spirituality, sexuality, consent and college campus culture.

Selected Works
Fiction The Possibility of Sainthood, 2008

Unplugged, 2016

Non-fiction The End of Sex: How Hookup Culture is Leaving a Generation Unhappy, Sexually Unfulfilled, and Confused About Intimacy (2013)

Sex and the Soul : Juggling Sexuality, Spirituality, Romance, and Religion on America's College Campuses (2015)

Consent on Campus: A Manifesto (2018)

Consent: A Memoir of Unwanted Attention (2019)

Adding this stub in anticipation of a WikiEdu Project starting in mid-September. Q15446318

Category:American non-fiction writer stubs

title: User:JKizzieHumanities/Donna Freitas


text:
Talk:David Zinczenko

Promotional Tone/Possible Conflict of Interest
Right now this article reads strongly like promotion. There should be more biographical info and less salesy talk ("fastest-growing magazine"/"landed the biggest get ever"/etc.). Any assertions such as those mentioned should be cited (e.g., what third-party organization says the mag is the fastest-growing?).

If you have any questions about how to make this article encyclopedic, ask or start with Wikipedia in brief.

(Note: I'm granting that the subject is notable; others may disagree.) HelpnWP (talk) 00:37, 8 May 2009 (UTC)

 * Tracking edits to Men's Health-related articles, it looks like someone with a vested interest is "maintaining" the pages. It may be time to recommend speedy deletion. HelpnWP (talk) 19:58, 8 June 2009 (UTC)
 * I agree with both of the above as well as HelpnWP's observation that the subject is notable enough to warrant an article. The possibility of a conflict of interest is troubling, though many WP articles originate with similar flaws, for example, WP:Copyright. It's our job then to clean up and police the page, which I'll do and hope others will help. In the interest of readers and WP standards, a template alluding to these concerns appears to be in order. Allreet (talk) 01:41, 27 September 2009 (UTC)

Fitness expert?
What credentials does this man have that makes him a fitness expert?Dumaka (talk) 17:55, 23 February 2010 (UTC)
 * Zincenko is a "fitness expert" because he plays the game of "Media Darling" very well. He's written books and is the editor of a widely circulated magazine with high sales numbers and healthy financials. He is a recognized authority on national broadcast television shows.  One doesn't need a degree in science, nutrition or P.E., a masters, or even a PhD, or certification by a board, to attain this level of media stardom for the recognition. Now if he was out there promoting fad diets, questionable practices or other forms of Quackery, then you would have a valid point. But no one is claiming he has puffed up his qualifications, or called to questions his methods or findings. <IP_ADDRESS> (talk) 13:12, 23 April 2010 (UTC)
 * lol I was reading some of this guy's stuff. He is not a fitness expert at all. <IP_ADDRESS> (talk) 05:05, 31 August 2010 (UTC)
 * And he blatantly ripped off Martin Berkhan!!!!! — Preceding unsigned comment added by <IP_ADDRESS> (talk) 09:54, 20 July 2016 (UTC)

Personal Life Section?
Is he single? Married? With a Life Partner? —Preceding unsigned comment added by <IP_ADDRESS> (talk) 05:42, 13 April 2011 (UTC)

No longer editor-in-chief
I added this:
 * Beginning in January 2013, he is no longer editor-in-chief at Men's Health.Men’s Health editor Zinczenko out with a link to NTY article. Can someone clean it up for me?

Thanks Kassorlae 08:50, 9 February 2013 (UTC) — Preceding unsigned comment added by Kassorlae (talk • contribs)

title: Talk:David Zinczenko


text:
Eddie Osei-Nketia

Edward Osei-Nketia (born 8 May 2001) is a New Zealand sprinter.

Osei-Nketia is the son of Gus Nketia, the former New Zealand national 100 m record holder. In 2019, after winning the Australian national title at 100 m, he confirmed his national allegiance to New Zealand. On 15 July 2022, he broke his father's the national record by running 10.08 at the 2022 World Athletics Championships in Oregon. Osei-Nketia spent his last secondary school years at Scots College in Wellington.

International representation
In June 2019, Osei-Nketia won the title of the 100 m at the Oceania Championships in Townsville.

On 28 September 2019 he came fifth in his heat of the first round of the 100m at the World Athletics Championships in Doha, Qatar with a time of 10.24s, missing out on a semi-final berth by 0.01s. Osei-Nketia won the 2019 Australian Athletics Championships 100m in 10.22 after running a personal best of 10.19 in the semi-final.

On 27 March 2021 he ran 10.12 in Brisbane, ranking him second on the New Zealand all-time list, 0.01 sec behind the National Record set by his father, Gus Nketia, in 1994, and qualifying him by ranking for the 2020 Summer Olympics, but he was not nominated.

Osei-Nketia broke his father's 100m record in finishing second in the 7th heat of the 100m 2022 World Athletics Championships in 10.08 seconds (wind -0.315m/s) on 15 July 2022.

Domestic achievements
At the New Zealand National Track and Field champs in 2019 Osei-Nketia won the senior men's 100m. He followed this in 2020 by winning both the senior 100m and 200m, a feat he repeated in 2022.

title: Eddie Osei-Nketia


text:
1800 in Siam

The year 1800 was the 19th year of the Rattanakosin Kingdom of Siam (now known as Thailand). It was the nineteenth year in the reign of King Rama I.

Incumbents

 * Monarch: Rama I
 * Front Palace: Maha Sura Singhanat
 * Rear Palace: Anurak Devesh
 * Supreme Patriarch: Ariyavangsayana (Suk)

Events

 * A fire spreads through the Chinatown neighbourhood in Bangkok.

title: 1800 in Siam


text:
Algorithms/Introduction

This book covers techniques for the design and analysis of algorithms. The algorithmic techniques covered include: divide and conquer, backtracking, dynamic programming, greedy algorithms, and hill-climbing.

Any solvable problem generally has at least one algorithm of each of the following types:

 * 1) the obvious way;
 * 2) the methodical way;
 * 3) the clever way; and
 * 4) the miraculous way.

On the first and most basic level, the "obvious" solution might try to exhaustively search for the answer. Intuitively, the obvious solution is the one that comes easily if you're familiar with a programming language and the basic problem solving techniques.

The second level is the methodical level and is the heart of this book: after understanding the material presented here you should be able to methodically turn most obvious algorithms into better performing algorithms.

The third level, the clever level, requires more understanding of the elements involved in the problem and their properties or even a reformulation of the algorithm (e.g., numerical algorithms exploit mathematical properties that are not obvious). A clever algorithm may be hard to understand by being non-obvious that it is correct, or it may be hard to understand that it actually runs faster than what it would seem to require.

The fourth and final level of an algorithmic solution is the miraculous level: this is reserved for the rare cases where a breakthrough results in a highly non-intuitive solution.

Naturally, all of these four levels are relative, and some clever algorithms are covered in this book as well, in addition to the methodical techniques. Let's begin.

Prerequisites
To understand the material presented in this book you need to know a programming language well enough to translate the pseudocode in this book into a working solution. You also need to know the basics about the following data structures: arrays, stacks, queues, linked-lists, trees, heaps (also called priority queues), disjoint sets, and graphs.

Additionally, you should know some basic algorithms like binary search, a sorting algorithm (merge sort, heap sort, insertion sort, or others), and breadth-first or depth-first search.

If you are unfamiliar with any of these prerequisites you should review the material in the Data Structures book first.

When is Efficiency Important?
Not every problem requires the most efficient solution available. For our purposes, the term efficient is concerned with the time and/or space needed to perform the task. When either time or space is abundant and cheap, it may not be worth it to pay a programmer to spend a day or so working to make a program faster.

However, here are some cases where efficiency matters:

 * When resources are limited, a change in algorithms could create great savings and allow limited machines (like cell phones, embedded systems, and sensor networks) to be stretched to the frontier of possibility.

 * When the data is large a more efficient solution can mean the difference between a task finishing in two days versus two weeks. Examples include physics, genetics, web searches, massive online stores, and network traffic analysis.

 * Real time applications: the term "real time applications" actually refers to computations that give time guarantees, versus meaning "fast." However, the quality can be increased further by choosing the appropriate algorithm.

 * Computationally expensive jobs, like fluid dynamics, partial differential equations, VLSI design, and cryptanalysis can sometimes only be considered when the solution is found efficiently enough.

 * When a subroutine is common and frequently used, time spent on a more efficient implementation can result in benefits for every application that uses the subroutine. Examples include sorting, searching, pseudorandom number generation, kernel operations (not to be confused with the operating system kernel), database queries, and graphics.

In short, it's important to save time when you do not have any time to spare.

When is efficiency unimportant? Examples of these cases include prototypes that are used only a few times, cases where the input is small, when simplicity and ease of maintenance is more important, when the area concerned is not the bottle neck, or when there's another process or area in the code that would benefit far more from efficient design and attention to the algorithm(s).

Inventing an Algorithm
Because we assume you have some knowledge of a programming language, let's start with how we translate an idea into an algorithm. Suppose you want to write a function that will take a string as input and output the string in lowercase:

// tolower -- translates all alphabetic, uppercase characters in str to lowercase function tolower(string str): string

What first comes to your mind when you think about solving this problem? Perhaps these two considerations crossed your mind: The first point is "obvious" because a character that needs to be converted might appear anywhere in the string. The second point follows from the first because, once we consider each character, we need to do something with it. There are many ways of writing the tolower function for characters:
 * 1) Every character in str needs to be looked at
 * 2) A routine for converting a single character to lower case is required

function tolower(character c): character

There are several ways to implement this function, including:

 * look c up in a table—a character indexed array of characters that holds the lowercase version of each character.

 * check if c is in the range 'A' ≤ c ≤ 'Z', and then add a numerical offset to it.

These techniques depend upon the character encoding. (As an issue of separation of concerns, perhaps the table solution is stronger because it's clearer you only need to change one part of the code.)

However such a subroutine is implemented, once we have it, the implementation of our original problem comes immediately:

// tolower -- translates all alphabetic, uppercase characters in str to lowercase function tolower(string str): string let result := "" for-each c in str: result.append(tolower(c)) repeat return result end

The loop is the result of our ability to translate "every character needs to be looked at" into our native programming language. It became obvious that the tolower subroutine call should be in the loop's body. The final step required to bring the high-level task into an implementation was deciding how to build the resulting string. Here, we chose to start with the empty string and append characters to the end of it.

Now suppose you want to write a function for comparing two strings that tests if they are equal, ignoring case:

// equal-ignore-case -- returns true if s and t are equal, ignoring case function equal-ignore-case(string s, string t): boolean

These ideas might come to mind:
 * 1) Every character in strings s and t will have to be looked at
 * 2) A single loop iterating through both might accomplish this
 * 3) But such a loop should be careful that the strings are of equal length first
 * 4) If the strings aren't the same length, then they cannot be equal because the consideration of ignoring case doesn't affect how long the string is
 * 5) A tolower subroutine for characters can be used again, and only the lowercase versions will be compared

These ideas come from familiarity both with strings and with the looping and conditional constructs in your language. The function you thought of may have looked something like this:

// equal-ignore-case -- returns true if s or t are equal, ignoring case function equal-ignore-case(string s[1..n], string t[1..m]): boolean if n != m: return false              \if they aren't the same length, they aren't equal\ fi  for i := 1 to n: if tolower(s[i]) != tolower(t[i]): return false fi  repeat return true end

Or, if you thought of the problem in terms of functional decomposition instead of iterations, you might have thought of a function more like this:

// equal-ignore-case -- returns true if s or t are equal, ignoring case function equal-ignore-case(string s, string t): boolean return tolower(s).equals(tolower(t)) end

Alternatively, you may feel neither of these solutions is efficient enough, and you would prefer an algorithm that only ever made one pass of s or t. The above two implementations each require two-passes: the first version computes the lengths and then compares each character, while the second version computes the lowercase versions of the string and then compares the results to each other. (Note that for a pair of strings, it is also possible to have the length precomputed to avoid the second pass, but that can have its own drawbacks at times.) You could imagine how similar routines can be written to test string equality that not only ignore case, but also ignore accents.

Already you might be getting the spirit of the pseudocode in this book. The pseudocode language is not meant to be a real programming language: it abstracts away details that you would have to contend with in any language. For example, the language doesn't assume generic types or dynamic versus static types: the idea is that it should be clear what is intended and it should not be too hard to convert it to your native language. (However, in doing so, you might have to make some design decisions that limit the implementation to one particular type or form of data.)

There was nothing special about the techniques we used so far to solve these simple string problems: such techniques are perhaps already in your toolbox, and you may have found better or more elegant ways of expressing the solutions in your programming language of choice. In this book, we explore general algorithmic techniques to expand your toolbox even further. Taking a naive algorithm and making it more efficient might not come so immediately, but after understanding the material in this book you should be able to methodically apply different solutions, and, most importantly, you will be able to ask yourself more questions about your programs. Asking questions can be just as important as answering questions, because asking the right question can help you reformulate the problem and think outside of the box.

Understanding an Algorithm
Computer programmers need an excellent ability to reason with multiple-layered abstractions. For example, consider the following code:

function foo(integer a): if (a / 2) * 2 == a: print "The value " a " is even." fi end

To understand this example, you need to know that integer division uses truncation and therefore when the if-condition is true then the least-significant bit in a is zero (which means that a must be even). Additionally, the code uses a string printing API and is itself the definition of a function to be used by different modules. Depending on the programming task, you may think on the layer of hardware, on down to the level of processor branch-prediction or the cache.

Often an understanding of binary is crucial, but many modern languages have abstractions far enough away "from the hardware" that these lower-levels are not necessary. Somewhere the abstraction stops: most programmers don't need to think about logic gates, nor is the physics of electronics necessary. Nevertheless, an essential part of programming is multiple-layer thinking.

But stepping away from computer programs toward algorithms requires another layer: mathematics. A program may exploit properties of binary representations. An algorithm can exploit properties of set theory or other mathematical constructs. Just as binary itself is not explicit in a program, the mathematical properties used in an algorithm are not explicit.

Typically, when an algorithm is introduced, a discussion (separate from the code) is needed to explain the mathematics used by the algorithm. For example, to really understand a greedy algorithm (such as Dijkstra's algorithm) you should understand the mathematical properties that show how the greedy strategy is valid for all cases. In a way, you can think of the mathematics as its own kind of subroutine that the algorithm invokes. But this "subroutine" is not present in the code because there's nothing to call. As you read this book try to think about mathematics as an implicit subroutine.

Overview of the Techniques
The techniques this book covers are highlighted in the following overview.

 * Divide and Conquer: Many problems, particularly when the input is given in an array, can be solved by cutting the problem into smaller pieces (divide), solving the smaller parts recursively (conquer), and then combining the solutions into a single result. Examples include the merge sort and quicksort algorithms.

 * Randomization: Increasingly, randomization techniques are important for many applications. This chapter presents some classical algorithms that make use of random numbers.

 * Backtracking: Almost any problem can be cast in some form as a backtracking algorithm. In backtracking, you consider all possible choices to solve a problem and recursively solve subproblems under the assumption that the choice is taken. The set of recursive calls generates a tree in which each set of choices in the tree is considered consecutively.  Consequently, if a solution exists, it will eventually be found.

Backtracking is generally an inefficient, brute-force technique, but there are optimizations that can be performed to reduce both the depth of the tree and the number of branches. The technique is called backtracking because after one leaf of the tree is visited, the algorithm will go back up the call stack (undoing choices that didn't lead to success), and then proceed down some other branch. To be solved with backtracking techniques, a problem needs to have some form of "self-similarity," that is, smaller instances of the problem (after a choice has been made) must resemble the original problem. Usually, problems can be generalized to become self-similar.

 * Dynamic Programming: Dynamic programming is an optimization technique for backtracking algorithms. When subproblems need to be solved repeatedly (i.e., when there are many duplicate branches in the backtracking algorithm) time can be saved by solving all of the subproblems first (bottom-up, from smallest to largest) and storing the solution to each subproblem in a table. Thus, each subproblem is only visited and solved once instead of repeatedly. The "programming" in this technique's name comes from programming in the sense of writing things down in a table; for example, television programming is making a table of what shows will be broadcast when.

 * Greedy Algorithms: A greedy algorithm can be useful when enough information is known about possible choices that "the best" choice can be determined without considering all possible choices. Typically, greedy algorithms are not challenging to write, but they are difficult to prove correct.

 * Hill Climbing: The final technique we explore is hill climbing. The basic idea is to start with a poor solution to a problem, and then repeatedly apply optimizations to that solution until it becomes optimal or meets some other requirement. An important case of hill climbing is network flow. Despite the name, network flow is useful for many problems that describe relationships, so it's not just for computer networks. Many matching problems can be solved using network flow.

Level 1 (easiest)
1. Find maximum With algorithm and several different programming languages

2. Find minimum With algorithm and several different programming languages

3. Find average  With algorithm and several different programming languages

4. Find mode  With algorithm and several different programming languages

5. Find total  With algorithm and several different programming languages

6. Counting  With algorithm and several different programming languages

7. Find mean With algorithm and several different programming languages

Level 2
1. Talking to computer Lv 1  With algorithm and several different programming languages

2. Sorting-bubble sort  With algorithm and several different programming languages

Level 3
1. Talking to computer Lv 2  With algorithm and several different programming languages

Level 4
1. Talking to computer Lv 3  With algorithm and several different programming languages

2. Find approximate maximum  With algorithm and several different programming languages

Level 5
1. Quicksort

title: Algorithms/Introduction


text:
käyrä

Etymology
From. Related to 🇨🇬 and 🇨🇬. Meaning extended from original "crooked" to first "curve" then "plot, graph".

Adjective

 * 1) crooked

Noun

 * 1) curve, contour
 * 2) plot, graph, diagram

title: käyrä


text:
Ski lodge

A ski lodge or day lodge is a building located in a ski area that provides amenities such as food, beverages, seating area, restrooms, and locker rooms for skiers and snowboarders. Larger resorts have a day lodge at each base area and also at mid-mountain, summit, or remote locations within the ski area.

Ski lodge can also refer to a resort area hotel such as Timberline Lodge in Oregon, or a ski club owned building with meeting space and overnight accommodations for members.

Notable ski lodges
Notable ski lodges include Skoki Ski Lodge in the Skoki Valley of Alberta, Canada's Banff National Park which was designated a National historic site of Canada in 1992, and the Lake Albina Ski Lodge which overlooks Lake Albina in Kosciuszko National Park in Australia.

title: Ski lodge


text:
Australian Vocational Education and Training/ICAI3101A Install and manage network administration protocols

From the official document:
 * "This unit defines the competency required to install and manage network protocols in a networking environment."

Basically, that means ... (translate above into plain english)

You can read more about this unit on the National Training Information Systems Official document for ICAI3101A.

This unit is part of the following qualifications:
 * Cert III Applications Qualification in Australia

How this unit will help you
After learning and applying the skills required by this unit you'll be able to demonstrate your skills in:

 * translate the above elements and performance criteria into plain english and summarise here...

Ideas for learning the required skills
...

Ideas for demonstrating this unit
The best way to demonstrate these skills is ...

Grading
If you are demonstrating this unit as part of a formal course, you might find that the unit is graded (meaning you can not only demonstrate your competence, but can also gain a credit or distinction). Your facilitator may already have set criteria that your college uses. If not, here are some ideas for possible credit/distinction activities that you can discuss with your facilitator:

Notes and discrepancies
nice, helped a fair bit though


text:
Barranco León

Barranco León is an archaeological site in Orce, Andalusia, Spain with an age range between 1.2 and 1.4 million of years. It is noted for having yielded evidence of hominin occupation, including the milk tooth of a boy or girl of 10 years. After the tooth had been dated, its original owner (the "child of Orce") was hailed as having left the earliest anatomical evidence for humans in Western Europe.

The site was excavated in 1995 by Josep Gibert i Clols and between 1999 and 2000 by Martínez Fernández y Toro.

Animals
Now situated in an arid area of Spain, the site was once at the edge of a lake. Among the large mammals were found Hippopotamus antiquus, Equus altidens, Felidae cf. Homotherium sp., Megaloceros sp. and Bovini gen. et indet.

Humans
Apart from the tooth, other finds from Orce have been posited as early human remains, but their status has not been confirmed.

Stone Tools
The lithic industry assemblage found at the site is from the Oldowan, and consists of more than 1000 artefacts (including waste flakes). Spiral or helical fractures, impact points, flake scars, and bone flakes were discovered on megafaunal remains and are associated with the tools.

Conservation
The Instituto Geológico y Minero de España in collaboration with the Spanish Geological Society (Sociedad Geológica de España) has drawn up a list of internationally important geosites in Spain. These geosites are known in Spain as LIGs. Barranco Leon is listed as AND331, a separate reference from the global geosite one, VP016. Barranco Leon is listed primarily for its paleontological interest with regard to vertebrates ("Yacimientos de vertebrados del Plioceno y Pleistoceno españoles"), although the stratigraphy is also of interest.

Access
The exact location of the geosite is confidential. However, tourism is encouraged at Orce. Material from Barranco Leon is on display at the local museum. Also, the Granada Geopark has promoted Orce in the context of geotourism. It is on a trekking route, the "First Settlers Great Path", which starts and finishes at Huéscar.

title: Barranco León


text:
Beth Reekles

Beth Reekles (pen name of Beth Reeks, born 7 June 1995) is a Welsh author of young adult fiction.

Biography
Beth Reekles was born on 7 June 1995 and grew up in Newport, Wales where she attended local primary school Mount Pleasant Primary and comprehensive Bassaleg School. She graduated from Exeter University with a degree in physics.

When Reekles was 15, having grown tired of stories of "vampires and werewolves", she wrote her first young adult novel, The Kissing Booth, publishing it chapter by chapter on Wattpad, a story sharing site. The novel was immensely popular, winning the Wattpad 2011 prize for Most Popular Teen Fiction, and when she was 17, she was offered a three-book contract by Penguin Random House. The Kissing Booth was published by Penguin Random House in 2012, followed by Rolling Dice and Out of Tune. A year later, she was named by Time magazine as one of "The 16 Most Influential Teens of 2013". She was named in The Times as one of the "Top 25 under 20 The new icons of a generation" in 2014.

The Kissing Booth was adapted for film, also titled The Kissing Booth, which premiered on Netflix in 2018. A sequel The Kissing Booth 2: Going the Distance was published in 2020 and a film adaptation, The Kissing Booth 2, premiered on Netflix the same year. A third film The Kissing Booth 3: One Last Time accompanied by a book was released on 11 August 2021. Reekles's first adult novel, Love, Locked Down, was published by Sphere Books in February 2022. Beth's novel Faking It was published on 2 February 2023.

Major works

 * The Kissing Booth (2012)
 * Rolling Dice (2013)
 * Out of Tune (2014)
 * The Kissing Booth 2: Going the Distance (2020)
 * The Kissing Booth 3: One Last Time (2021)
 * Love, Locked Down (2022)
 * Seven Days of You (2022)

title: Beth Reekles


text:
Gombe Bulls

Gombe Bulls is a Nigerian professional basketball team located in Gombe State. The team competes in the Nigerian Premier League.

History
The team participated in the 2017 FIBA Africa Clubs Champions Cup, which was the first time the team played in the top continental league in Africa. The Bulls finished 11th with a 2–5 record.

In 2018, Gombe won their first ever Nigerian Premier League title after defeating the Kwara Falcons in the final.

Honours
Nigerian Premier League
 * Champions (1): 2018
 * Runners-up (1): 2017

In African competitions
FIBA Africa Clubs Champions Cup (1 appearance)
 * 2017 – Preliminary Round

Notable players

 * John Idu
 * Abdulwahad Yakubu

title: Gombe Bulls


text:
Dabheog

Saint Dabheog is the patron saint and a founder of a monastery on an island in Lough Derg, a lake in County Donegal, Ireland, near the town of Pettigo and shouldering the border of counties Donegal and Fermanagh. His feast day is 16 December.

Biography
Little is known about his biography but local records mention his existence as an abbot of Lough Derg in the 5th century. Healy states that Dabheog was born in Wales. He was the son of King Breca (or Brychan), the great father of a host of Welsh saints.

Dabheog is considered to be a disciple of Saint Patrick who became responsible for caring for the site known as St. Patrick's Purgatory, which was on one of the islands in the lake known as Lough Derg. He took charge of the church and hermitage in Tirhugh.

There is a firmly established tradition regarding St. Dabheog, who presided over, and possibly established, the monastery on the site during the lifetime of Patrick. His name has been associated from early centuries with several places in the area: St. Dabheoc's Chair on the south bank of Lough Derg, the townland of Seedavoc (St. Dabheoc's Seat), and a mountain in that townland, Seavadog Mountain. One of the islands in Lough Derg was also named after him: St. Dabheoc's Island, which may have been Saints Island.

Many of the modern Catholic pilgrimage rituals at Lough Derg are focused on devotion to St. Dabheog: including the short hike to a pre-Christian Bronze Age burial site (known as Dabheog's Chair or Seat) on a hill overlooking Lough Derg, and the meditation upon one of the beehive cells on Station Island which is dedicated to the saint.

One of the boats which transports pilgrims to Station Island is named after Dabheog, as well as the valley overlooking Lough Erne. The Clan McGrath, who were the Coarbs (hereditary overseers) of Lough Derg from the 13th-17th century, consider Dabheog as their patron saint. Dabheog is also known by the following aliases: Dabeoc, Davog, Davoc, Daboc, Beoc, Mobeoc, Mobheog, Daveoc, Daveog. This variation is due to the lack of standardization in the Irish language and the ambiguity of the saint's historical origins.

The plant name Daboecia has been given to St. Dabheog's heath.

title: Dabheog


text:
Efrain Morales

Efraín Andrés Morales Badillo (born March 4, 2004) is a professional footballer who plays as a defender for Atlanta United. Born in the United States, he is a youth international for Bolivia.

Career
Born in Decatur, Georgia, Morales joined in the youth academy of Major League Soccer club Atlanta United in 2016. Morales began at the under-12 level but quickly progressed to the under-17 side. After impressing coaches in the youth setup, Morales signed a professional homegrown player contract with Atlanta United on August 13, 2020, which will come into effect on January 1, 2021.

On August 15, 2020, Morales made his professional debut for Atlanta United 2, Atlanta United's reserve team in the USL Championship, against Charleston Battery. He came on as a 22nd-minute substitute for Patrick Nielsen and scored his first professional goal in the 51st minute. Despite the goal, Atlanta United 2 lost 3–2.

Morales signed a contract extension with Atlanta United on November 29, 2023.

Personal life
Born in the United States, Morales is the son of a Bolivian father and a Puerto Rican mother.

title: Efrain Morales


text:
User:HydrantDrone/sandbox

Three And A Half Minutes (band) or 3½ Minutes were a 4 piece indie band from Bishop's Stortford, Essex.

The line-up comprised of Matthew Carey (Lead Vocal, Guitar) Laurence Carey (Bass, Vocals) Stephen Barber (Guitar) Alex Boucher (Drums). Matthew, Laurence and Stephen attended Bishop's Stortford College and formed the band in the late 80's. Alex joined the band in 1991 and shortly after, the band recorded a new demo tape called Sensible Hair. The band started to get attention from local press and they would regularly play at The Square, Harlow, supporting popular bands of the time, such as Mega City Four, Love's Young Nightmare and Scorpio Rising.

With band manager Mac Mcdonald, they recorded another demo, entitled "Cute" at Von Studio's in London. That summer, they supported The Pogues at a concert in Harlow Town Park. With more gigs in London and a growing queue of record companies lining up to sign the band, they parted ways with Mac and signed to an indie label created by 3 record company execs: Mike Smith of EMI, Andy Saunders and Ben Wardle from EastWest. The band released their first EP " Peep" on Scared Hitless Records in 1992, garnering positive reviews and Single of the Week in NME. Tours and support slots followed with Sultans of Ping FC, Kingmaker, Ned's Atomic Dustbin and a support slot opening for Suede, Mega City Four and Blur at the Town & Country Club in Kentish Town.

Off the back of a headline gig at the Camden Falcon, they were spotted by Laura Ziffren of Hollywood Records and were subsequently signed to the label. Their 2nd EP Bled Me Dry was released in 1993 on CD and 12" vinyl, showing a more mature sound but with the thrashy, punky sound they were known for. Bled Me Dry was also featured on the soundtrack to comedy movie, Son In-Law. After a recording session with Hugh Jones at Rockfield Studios, it became clear that musical tastes were changing and with new manager Tim Smith they parted ways with Hollywood Records.

Shortly after, Alex left the band to join Travis Cut and they changed their name to Poloroid. When the camera brand objected, the name was changed to In Aura and they signed to EMI Records. The sound was more sonic and electronic compared to 3 1/2 Minutes guitar led songs. After an album and tour, they disbanded.

title: User:HydrantDrone/sandbox


text:
Novoye Karakyure

Novoye Karakyure (Новое Каракюре; ЦIийи Къара Куьре) is a rural locality (a selo) in Dokuzparinsky District, Republic of Dagestan, Russia. The population was 850 as of 2010. There are 21 streets.

Geography
Novoye Karakyure is located 4 km northeast of Usukhchay (the district's administrative centre) by road. Stary Gaptsakh and Usukhchay are the nearest rural localities.

Nationalities
Lezgins live there.

title: Novoye Karakyure


text:
Rotem Gafinovitz

Rotem Gafinovitz (רותם גפינוביץ'; born 9 June 1992) is an Israeli road cyclist, who rides for Hess Cycling Team. She participated at the 2012 UCI Road World Championships. Through May 2024, she had won six UCI races in her career, and had won the Israeli national time trial championships in road cycling four times. Gafinovitz will represent Israel at the 2024 Summer Olympics in Paris in cycling in the Women's individual road race at Pont d'Iéna on August 4, 2024.

Early and personal life
Gafinovitz was born in Modi'in-Maccabim-Re'ut, Israel. She 1.63 meters (5 ft 4 in) tall, and weighs 52 kilograms (115 lb).

Cycling career
Gafinovitz rides for Hess Cycling Team.

2015–23
Gafinovitz won the gold medal in the Israeli National Road Race Championships in 2015, and won the Israeli National Time Trial Championships in 2018, 2019, 2021, and 2023.

In September 2016, Gafinovitz was announced as part of the squad for 2017.

Gafinovitz won the Tour of Arava in 2019. That year she was also sixth in the GC Gracia–Orlová. At the 2019 European Games in Minsk, Belarus, she came in 9th in the Women's road time trial, and at the 2022 European Road Championships in Munich, Germany, she came in 18th in the Women's time trial.

Gafinovitz was 2nd in the Regiónom Nitrianskeho Kraja in Slovakia in 2023. She was 3rd in the GP of the Mayor of the city Žiar nad Hronom in Slovakia in 2023.

2024–present
Through May 2024, Gafinovitz had won six UCI races in her career.

2024 Summer Olympics
Gafinovitz will represent Israel at the 2024 Summer Olympics in Paris in cycling in the Women's individual road race at Pont d'Iéna on August 4, 2024. She said: "The Olympic Games have been my dream since I was 17, and this ticket to it is the proof for me that even if it takes time, one has to go on and not give up. This is true in sports, and it is doubly true in the current struggle for the return of the abducted in Gaza."

Major results
Source:

Road

 * 2010
 * National Junior Road Championships
 * 2nd Road race
 * 2nd Time trial

 * 2011
 * 3rd Time trial, National Road Championships

 * 2012
 * National Road Championships
 * 2nd Road race
 * 2nd Time trial

 * 2013
 * National Road Championships
 * 2nd Road race
 * 2nd Time trial

 * 2015
 * National Road Championships
 * 1st MaillotIsrael.PNG Road race
 * 2nd Time trial

 * 2016
 * 2nd Road race, National Road Championships

 * 2017
 * 2nd Time trial, National Road Championships

 * 2018
 * National Road Championships
 * 1st MaillotIsrael.PNG Time trial
 * 2nd Road race

 * 2019
 * National Road Championships
 * 1st MaillotIsrael.PNG Time trial
 * 2nd Road race
 * 1st Tour of Arava
 * 6th Overall Gracia–Orlová
 * 9th Time trial, European Games

 * 2021
 * National Road Championships
 * 1st MaillotIsrael.PNG Time trial
 * 2nd Road race

 * 2022
 * National Road Championships
 * 2nd Time trial
 * 3rd Road race

Mountain biking

 * 2014
 * 2nd Cross-country, National Mountain Bike Championships
 * 2nd Salamina Mountain bike
 * 3rd Ma'alot Mountain bike
 * 3rd Malmédy Mountain bike

 * 2015
 * National Mountain Bike Championships
 * 1st MaillotIsrael.PNG Cross-country
 * 3rd Marathon
 * 1st Ein HaShofet Mountain bike
 * 1st Mishmar Ha'Emeq Mountain bike
 * 1st Kiryat-Ata Mountain bike
 * 2nd Mishmar Ha'Emeq Mountain bike
 * 2nd Haifa Mountain bike (a)
 * 3rd Haifa Mountain bike (b)

title: Rotem Gafinovitz


text:
GENtle/Options

Global program options can be altered via Tools/Options.

Enzyme settings
Here the gloal enzyme options can be selected. These can be overridden for an individual sequence in the sequence editor, where there is a tab identical to this one.

title: GENtle/Options


text:
School talk:Computer science

Everything was archived over http://en.wikiversity.org/wiki/School_talk:Computer_Science/Archive_1 !

Let's DO Something
It appears a lot of this material hasn't been updated or really touched for quite a while (2009 it seems the discussion ended), so I'm going to start developing the school into something accessible to the general public rather than the cryptic mess it is right now, while adding to advanced resources. My goal is to make the school a continuous resource for every level. Your help is appreciated. joshua.thomas.bird 07:58, 10 August 2011 (UTC)

 * If past history is any indication, I'd say work on one lesson/topic/session at a time. If you want to develop a course or a learning path, go ahead, but flesh each section out and then continue on. We literally have thousands of stub learning resources that were part of someone's "grand plan" to rule the machines, but never quite got off the drawing board. Having said that, of course, go forth and BE BOLD and build your learning resources. I'll do my best to assist. Historybuff 08:17, 5 December 2011 (UTC)

 * I am just starting with Computer Science, however I have started refurbishing the Introductory Courses. We should organize soon. Fabianhjr 19:27, 18 December 2011 (UTC)

Although I have not seen anybody updating this material in a while, I have been building up some courses and agree this landing page could lend itself a bit more to readability. Is anybody still editing this that would want to working on building a more unified department page? Azotochtli (talk) 21:22, 29 July 2012 (UTC)

strategy wikimedia - Proposal:Sugar-in-VirtualBox as a browser plugin
Please see Proposal:Sugar-in-VirtualBox as a browser plugin, Erkan Yilmaz uses the Chat (try) 18:47, 21 March 2010 (UTC)

Department and Fields Organization
I propose we copycat the Wikipedia template on Computer Science. Fabianhjr 21:20, 18 December 2011 (UTC)
 * Done! See it here Fabianhjr 23:35, 19 December 2011 (UTC)

Layout
Hello! Seems like nobody has been here in a while, so I took the liberty of organizing the layout of the page (without modifying the content). Please feel free to revert or change whatever you want. I think there should be an effort to reduce the amount of information on the front page, or at least condense it into a unified form (learning paths/courses? departments/special departments/possible departments?). Azotochtli (talk) 14:13, 1 August 2012 (UTC)

Tasks Page
Hello. I made a main list of help needed on a help page. Please feel free to add on to or delete this content as needed. Azotochtli (talk) 14:29, 7 August 2012 (UTC)

Response to quality review
I think that there should be an effort to respond to the quality review this department received. School:Computer_Science/quality. Anybody who wants to help should try to fix the points addressed (considering we got a 0%). Azotochtli (talk) 13:52, 10 August 2012 (UTC)

Unofficial Degree
I added a page for receiving an unofficial degree. This is a list of core classes in CS (see talk on that page for more information). I think those courses should be the main focus of editing and contribution. -- Azotochtli (talk) 18:10, 11 August 2012 (UTC)

 * I appreciate the sentiment behind including a list of courses that would be common to a CS degree, but I'm having a hard time with the description of "required" in a completely elective environment such as Wikiversity. I would like to see "required" changed to "recommended".  I'd also prefer to see these courses described as "core courses" rather than as an unofficial degree.  The quality of the content so far isn't quite to the point where I would want someone to think they've earned equivalency if this is all they've mastered. -- Dave Braunschweig (talk) 03:38, 11 December 2012 (UTC)

 * I totally agree. Good choice. Azotochtli (discuss • contribs) 17:25, 24 February 2013 (UTC)

related business topics
Perhaps this school could have lessons, departments and/or resources that would help learners to understand the business aspects of computer science, whether it is related to finding a job, being a consultant, starting a tech start-up and/or so on and so forth. Michael Ten (talk) 20:56, 26 December 2012 (UTC)

 * That sounds like a great contribution. So far I mainly have organized the sections of courses in the course listing page. I would start by making a new section there and putting some courses under that - if the courses don't exist you can make a redlink and have someone else build them or begin building them yourself. If you have an idea on how to change the organization other than through the course listing page please feel free to be bold and do what you think would work well. Azotochtli (discuss • contribs) 17:28, 24 February 2013 (UTC)

"Entrances" and "Buildings"
Although I think the contributor had the right sentiment, I find the digital "buildings" and "entrances" to be confusing and clutter the department which has little enough content to begin with. (If you don't know what I am talking about, look on the navigation bar on the upper right on the department page). I think we should remove them. Anybody else feel this way? Azotochtli (discuss • contribs) 17:32, 24 February 2013 (UTC)

 * ✅ -- Dave Braunschweig (discuss • contribs) 01:41, 27 July 2013 (UTC)

Unification with Computer_science_program
There is another computer science department thing over here Computer_science_program. Someone should work to unify these. So much of the computer science content is scattered across wikiversity. They should all be sewn together and redundant pages removed. Azotochtli (discuss • contribs) 17:49, 24 February 2013 (UTC)

Planet Earth Citizens, 4schools - IT E-Learning Environment
Two notes, gentlemen, if I may. For Earth-wide best content, pedagogy-wise, support-wise, and content-wise, see edx.org [|edx.org] (by Earth-wide best CS university MIT), Schools & Partners 'MITx', Subjects 'Computer Science' (CS), Prerequisites: none, pair of courses 6.00.1x (Introduction to Computer Science and Programming Using Python) - intro to CS, 6.00.2x (Introduction to Computational Thinking and Data Science) - intro to data science. They run three times a year. Each takes abt 7 weeks. And 6.00.1x overlaps 6.00.2x (five-day overlap). The next 6.00.1x starts end January, then mid July, then mid September. Most of the content are videos. edx would be grateful for subtitles if you produce and provide them. And they would incorporate them. Each contains abt 7 Problem Sets, students get the scaffolding they will need, and their answers are automatically graded by software graders in a second or two.

And my second note. People cannot get very far in CS without English.

(I am a Czech, a CS master degree student. I've done the two courses. At MIT the two are that university's single course for their freshmen [students of the first bachelor year]. I recommend to find a fellow student or a few and socialize on FaceBook, without compromising academic honesty [without cheating], because those are difficultcourses [one does not expect otherwise from globally leading university] and one needs encouragement in order to not drop out. Students do not need to pay, payment is only for the certificate, which is additional form of encouragement.)

--Szozdakosvi (discuss • contribs) 15:24, 1 December 2018 (UTC)

Begginer learning way Of CS
How can learn CS to rudimentary level to pro ahead level how? <IP_ADDRESS> (discuss) 04:39, 22 February 2024 (UTC)

Defunct learning resource links
Newcomer here, I'm just going to point out some broken links in the page.

 * Online Courses at MIT, complete with etextbooks It returns a Page not Found error.
 * Complete and On-line Creative Commons course in Computer Science For me, the webpage just loads endlessly.
 * The Structure and Interpretation of Computer Programs (SICP) Another Page not Found error.
 * Software Engineering for Software as a Service (no longer available) If this is known to not work, why is still in the front page?
 * Natural Language Processing Another Page not Found error.

Should these be deleted or replaced with archived links of the intended content? VividlyDull (discuss • contribs) 17:58, 23 March 2024 (UTC)

title: School talk:Computer science


text:
Moskovsky, Altai Krai

Moskovsky (Московский) is a rural locality (a settlement) in Volchno-Burlinsky Selsoviet, Krutikhinsky District, Altai Krai, Russia. The population was 37 as of 2013. There are 3 streets.

Geography
Moskovsky is located 44 km west of Krutikha (the district's administrative centre) by road. Volchno-Burlinskoye and Romanovo are the nearest rural localities.

title: Moskovsky, Altai Krai


text:
User:Jamesbooker

Hi!

My name is James Booker (hence the username, eh?). I live in a town called Heanor in the county of Derbyshire, England. Derbyshire is one of many counties in the mid-regions of England known as the Midlands.

History
I joined Wikibooks on the 1st September 2004, and Wikipedia a few weeks before that. I instantly fell in love with the Wikipedia ethic, but found that anything I could contribute to the Wikipedia seemed to already have been done, and so I started looking at the sister projects, where I discovered Wikibooks and the Wikiversity! Since then I only really use Wikipedia as content-reference for Wikibooks.

Interests
My interests are computer programming in PHP, C++, Delphi and a multitude of other languages. I enjoy playing my PS2 and GameCube (I'm an obsessive of the Final Fantasy series, and intend on setting up the complete guidebook here to the entire series) and spending as much time as possible with my fiancé, Rebecca.

My aims in being here are to help expand the Wikibooks project to the point that complete authoratitive texts can be enjoyed by students from all over the world.

My Bookshelf
Wikibooks/Schools I either read or contribute to.

 * Programming:PHP
 * School_of_Music
 * Musictionary

title: User:Jamesbooker


text:
Wikipedia:Sockpuppet investigations/Qpv3nomqp/Archive

07 February 2015

 * Suspected sockpuppets

 * User compare report Auto-generated every hour.
 * Editor interaction utility

Both promoting hip hop artist Holy Ghost Ridaz and both have the same style of gibberish username. No diffs available for Qpv3nomqp since the page he created was speedied, but here's the talk page Qph3llsqpv3nom made:. Blackguard 08:28, 7 February 2015 (UTC)

Comments by other users

Clerk, CheckUser, and/or patrolling admin comments

 * I've blocked both accounts as promotional and that fact that they are likely socks. Mike V • Talk 00:47, 8 February 2015 (UTC)


text:
Modern Physics/Introduction to Special Relativity

At first glance, special relativity seems weird. A number of rules which we use to understand the world no longer apply. These rules include the rule that velocities can be added to each other, the rule that time and space are different things, the rule that matter and energy are separate, the rules for momentum. Because we can no longer rely on our normal intuition to figure things out, things can seem bizarre and confusing.

Fortunately, the apparent oddness of special relativity does not arise from deep complexity. Underneath the surface, there are some very beautiful simple symmetries and rules, and these symmetries and rules allow us to relate special relativity with the physics with which we are familiar, with only a few minor amendments.

Nevertheless, some of the ideas of special relativity seem so contrary to the way that we naively expect that the universe ought to behave and to our everyday experience that a perfectly natural reaction is that special relativity could be not possibly be correct.

However, numerous experiments have demonstrated that it's not special relativity that is incorrect, but rather our low speed intuition about how things should work. After all, we don't normally deal with things moving at close to the speed of light, and there is no particular reason to believe that our low speed thinking applies at high speed. And experiments clearly indicate that they don't. Furthermore, it turns out that many ordinary phenomena really are the result of relativity. Magnetism, for example, is a purely relativistic phenomenon that we see daily but which can't be properly explained without relativity.

But coming to this realization was difficult for physicists. One way of intuiting special relativity is take the journey that physicists did. We shall start with the ordinary everyday universe of classical Newtonian physics, which we studied in the previous two books, and then gradually travel out to the places which are odd. We are helped in this journey by the fact that the road has already been travelled by generations of physicists who gradually came to the realization that the world was stranger than they had imagined.

Therefore, the approach we shall take is to first go down a short historical survey which illustrates why special relativity is necessary. We shall then talk about the great conceptual breakthrough that Albert Einstein made, and then from the simple axioms that he figured out we shall see the subtle consequences that follow. We shall see too how straightforward special relativity really is, how simple at its heart.


text:
Hernando Iriberri

Hernando Delfin Carmelo Arreza Iriberri (born April 22, 1960) is a retired Filipino soldier, and was Chief of Staff of the Armed Forces of the Philippines from July 2015 to April 2016. He had previously been the 56th Commanding General of the Philippine Army since February 7, 2014.

Biography
Iriberri was commissioned in the AFP Regular Force in March 1983 after his graduation from the Philippine Military Academy. Aside from mainly serving as an infantryman, he was also involved in other fields of the Army such as intelligence, public relations and staff functions. Iriberri was involved in international peace support operations.

He had served as spokesman of the Department of National Defense in 2011 during the term of National Defense Secretary Voltaire Gazmin as Commanding General, and Senior Military Assistant at the same department before becoming Commander of the Army's 503rd Brigade in Abra and later Chief of the 7th Infantry Division.

Philippine Army
Iriberri, who was a Major General at that time, was named Commanding General of the Philippine Army, replacing Lt. Gen. Noel A. Coballes on February 7, 2014 when the latter had reached the mandatory retirement age of 56. Iriberri was promoted to the rank of Lieutenant General on March 31, 2014.

Chief of Staff
On July 10, 2015, Iriberri was appointed as the 46th Chief of Staff of the Armed Forces of the Philippines at a ceremony in Camp Aguinaldo in Quezon City.

Iriberri's retirement officially took effect on April 22, 2016.

Awards

 * Philippines Presidential Unit Citation.png Philippine Republic Presidential Unit Citation
 * PHI Legion of Honor 2003 Officer BAR.svg Philippine Legion of Honor -Officer
 * Anti-dissidence Campaign Medal.png Anti-Dissidence Campaign Medal
 * Luzon Anti-dissidence Campaign Medal.png Luzon Anti Dissidence Campaign Medal
 * PHL Gold Cross.png Gold Cross (Philippines)
 * Parangal sa Kapanalig ng Sandatahang Lakas ng Pilipinas.jpg Parangal sa Kapanalig ng Sandatahang Lakas ng Pilipinas
 * United Nations Service Medal Korea ribbon.svg United Nations Service Medal
 * PHL Military Civic Action Medal.gif Military Civic Action Medal
 * PHL Military Commendation.gif Military Commendation Medal
 * PHL Military Merit Medal.gif Military Merit Medal (Philippines)
 * Mindanao Anti-dissidence Campaign Medal.png Mindanao Anti-dissidence Campaign Medal
 * Disaster Relief and Rehabilitation Operations Ribbon.gif Disaster Relief and Rehabilitation Operations Ribbon
 * Combat Commander's (Kagitingan) Badge.png Combat Commander's Badge (Philippines)
 * PHL Distinguished Service Star BAR.svg Distinguished Service Star
 * PHL Outstanding Achievement Medal.PNG Outstanding Achievement Medal
 * PHL Silver Wing Medal ribbon bar.png Silver Wing Medal
 * PHL Bronze Cross.gif Bronze Cross Medals
 * PHL Gawad Sa Kaunlaran.gif Gawad sa Kaunlaran
 * Darjah Panglima Gagah Angkatan Tentera.png Malaysian Armed Forces Order of Valor, First Commander
 * Scout Ranger Qualification Badge.jpg Scout Ranger Badge
 * Combat Commander's (Kagitingan) Badge.png Combat Commander's Badge (Philippines)

title: Hernando Iriberri


text:
User:JakeNelson~enwikibooks

I live in Bloomington, Minnesota, near the Mall of America. I am a computer science/economics student, and have worked in television production. I have also worked in proofreading, and expect to be applying that a fair bit.

title: User:JakeNelson~enwikibooks


text:
French/Lessons/Weather

The preposition means at or in:

The contraction is used in place of à le (singular):

Likewise, the contraction is used in place of à les (plural).

Mireille:

Monique:

 * Monique could also use the question form instead of the intonation given above:
 * Est-ce qu'il va pleuvoir aujourd'hui ? (Pronounced eh-skeel)
 * or
 * Va-t-il pleuvoir aujourd'hui ?

Mireille:

Monique:

Marcelle:

Similar to English, pleuvoir is an : it has only a third-person singular conjugation:
 * il pleut (present)
 * il va pleuvoir or il pleuvra (future)
 * il pleuvrait (conditional).

In order to say that one did not do something, the construction must be used. The is placed before the verb, while the  is placed after.

Formation and rules
Simple negation is done by wrapping around the verb:

In a past tense, surrounds the auxiliary verb, not the participle:

When an infinitive and conjugated verb are together, usually surrounds the conjugated verb:

can also precede the infinitive for a different meaning:

precedes any pronoun relating to the verb it affects:

In spoken French, the can be omitted, leaving simply  after the verb in context:

Negation of indefinite articles
The indefinite articles un, une, and des change to de (or d’) when negating a sentence.

Note that means both the weather and the time.

The verb is translated to to go. It is irregularly conjugated (it does not count as a regular verb).

Usage
There is no present progressive tense in French, so aller in the present indicative is used to express both I go and I am going:

Aller must be used with a place and cannot stand alone.

In addition to meaning at or in, the preposition means to when used with :

An infinitive preceded by is used to say that something is going to happen in the near future:

Recall that the negative goes around the conjugated verb.

In place of a preposition and place, the pronoun, meaning there, can be used; y comes before the verb:

Remember that aller must be used with a place (there or a name) when indicating that you are going somewhere, even if a place wouldn't normally be given in English.

The negative form of aller with the y pronoun has both the verb and pronoun enclosed between ne and pas:

title: French/Lessons/Weather


text:
Wikipedia:Articles for deletion/Clint Eastwood in the 1970s

The result was Delete. There is clear consensus here that the page shouldn't exist. There is a reasonable argument, not refuted, that some of the material may need to be merged. There is the obvious fact that all the material cannot be merged. Therefore, consider this a "delete", but with a delay involved so that any necessary merging can be done beforehand. Once this has been handled to everyone's satisfaction, tag the page for speedy deletion, and link this discussion. As an aside, while it is true that AfD is not the best place to request a merger, a merger is a reasonable outcome at AfD, and the entirely of this page is obviously not viable for a merger. !voting to keep for procedural reasons isn't really a !vote to keep. Linking a bunch of tangentially related guidelines is not helpful. Vanamonde (Talk) 14:56, 1 October 2019 (UTC)

Clint Eastwood in the 1970s

 * – ( View AfD View log  Stats )

Redundant and non-encyclopedic. No other major actor (e.g., see Al Pacino and Dustin Hoffman has multiple pages covering each film in depth. In any case, everything in the film summary below is covered in the film article itself. — btphelps (talk to me) (what I've done) 05:08, 23 September 2019 (UTC)
 * Note: This discussion has been included in the list of Actors and filmmakers-related deletion discussions. — btphelps (talk to me) (what I've done) 05:08, 23 September 2019 (UTC)

 * Speedy Keep It's this discussion that is redundant and non-encyclopedic.  Clint Eastwood is obviously a huge topic but we don't need six more pages to discuss how best to organise it.  See WP:ATD; WP:BEFORE; WP:LIGHTBULB; WP:NOTPAPER; WP:PRESERVE; &c. Andrew D. (talk) 16:05, 23 September 2019 (UTC)
 * Delete per nom. Excessive details running riot. This is more appropriate for a book than a Wikipedia article. This nomination should have been bundled. This consists of information about the films he acted in or directed. Any useful, unduplicated material can go in the individual film articles. Clarityfiend (talk) 19:34, 23 September 2019 (UTC)
 * Delete This level of detail works with a book, not an encyclopedia article.John Pack Lambert (talk) 22:20, 27 September 2019 (UTC)
 * Delete/Merge Absurd level of detail. The main Clint Eastwood is quite comprehensive already and this is not an appropriate use of splitting and summary style. Just direct readers to the single book this is wholly sourced to, don't turn this into an entire book by itself copying every fact in that one. Reywas92Talk 00:58, 1 October 2019 (UTC)
 * Speedy keep per Andrew Davidson. This is an editorial problem snd should never have been brought to AFD. These articles should have been tagged for merger, and then discussed at Talk:Clint Eastwood in order to go about that business in the propper manner. Obviously, there should not be this many pages about Clint Eastwood, but there's a lot of material here that could be of some value, either in the film articles or weeded down to a few additions to improve the central article. I strongly urge an admin to close this discussion and direct the nominator to tag the articles for merger and begin a merger conversation with editors interested in tackling what would be a fairly large collaborative project. There are too many editoriall decisions to be made here to be simply solved by an AFD.4meter4 (talk) 04:40, 1 October 2019 (UTC)


text:
aulate

Etymology
From and.

Adjective

 * 1)  Having an aulos (annular wall) between one's axial and periaxial regions.

title: aulate


text:
Sérgio Vieira (politician)

Sérgio Vieira (4 May 1941 – 16 December 2021) was a Mozambican politician and poet. He was Director of the Department of Education and Culture for Frelimo, Governor of the Banco de Moçambique (Bank of Mozambique) and Minister of Security and of Agriculture.

Life and work
Vieira was born in Tete, Mozambique, on 4 May 1941. He was the great-grandson of pt:Julião José da Silva Vieira, a Portuguese soldier and colonial administrator, and maternal cousin to Orlando da Costa, a Portuguese writer.

At a young age, he became a political activist, and graduated in political science. During university studies, he was part of the youth opposition movement Empire Students' House. During exile in Dar-es-Salam, he headed the FRELIMO Culture and Education Department. After the independence of his country, he held the position of Governor of the Banco de Moçambique and Minister of Internal Administration.

He died on 16 December 2021, at the age of 80.

Literature
His literary works are in Portuguese. He collaborated with some newspapers and magazines such as Jornal de Angola (Angola Newspaper) and is also included in many anthologies of poetry. His main model is Marcelino dos Santos.

title: Sérgio Vieira (politician)


text:
Wikipedia:Articles for deletion/Captain's Pick in Australian Politics

The result was   delete. Missvain (talk) 05:35, 17 February 2015 (UTC)

Captain's Pick in Australian Politics

 * – ( View AfD View log  Stats )

This is a bit of a mess of an article for what's essentially a catchphrase. I'm not convinced it's unsalvageable, but it shouldn't be on Wikipedia in its current form and at its current title. The Drover's Wife (talk) 09:22, 10 February 2015 (UTC)
 * delete it's been used maybe 5 times in australian politics and only once by Julia Gillard. The Australian national university even acknowledge it's originally a sporting term, mean basically the leader can choose unilaterally. and that is no different to using it in a political context. LibStar (talk) 12:13, 10 February 2015 (UTC)
 * Note: This debate has been included in the list of Australia-related deletion discussions. • Gene93k (talk) 18:58, 11 February 2015 (UTC)
 * Note: This debate has been included in the list of Language-related deletion discussions. • Gene93k (talk) 18:59, 11 February 2015 (UTC)
 * Note: This debate has been included in the list of Politics-related deletion discussions. • Gene93k (talk) 18:59, 11 February 2015 (UTC)

 * delete This is just wp:recentism. — Preceding unsigned comment added by Hollth (talk • contribs) 03:08, 12 February 2015 (UTC)
 * Delete. A term that has only really been widely used for a week (and is a dictionary definition at that) does not need an article. -- Chuq (talk) 08:40, 13 February 2015 (UTC)
 * Delete, per User:LibStar. There is no special context to this phrase in politics, and it seems pretty obviously to be a way to list out Tony Abbott gaffes.  As we don't have server room for a complete list of those, and if we removed it this becomes a dicdef, I don't see any value in keeping this article.  Lankiveil (speak to me) 07:09, 14 February 2015 (UTC).
 * Delete, I don't think the term passes WP:GNG. It has been mentioned in the media, but I haven't seen "'Significant coverage' [that] addresses the topic directly and in detail". I do however think that some of the article could be salvaged and merged into Tony Abbott's article, as it has been a personal controversy for him. ColonialGrid (talk) 07:23, 14 February 2015 (UTC)