text:
Introduction to Programming/About Programming

Introduction to computer programming language

What is a program?

 * Reading assignment: learn about the binary system

A computer is a tool for solving problems with data.

A program is a sequence of instructions that tell a computer how to do a task. When a computer follows the instructions in a program, we say that it executes that program. You can think of a program like a recipe that tells you how to make a peanut butter sandwich. In this model, you are the computer, making a sandwich is the task, and the recipe is the program that tells you how to execute the task.

 * Activity: Come up with a sequence of instructions to tell someone how to make a peanut butter sandwich. Don't leave any steps out, or put them in the wrong order.

Was that easy? Did you remember all the steps? Maybe you forgot to tell me to use a knife to spread the peanut butter. Now I've got peanut butter all over my hands! Of course, you say, a person wouldn't be that dumb. But a computer is that dumb. A computer will only do what you tell it to do. This might make programming frustrating at first, but it's relieving in a way: if you do everything right, you know exactly what the computer is going to do, because you told it.

Of course, computers don't understand recipes written on paper. Computers are machines, and at the most basic level, they are a collection of switches—where 1 represents "on" and 0 represents "off". Everything that a computer does is implemented in this most basic of all numbering systems—binary. If you really wanted to tell a computer what to do directly, you'd have to talk to it in binary, giving it coded sequences of 1s and 0s that tell it which instructions to execute. However, this is nearly impossible. In practice, we use a programming language.

with algorithm and flowchart for solving problem:

What is a programming language?
A programming language is, as the name would suggest, a language developed to express programs. All computers have a native programming language that they understand, commonly referred to as machine code. However, machine code is a difficult language for us to follow: amongst a number of difficulties, it is typically expressed in the binary number system, and it is unique to a particular computer architecture (thus two different computers could potentially use two different versions of machine code). Other programming languages, such as Assembly, BASIC, Java and C++ exist to provide a better interface between us, as the programmers, and the computer, by allowing programs to be expressed in a language that is easier for us to understand and potentially common to a number of computer architectures, but which can still be translated into machine code. In order for this to happen, a computer must either compile or interpret programs written in one of these languages before they can be executed.

Compilation vs Interpretation
A compiled program has to be modified into machine code before it is used. The binary is then permanently stored. As an analogy, think of a novel that was written in one language and then translated into another. For example, the Harry Potter novels were written in British English, and were then subsequently translated into 67 other languages, including Hindi, Latvian, and Latin. In much the same way, a computer program can be compiled (or "translated") into machine code, and it may potentially be compiled into different architectures (or "dialects") of machine code to suit different computers. Each translation will be a unique version of the program, in the same way that each translated book is a unique version of the original novel. To take the analogy further, if I was fortunate enough to have written the first Harry Potter novel, it may be the case that I wouldn't understand the language into which it is translated. Thus I could be given the Latvian version of the novel, and I could reasonably surmise that it tells the same story as the British English one, but I would be unable to read it. In the same sense, the version of my program that has been compiled into machine code might be impossible for me to read: it is said to be "machine-readable", in that the computer can understand it, but it is far from easily readable for humans.

An interpreted program is stored in a human-readable form. When the program is executed, an interpreter modifies the human-readable content as it is run. This is analogous to the role that a human interpreter performs. For example, rather than translating the British English version of Harry Potter into Latvian and then providing the Latvian version to someone who understands the language, (as per compilation), we could hire a translator who knows both British English and Latvian. The translator may choose to read each line from the British English novel, translate each line (one at a time) into Latvian, and, as each line is translated, relate it to the listener. The computer interpreter performs the same function: it reads an instruction in one programming language, translates it into machine code, and then executes the machine code version. Once that instruction is out of the way, it moves along to the next, performing exactly the same task, in much the same way that the interpreter of the Harry Potter novel would move on to the next line once the first has been related. Unlike compiled programs, at no point is a complete, discrete, machine code version of the program produced: at any point in time only a small number of instructions exist as machine code versions, and these will be removed from the computer's memory when they are no longer required.

There are advantages for both types of software development. As a generalization, compiled programs are faster to run but slower to develop. Compiled programs often run faster because the computer only needs to execute the previously translated instructions. In interpreted languages, every time the program is run the computer also needs to translate each of the instructions. This translation causes a delay, slowing the execution of the program. On the other hand, interpreted languages are often written in a smaller time frame, because the languages are simpler and the whole program does not need to be compiled each time a new feature is bug tested.

Features of both approaches are discussed in more detail later.

Levels of programming language
Programming languages are described in levels. Low-level programming is close to machine code, high-level programming is closer to natural languages. At the most basic level (or "lowest level") is assembly language. This language is just a direct translation of the binary instructions the computer executes—each assembly language instruction directly relates to one in machine code. Thus just as every kind of processor architecture has its own machine code, each processor architecture also has its own assembly language.

Here's how to add two numbers in MIPS assembly:

LUI R1, #1 LUI R2, #2 DADD R3, R1, R2

This just did the calculation 1 + 2 = 3. Very roughly, the first two lines load the numbers "1" and "2" into the computer's memory, and the third instruction tells the computer to add the values together and store the result.

As you can see from the example, assembly language is quite dissimilar to natural languages. Higher level languages both get closer to natural languages and provide more efficient methods of expressing the instructions—thus to implement a given feature for a program in assembly language almost always requires more code than implementing the same feature in a higher level language such as C or C++. Assembly language gives the programmer the ultimate in flexibility and performance, at the expense of complexity and development time.

 * Reading Assignment: Assembly language (Wikipedia article)

High-level languages look more like natural language with mathematical operations thrown in. These languages require more translation before the computer will understand them, but they are much easier to write. Here's what the same program might look like in a high-level language:

x = 1 + 2;

The variation between different programming languages can be quite extensive. Traditionally, the first program a programmer writes in a new language is Hello World—a simple program that outputs the phrase "Hello world!" (or a variation thereof) to the user. As will be clear from the following examples, even this seemingly simple task can be expressed in many different ways depending on which language is being used. For example:

In C:

int main { printf("Hello World!\n"); return 0; }
 * 1) include

In BASIC:

10 PRINT "Hello world!" 20 END

In Java:

public class HelloWorld {  public static void main(string[] args) {    System.out.println("Hello world!"); } }

In Pascal:

program HelloWorld; begin writeln('Hello World'); end.

In Perl:

print "Hello World!\n";
 * 1) !/usr/bin/perl

In Python: Of these examples, C is considered to be the "lowest level" language, which is to say that it is the closest to machine code. The others are considered to be higher level languages, and thus are (generally) closer to natural languages. Some of the complexity you can see, especially with Java, derives from the way the programs are structured: Java is an object-oriented language, while Pascal, to pick but one, is a procedural language. However, this is something that we will need to address later.

 * Reading Assignments
 * High-level programming languages (Wikipedia article)
 * Optional: The Hello World Collection (Offsite collection of "Hello, World!" programs)

 * Activity
 * Discuss why you think that there are so many different programming languages; why do you believe that a programmer would choose one over the other? It may be worth comparing this question to why there are so many different natural languages, and ask why someone who is multi-lingual might choose to use one natural language over another.

Translation schemes
Depending on the language used, and the particular implementation of the language used, the process to translate high-level language statements to actions may involve compilation and interpretation. Compilation is handled by a special program called a "compiler". Interpretation is a process in which language statements are realized into actions, and is conducted either by the CPU or by a special program called an "interpreter" or Virtual Machine.

Translating source code to machine code instructions is a process that is generally restricted to the compiled scheme and interpreted scheme. A common misunderstanding is that these schemes are properties of the language itself. Technically speaking, they are properties of the implementation of the language. Thus different implementations of the one language may produce compiled or interpreted code.

To further complicate matters, perfect classification of different schemes is difficult. To illustrate this, we will discuss the following examples below:
 * An implementation using multiple schemes
 * Multiple implementations using multiple schemes
 * An implementation changing their scheme
 * An implementation using a mixed scheme

 * Compiled Scheme. A program's source code is compiled to machine code/binary/executable. This executable is then interpreted by the CPU (in practice, most compilers do not compile directly to machine code, many compile to C then to assembly before recompiling to machine code, this process is usually done transparently). Example: GCC (C, C++), MSVC (C/C++), ghc (Haskell), fpc (Pascal), gpc (Pascal), V8 (JavaScript), Visual Basic 6 Native Code (BASIC)

 * Interpreted Scheme. A program's source code is interpreted line-by-line by a program called Interpreter, when there is a control structure . In practice, this scheme is very rarely used, because the interpreter had to reinterpret the source code every time the line is executed again and because it isn't very hard to cleanly move to any one of the mixed schemes. Example: PHP 3 and before (PHP), SpiderMonkey (JavaScript)

 * Mixed Scheme. This is a group of schemes that involves a compilation to an intermediate form but it is never compiled to machine code. Note that some languages implementation in this scheme (e.g. Sun Java) might selectively compile parts of its code to machine code (Just-In-Time compilation) for optimization purpose
 * Virtual Machine Scheme. A program's source code is compiled to a platform-independent byte-code file, which resembles machine code but cannot be run directly by the CPU. Instead, a special program called Virtual Machine would interpret the byte-code. Example: javac and JVM (Sun Java), CPython (Python), PHP 4 and above (PHP), Visual Basic 6 P-code (BASIC), various .NET languages (C#, VB.NET).
 * Abstract Syntax Tree Scheme. A program's source code is compiled to an in-memory object equivalent of the source code. Thus, the source code is only read once and the program is run from this tree. Example: perl (Perl), pugs (Perl)

Also note that all languages are theoretically able to be implemented in every scheme. However, each language fits a certain scheme better than other schemes.

Some shortsighted programmers consider interpreted languages to be inferior because they are slower compared with compiled languages. In fact, because of their dynamic nature, interpreted languages can be substantially more flexible, easier to learn, and faster to develop—sometimes you can have your program weeks sooner for the small price of being a fraction of a second slower; especially when you are using the fast computers of the modern age. In some limited cases, an interpreted language's core functions might be so highly optimized to the extent that an average quality program in compiled language could be slower than one written in interpreted language. In other cases (like applications using a database, or network access) a majority of your application's time is spent waiting to access data or the network, and using a "faster" compiled language will not make much difference. In fact, the general rule is: don't choose a language because it's faster. Otherwise, you'd be better off using assembly language directly. Choose a language you're comfortable with, one that looks "sexy" to you. It will be your friend during your whole programming work so choose well. Try several languages out before making a definitive choice.

It would be nice to have one language to "rule them all"—but we don't. The fact is, many different languages exist for different purposes. There are a few languages that fulfill a wide variety of programming needs, but to encompass all of them, it would have to be such a huge undertaking and become cumbersome and segmented as programmers begin customizing the language to their needs. Truth be told, many languages have become customized thus and released as independent packages, simplified for a smaller audience and streamlined for efficiency in that area only. Lua is for example targeted for scripting in games. While it's usable from outside of this context, that specific context is where it will probably be the most efficient/adapted.

Why should we create computer programs?
What is it that makes computer programming useful or pointless? What are the goals, common problems, and solutions related with computer programming?

Optional reading: History of programming—what problems and tasks motivated the invention of programmable machines?

Writing a program without knowing what problem you are trying to solve is the equivalent of swinging a knife without knowing what it is that you want to cut.

Code with a purpose. This is how:

Basic goals of computer programming
When you are planning to create a computer program you should:
 * Ensure your program fulfills the need it is addressing.
 * Ensure that people can easily use your program.
 * Ensure that it is easy to understand, fix, and improve your program without a major time investment.
 * Enhance problem solving using logic.
 * Developing a high understanding of principles in programming.
 * Demonstrating basic concepts, and software applications.
 * Recognizing ethical working codes.

Common problems
These are very common mistakes programmers make:
 * Your program does not do a job any better than an available alternative program. At best, you're re-inventing the wheel.
 * Your program does not work as intended.
 * Your program is too complicated or too primitive to be useful to most people.
 * Other people, or yourself at a later time, can't understand the programming behind your program. This means your project won't grow.

Solutions

 * Utility and Usability
 * Survey the field to look for programs similar to what you intend to develop. Determine what you like and don't like about those programs. Figure out ways to improve those programs.
 * Find source code for similar programs to what you want to make if at all possible. Unfortunately, people often write a lot of inferior code and leave it floating around the Internet. Don't be one of those people. Only release useful, well-written programs.
 * Thoroughly plan what you want your program to do before you start working on it. One way to do this is to make a flowchart of what you want your program to do.
 * Aim towards the maximum functionality your program can achieve while maintaining minimal complexity. Think of the iPod, matchstick, doorknob and television. They are simple yet effective.
 * If possible, talk to people who might use your program to get an idea of what features they would want or expect.
 * Remember the 80–20 rule: 20% of the features in most programs are used 80% of the time. If you can successfully identify even a few of the seldom used features and leave them out, you can save yourself some time and frustration.
 * Maintainability
 * Make it easy for someone to look at your program's source code and understand what's going on.
 * Use comments when you're doing somewhat complicated things in your program, or when in doubt.
 * Always choose readability of your code over memory performance. Though in the short run this may not always be the best choice, in the long run, the performance can be improved if the code is easy to understand.
 * Use simple, easy-to-understand names for variables. The convention is that a variable should be written variable_name or variableName.
 * Look at examples of source code, and especially source code intended as an example of proper programming form. Recognize the structure they're using to make things simple.

Make programming easy for you and everybody else
Computers and computer programs are intended to make our lives easier, not more complicated.

Programmers have figured out a very good way of doing things: Free Software.

Free Software is software written by an author who has released that software with the source code, freely available for anybody to look at, modify, improve and implement into their own software. Just like wiki, this is an easy, efficient and useful way of doing things.

To make programming easier for all coders, you should:
 * Release under GPL GNU General Public License
 * Take advantage of Free Software to create more Free Software
 * Make your code readable and efficient

How does one become a programmer?
A programmer is generally tasked with producing a solution to a problem via a computer program, which can be reused as various particular instances of that problem arise. To accomplish this task, the programmer therefore must be able to understand the problem, derive an appropriate solution, and then be able to effectively express that solution in a computer programming language.

The first prerequisite to becoming a programmer is to develop a strong background in problem solving as is often required in fields such as mathematics and engineering. The ability to formally, concisely, and clearly state a problem and then derive its solution is a fundamental skill that precedes the process of any computer coding. The study of computer algorithms focuses on the generalized problem solving approaches often applicable in computer science. Techniques such as programming design patterns provide practical templates which often help frame solutions in an understandable, reusable manner. In general, there are many different classes of problems in computer science that require different techniques to solve effectively: having a strong repertoire of approaches aids in finding good solutions.

The second prerequisite to becoming a programmer is knowing a programming language with which to express a particular solution to a problem. A programming language is a tool, which practice will help hone into expertise. Learning multiple languages can often be helpful as the process will demonstrate the particular strengths of different approaches to solving particular classes of problems.

In both these areas, practice is essential. Exposure to a wide variety of problems and tools to solve them will increase your understanding of the field as whole, to judge for yourself the relative merit of techniques in the field, as well as to discover unique, new approaches to addressing the problems of computer science. As with the practice of any new skill, do not be afraid to make mistakes, to redo earlier work, or to stumble along the way to expertise.

Those unfamiliar with programming may think it is like a write-up, written linearly from beginning to end. That is not the case. Instead, it rather resembles sculpting.

Don't be afraid to make mistakes because you will make them—constantly and for the rest of your career. Even the best programmers make mistakes regularly (if they try to say differently then they are either lying or deluded). Making mistakes is really part of the programing process. Someone said, to find a solution to a problem you must partly solve the problem. So you'll probably end up rewriting parts of your programs several times. Part of what distinguishes better programmers is their ability to catch at least some mistakes before they become a problem. Nobody can catch them all without help. Well, nobody can catch them all : there is no bug-free program. Additionally, it is good coding practice to code the smallest modules of a program, one at a time. This provides an isolated testing environment. Just be sure that everything is planned carefully from the outset, so that the little modules are not "orphaned" from other modules that they need to run. Note that when this approach is used, care should be taken to lay the foundation first, making careful note of "dependencies" within the program; code modules upon which other modules rely first, and then code higher-level modules after the foundations have been thoroughly tested. Unit testing is a good programming practice. Some programming processes, such as XP (eXtreme Programming), recommend to write tests before actual code.

Learn to work with others in a team environment. People have different strengths and weaknesses and a good team can bring together people whose strengths and weaknesses are complementary. The members of a team can teach each other. Most importantly, teams can tackle problems that would be too big for an individual. Beware, though, teams are not easy to lead and you can easily make a project a disaster by just gathering as many people as you can. If you want to work with a team, come with a solid design and a strong vision of what the project should look like when it's finished. If other members of the team suggest new ideas, take them with consideration but do not fall in the feature-greed pitfall, e.g. your project is never finished because the final goal grows beyond all proportions. As the XP process suggest, make small and frequent releases, prefer running code to vague and abstract design. Also, be careful how you go about this, you may not always agree with your team and that's okay!

As you continue to practice the art, take some time here and there to learn about the underlying theory that makes up the field commonly referred to as Computer Science.

 * Next Lesson
 * Introduction to Programming


text:
Bullfrog

Bullfrog is a common English language term to refer to large, aggressive frogs, regardless of species.

Examples of bullfrogs include:

America

 * Helmeted water toad (Calyptocephalella gayi), endemic to Chile
 * American bullfrog (Lithobates catesbeianus), indigenous to North America
 * Cane toad (Rhinella marina), a toad indigenous to Central and South America, called 'bullfrog' in the Philippines

Australia

 * Limnodynastes dorsalis, found in Southwest Australia
 * Limnodynastes dumerilii, found in Eastern Australia
 * Giant banjo frog (Limnodynastes interioris), found in Eastern Australia

Africa

 * African bullfrog (Pyxicephalus adspersus), found in central and southern Africa
 * Calabresi's bullfrog (Pyxicephalus obbianus), found in Somalia
 * Crowned bullfrog (Hoplobatrachus occipitalis), found in much of Africa
 * Edible bullfrog (Pyxicephalus edulis), found in much of Africa

Asia

 * Banded bullfrog (Kaloula pulchra), found in Southeast Asia
 * Chinese edible frog (Hoplobatrachus rugulosus) or East Asian Bullfrog, found in China and Southeast Asia
 * Hoplobatrachus crassus or Jerdon's bullfrog, found in India
 * Hoplobatrachus tigerinus or Indus Valley bullfrog, found in Pakistan and North India

source: wikimedia

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

title: Bullfrog


text:
Talk:Fanning Springs State Park

External links modified
Hello fellow Wikipedians,

I have just modified 2 one external links on Fanning Springs State Park. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20120502124542/http://www.floridastateparks.org/resources/doc/individualparks/brochures/fas-brochure.pdf to http://www.floridastateparks.org/resources/doc/individualparks/brochures/fas-brochure.pdf
 * Added archive https://web.archive.org/web/20120712004942/http://www.dep.state.fl.us:80/gwt/guide/regions/crossflorida/trails/nature_coast_trail%20.htm to http://www.dep.state.fl.us/gwt/guide/regions/crossflorida/trails/nature_coast_trail%20.htm

Cheers.— InternetArchiveBot  (Report bug) 17:19, 29 December 2016 (UTC)

title: Talk:Fanning Springs State Park


text:
Talk:Elizabeth Dwomoh

Artchino (talk) 05:31, 10 February 2015 (UTC)Hi! Let's keep this article clean for a quality reading. Thank you.

External links modified
Hello fellow Wikipedians,

I have just modified 1 one external link on Elizabeth Dwomoh. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20140921070234/http://www.missexclusive.be:80/index.php/nl/ct-menu-item-2/miss-exclusive-2015 to http://www.missexclusive.be/index.php/nl/ct-menu-item-2/miss-exclusive-2015

Cheers.— InternetArchiveBot  (Report bug) 19:21, 22 December 2016 (UTC)

title: Talk:Elizabeth Dwomoh


text:
Alexander Fraser, 4th Lord Lovat

Alexander Fraser, 4th Lord Lovat (1527 – 1557/1558) was a Scottish peer and Chief of Clan Fraser of Lovat from 1544 until 1557. He succeeded to the chiefship in July 1544, aged seventeen, after his father Hugh Fraser, 3rd Lord Lovat and elder brother Simon were killed in the battle of Loch Lochy. He was made the legal ward of Robert Reid, Bishop of Orkney (d. 1558), who was a relative of his mother's. In 1555 he waited on Mary of Guise when she came to Inverness to hold assizes. He died of rheumatism in 1557/1558.

Marriage and family
Lovat married Janet Campbell (died 1592), daughter of Sir John Campbell of Cawdor Castle, a son of Archibald Campbell, 2nd Earl of Argyll. Their children included:
 * Hugh Fraser, 5th Lord Lovat
 * Thomas Fraser of Knockie and Strichen
 * James Fraser of Ardochy
 * Anna Fraser, who married John Fraser of Dalcrosa, also called John Mor MacVaister

When Janet Campbell died in 1592 she left her two silver goblets, a bed with "Scottish green" curtains, and the high table of Dalcross Castle to her grandson Simon Fraser, Lord Lovat.

title: Alexander Fraser, 4th Lord Lovat


text:
Talk:Perl Programming/Functions

Use of "my" should be explained. (Done. Thanks, Dysprosia.)

No problem :) Dysprosia 04:58, 21 Apr 2004 (UTC)

Any chance you could cover calling a function by name at runtime as in

using strict; sub foo {  print "here"; } my $funcname = "foo"; $funcname;
 * 1) !/bin/perl

ps: the above code doesn't work in strict mode. I'm searching for the correct way to do it

 * No, the point of strict is to keep you from doing that. Don't do that.  Don't want to do that. --Randal L. Schwartz 22:51, 11 September 2006 (UTC)

 * Actually you can do that, and "There is more than one way to do it":

use strict; use warnings; sub foo { print "here\n"; } my $funcname = "foo"; $::{$funcname}; {  no strict qw(refs); &{$funcname}; }
 * 1) !/bin/perl

 * On the other hand, these are advanced techniques, those are highly advanced techniques, e.g., for those writing AUTOLOAD functions or writing test suite libraries. I don't think it is appropriate here. Ike 10:43, 8 November 2007 (UTC)

title: Talk:Perl Programming/Functions


text:
2006 Egyptian Super Cup

The 2006–07 Egyptian Super Cup was the sixth edition of the Egyptian Super Cup, an annual football match between the winners of the previous season's Egyptian Premier League and Egypt Cup. The match is usually contested by the winners of the Premier League and the Egypt Cup, but since Al Ahly won the double (2005–06 Egyptian Premier League and 2005–06 Egypt Cup), ENPPI qualified instead of Zamalek (second-placed in the league and cup), who was prevented from playing the match by decision of the football association. The match was played at the Cairo International Stadium. Al Ahly defended the trophy they won in the previous edition and defeated ENPPI 1–0.

title: 2006 Egyptian Super Cup


text:
Grzegorz Motyka (footballer)

Grzegorz Motyka (born 31 January 1972) is a former footballer who played as a defender or midfielder. In a career which was mostly played in the top two divisions in Poland, he had spells with Hutnik Nowa Huta, Amica Wronki, and Dyskobolia Grodzisk Wielkopolski. His longest spell at a club was with Lechia Gdańsk, where also played in both of the Lechia Gdańsk merger teams Olimpia-Lechia Gdańsk and Lechia-Polonia Gdańsk.

Lechia Gdańsk
Born in Gdańsk, Motyka started playing football for local team Lechia Gdańsk alongside his brother Tomasz Motyka. He made his first team debut against Widzew Łódź towards the end of the 1990–91 season. At the start of his career Motyka played mainly as a defender for Lechia, before advancing slightly higher up the pitch to play as a defensive midfielder. During his time with Lechia the team played in the II liga, the second division in Poland. At the end of the 1994–95 season Lechia were relegated to the third tier. In total for Lechia Gdańsk, Motyka played 80 games and scored 3 goals.

Olimpia-Lechia Gdańsk
With Lechia Gdańsk being relegated to the third division, a merger was formed with Olimpia Poznań to create the Olimpia-Lechia Gdańsk team taking Olimpia's position in the top division. Motyka moved from the relegated Lechia team to the newly formed Olimpia-Lechia team. In total Motyka played twenty times in his first top division season, scoring one goal as the Olimpia-Lechia suffered with relegation. At the end of the season the team was dissolved, with Motyka finding himself without a club.

Hutnik Nowa Huta
Motyka moved to Kraków joining Hutnik Nowa Huta to stay in the top division. For Hutnik he played 29 times during the 1996–97 season. Motyka suffered the same fate as 12 months prior, as Hutnik found themselves being relegated from the I liga.

Amica Wronki
The next club Motyka joined was Amica Wronki. The two years he spent at Amica ended up being the most successful of his career. In his first season at the club, Amica won the Polish Cup. His second season was more successful with Amica winning both the Polish SuperCup and the Polish Cup for the second time. In total he played 43 league games for Amica over the two seasons.

Dyskobolia Grodzisk Wielkopolski
Motyka joined Dyskobolia in the summer of 1999 and had a short spell with the club leaving in the next transfer window despite playing in most of Dyskobolia's games up to that point in the season.

Lechia-Polonia Gdańsk
In January 2000 he moved back to Gdańsk having dropped down a division to play with Lechia-Polonia Gdańsk. He played most of the remaining games of the season for Lechia, helping the club to avoid relegation.

Later years
Motyka joined fellow II liga team KSZO Ostrowiec Świętokrzyski in 2000, but managed to only play in 4 games in all competitions as the team won promotion to the I liga. He spent two seasons with Aluminium Konin, helping the team to win promotion from the third tier to the second. In 2002 he moved back to the Pomeranian region of Poland, playing with KP Sopot, Unia Tczew, Przylesie Sopot and GKS Kowale, retiring from football in 2009.

Honours
Amica Wronki
 * Polish Cup: 1997–98, 1998–99
 * Polish SuperCup: 1998

title: Grzegorz Motyka (footballer)


text:
Elfin Team

Advanced Persistent Threat 33 (APT33) is a hacker group identified by FireEye as being supported by the government of Iran. The group has also been called Elfin Team, Refined Kitten (by Crowdstrike), Magnallium (by Dragos), Peach Sandstorm, and Holmium (by Microsoft).

History
FireEye believes that the group was formed no later than 2013.

Targets
APT33 has reportedly targeted aerospace, defense and petrochemical industry targets in the United States, South Korea, and Saudi Arabia.

Modus operandi
APT33 reportedly uses a dropper program designated DropShot, which can deploy a wiper called ShapeShift, or install a backdoor called TurnedUp. The group is reported to use the ALFASHELL tool to send spear-phishing emails loaded with malicious HTML Application files to its targets.

APT33 registered domains impersonating many commercial entities, including Boeing, Alsalam Aircraft Company, Northrop Grumman and Vinnell.

Identification
FireEye and Kaspersky Lab noted similarities between the ShapeShift and Shamoon, another virus linked to Iran. APT33 also used Farsi in ShapeShift and DropShot, and was most active during Iran Standard Time business hours, remaining inactive on the Iranian weekend.

One hacker known by the pseudonym of xman_1365_x was linked to both the TurnedUp tool code and the Iranian Nasr Institute, which has been connected to the Iranian Cyber Army. xman_1365_x has accounts on Iranian hacker forums, including Shabgard and Ashiyane.

title: Elfin Team


text:
Wikiversity:Candidates for Custodianship/MichaelBillington

This is an archive of community discussion related to the nomination for full custodianship of User:MichaelBillington.

The 5 day period for comments on this nomination starts on 09:57, 10 January 2007 (UTC) and ends on 09:57, 15 January 2007 (UTC).
 * Mentor:
 * Evaluation
 * I'm pleased to nominate MichaelBillington for full custodianship.He has been a probationary custodian since 11 December 2006. He has made an enormous contribution using the Custodian tools by blocking thousands of Open Proxy IPs, from lists he created from our sister projects. He's also caught a few vandals, and done a good bit of cleanup work as well. He continues to be active in discussions of the project both here on the wiki and on the IRC channels.

 * He's been a hard-working Custodian, and I suspect he'll continue to be so.--SB_Johnny | talk 10:03, 10 January 2007 (UTC)

 * Comments
 * Support.....unless all of the proxy blocking has caused brain damage ;) --JWSchmidt 17:10, 10 January 2007 (UTC)
 * Support I rather like Wikiversity's RfA process.. it allows us to see if the custodian-to-be could/would abuse the tools. Michael has done the complete opposite. Your work on OP is awesome! But how about gettin back to enwp and helping us eh  Good Luck! Deon555 08:59, 11 January 2007 (UTC)

 * Result
 * permanent custodianship confirmed. sebmol ? 08:05, 16 January 2007 (UTC)

From Probationary custodians
See Candidates for Custodianship/MichaelBillington (previous discussion) for the previous discussions.


text:
Game mechanics

This is a part of Board Game Design. For game mechanics in general feel free to contribute to this page.

Introduction
This will be a page for the discussion of organization and experimentation with game mechanics.

List of game mechanics in board games
This list has been developed from BoardGameGeek.

 * /Acting/
 * Action Point Allowance System
 * /Area Control & Area Influence/
 * Area Enclosure
 * /Area Movement/
 * Area-Impulse
 * /Auction & Bidding/
 * Backtracking
 * Betting/Wagering
 * Betrayer/Betrayal
 * Capture
 * Card Dealing
 * Card Drafting
 * Card Drawing
 * Card Driven Campaign/Battle
 * Character Development
 * Chit-Pull System
 * Co-operative Play
 * /Commodity Speculation/
 * Conquest
 * Crayon Rail System
 * Deck Construction
 * Dialogue
 * Dice Rolling
 * Dice Drafting
 * Dice-as-Workers
 * Exploration
 * Hand Management
 * /Hex-and-Counter/
 * Hidden Role
 * King Making
 * Line Drawing
 * Memory
 * Modular Board
 * Negotiating
 * Paper-and-Pencil
 * Partnerships
 * Pattern Building
 * Pattern Recognition
 * Pick-up and Deliver
 * /Point to Point Movement/
 * Riddle Solving
 * Rock-Paper-Scissors
 * /Rondel/
 * Role Playing
 * Roll and Move
 * Russian Roulette
 * /Secret Unit Deployment/
 * /Set Collection/
 * Simulation
 * Simultaneous Action
 * Selection
 * Shell-game
 * Singing
 * /Stock holding/
 * Storytelling
 * Take That!
 * /Tile Placement/
 * /Trading/
 * Trick-taking
 * Upgrading
 * Variable Phase Order
 * Variable Player Powers
 * /Victory points/
 * /Voting/
 * /Worker Placement/

Proposed Taxonomy/Hierarchy
A place to discuss how mechanics can be ordered and organized.

Board

 * /Area Control & Area Influence/
 * /Area Enclosure/
 * /Area Movement/
 * /Hex-and-Counter/
 * /Modular Board/
 * /Pick-up and Deliver/
 * /Point to Point Movement/
 * /Rondel/
 * /Tile Placement/

Cards

 * /Deck Construction/
 * /Card Dealing/
 * /Card Drafting/
 * /Card Drawing/
 * /Card Driven Campaign/Battle/
 * /Hand Management/
 * Russian Roulette

Resource Management

 * /Commodity Speculation/
 * /Stock holding/
 * /Trading/

Role Playing

 * /Acting/
 * /Character Development/
 * /Co-operative Play/
 * /Dialogue/
 * /Riddle Solving/
 * /Role Playing/
 * Storytelling

Unit Placement

 * /Secret Unit Deployment/
 * /Worker Placement/

List of game mechanics in video games

 * /F2P to P2P/
 * /Harvesting Resources/
 * /Taking A Break Mechanics/
 * /Trading/

title: Game mechanics


text:
Talk:Dick Snyder

External links modified
Hello fellow Wikipedians,

I have just modified 1 one external link on Dick Snyder. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20110823145712/http://ohiobasketballhalloffame.com/wp-content/uploads/2011OBHF_Ad_v3.pdf to http://ohiobasketballhalloffame.com/wp-content/uploads/2011OBHF_Ad_v3.pdf

Cheers.— InternetArchiveBot  (Report bug) 17:14, 12 December 2016 (UTC)

title: Talk:Dick Snyder


text:
Vietnamese/Lesson series

This is a lesson series for Languages --> Southeast Asian languages --> Vietnamese Language --> Vietnamese One (VSL 1)

 * Lesson : Greetings

 * Lesson : Telling time, numbers

 * Lesson : Occupations and Subjects of Study

 * Lesson : Days of the Week, Dates

 * Lesson : Review

 * Lesson : Travel Destinations

 * Lesson : Daily Activities

 * Lesson : Family and School Activities

 * Lesson : Transportation

 * Lesson : Review

 * Lesson : Shopping and House Rental

 * Lesson : Travel and Eating Out

 * Lesson : Phone Conversations

 * Lesson : Shopping and Geography

 * Lesson : Review

 * Lesson : Daily Activities

 * Lesson : More on Travel

 * Lesson : Bargaining

 * Lesson : At the Restaurant

 * Lesson : Review

title: Vietnamese/Lesson series


text:
User:Cassandra Salvador

Ermilyn Cassandra Salvador was born in 13,October 2005,Age14 years.She is a filipina singer in San Mateo Rizal,Phillipines and Spoken poetry speaker and writer.She is also known with her nickname"Sandy".

title: User:Cassandra Salvador


text:
Rishikaa Singh Chandel

Rishikaa Singh Chandel (born 1 September 1995) is an Indian television actress who works in the television industry. She is known for playing Damini as lead role in Doordarshan's Nayi Soch serial. Her father Yashwant Singh is a business man and her mother Archana Singh is a house wife.

Early life
Rishikaa was born on the 01st September in the year 1995. She has done her schooling from S.D.S. Public School, Chhapra, Bihar. She has done Master in Journalism & Mass Communication from the Nalanda Open University, Patna, Bihar. She is from Chhapra, Saran, Bihar.

Career
Rishikaa Singh Chandel made her television debut on Sony TV with CID in 2017. She then performed in Dulari serial on Doordarshan. She also acted in Bhabi Ji Ghar Par Hain on Colors TV, Savdhaan India on Life OK, Jai Santoshi Maa on &TV, Vidhya on Colors TV.

Currently, she has been portraying Damini in Doordarshan's Nayi Soch as a lead actor. She is playing the negative lead role in  LovePanti in which her character's name is Sarita. This show is on air  MxPlayer and Azaad TV.

title: Rishikaa Singh Chandel


text:
File:Ironbark BurntBushes.jpg

Summary
This is an image I took of St Peters Lutheran College, Ironbark Outdoor Education. Sp0kk 13:26, 11 August 2006 (UTC)

title: File:Ironbark BurntBushes.jpg


text:
rifampicin

Etymology
.

Noun

 * 1)  A reddish-brown semisynthetic antibiotic C43H58N4O12 obtained from the bacterium, used chiefly to treat tuberculosis, leprosy, and asymptomatic carriers of meningococci.

title: rifampicin


text:
CINAR scandal

The CINAR scandal was a major accounting scandal in Canada that came to light in March 2000 at CINAR, renamed to Cookie Jar Group, one of the world's most successful children's television production companies at the time. It was exposed when investigators revealed that US$122 million was invested into Bahamian bank accounts without the board members' approval. The scandal resulted in Canada's longest criminal trial ever brought before a jury, lasting from May 2014 to 2016.

In 2004, following the scandal, CINAR was sold to a group led by Nelvana founder Michael Hirsh, and former Nelvana president Toper Taylor for CA$190 million. The company was subsequently renamed Cookie Jar.

Background
CINAR was founded by the husband and wife team of Micheline Charest and Ronald Weinberg in 1976 in New York City after organizing an event for a women's film festival, and later moved its operations to Montreal, Quebec. Throughout the 1980s and 1990s, the company saw massive success with children's programming such as Papa Beaver's Storytime, The Busy World of Richard Scarry, Are You Afraid of the Dark?, The Adventures of Paddington Bear, Wimzie's House, Caillou, Zoboomafoo and Arthur.

CINAR went public on the Toronto Stock Exchange in 1993, and then on the Nasdaq one year later. By 1999, CINAR boasted annual revenues of CA$150 million and owned about CA$1.5 billion of the children's television market. In 1996, CINAR acquired the library of the British animation studio FilmFair, which included television adaptations of Paddington Bear. CINAR shut down the studio in 1998. In February 1999, CINAR acquired the film library of Leucadia Film Corporation.

Scandal
The company collapsed in 2001, when an internal audit revealed US$122 million was invested into Bahamian bank accounts without the board members' approval. CINAR had also paid American screenwriters for work while continuing to accept federal grants and tax credits for the production of domestic content, although the names of Canadian citizens (generally non-writers connected to CINAR, including Charest's sister Helene) were credited for their work.

While criminal charges were not filed, CINAR denied any wrongdoing, choosing instead to pay a settlement to Canadian and Quebec tax authorities of CA$17.8 million and another CA$2.6 million to Telefilm Canada, a Canadian federal funding agency. The value of CINAR's stock plummeted, and the company was soon delisted.

There was some speculation that CINAR's CFO Hasanain Panju was the mastermind behind the investment scheme. Other individuals believed to have helped with the scheme include John Xanthoudakis of Norshield Investment Group and Lino Matteo of Mount Real Corporation. It was alleged that Charest and Weinberg (and later Panju) used CINAR as a personal 'piggy bank' and schemed to transfer funds out from the company to the Bahamas through a series of complicated transactions to their own offshore holding companies.

In 2001, Charest and Weinberg agreed to pay $1 million each, and were fired from the company's board of directors.

Aftermath
On August 26, 2009, in a separate case, the Superior Court of Quebec ruled that CINAR had plagiarized the work of Claude Robinson for its animated series Robinson Sucroe. The series was based on a concept he had pitched to CINAR in 1986, but had been turned down. Robinson was awarded $5.2 million in damages, in a suit that resolved a 14-year dispute between the two parties.

On March 10, 2011, co-founder Ronald A. Weinberg returned to Montreal from vacationing in the Caribbean islands and was promptly arrested for securities fraud after a warrant was issued for him to be taken into custody earlier that month.

On January 17, 2014, former CFO Hasanain Panju pleaded guilty to undisclosed crimes. The judge noted these crimes were "disgraceful" and placed a publication ban on details surrounding the trial. Panju was sentenced to four years in prison.

On May 12, 2014, Weinberg, John Xanthoudakis of Norshield Financial Group and Lino Matteo of Mount Real Corp. were charged with 26 counts of fraud in Montreal Superior Court. They were convicted on most of the counts on June 2, 2016, and in the trial Panju acted as a key Crown witness. On June 22, 2016, Weinberg was sentenced to 8 years and 11 months in prison, and the other two received sentences of 7 years and 11 months each. On May 3, 2019, Weinberg was fully paroled.

The CINAR affair was described thus by The Globe and Mail:

Mr. Weinberg and Ms. Charest set out to make non-violent, non-sexist children's programming because they wanted to foster socially progressive attitudes and feelings of self-worth in their own sons and a generation of kids with far too many bad TV choices.

But by the time their own kids had outgrown CINAR's shows, the couple's motivations seemed to have slid down the well-greased path of basic greed and avarice. If it took breaking the rules to enrich themselves, so be it. Success had gone to their heads. They acted (if not felt) invincible.

title: CINAR scandal


text:
Web Design/Build a basic web page/HTML Quiz

 {Try your luck at these quiz questions…}

{Which heading tag will produce the largest text? +
 -
 -
 -

 * type=""}

{Which tag would you use to create a hyperlink? - + -
 -

 * type=""}

{Which of these tags should NOT be located in the head section of your page? - -link to a style sheet +background image -metatags
 * type=""}

{If you put a tag in the head section of your page, it will appear in bold, large print at the beginning of your page. Select one: -TRUE +FALSE -It depends on the browser -Only if the CSS makes it display that way
 * type=""}

{If you want to have the browser open a new window for a link to an outside page, which attribute would you use? -alt +target -src -start
 * type=""}

{If you want your ordered list to use capital letters and start with the letter D, which attributes would you use? -type="a" start="D" -type="A" start="D" +type="A" start="4" -type="letter" start="d"
 * type=""}

{The anchor tag links to: -specific places within a particular page. -other pages within your website. -pages anywhere on the Internet. +All of these are correct
 * type=""}

{HTML documents should be saved as text only, and the file name should have .html as the ending. Cascading stylesheets should also be saved as text, but the file name should end with: -.xml +.css -.ccs -.xhtml
 * type=""}

{HTML tags use brackets to contain the information. What kind of notation do Cascading Style Sheets use to contain information? -Brackets, just like HTML. -Parentheses. +Curly brackets. -Forward slashes.
 * type=""}

{Which input type would allow a reader to select several options from a list of possibilities? -radio +checkbox -multi-line textbox -form
 * type=""}

{If the input type is "text" and the size is "2", which answer will NOT show on the website? +Yes -No -10 -5
 * type=""}

{8 to 10% of all males have some form of colorblindness. This is a good reason to avoid color schemes that include: +red on green. -black on white. -blue on yellow. -green on white.
 * type=""}

{To make your website easier to be read by automated reading programs for the blind, you can: -use
...
 tags for easier navigation -use alt tags to describe images -use alt tags that name the link destination for images that function as links. +All of these are correct
 * type=""}

{What does marquee tag do? +make text running -nothing -blast -All of these are correct
 * type=""}


text:
Wiktionary

What is Wiktionary?
Wiktionary is a multilingual, Web-based project to create a free content dictionary, available in over 150 languages. Unlike standard dictionaries, it is written collaboratively by volunteers using wiki software, allowing articles to be changed by almost anyone with access to the Web site. The project's name is a portmanteau of the words wiki and dictionary. Like its sister project Wikipedia, Wiktionary is run by the Wikimedia Foundation. Because Wiktionary is not limited by print space considerations, most of Wiktionary's language editions provide definitions and translations of words from many languages, and some editions offer additional information typically found in thesauruses and lexicons.

Projects for collaboration between Wikiversity and Wiktionary

 * Lexicon
 * Translation

title: Wiktionary


text:
Joseph Pitt

Joseph Pitt (1759–1842) was a British lawyer of humble origins who prospered as a property speculator, notably in Cheltenham, Gloucestershire, but also in Wiltshire, and who served as a Tory MP for Cricklade, Wiltshire 1812–1831. His name is commemorated in Pittville, Cheltenham, his largest speculative development.

title: Joseph Pitt


text:
вѣтвь

Etymology
From ; cognate with 🇨🇬, 🇨🇬, 🇨🇬 and 🇨🇬. Outside of Slavic, cognate with 🇨🇬, 🇨🇬 and 🇨🇬, all from.

Noun

 * 1) branch

title: вѣтвь


text:
User:DaveSellinger

In 1939 Dave Sellinger III gave his famous " Whoa man where am I speech" He was Born in 1899 in West Philadelphia. He died shortly after in 2076.

title: User:DaveSellinger


text:
Andrews Run (Brokenstraw Creek tributary)

Andrews Run is a 3.57 mi long 3rd order tributary to Brokenstraw Creek. It is classed as a cold water fishery by the Pennsylvania Fish and Boat Commission.

Course
Andrews Run is formed at the confluence of Birch Springs Run and Rattlesnake Run in Warren County, Pennsylvania about 3 miles south-southeast of Pittsfield, Pennsylvania. It then flows northeast to meet Brokenstraw Creek at Pittsfield, Pennsylvania.

Watershed
Andrews Run drains 12.78 sqmi of the Pennsylvania High Plateau province and is underlaid by the Venango Formation, Corry Sandstone through Riceville Formation and the Shenango through Cuyahoga Group. The watershed receives an average of 43.1 in/year of precipitation and has a wetness index of 389.62. The watershed is about 79% forested.


text:
Łukasz Turzyniecki

Łukasz Turzyniecki (born 25 March 1994) is a Polish professional footballer who plays as a defender for Legia Warsaw II.

Club career
In his two stints with Legia Warsaw he never appeared for the main squad in an Ekstraklasa game, but made appearances in the Polish Cup.

On 31 July 2020, he signed a two-year deal with Zagłębie Sosnowiec. On 23 May 2022, it was announced he would leave the team at the end of his contract.

On 1 July 2022, he moved to Olimpia Elbląg on a one-year deal with an extension option.

On 30 January 2023, he re-joined Legia Warsaw II.

Honours
Legia Warsaw
 * Polish Cup: 2017–18

title: Łukasz Turzyniecki


text:
GWR 1000 Class 1014 County of Glamorgan

No.1014 County of Glamorgan  is a steam locomotive which is under construction as a "new-build" project, based at Didcot Railway Centre in Didcot, Oxfordshire. Unlike most other new-build projects which are underway and are building new members of lost classes like 2007 Prince of Wales and 2999 Lady of Legend it was decided to build a mock of one of the Great Western Railway 1000 or "County" Class engines, the chosen engine being 1014 (instead of the last built No.1029 County of Worcester or the last to be withdrawn No.1011 County of Chester) The project was launched in 2005 with the creation of the 'Three Counties Agreement' between the Great Western Society (GWS) and the Vale of Glamorgan Council saw three members of the Barry 10, all of the being ex-GWR locomotives, and a 3,500-gallon tender being used to help resurrect extinct GWR locomotives. This meant that a GWR 1000 Class No. 1014 County of Glamorgan, GWR 3800 Class No. 3840 County of Montgomery, a GWR 2221 Class tank engine, and a GWR 4700 Class No. 4709 would be constructed from the parts of GWR 2800 Class No. 2861, GWR 5101 Class No. 4115, GWR 5205 Class No. 5227, GWR 6959 Class No. 7927 Willington Hall and LMS 8F No. 48518.

Original County of Glamorgan
The original engine was built unnamed in February 1946 and was allocated to Bristol Bath Road. She received her name County of Glamorgan in March 1948 and during the same year she was taken into British Railways ownership. She received a double chimney in May 1958 and in September 1960 she was transferred to Bristol St Philip's Marsh. Further transfers during her career included to Neyland and Shrewsbury with her final shed allocation being at Swindon.

Allocations and history
The locations of the original 1014 on particular dates.

Withdrawal and scrapping
She was withdrawn from Swindon's 82C shed in April 1964 with a running life of 18 years and 2 months. Following a period of storage after her withdrawal she was sent to Cashmore's scrapyard in Newport and was cut up in December 1964.

Replica
Since none of the original County class engines survived into preservation (the last being 1011 County of Chester was withdrawn in November 1964 and sent straight for scrap at Cashmore's, Newport), it was decided by members at the Didcot Railway Centre to build a representation of one of the original engines from GWR & BR days instead of building the next member of the class as a large number of new build engines were being built at the time as new members of the class.

Parts from an original Modified Hall No. 7927 Willington Hall and LMS Stanier Class 8F No. 48518 have been used in the project (parts included the frames from 7927 and boiler from 48518), the frames of 48518 and boiler from 7927 later being sent to the Llangollen Railway with the boiler being used on new-build GWR 6800 Class 4-6-0 No. 6880 Betton Grange. Like other new-build projects, a large number of new parts have to be constructed which included the driving wheels as no other class of GWR engine other than the county's had 6 ft 3 in driving wheels and the wheels that had come with 7927 being 6 ft in size. Original County parts are also being used in the construction of 1014 which include the original chimney from 1006 County of Cornwall, the regulator from 1011 County of Chester & the reverser from 1024 County of Pembroke.

The original height of the county's was 13 ft 5in, but the max height allowed for steam locomotives to work on the mainline by Network Rail because of overhead wires clearances is 13 ft 1 in. Because building the replica to its original height would result in only being able to operate it on heritage railways as its height would be over the max allowed and because the engine's owners plan to operate the completed replica engine on the mainline, the engine is being built with a slightly smaller height. In order to operate on the mainline when completed, the engine will also require the fitment of: Speedometer, AWS, TPWS, OTMR & GSM-R.

There will also be some modifications done to the engine's tender as it is common now for engines to carry more water than they originally did and less coal because of there being no water columns on the mainline other than a few select locations (most stops being done by either hydrants or roadside tankers) and the water troughs have long since disappeared. A support coach to carry tools and spare parts for the engine, as well as crew members, will also have to be examined. The plan is to not fit the engine with the required mainline equipment at first when completed, but when funding has been raised from running as well as a possible appeal mandatory equipment will be fitted to the engine for future mainline operations.

In the past few years, much progress has been done to ensure that the locomotive is fully functionally in the near future. In 2019, its plates were completed. In 2020, two very important milestones were reached. In September 2020, it was announced that the tubeplates for the locomotive were completed. It was also announced that the locomotive will have a three-row super heater. The second milestone was announced on the 4th of November in 2020. That being that funding for the locomotive reached £980,000 in fundraising campaigns.

title: GWR 1000 Class 1014 County of Glamorgan


text:
Category talk:Afghan cuisine

odd question wrong place
Dumb question, but in the Simpsons episode New Kid on the Block were they using the name of real Afghani dishes?--T. Anthony 14:58, 11 August 2006 (UTC)

title: Category talk:Afghan cuisine


text:
Barneveld Zuid railway station

Barneveld Zuid (English: Barneveld South) is a railway station in the south of Barneveld, Netherlands. The station opened on 2 February 2015 and is located on the Nijkerk–Ede-Wageningen railway, also known as the Valleilijn. The train services are operated by Connexxion.

Train services
, the following local train services call at this station:

 * Stoptrein: Amersfoort - Barneveld - Ede-Wageningen
 * Stoptrein: Amersfoort - Barneveld

title: Barneveld Zuid railway station


text:
especialista

Etymology
From.

Noun

 * 1) specialist

Etymology
From.

Noun

 * 1) specialist
 * 2) stuntman

Noun

 * 1) specialist

Etymology
From.

Noun

 * 1) specialist; expert person with extensive knowledge or ability in a given field

Etymology
From.

Noun

 * 1) specialist
 * 2) stuntman

Adjective

 * 1) specialist

title: especialista


text:
William A. M. Burden

William Armistead Moale Burden Jr. (April 8, 1906 – October 10, 1984) was an American banker, art collector, and philanthropist who served as U.S. Ambassador to Belgium under President Eisenhower.

Early life
Burden was born on April 8, 1906, in Manhattan to William Armistead Moale Burden Sr. (1877–1909), and Florence Vanderbilt (née Twombly) (1881–1969). His younger brother, Shirley Carter Burden (1908–1989), was a prominent photographer. Their paternal grandparents were I. Townsend Burden (1838–1913)  and Evelyn Byrd Moale (1847–1916), the daughter of William Armistead Moale (1800–1880) of Baltimore, Maryland, who was a descendant of the Carter and Byrd families of Virginia. Burden's grandfather was an owner of Burden Iron Works, which was founded by his great-grandfather, Henry Burden (1791–1871).

His maternal grandparents were Florence Adele Vanderbilt Twombly, a granddaughter of Commodore Cornelius Vanderbilt, and Hamilton McKown Twombly.

Burden attended and graduated from Harvard College in 1927. He also attended special aviation courses at the Massachusetts Institute of Technology.

Career
In 1927, after his graduation from Harvard, he was hired as an aviation research analyst at Brown Brothers Harriman & Co. From 1932 to 1938, he worked for Scudder, Stevens and Clark. In 1935, while at Scudder, he was elected a director of the United Air Lines Transport Corporation. In 1940, he was named to the board of trustees of Central Hanover Bank & Trust Co.

During World War II, he was Special Assistant for Research and Development to the Secretary of the Air Force. In 1947, after the War, he joined Smith, Barney & Co. as an aviation consultant.

In 1949, he founded William A. M. Burden & Co., an investment company intended to pool and manage his family's money. The firm is considered a pioneer in the "family office" space and continues to this day, managing half a billion dollars as of 1998. Unlike other Vanderbilt descendants, Burden "saw the fortune dissipating into smaller and smaller chunks and was determined to protect his own progeny."

In 1959, he was nominated by President Dwight D. Eisenhower as U.S. Ambassador to Belgium. He served in this role from 1959 until 1961.

Burden served on the board of trustees of the Museum of Modern Art in New York City from 1943 until his death. He was elected President of the Board in 1953, succeeding Nelson Rockefeller, who resigned to accept appointment as Under Secretary of the U.S. Department of Health, Education and Welfare. Burden resigned as president in 1959, to become Ambassador, and was succeeded by Blanchette Ferry Rockefeller, the wife of John D. Rockefeller III. He resumed the presidency again afterwards from 1961 until 1965. He donated works to be auctioned off for the Museum, including Paul Cézanne's Apples, in 1960. He also served as a trustee of Columbia University, a member of the board of the Smithsonian Institution, director of the Council on Foreign Relations, chairman of the Institute for Defense Analysis.

Residence
In the 1940s, Burden and his wife commissioned Wallace K. Harrison, an architect who was involved in the design of Rockefeller Center, the Museum of Modern Art, and the United Nations Building in New York, as well as Isamu Noguchi, the artist, to design a summer home for them in Maine. The original 4,500 square-foot house, known as "Sea Change," was completed in 1947 and in the early 1980s, an indoor swimming pool was added bringing the home up to 6,500-square-feet.

Personal life
On February 16, 1931, he was married to Margaret Livingston Partridge (1909–1996), at Saint Thomas Church in Manhattan. She was a daughter of sculptor William Ordway Partridge (1861–1930) and a niece of Bishop Sidney Catlin Partridge. On her mother's side, she was a granddaughter of William H. Wetmore and great-great-great-granddaughter of Chancellor Robert L. Livingston. Together, they were the parents of four sons:

 * William Armistead Moale Burden III (1931–1962), a reporter for The Washington Post who was married to Leslie Lepington Hamilton (1932–1998), granddaughter of Bishop Franklin Hamilton, in 1951.
 * Robert Livingston Burden (1934–1974), who was the head of the science department at Thomas Jefferson School in St. Louis.
 * Hamilton Twombly Burden (1937–2015), who was an author.
 * Ordway Partridge Burden (b. 1944), who married Jean Elizabeth (née Poor) Lynch, a granddaughter of Walter E. Poor, founder of the Sylvania Electric Company, in 1991.

Burden died on October 10, 1984.

Legacy
In 1971, together with his mother and brother, he donated Burden Auditorium to Harvard Business School in honor of his father, William A. M. Burden Sr., who graduated from Harvard in 1900, and his son, William A. M. Burden III, who graduated from Harvard in 1953 and Harvard Business School in 1955, both of whom died young. The hall was designed by Lincoln Center architect Philip Johnson.

His estate in Mount Kisco, New York was later purchased and subdivided in the 2000s.

His granddaughter, Wendy Burden, wrote a memoir entitled Dead End Gene Pool about her family, including her grandfather William, who in the waning years of his life “had a bathroom and dressing room lined with two inches of foam to avoid bruising himself. Once, while visiting Paris, he had a private secretary in New York order seven new Mercedes-Benzes — one to be delivered within a few hours."

After his death, in 1985 his widow donated "eleven masterworks" from his estate to the Museum of Modern Art. Paintings included:

Published works

 * The Struggle for Airways in Latin America (1943), Council on Foreign Relations.
 * Peggy and I: A Life Too Busy For a Dull Moment (1982) 345 pp.

title: William A. M. Burden


text:
Pierrefonds FC

Association de Soccer de Pierrefonds is a Canadian women's semi-professional soccer club based in Pierrefonds, Quebec that plays in Ligue1 Québec. Their L1QC team operates under the name Pierrefonds FC.

History
Established as a youth soccer club, the club had an established program for many years, including a senior team in the Ligue de Soccer Elite Quebec, Quebec's top amateur division.

The club announced that they would enter a team in the women's division of the semi-professional Première Ligue de soccer du Québec. They had originally planned to enter the team into the league a couple of years earlier, however, floods had damaged their fields, requiring them to delay their entry. However, the COVID-19 pandemic interrupted the 2020 season and upon the league's re-start, the club decided to not participate in 2020.

The club has a working arrangement with top-tier Spanish club Valencia CF. In 2020, Pierrefonds received their national license recognition from the Canadian Soccer Association. In 2020, the club decided to merge with Club de Soccer Dollard to form Force FC, although the PLSQ club is still expected to be under the name Pierrefonds.

In their first season in 2021, they began the year winning their first five games, ultimately finishing fourth in the division.

Seasons
Women

title: Pierrefonds FC


text:
Cookbook:Potato Pancakes

| Cuisine of Israel

Ingredients

 * 4 large potatoes
 * 1 medium onion
 * 1 egg, beaten
 * 2 tablespoons Matzo meal, corn meal, or flour
 * Salt to taste
 * 2 tablespoons vegetable oil
 * Applesauce and/or sour cream

Procedure

 * 1) Peel and grate potatoes and onion.
 * 2) Mix potato and onion with egg, matzo meal, and salt.
 * 3) Heat oil in a 10-inch pan over medium heat until it is quite hot. Drop 1–2 tablespoons of the potato mixture onto the pan per pancake. Turn once to allow both sides to fry.
 * 4) Serve with applesauce and/or sour cream as a topping.

title: Cookbook:Potato Pancakes


text:
User:Bluehood 1

My name is Conor Kane. I'm from London and am currently at Stirling university, at the moment I am in the works of making a short student film for the Stirling film society called AirTV.

title: User:Bluehood 1


text:
Guo Tu

Guo Tu (died 205), courtesy name Gongze, was an official and adviser serving under the warlords Yuan Shao and Yuan Tan during the late Eastern Han dynasty of China.

Life
Guo Tu was from Yingchuan Commandery (潁川郡), which is around present-day Xuchang, Henan. He started his career as a subordinate of Han Fu, the Governor of Ji Province. In 191, Guo Tu, along with Xin Ping, Xun Chen and others, managed to convince Han Fu to relinquish his governorship to the warlord Yuan Shao. Guo Tu then became an adviser to Yuan Shao.

In 195, the Han Emperor Xian called for help from the lords, pleading them to escort him and the imperial court away from the tyrants Li Jue and Guo Si. Yuan Shao's strategist Ju Shou advised Yuan Shao to take the emperor in and use him as a puppet to control and manipulate the other warlords. Just as Yuan Shao was about to agree and send out an army to rescue the Emperor, Guo Tu objected and said Emperor Xian would control him, not the other way round. Yuan Shao was persuaded by it and did not rescue the Emperor. As a result, the much less powerful warlord Cao Cao took Emperor Xian into his capital of Xuchang and issued many edicts in the Emperor's name, including a harshly worded edict condemning Yuan Shao for conquering Han provinces from other governors.

During the Battle of Boma in 200, Yuan Shao ordered Yan Liang, with Guo Tu and Chunyu Qiong providing support, to lead troops to attack Boma (白馬; near present-day Hua County, Henan), which was defended by Liu Yan (劉延), a military officer under Yuan Shao's rival Cao Cao. Yan Liang lost the battle and was slain by Guan Yu, who was then a subordinate of Cao Cao.

Later that year, during the Battle of Guandu, Cao Cao led a successful raid on Yuan Shao's supply depot at Wuchao (烏巢) and set fire to the supplies. Zhang He and Gao Lan (高覽), two of Yuan Shao's officers, wanted to lead troops to attack Cao Cao at Wuchao and salvage whatever supplies they could. However, Guo Tu strongly objected to this plan and proposed that they attack Cao Cao's main camp instead to divert Cao Cao's attention away from Wuchao. Yuan Shao heeded Guo Tu's advice and ordered Zhang He and Gao Lan to lead troops to attack Cao Cao's main camp. When news reached Yuan Shao that Zhang He and Gao Lan had failed to capture Cao Cao's main camp, Guo Tu became fearful because his idea had gone wrong. He then accused Zhang He and Gao Lan of not doing their best because they were planning to defect. After Zhang He and Gao Lan heard about it, they were so angry that they led their troops and defected to Cao Cao's side.

Shen Pei's two sons were captured by Cao Cao's forces during the Battle of Guandu. After the battle, Meng Dai (孟岱), one of Yuan Shao's subordinates, slandered Shen Pei in front of Yuan Shao. Guo Tu and Xin Ping agreed with what Meng Dai said, so Yuan Shao removed Shen Pei from his command in Ye city and replaced him with Meng Dai.

In 202, following Yuan Shao's death, his subordinates became polarised into two camps because Yuan Shao did not clearly designate one of his sons as his successor. In one camp, Pang Ji, Shen Pei and others supported Yuan Shang and wanted him to be the new Governor of Ji Province. In the other camp, Xin Ping, Guo Tu and others supported Yuan Tan, Yuan Shao's eldest son. Pang Ji and Shen Pei feared that Yuan Tan would harm them if he came to power so they lied that Yuan Shao had named Yuan Shang as his successor on his deathbed. Yuan Tan retreated to Liyang County (黎陽縣; present-day Xun County, Henan) and appointed himself General of Chariots and Cavalry (車騎將軍) there.

Internal conflict soon broke out between Yuan Shang and Yuan Tan, but they cooperated when Cao Cao led his forces to attack them. After Cao Cao retreated, the Yuan brothers started fighting again for control over northern China. In 205, Cao Cao defeated Yuan Tan at the Battle of Nanpi and eliminated him, along with Guo Tu and his other subordinates.

title: Guo Tu


text:
Cyril Dimon

Cyril Dimon (died 4 January 2005) was an Australian rugby league referee. Dimon began his refereeing career in the Newtown District Junior Rugby League. He was subsequently graded to referee in the New South Wales Rugby League (NSWRL). He refereed nine first grade matches in 1961–1962. In his first game of 1962, Dimon was criticised by the players for the large number of scrum penalties. Dimon dismissed both hookers from the game. In 1963 Dimon, by then a touch judge, took over a first grade match from Col Pearce when Pearce damaged a knee tendon.

In July 1963, Dimon was a touch judge in the Test match between South Africa and Australia.

title: Cyril Dimon


text:
biomodification

Noun

 * 1) The process of modifying a biological organism using either genetic or mechanical means.
 * 2) The modification of a material by biological (enzymatic or genetic) means

title: biomodification


text:
Wikipedia:Articles for deletion/Cityblis

The result was delete.  A  Train talk 08:30, 15 October 2017 (UTC)

Cityblis

 * – ( View AfD View log  Stats )

I have previously objected to the deletion, but the website is gone now so the page is completely useless. iopq (talk) 09:06, 21 September 2017 (UTC)
 * Note: This debate has been included in the list of Internet-related deletion discussions.  M assiveYR   ♠  10:44, 21 September 2017 (UTC)
 * Note: This debate has been included in the list of Websites-related deletion discussions.  M assiveYR   ♠  10:44, 21 September 2017 (UTC)
 * Note: This debate has been included in the list of Sweden-related deletion discussions.  M assiveYR   ♠  10:44, 21 September 2017 (UTC)

We don't delete biographies because people die, we don't delete articles about buildings because they're torn down, and we don't delete articles about companies because they no longer exist. Whether or not the company is no longer active is not relevant, only if they were notable and verifiable. History is important too. /Julle (talk) 15:45, 26 September 2017 (UTC)

 * It wasn't particularly notable when it existed either. -iopq (talk) 19:52, 28 September 2017 (UTC)

 Relisted to generate a more thorough discussion and clearer consensus.

Please add new comments below this notice. Thanks,  Anarchyte  ( work  |  talk )  06:33, 29 September 2017 (UTC)  Relisted to generate a more thorough discussion and clearer consensus. Relisting comment: Noting that if kept/closed as no consensus, editing will have to be done to reflect its current status.
 * Automated comment: This AfD was not correctly transcluded to the log (step 3). I have transcluded it to Articles for deletion/Log/2017 September 29.  —cyberbot I   Talk to my owner :Online 09:42, 29 September 2017 (UTC)

Please add new comments below this notice. Thanks, ansh 666 07:34, 7 October 2017 (UTC)
 * Delete: A WP:SPA article about an online company. The article text and references describe its proposition and site features at start-up without making substantial claim to notability. There was a previous WP:PROD by an IP, which was rightly objected as the rationale was invalid: "This entity is referencing its, presumably, self-created article in unsolicited spam email. Presumably, this is to legitimize itself by reference. Propose deletion." Beyond the initial start-up announcement and some slightly later announcement coverage I am seeing nothing in terms of in-depth coverage of the platform or, for that matter, for its presumed demise. Fails WP:CORPDEPTH, WP:NWEB. AllyD (talk) 14:58, 7 October 2017 (UTC)
 * Weak keep WP:CORPDEPTH has been cited, but it says "The depth of coverage of the subject by the source must be considered. If the depth of coverage is not substantial, then multiple[2] independent sources should be cited to establish notability. Trivial or incidental coverage of a subject is not sufficient to establish notability." This subject meets that. Capitals00 (talk) 16:53, 8 October 2017 (UTC)
 * Delete doesn't meet WP:GNG. The coverage is all of the launch (so not sustained), and largely in blogs/trade press websites that are now defunct. power~enwiki ( π,  ν ) 15:47, 10 October 2017 (UTC)
 * Delete -- 100% advertorial content starting with the lead: "...interactive, multi-platform social eCommerce website...". Does not meet WP:NWEB / WP:CORPDEPTH either. K.e.coffman (talk) 04:48, 14 October 2017 (UTC)


text:
User:FollowingAmrKhaled

It is time to reform our religion, so that it can take its place in the modern world, rather than clinging to ways that forever prevent us from achieving enlightenment.

title: User:FollowingAmrKhaled


text:
restyle

Verb

 * 1) To refashion something in a new style or shape in order to fit another purpose.
 * 2) To give another name, designation or title to something.

title: restyle


text:
Aros/Developer/Docs/Examples/HelloWorld

Description
This is an example 'Hello World' program to demonstrate the basics of using c under AROS

The Code
Save this as a plain text file named 'helloworld.c'. Inside AROS you can do this by opening a shell (e.g. hit RightAROSKey* + w in Wanderer), typing 'edit helloworld.c', entering the code above, hit RightAROSKey + w to save it, hit RightAROSKey + q to quit editing.

(*on most keyboards RightAROSKey is the Windows key on the right side)

Making It Compile
If you've created 'helloworld.c' inside AROS, compile it with:

gcc -o helloworld helloworld.c

To cross-compile it from linux, provided you've got a proper SDK installed, making the executable helloworld program on AROS-linux-hosted takes this step:

i386-aros-gcc -o helloworld helloworld.c

In both cases, the result will be an executeable called 'helloworld', which should run under AROS.

Running It
In case you've cross-compiled from linux, move the executable into the AROS-linux-hosted installation tree, e.g. like this (assuming 'AROS/' is the root directory of AROS-linux-hosted, which corresponds to the 'System' partition inside AROS):

> mv helloworld AROS/

Inside AROS, find and run your executable via Wanderer, in our case: double-click 'System' icon on Wanderer desktop, double-click 'helloworld' icon (you might have to hold right mouse button and select 'Window -> View -> All Files' to see it). A window will be opened displaying the program's output.

Or, to run it from AROS' shell, assuming you are still in the same directory where you compiled it, just type its name:

System:> helloworld

title: Aros/Developer/Docs/Examples/HelloWorld


text:
PHP Programming/The foreach Loop

The code
or

Analysis
The foreach loop is a special form of the standard for loop. The example above will print all the values of $array. The foreach structure is a convenient way to loop through an array.

Simple foreach statement
Foreach loops are useful when dealing with an array indexed with arbitrary keys (e.g. non-numeric ones):

To use the classical for structure, you'd have to write:

Basically, an array value can be accessed only from its key: to make sure you get all the values, you first have to make a list of all the existings keys, then grab all the corresponding values. The access to first array value, the previous example does the following steps:

The foreach structure does all the groundwork for you:

Note how the latter example is easier to read (and write). Both will output: My House My Car My Lab

foreach with key values
If you need to use the array's keys in the body of your loop, just add the variable as in the following statement. The phrase '$myKey => $value' makes the value of the key accessible:

Note that this is very useful when constructing a dropdown list in HTML. You can use a foreach-loop to have the $myKey variable inserted into the <tt>value="..."</tt> part and the <tt>$value</tt> as the actual text.

This form mimics the way we used custom keys for $array elements. It will not only assign the elements of $array to $someVar, but also assign the keys of those elements to $i.

Note that, if you change the assigned variable inside the <tt>foreach</tt> loop, the change will not be reflected to the array. Therefore, if you need to change elements of the array you need to change them by using the array key. Example:

title: PHP Programming/The foreach Loop


text:
Talk:Countdown (2019 film)

Spoiller alert. Too smart for her own good
It is reaalisd that the one way to beat Satan/the Demon is if someone dies even one second early. Quinn Harris succeeds so they win. BUT she is revived so Satan/the Demon could argue that she was not really dead so she cheated. The game starts again.(<IP_ADDRESS> (talk) 05:20, 22 January 2020 (UTC))

title: Talk:Countdown (2019 film)


text:
Talk:2020 United Kingdom school exam grading controversy

Merger proposal: algorithm article
Propose to merge Ofqual exam results algorithm here. Much overlap between the two articles. --Wire723 (talk) 11:26, 20 August 2020 (UTC)
 * Support - as that would make a good sub-topic for this article. -- DeFacto (talk). 11:42, 20 August 2020 (UTC)
 * Oppose - I've changed my mind now, seeing the direction that Ofqual exam results algorithm has gone in, -- DeFacto (talk). 15:59, 24 August 2020 (UTC)

 * Too soon Thanks to for his excellent copy edit. I was penning the article last night, as new aspects kept emerging- the subject is still so unstable. The full nature of the algorithm is no released (I think) and it has not yet been described in Hansard. I would prefer to keep thethis article just describing the politics, and leave the technical aspects of the algorithm over there at arms length. Call me pessimistic but this article is likely to expand greatly over the next three or so years. Just today we have had This sleaze and have have hints of universities going bankrupt. There is an article waiting to be written on Moderation techniques used in A level examining pre 2019. My role was to get some facts onto WP -quickly when thousands could be searching-and will happily watch as the text is re-positioned but my advice is to wait. --ClemRutter (talk) 14:20, 20 August 2020 (UTC)
 * Support merge. This is essentially the same topic - the controversy was caused by the use of the algorithm. Fences  &  Windows  23:00, 20 August 2020 (UTC)
 * Support as what is known about the algorithm should be explained in enough detail in this page for the controversy to fully make sense. Andysmith248 (talk) 23:09, 20 August 2020 (UTC)
 * Support Comment above is slightly WP:CRYSTAL, but they're probably right long term. imo one article for now. Split again if need be in a few years. Way too much overlap for now. We're just ending up with two underdeveloped articles, and anything we add to one there's a good chance has to be added to the other too... ProcrastinatingReader (talk) 23:57, 20 August 2020 (UTC)
 * Oppose That article has developed independently and focused more on the technical nature. Given the changes, it is no longer suitable for merge imo. ProcrastinatingReader (talk) 12:30, 23 August 2020 (UTC)
 * Support Well I am not biased in this regard. Probably many people will type exam controversy rather than Ofqual exam results algorithm to get the information. I appreciate, , and  for the fine work in expanding this article. Abishe (talk) 15:22, 21 August 2020 (UTC)
 * Oppose Although I proposed the move, now that the algorithm article has become more detailed and technical it will no longer fit well as a section here. --Wire723 (talk) 15:27, 24 August 2020 (UTC)

It is probably good that the articles didn't get merged (yet). It is sad that the discussion in both articles is written as if by competing interest groups. Issues are discussed like on average would the algorithm have penalized state school students. Yet, the important technical fact which was discussed at the time in a few articles and well-understood wasn't about whether particular *groups* were treated unfairly. The issue was that the algorithm produced an exact copy of previous years' grade distribution for each classroom. On the level of grade distributions (averages etc etc) this is pretty unassailable, but the issue is what it does for *each individual student.* If in previous years the distribution in such-and-such school for Maths is A*, A, B, D, D, D then the fourth-best student in that class *will* get a D by the algorithm. Even if the poor kid worked his/her heart out to deserve an A*.

It would be like having a criminal justice system where the same number of people are convicted to life imprisonment in each town as had been the year before. The judges just rank the population by criminality and the twelfth worst criminal gets life in prison this year, if the twelfth-worst criminal got life in prison last year. No matter that *this* year in this small village, the twelfth worst criminal only committed littering.

Please someone try to deal with this, the notion that a system which was built to be politically unassailable from the statistics, would have been horribly unfair for individual students. That point is totally missed here, where all the discussion is on the things the algorithm would have done well, and the actual algorithm article misses the point of what was wrong now! Createangelos (talk) 22:31, 15 September 2021 (UTC)

Widen to include Scottish Highers?
Almost the same algorithm and controversy played out earlier in the month in Scotland and many sources discuss them together.. 2020 United Kingdom school examinations grading controversies would cover it. Fences &  Windows  23:11, 20 August 2020 (UTC)
 * Support: I was going to suggest 2020 United Kingdom school examination grading controversy. And BTECS should be included too. . TSventon (talk) 23:29, 20 August 2020 (UTC)
 * Support the singular if anything. Pretty much all the same issue, commonly known as a single fiasco, even though it has multiple components. I don't think calling it a 'controversy' is accurate, and it's not really what any RS use. Fiasco is definitely the most common term amongst sources. Hence, per these reasons and the article title policy, I think the best title is 2020 United Kingdom exams fiasco. ProcrastinatingReader (talk) 23:56, 20 August 2020 (UTC)
 * Oppose for now: I'm not sure at the moment as the article doesn't really cover Wales or Northern Ireland either. The nations are all different jurisdictions, have their own qualification regulators and policies. I'd say keep them separate for now, but do cover all secondary education qualifications in England, including BTECS, too.
 * And as the article covers more aspects of the problem of deciding qualifications during the Covid lock-down than just the controversy that resulted after the A level results were announced, I think we should rename it to something like: Effect of the Covid-19 lockdown on qualification grading in England. -- DeFacto (talk). 06:26, 21 August 2020 (UTC)
 * Not even close to a common/recognisable name. 2020 United Kingdom education shutdown already exists for stuff outside this article's scope in that regard. The title is also a political opinion. ProcrastinatingReader (talk) 15:16, 21 August 2020 (UTC)
 * that's why I said "something like". Please feel free suggest an alternative, snappier and recognisable name, that will neutrally capture the essence of this article, which about how the grades were decided as well as how they were received and the aftermath. -- DeFacto (talk). 15:35, 21 August 2020 (UTC)
 * As I said above, 2020 United Kingdom exams fiasco, it is the common name reported by media sources and most recognisable, it is accurate, and it is neutral. ProcrastinatingReader (talk) 12:32, 23 August 2020 (UTC)
 * Except that the article isn't just about the event that some media outlets editorialised as a 'fiasco'. That's just a small part of the content, so that title becomes even more inappropriate. What we need is a title that encapsulates all of the content, which is now about how the UK dealt with the processing of secondary school qualifications in 2020, due to all exams being cancelled because of Covid-19. -- DeFacto (talk). 18:58, 23 August 2020 (UTC)
 * It's better to structure it around the fiasco, otherwise this topic likely wouldn't even be notable enough outside of 2020 United Kingdom education shutdown. Most RS only reported on it due to it turning into a mess. How I imagine the article looking, once developed, is (roughly): Background (what the exams are, who takes them, when, and the government cancelling them due to pandemic), what happened (the fiasco, the criticism, reporting, legal cases, hardline stance, u-turns), aftermath as it happens/is currently being discussed (Select Committee review, which will possibly result in a complete restructuring of Ofqual, effect on universities admissions numbers and intakes, effect on 2021 cohort, social ladder discussions being raised, etc...), obviously broken down into further sections/sub-sections. Hence I don't think my proposed title is bad. ProcrastinatingReader (talk) 19:21, 23 August 2020 (UTC)
 * I disagree that this story wouldn't be notable if it wasn't for the way the algorithm turned out. This story started when the reliable sources reported that exams were cancelled in March. And exam results always make the news, even when uneventful. That these results led to massive grade inflation wouldn't have gone unreported. This story would have run for days even if the algorithm had worked as intended. The algorithm failure shouldn't be used as an excuse to hijack the article. -- DeFacto (talk). 20:30, 23 August 2020 (UTC)
 * , perhaps you may wish to reconsider your approach to engaging in articles. In other words, perhaps start... writing, instead of just reverting and stonewalling, especially given history? Frankly, I can't be bothered to edit war with you, but since this is the 3rd article I've encountered you on and each time all you seem to do is revert and disappear, I figure it's a good idea to suggest that if you indiscriminately disagree with everything someone else writes, and mass-revert, you might either (a) want to incrementally improve instead or (b) start writing yourself. Frankly, it just makes others not want to participate on articles you insert yourself into, and I'm personally past that point. The only result is that articles will remain undeveloped. ProcrastinatingReader (talk) 00:13, 28 August 2020 (UTC)
 * , as I didn't recognise the picture you painted, I went to the trouble of making a tally of our respective edits to this article. By my count, 74% of my edits made net increases to the article content, yet only 50% of yours did. I'd suggest that if you are going to throw allegations about another editor, that you: a) check your facts first, b) do it on their talkpage and not that of the article.
 * And perhaps, rather than whinging if someone doesn't fully agree with content you've added, you could open a section on it in the talkpage, and not make unwarranted and unsubstantiated allegations about the behaviour of another editor. -- DeFacto (talk). 10:09, 28 August 2020 (UTC)
 * On the note of them being different, yes, technically each devolved government took their own decision, since education is a devolved matter. In practice, they all followed exactly the same plan/decisions as the UK government did for England, and ended up with the same mess. Only Scotland has different examinations, the rest have the same qualifications and exam bodies (and probably used the same algorithm). It's silly to have 4 separate articles for this, and copy+paste the content in here word-for-word into each, replacing simply the country names. ProcrastinatingReader (talk) 19:51, 23 August 2020 (UTC)
 * Replace the word "controversy" with "uproar" seems good. I have no idea how to change it myself though. <IP_ADDRESS> (talk) 11:06, 23 August 2020 (UTC)
 * Replace the word "controversy" with "uproar" seems good. I have no idea how to change it myself though. <IP_ADDRESS> (talk) 11:06, 23 August 2020 (UTC)

Reboot
This discussion seems to have petered out without conclusion last year. It still strikes me as strange that the article title only refers to GCSE and A-levels when the devolved nations, particularly Scotland, had the same issue with Highers and so on. The article also now contains an improvement tag suggesting that we increase coverage of the controversy as it applies in the devolved nations, but improving the article to cover the situation in Scotland (say) then further draws the article content away from the title. From the discussion above, clearly "controversy" and "uproar" are far too far, but looking back now, it still was and is controversial, and it still is an illustrative lesson of the perils of the use of algorithms by government, so I'd suggest we steer away from just classifying it as just a sub-story of the educational response to COVID in the UK. As such, I'd be keen on moving the article to "2020 United Kingdom examination grading controversy", omitting 'school' because A-levels are not taken exclusively by students in school, but can be taken independently, in colleges, and other educational institutions. —Tom Morris (talk) 15:36, 28 December 2021 (UTC)

BTEC results
BTECs seem to have passed under the radar! BTECs Students wishing to follow a vocational route take BTEC courses, Level 1 & 2 lead to GCSEs, and Level 3 lead to A levels. The Level 3 grade was issued, withdrawn and reissued- level 2 weren't issued but were remarked. So what was the standardisation technique? How did Pearson get the contract?--ClemRutter (talk) 17:45, 25 August 2020 (UTC)
 * The 'Vocational qualifications' subsection at Ofqual exam results algorithm could be moved here. The history re Pearson is outlined at General Certificate of Secondary Education. --Wire723 (talk) 18:55, 25 August 2020 (UTC)

Assessment
This is more than a Start. I have upped Schools to C- I don't think I can justify a B, as there are issues not addressed. Needs to be discussed-any opinions?--ClemRutter (talk) 07:50, 15 June 2021 (UTC)

Financial implications
The Guardian raises the issue of examination fee rebates. This give some tantalising details of the costs to school of an A level entry- and the cost to teachers time of continual assessment- both in 2020 and 2021. 2021 is out of scope for this article. Quo vadis magister? --ClemRutter (talk) 08:03, 15 June 2021 (UTC)

Requested move 27 August 2022

The result of the move request was: moved. For increasing clarity and also being more inclusive in scope. (closed by non-admin page mover) — Ceso femmuin mbolgaig mbung, mellohi! (投稿) 22:17, 3 September 2022 (UTC)

2020 UK GCSE and A-Level grading controversy → 2020 United Kingdom school exam grading controversy – Fewer acronyms and more clear to international readers as per WP:NAME. Arcahaeoindris (talk) 21:28, 27 August 2022 (UTC)

 * Sounds sensible to me, especially since it also includes BTECs. Richard Nevell (talk) 23:46, 27 August 2022 (UTC)


text:
Guy Kingsford

Guy Duncan Kingsford (September 30, 1911 – November 9, 1986) was an English-born American film, television, and radio actor.

Biography
Born in Redhill, Surrey in the United Kingdom, he was the son of British actor Walter Kingsford who moved with his wife to New York City.

In 1938 he was in the theatrical production Once is Enough.

He was in the US Army during World War II. He performed in a vaudeville-style variety show at Camp Sibert alongside other enlisted industry professionals. According to Sidney Skolsky, when Kingsford was traveling in Berlin, Germany that same year as part of a touring company, the Reich Film Chamber tried to recruit him to act in a propaganda film. In the role, he would have portrayed a "so-called "patriot" who would turn over United States military secrets to the German High Command." Kingsford was offered $3,000 up front and an additional $15,000 upon completion of the film. Kingsford sarcastically asked the recruiter from the Chamber if he had checked with the American Embassy prior to recruiting American actors for the film. The recruiter left and never contacted Kingsford again.

In the 1940s he was a voice actor in Lux Radio Theater shows. He also owned a home, with his sister, in Luxembourg along the Saar River. In 1943, he co-starred in Silk Hat Harry at the Music Box Theater in Los Angeles. That same year, while filming Sahara, he was almost injured by a bayonet but was protected by a package of war bonds in his shirt. He appears on a lobby card promoting the film Escort Girl.

In 1953, he played a Roman soldier in Salome.

He retired in 1960 and died in Encino, California, in 1986.

Filmography

 * The Headline Woman (1935), as a taxi driver
 * Happy Go Lucky (1936)
 * Escort Girl (1941)
 * That Hamilton Woman (1941)
 * Stagecoach Express (1942)
 * Texas to Bataan (1942)
 * Law of the Jungle (1942)
 * House of Errors (1942)
 * Sahara (1943)
 * Paris After Dark (1943)
 * The Phantom (1943)
 * Second Chance (1943)
 * The Lone Wolf in London (1947)
 * Elephant Stampede (1951)
 * Fort Vengeance (1953)
 * Moonfleet (1955)
 * The Night Holds Terror (1955)
 * Teen-Age Crime Wave (1955)
 * Inside Detroit (1956)
 * The Decks Ran Red (1958)
 * Highway Patrol (1955)

title: Guy Kingsford


text:
User:Deepak Amera/sandbox

Deepak Amera was born on 25th september 1988 in Indore, India. He was elder son of Mr J B S Amera and Shobha Amera.

title: User:Deepak Amera/sandbox