text:
Glendale Community College (California)

Glendale Community College (GCC) is a public community college in Glendale, California.

History
The college was founded as Glendale Junior College in 1927, to serve the Glendale Union High School District which at the time included La Crescenta, Glendale, and Tujunga. From 1927 to 1929 classes were held in the buildings of Glendale Union High School at Broadway and Verdugo in the City of Glendale. In 1929 the junior college moved to the Harvard School plant of the Glendale Union High School District where it remained until 1937. In this year a new plant, part of the present one, was completed and occupied. The year before, in 1936, the Glendale Junior College District was dissolved as such and became a part of the new Glendale Unified School District. The name of the school was changed to Glendale College in 1944. On July 1, 1970, Glendale College became a part of the Glendale Junior College District. On April 20, 1971, the Board of Education adopted a resolution changing the District name to Glendale Community College District.

On November 4, 1980, Glendale voters approved a measure to establish separate Boards, with the new board taking office in April 1981. The separation resulted in the creation of a board of trustees solely responsible for the governance of the Glendale Community College District. In 1936, 25 acre were acquired for the present site of the college.

Campus
The campus now consists of 100 acre and 15 permanent buildings. It is located on the slopes of the San Rafael Hills overlooking the valleys in the Glendale area.

Glendale Community College District
The Glendale Community College District is a constituent community college district of the California Community College System (CCCS), whose only college is GCC.

It is governed by a 5-member elected Board of Trustees, elected by geographical district effective in 2017. Pursuant to their authority, they have promulgated policies and administrative regulations for the administration of the district and GCC and serves Glendale and La Crescenta-Montrose.

The elections for the Glendale Community College Board of Trustees is held at the same day the Glendale City Council and Glendale Unified School District Board of Education, which took place on a first Tuesday after the first Monday in April of odd-numbered years. Effective with the March 2020 election, the elections are held on a first Tuesday after the first Monday during the California Primary Election.

Academics
The college has an open admissions policy and offers credit for life experiences. It is accredited by the Accrediting Commission for Community and Junior Colleges (ACCJC).

Athletics
The college athletic teams are nicknamed the Vaqueros (men) or Lady Vaqueros (women). Glendale currently fields eight men's and eight women's varsity teams. It competes as a member of the California Community College Athletic Association (CCCAA) in the Western State Conference (WSC) for all sports except football, which competes in Southern California Football Association (SCFA).

Blake Gailen played baseball for Glendale Community College, graduating in 2005, and was All-Western State Conference as a freshman and All-Southern California Team as a sophomore. Future major leaguer Ryan Sherriff pitched for the college baseball team as the team's ace in 2011, and was named 2011 First Team All-Western State Conference South Division.

Alumni

 * Mark Caguioa, professional basketball player
 * Glenn Corbett, actor
 * Marian Cleeves Diamond, Professor Emeritus of Anatomy & Neuroanatomy at University of California, Berkeley, taught at UCB for over 50 years; one of the founders of modern neuroscience
 * Angie Dickinson, actress, award winner, philanthropist, Police Woman (TV), Over 50 movies, author and fitness & health expert.
 * Marco Estrada, pitcher Toronto Blue Jays
 * Cathy Ferguson, two-time Olympic gold medalist swimmer
 * Bob Gagliano, American football player
 * Blake Gailen (born 1985), American-Israeli professional baseball player
 * Beverly Garland, actress
 * Dan Harmon, television writer/producer; creator of Community and Rick and Morty.
 * Ron Lopez, football player
 * Hue Jackson, NFL coach
 * Donald D. Lorenzen (1920–80), LA City Council member, 1969–77
 * Masiela Lusha, actress
 * Eva Mendes, actress
 * Dick Moje, National Football League player
 * Ricky Ortiz, professional wrestler
 * Danielle Panabaker, actress
 * Kay Panabaker, actress, zoologist
 * Andy Reid, three-time Super Bowl-winning NFL coach
 * Freddy Sanchez, baseball player
 * Seann William Scott, actor
 * Ryan Seacrest, broadcaster, producer
 * Quincy "Schoolboy Q" Hanley, rapper
 * Ryan Sherriff (born 1990), Major League baseball pitcher for the St. Louis Cardinals
 * Lon Simmons, broadcaster
 * Juno Stover, two-time Olympic diving medalist; two-time AAU champion; two-time Pan-American Games medalist
 * Vic Tayback, actor
 * Erick Thohir, Indonesian businessman
 * Jordi Vilasuso, actor
 * Kyle Vincent, musician
 * Matt Whisenant, MLB baseball pitcher
 * Frank Wykoff, three-time Olympic gold medalist runner

In popular culture
Glendale Community College inspired the NBC show Community which premiered in the fall season of 2009. The show uses the fictional setting of Greendale Community College; the show's creator, Dan Harmon, has stated that the show was actually based on his experience attending Glendale Community College. Harmon describes the series as "flawed characters [coming into Greendale] and becoming unflawed by being in this place because it's been underestimated by the system around it."

title: Glendale Community College (California)


text: User talk:168.229.26.40

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

title: User talk:168.229.26.40


text:
Talk:The Ellen DeGeneres Show

VfD (2005)
For the February 2005 deletion debate, see Votes for deletion/The Ellen DeGeneres Show — Preceding unsigned comment added by Jni (talk • contribs) 16:20, 3 February 2005 (UTC)

Section
I think a criticsm section is a good idea. 1st one would be "My Crazy Dreams" is very similar to Oprah's "Wildest Dreams Come True". - Mike Beckham 04:20, 17 June 2006 (UTC)

Good idea, but I don't know how to go about writing it...why don't you try? Astro 3236 10:46, 25 August 2006 (UTC)

 * Done - Mike Beckham 12:03, 25 August 2006 (UTC)

Well done, but dont we need to cite sources for this kind of thing? No offence though. Astro 3236 15:42, 25 August 2006 (UTC)

 * Would be hard to find any, however it is visable similar. It is a hard one. - Mike Beckham 08:53, 16 September 2006 (UTC)

If no one can cite this criticism then it should be deleted. No matter how similar they are. --Shawn283 07:17, 19 September 2006 (UTC)

Season 4
Season 4's comin, so how should we put it into the article? It premiers Sept 4th. Astro 3236 12:17, 19 August 2006 (UTC)

 * I added some info while fixing parts of article. - Mike Beckham 12:03, 25 August 2006 (UTC)

Deletion of paragraph
This paragraph keeps getting deleted: ''The program is the continuation of two popular daytime television talk shows: The Rosie O'Donnell Show and The Caroline Rhea Show. The program is distributed by Warner Brothers, the distributors of the above two shows, and although the producers and cast are different, the basic premise of the show is the same. The program mixes in comedy, celebrity guests, and human interest stories, taking components from late night television and traditional daytime talk shows. ''

The source was the September 17, 2003 Hartford Courant article, which someone is objecting to because they can't find a link. It is not my responsibility to provide Lexis-Nexis access for everyone to check cites. The pull quote that proves this point follows:

Like new neighbors ready to spend an hour each day chatting over coffee, a new crop of daytime hosts is, as a whole, an improvement over the gossipy, mudslinging old ones.

The tide is turning slowly against the confrontational trash and more toward the brighter, lighter shows, with an emphasis on entertainment figures. ``The Ellen DeGeneres Show,'' which started last week (on WVIT, Channel 30, at 4 p.m.) fills a slot originated by Rosie O'Donnell and occupied last season by Caroline Rhea. DeGeneres continues their traditions with a kinder approach to stars, close rapport with her audience and a penchant for toys.

She also has two great things going for her -- a ready, dry wit and a wealth of Hollywood friends. Her first guest last week would have been a coup for any talk show day or night -- Jennifer Aniston, the ``Friends'' star. The entire second show was devoted to Justin Timberlake, who says he was charmed by DeGeneres' videotape inviting him on.

As natural and nice as she is, there are areas she doesn't touch, possibly because she's still smarting from the overkill that greeted her public coming-out on her sitcom. Unlike most talk-show hosts, she is loath to talk about herself or her personal life. She has no stories about raising kids.'' Please discuss this, in the talk page, before reverting any further. Thank you. Calwatch 19:46, 16 September 2006 (UTC)

 * Ellen, Rosie, and Caroline are syndicated. The passage you stated (for WVIT) does not imply a succession, it only happens that WVIT has found the same network and time slot for the 3 shows. In New York, for example, Rosie O'Donnell and Caroline Rhea (which have direct succession: Rosie chose Caroline to be her successor) were both on WABC-TV. Rosie was on at 10:00 am, and I think Rhea's show was pushed back to the early morning to make way for The Wayne Brady Show at the 10:00 am slot. Ellen aired on WNBC at 10:00 am until this season, where it moved to 4:00 pm. Caroline and Rosie did not choose Ellen to be their successor. All you can say about Ellen and the two other shows are that they are similar. Tinlinkin 20:21, 16 September 2006 (UTC)

 * Which I did. Will that be acceptable to you? Calwatch 20:36, 16 September 2006 (UTC)

 * It's OK now, I guess. One other comment: if you cite a non-Web source, you should include the page number for reference. Tinlinkin 06:49, 17 September 2006 (UTC)

 * If I could find that on Lexis-Nexis, I would. Some articles do, others don't. Calwatch 23:57, 17 September 2006 (UTC)

Quotes
I really like Ellen DeGeneres—even way back from her stand-up days—but the quotes section doesn't fit in Wikipedia. They read like a GeoCities fansite. —SpyMagician 05:57, 8 May 2007 (UTC)
 * Sorry I reverted without posting here; just saw that you did that. They are part of the running of the show, part of the comedy. Maybe it could be expanded into a paragraph and just mention a few quotes. Otherwise, you are correct. bmitchelf•T•F 05:01, 9 May 2007 (UTC)
 * I just reverted your revert. They really need to be placed in some context.  Especially since these 'quotes' are simply one-word sound effects. —SpyMagician 05:04, 9 May 2007 (UTC)

Hillary Clinton
I read somewhere that Hillary Clinton will be coming on the show Sept. 4 and that Ellen will invite other presidential candidates. Donnabella 21:38, 25 August 2007 (UTC)

Fair use rationale for Image:Ellendegeneres.jpg
Image:Ellendegeneres.jpg is being used on this article. I notice the image page specifies that the image is being used under fair use but there is no explanation or rationale as to why its use in this Wikipedia article constitutes fair use. In addition to the boilerplate fair use template, you must also write out on the image description page a specific explanation or rationale for why using this image in each article is consistent with fair use.

Please go to the image description page and edit it to include a fair use rationale. Using one of the templates at Fair use rationale guideline is an easy way to ensure that your image is in compliance with Wikipedia policy, but remember that you must complete the template. Do not simply insert a blank template on an image page.

If there is other fair use media, consider checking that you have specified the fair use rationale on the other images used on this page. Note that any fair use images lacking such an explanation can be deleted one week after being tagged, as described on criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you.

BetacommandBot (talk) 21:23, 13 February 2008 (UTC)

Recurring themes
How about mentioning how they photoshop tony's head on a male model's body, also done with oprah, ellen, and ellen's mom's heads. I would but i don't know how. —Preceding unsigned comment added by 72.253.86.238 (talk) 23:18, 19 May 2009 (UTC)

Airing time
Shouldn't the airing time to in the very first paragraph or some place easy to find? Come on geniuses, you wiki people have time to fight over everything and edit each other out but no time to figure THAT out? We have international time slot and channels all figured out for crying out loud. —Preceding unsigned comment added by 208.120.25.229 (talk) 12:34, 10 February 2010 (UTC)

Rumors that James Corden will take over Ellen's Daytime show
https://www.msn.com/en-us/tv/news/james-corden-might-replace-ellen-degeneres-due-to-recent-claims/ar-BB17tKTj

Note there are reports that James Corden is named as a candidate to take over the Ellen Show as of August 2020. 2601:640:C600:3C20:CC6D:A69D:10C1:854 (talk) 00:56, 3 August 2020 (UTC)

You're missing a writer.
Kevin Leman II, the son of Kevin Leman, a child psychologist, is the head writer of the show. I think he should be included in this article. Curvebill (talk) 17:30, 11 February 2010 (UTC) Kevin Leman II was fired from the Ellen Show following serious allegations of sexual misconduct. I think if he is included in this article for his credit as former writer for the show, then he should also have mentioned his sexual misconduct allegations and subsequent firing as a result of those allegations.

Clarification
This show is actually called 'Ellen' and that is not even her first name. Her last name is correct...Degeneres. I propose that we discuss this topic to some extent. --#+3B 05:25, 8 October 2011 (UTC) — Preceding unsigned comment added by Bill Riojas Mclemore (talk • contribs)

Show ratings reference not supporting the text
The reference for 4 million episode viewers is not supported by the citation which says "Ellen DeGeneres (2,950,000 average viewers) rose 10% to a new season high of 2.2." It may be that the 4 million claimed viewers is obsolete. Damotclese (talk) 02:30, 10 September 2013 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 3 external links on The Ellen DeGeneres Show. 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:
 * Corrected formatting/usage for http://www.billboard.com/articles/news/6663074/pink-theme-song-ellen-degeneres-show
 * Added archive https://web.archive.org/web/20071221064005/http://www.startribune.com/entertainment/tv/11828236.html to http://www.startribune.com/entertainment/tv/11828236.html
 * Added tag to http://defamer.com/hollywood/hollywood-strikewatch/ellen-degeneres-speaks-only-in-exotic-birdcalls-as-a-gesture-of-writer-solidarity-321145.php
 * Corrected formatting/usage for http://ellen.warnerbros.com/?%7CWebsite

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 01:29, 27 December 2017 (UTC)

References corrupted
Just a note that as of June 1, 2019, references 51 through 98 have been corrupted, and replaced by references to what looks like local computer files. An editor needs to restore the correct references.

Revisions
AldezD, why do you keep deleting these revisions?? Wjrz nj forecast (talk) 00:54, 11 May 2020 (UTC) Wjrz nj forecast (talk) 00:55, 11 May 2020 (UTC)
 * Because they're unsourced WP:OR WP:CRYSTAL edits. AldezD (talk) 01:53, 11 May 2020 (UTC)

Past/Present Tense
Why is the show still listed as “is” instead of “was” with a note saying to not change the tense even though the show has ended? Calebh98 (talk) 03:05, 8 June 2022 (UTC)

 * Refer to MOS:TENSE. (CC) Tb hotch ™ 05:28, 30 January 2023 (UTC)

International Broadcast
As of 2023, the show doesn't air on ITV2 in Britain anymore. 2A00:23C6:4B42:F301:B877:1210:D354:2B2A (talk) 07:05, 26 June 2023 (UTC)

title: Talk:The Ellen DeGeneres Show


text:
Centrality

In graph theory and network analysis, indicators of centrality assign numbers or rankings to nodes within a graph corresponding to their network position. Applications include identifying the most influential person(s) in a social network, key infrastructure nodes in the Internet or urban networks, super-spreaders of disease, and brain networks. Centrality concepts were first developed in social network analysis, and many of the terms used to measure centrality reflect their sociological origin.

Definition and characterization of centrality indices
Centrality indices are answers to the question "What characterizes an important vertex?" The answer is given in terms of a real-valued function on the vertices of a graph, where the values produced are expected to provide a ranking which identifies the most important nodes.

The word "importance" has a wide number of meanings, leading to many different definitions of centrality. Two categorization schemes have been proposed. "Importance" can be conceived in relation to a type of flow or transfer across the network. This allows centralities to be classified by the type of flow they consider important. "Importance" can alternatively be conceived as involvement in the cohesiveness of the network. This allows centralities to be classified based on how they measure cohesiveness. Both of these approaches divide centralities in distinct categories. A further conclusion is that a centrality which is appropriate for one category will often "get it wrong" when applied to a different category.

Many, though not all, centrality measures effectively count the number of paths (also called walks) of some type going through a given vertex; the measures differ in how the relevant walks are defined and counted. Restricting consideration to this group allows for taxonomy which places many centralities on a spectrum from those concerned with walks of length one (degree centrality) to infinite walks (eigenvector centrality). Other centrality measures, such as betweenness centrality focus not just on overall connectedness but occupying positions that are pivotal to the network's connectivity.

Characterization by network flows
A network can be considered a description of the paths along which something flows. This allows a characterization based on the type of flow and the type of path encoded by the centrality. A flow can be based on transfers, where each indivisible item goes from one node to another, like a package delivery going from the delivery site to the client's house. A second case is serial duplication, in which an item is replicated so that both the source and the target have it. An example is the propagation of information through gossip, with the information being propagated in a private way and with both the source and the target nodes being informed at the end of the process. The last case is parallel duplication, with the item being duplicated to several links at the same time, like a radio broadcast which provides the same information to many listeners at once.

Likewise, the type of path can be constrained to geodesics (shortest paths), paths (no vertex is visited more than once), trails (vertices can be visited multiple times, no edge is traversed more than once), or walks (vertices and edges can be visited/traversed multiple times).

Characterization by walk structure
An alternative classification can be derived from how the centrality is constructed. This again splits into two classes. Centralities are either radial or medial. Radial centralities count walks which start/end from the given vertex. The degree and eigenvalue centralities are examples of radial centralities, counting the number of walks of length one or length infinity. Medial centralities count walks which pass through the given vertex. The canonical example is Freeman's betweenness centrality, the number of shortest paths which pass through the given vertex.

Likewise, the counting can capture either the volume or the length of walks. Volume is the total number of walks of the given type. The three examples from the previous paragraph fall into this category. Length captures the distance from the given vertex to the remaining vertices in the graph. Closeness centrality, the total geodesic distance from a given vertex to all other vertices, is the best known example. Note that this classification is independent of the type of walk counted (i.e. walk, trail, path, geodesic).

Borgatti and Everett propose that this typology provides insight into how best to compare centrality measures. Centralities placed in the same box in this 2×2 classification are similar enough to make plausible alternatives; one can reasonably compare which is better for a given application. Measures from different boxes, however, are categorically distinct. Any evaluation of relative fitness can only occur within the context of predetermining which category is more applicable, rendering the comparison moot.

Radial-volume centralities exist on a spectrum
The characterization by walk structure shows that almost all centralities in wide use are radial-volume measures. These encode the belief that a vertex's centrality is a function of the centrality of the vertices it is associated with. Centralities distinguish themselves on how association is defined.

Bonacich showed that if association is defined in terms of walks, then a family of centralities can be defined based on the length of walk considered. Degree centrality counts walks of length one, while eigenvalue centrality counts walks of length infinity. Alternative definitions of association are also reasonable. Alpha centrality allows vertices to have an external source of influence. Estrada's subgraph centrality proposes only counting closed paths (triangles, squares, etc.).

The heart of such measures is the observation that powers of the graph's adjacency matrix gives the number of walks of length given by that power. Similarly, the matrix exponential is also closely related to the number of walks of a given length. An initial transformation of the adjacency matrix allows a different definition of the type of walk counted. Under either approach, the centrality of a vertex can be expressed as an infinite sum, either

 * $$\sum_{k=0}^\infty A_{R}^{k} \beta^k $$

for matrix powers or

 * $$\sum_{k=0}^\infty \frac{(A_R \beta)^k}{k!}$$

for matrix exponentials, where

 * $$k$$ is walk length,
 * $$A_R$$ is the transformed adjacency matrix, and
 * $$\beta$$ is a discount parameter which ensures convergence of the sum.

Bonacich's family of measures does not transform the adjacency matrix. Alpha centrality replaces the adjacency matrix with its resolvent. Subgraph centrality replaces the adjacency matrix with its trace. A startling conclusion is that regardless of the initial transformation of the adjacency matrix, all such approaches have common limiting behavior. As $$\beta$$ approaches zero, the indices converge to degree centrality. As $$\beta$$ approaches its maximal value, the indices converge to eigenvalue centrality.

Game-theoretic centrality
The common feature of most of the aforementioned standard measures is that they assess the importance of a node by focusing only on the role that a node plays by itself. However, in many applications such an approach is inadequate because of synergies that may occur if the functioning of nodes is considered in groups.

For example, consider the problem of stopping an epidemic. Looking at above image of network, which nodes should we vaccinate? Based on previously described measures, we want to recognize nodes that are the most important in disease spreading. Approaches based only on centralities, that focus on individual features of nodes, may not be good idea. Nodes in the red square, individually cannot stop disease spreading, but considering them as a group, we clearly see that they can stop disease if it has started in nodes $$v_1$$, $$v_4$$, and $$v_5$$. Game-theoretic centralities try to consult described problems and opportunities, using tools from game-theory. The approach proposed in uses the Shapley value. Because of the time-complexity hardness of the Shapley value calculation, most efforts in this domain are driven into implementing new algorithms and methods which rely on a peculiar topology of the network or a special character of the problem. Such an approach may lead to reducing time-complexity from exponential to polynomial.

Similarly, the solution concept authority distribution applies the Shapley-Shubik power index, rather than the Shapley value, to measure the bilateral direct influence between the players. The distribution is indeed a type of eigenvector centrality. It is used to sort big data objects in Hu (2020), such as ranking U.S. colleges.

Important limitations
Centrality indices have two important limitations, one obvious and the other subtle. The obvious limitation is that a centrality which is optimal for one application is often sub-optimal for a different application. Indeed, if this were not so, we would not need so many different centralities. An illustration of this phenomenon is provided by the Krackhardt kite graph, for which three different notions of centrality give three different choices of the most central vertex.

The more subtle limitation is the commonly held fallacy that vertex centrality indicates the relative importance of vertices. Centrality indices are explicitly designed to produce a ranking which allows indication of the most important vertices. This they do well, under the limitation just noted. They are not designed to measure the influence of nodes in general. Recently, network physicists have begun developing node influence metrics to address this problem.

The error is two-fold. Firstly, a ranking only orders vertices by importance, it does not quantify the difference in importance between different levels of the ranking. This may be mitigated by applying Freeman centralization to the centrality measure in question, which provide some insight to the importance of nodes depending on the differences of their centralization scores. Furthermore, Freeman centralization enables one to compare several networks by comparing their highest centralization scores.

Secondly, the features which (correctly) identify the most important vertices in a given network/application do not necessarily generalize to the remaining vertices. For the majority of other network nodes the rankings may be meaningless. This explains why, for example, only the first few results of a Google image search appear in a reasonable order. The pagerank is a highly unstable measure, showing frequent rank reversals after small adjustments of the jump parameter.

While the failure of centrality indices to generalize to the rest of the network may at first seem counter-intuitive, it follows directly from the above definitions. Complex networks have heterogeneous topology. To the extent that the optimal measure depends on the network structure of the most important vertices, a measure which is optimal for such vertices is sub-optimal for the remainder of the network.

Degree centrality

Historically first and conceptually simplest is degree centrality, which is defined as the number of links incident upon a node (i.e., the number of ties that a node has). The degree can be interpreted in terms of the immediate risk of a node for catching whatever is flowing through the network (such as a virus, or some information). In the case of a directed network (where ties have direction), we usually define two separate measures of degree centrality, namely indegree and outdegree. Accordingly, indegree is a count of the number of ties directed to the node and outdegree is the number of ties that the node directs to others. When ties are associated to some positive aspects such as friendship or collaboration, indegree is often interpreted as a form of popularity, and outdegree as gregariousness.

The degree centrality of a vertex $$v$$, for a given graph $$G:=(V,E)$$ with $$|V|$$ vertices and $$|E|$$ edges, is defined as

 * $$C_D(v)= \deg(v)$$

Calculating degree centrality for all the nodes in a graph takes $\Theta(V^2)$ in a dense adjacency matrix representation of the graph, and for edges takes $$\Theta(E)$$ in a sparse matrix representation.

The definition of centrality on the node level can be extended to the whole graph, in which case we are speaking of graph centralization. Let $$v*$$ be the node with highest degree centrality in $$G$$. Let $$X:=(Y,Z)$$ be the $$|Y|$$-node connected graph that maximizes the following quantity (with $$y*$$ being the node with highest degree centrality in $$X$$):

 * $$H= \sum^{|Y|}_{j=1} [C_D(y*)-C_D(y_j)]$$

Correspondingly, the degree centralization of the graph $$G$$ is as follows:

 * $$C_D(G)= \frac{\sum^{|V|}_{i=1} [C_D(v*)-C_D(v_i)]}{H}$$

The value of $$H$$ is maximized when the graph $$X$$ contains one central node to which all other nodes are connected (a star graph), and in this case

 * $$H=(n-1)\cdot((n-1)-1)=n^2-3n+2.$$

So, for any graph $$G:=(V,E),$$

 * $$C_D(G)= \frac{\sum^{|V|}_{i=1} [C_D(v*)-C_D(v_i)] }{|V|^2-3|V|+2}$$

Also, a new extensive global measure for degree centrality named Tendency to Make Hub (TMH) defines as follows:
 * $$\text{TMH} = \frac{\sum^{|V|}_{i=1} \deg(v)^2 }{\sum^{|V|}_{i=1} \deg(v) }$$

where TMH increases by appearance of degree centrality in the network.

Closeness centrality
In a connected graph, the normalized closeness centrality (or closeness) of a node is the average length of the shortest path between the node and all other nodes in the graph. Thus the more central a node is, the closer it is to all other nodes.

Closeness was defined by Alex Bavelas (1950) as the reciprocal of the farness, that is $C_B(v)= (\sum_u d(u,v))^{-1}$  where $$d(u,v)$$ is the distance between vertices u and v. However, when speaking of closeness centrality, people usually refer to its normalized form, given by the previous formula multiplied by $$N-1$$, where $$N$$ is the number of nodes in the graph
 * $$C(v)= \frac{N-1}{\sum_u d(u,v)} .$$

This normalisation allows comparisons between nodes of graphs of different sizes. For many graphs, there is a strong correlation between the inverse of closeness and the logarithm of degree, $$(C(v))^{-1} \approx -\alpha \ln(k_v) + \beta$$ where $$k_v$$ is the degree of vertex v while α and β are constants for each network.

Taking distances from or to all other nodes is irrelevant in undirected graphs, whereas it can produce totally different results in directed graphs (e.g. a website can have a high closeness centrality from outgoing link, but low closeness centrality from incoming links).

Harmonic centrality
In a (not necessarily connected) graph, the harmonic centrality reverses the sum and reciprocal operations in the definition of closeness centrality:

 * $$H(v)= \sum_{u | u \neq v} \frac{1}{d(u,v)}$$

where $$1 / d(u,v) = 0$$ if there is no path from u to v. Harmonic centrality can be normalized by dividing by $$N-1$$, where $$N$$ is the number of nodes in the graph.

Harmonic centrality was proposed by Marchiori and Latora (2000) and then independently by Dekker (2005), using the name "valued centrality," and by Rochat (2009).

Betweenness centrality

Betweenness is a centrality measure of a vertex within a graph (there is also edge betweenness, which is not discussed here). Betweenness centrality quantifies the number of times a node acts as a bridge along the shortest path between two other nodes. It was introduced as a measure for quantifying the control of a human on the communication between other humans in a social network by Linton Freeman. In his conception, vertices that have a high probability to occur on a randomly chosen shortest path between two randomly chosen vertices have a high betweenness.

The betweenness of a vertex $$v$$ in a graph $$G:=(V,E)$$ with $$V$$ vertices is computed as follows:

 * 1) For each pair of vertices (s,t), compute the shortest paths between them.
 * 2) For each pair of vertices (s,t), determine the fraction of shortest paths that pass through the vertex in question (here, vertex v).
 * 3) Sum this fraction over all pairs of vertices (s,t).

More compactly the betweenness can be represented as:

 * $$C_B(v)= \sum_{s \neq v \neq t \in V}\frac{\sigma_{st}(v)}{\sigma_{st}}$$

where $$\sigma_{st}$$ is total number of shortest paths from node $$s$$ to node $$t$$ and $$\sigma_{st}(v)$$ is the number of those paths that pass through $$v$$. The betweenness may be normalised by dividing through the number of pairs of vertices not including v, which for directed graphs is $$(n-1)(n-2)$$ and for undirected graphs is $$(n-1)(n-2)/2$$. For example, in an undirected star graph, the center vertex (which is contained in every possible shortest path) would have a betweenness of $$(n-1)(n-2)/2$$ (1, if normalised) while the leaves (which are contained in no shortest paths) would have a betweenness of 0.

From a calculation aspect, both betweenness and closeness centralities of all vertices in a graph involve calculating the shortest paths between all pairs of vertices on a graph, which requires $O(V^3)$ time with the Floyd–Warshall algorithm. However, on sparse graphs, Johnson's algorithm may be more efficient, taking $O(|V||E|+|V|^2 \log|V|)$ time. In the case of unweighted graphs the calculations can be done with Brandes' algorithm which takes $O(|V||E|)$ time. Normally, these algorithms assume that graphs are undirected and connected with the allowance of loops and multiple edges. When specifically dealing with network graphs, often graphs are without loops or multiple edges to maintain simple relationships (where edges represent connections between two people or vertices). In this case, using Brandes' algorithm will divide final centrality scores by 2 to account for each shortest path being counted twice.

Eigenvector centrality
Eigenvector centrality (also called eigencentrality) is a measure of the influence of a node in a network. It assigns relative scores to all nodes in the network based on the concept that connections to high-scoring nodes contribute more to the score of the node in question than equal connections to low-scoring nodes. Google's PageRank and the Katz centrality are variants of the eigenvector centrality.

Using the adjacency matrix to find eigenvector centrality
For a given graph $$G:=(V,E)$$ with $$|V|$$ number of vertices let $$A = (a_{v,t})$$ be the adjacency matrix, i.e. $$a_{v,t} = 1$$ if vertex $$v$$ is linked to vertex $$t$$, and $$a_{v,t} = 0$$ otherwise. The relative centrality score of vertex $$v$$ can be defined as:

 * $$x_v = \frac{1}{\lambda} \sum_{t \in M(v)}x_t = \frac{1}{\lambda} \sum_{t \in G} a_{v,t}x_t$$

where $$M(v)$$ is a set of the neighbors of $$v$$ and $$\lambda$$ is a constant. With a small rearrangement this can be rewritten in vector notation as the eigenvector equation

 * $$\mathbf{Ax} = {\lambda}\mathbf{x}$$

In general, there will be many different eigenvalues $$\lambda$$ for which a non-zero eigenvector solution exists. Since the entries in the adjacency matrix are non-negative, there is a unique largest eigenvalue, which is real and positive, by the Perron–Frobenius theorem. This greatest eigenvalue results in the desired centrality measure. The $$v^{th}$$ component of the related eigenvector then gives the relative centrality score of the vertex $$v$$ in the network. The eigenvector is only defined up to a common factor, so only the ratios of the centralities of the vertices are well defined. To define an absolute score one must normalise the eigenvector, e.g., such that the sum over all vertices is 1 or the total number of vertices n. Power iteration is one of many eigenvalue algorithms that may be used to find this dominant eigenvector. Furthermore, this can be generalized so that the entries in A can be real numbers representing connection strengths, as in a stochastic matrix.

Katz centrality
Katz centrality is a generalization of degree centrality. Degree centrality measures the number of direct neighbors, and Katz centrality measures the number of all nodes that can be connected through a path, while the contributions of distant nodes are penalized. Mathematically, it is defined as

 * $$x_i = \sum_{k=1}^{\infin}\sum_{j=1}^N \alpha^k (A^k)_{ji}$$

where $$\alpha$$ is an attenuation factor in $$(0,1)$$.

Katz centrality can be viewed as a variant of eigenvector centrality. Another form of Katz centrality is

 * $$x_i = \alpha \sum_{j =1}^N a_{ij}(x_j+1).$$

Compared to the expression of eigenvector centrality, $$x_j$$ is replaced by $$x_j+1.$$

It is shown that the principal eigenvector (associated with the largest eigenvalue of $$A$$, the adjacency matrix) is the limit of Katz centrality as $$\alpha$$ approaches $$\tfrac{1}{\lambda}$$ from below.

PageRank centrality
PageRank satisfies the following equation

 * $$x_i = \alpha \sum_{j } a_{ji}\frac{x_j}{L(j)} + \frac{1-\alpha}{N},$$

where

 * $$L(j) = \sum_{i} a_{ji}$$

is the number of neighbors of node $$j$$ (or number of outbound links in a directed graph). Compared to eigenvector centrality and Katz centrality, one major difference is the scaling factor $$L(j)$$. Another difference between PageRank and eigenvector centrality is that the PageRank vector is a left hand eigenvector (note the factor $$a_{ji}$$ has indices reversed).

Percolation centrality
A slew of centrality measures exist to determine the ‘importance’ of a single node in a complex network. However, these measures quantify the importance of a node in purely topological terms, and the value of the node does not depend on the ‘state’ of the node in any way. It remains constant regardless of network dynamics. This is true even for the weighted betweenness measures. However, a node may very well be centrally located in terms of betweenness centrality or another centrality measure, but may not be ‘centrally’ located in the context of a network in which there is percolation. Percolation of a ‘contagion’ occurs in complex networks in a number of scenarios. For example, viral or bacterial infection can spread over social networks of people, known as contact networks. The spread of disease can also be considered at a higher level of abstraction, by contemplating a network of towns or population centres, connected by road, rail or air links. Computer viruses can spread over computer networks. Rumours or news about business offers and deals can also spread via social networks of people. In all of these scenarios, a ‘contagion’ spreads over the links of a complex network, altering the ‘states’ of the nodes as it spreads, either recoverable or otherwise. For example, in an epidemiological scenario, individuals go from ‘susceptible’ to ‘infected’ state as the infection spreads. The states the individual nodes can take in the above examples could be binary (such as received/not received a piece of news), discrete (susceptible/infected/recovered), or even continuous (such as the proportion of infected people in a town), as the contagion spreads. The common feature in all these scenarios is that the spread of contagion results in the change of node states in networks. Percolation centrality (PC) was proposed with this in mind, which specifically measures the importance of nodes in terms of aiding the percolation through the network. This measure was proposed by Piraveenan et al.

Percolation centrality is defined for a given node, at a given time, as the proportion of ‘percolated paths’ that go through that node. A ‘percolated path’ is a shortest path between a pair of nodes, where the source node is percolated (e.g., infected). The target node can be percolated or non-percolated, or in a partially percolated state.

 * $$PC^t(v)= \frac{1}{N-2}\sum_{s \neq v \neq r}\frac{\sigma_{sr}(v)}{\sigma_{sr}}\frac{{x^t}_s}{{\sum {[{x^t}_i}]}-{x^t}_v}$$

where $$\sigma_{sr}$$ is total number of shortest paths from node $$s$$ to node $$r$$ and $$\sigma_{sr}(v)$$ is the number of those paths that pass through $$v$$. The percolation state of the node $$i$$ at time $$t$$ is denoted by $${x^t}_i$$ and two special cases are when $${x^t}_i=0$$ which indicates a non-percolated state at time $$t$$ whereas when $${x^t}_i=1$$ which indicates a fully percolated state at time $$t$$. The values in between indicate partially percolated states ( e.g., in a network of townships, this would be the percentage of people infected in that town).

The attached weights to the percolation paths depend on the percolation levels assigned to the source nodes, based on the premise that the higher the percolation level of a source node is, the more important are the paths that originate from that node. Nodes which lie on shortest paths originating from highly percolated nodes are therefore potentially more important to the percolation. The definition of PC may also be extended to include target node weights as well. Percolation centrality calculations run in $O(NM)$ time with an efficient implementation adopted from Brandes' fast algorithm and if the calculation needs to consider target nodes weights, the worst case time is $O(N^3)$.

Cross-clique centrality
Cross-clique centrality of a single node in a complex graph determines the connectivity of a node to different cliques. A node with high cross-clique connectivity facilitates the propagation of information or disease in a graph. Cliques are subgraphs in which every node is connected to every other node in the clique. The cross-clique connectivity of a node $$v$$ for a given graph $$G:=(V,E)$$ with $$|V|$$ vertices and $$|E|$$ edges, is defined as $$X(v)$$ where $$X(v)$$ is the number of cliques to which vertex $$v$$ belongs. This measure was used by Faghani in 2013 but was first proposed by Everett and Borgatti in 1998 where they called it clique-overlap centrality.

Freeman centralization
The centralization of any network is a measure of how central its most central node is in relation to how central all the other nodes are. Centralization measures then (a) calculate the sum in differences in centrality between the most central node in a network and all other nodes; and (b) divide this quantity by the theoretically largest such sum of differences in any network of the same size. Thus, every centrality measure can have its own centralization measure. Defined formally, if $$C_x(p_i)$$ is any centrality measure of point $$i$$, if $$C_x(p_*)$$ is the largest such measure in the network, and if:

 * $$\max \sum_{i=1}^{N} (C_x(p_*)-C_x(p_i))$$

is the largest sum of differences in point centrality $$C_x$$ for any graph with the same number of nodes, then the centralization of the network is:

 * $$C_x=\frac{\sum_{i=1}^{N} (C_x(p_*)-C_x(p_i))}{\max \sum_{i=1}^{N} (C_x(p_*)-C_x(p_i))}.$$

The concept is due to Linton Freeman.

Dissimilarity-based centrality measures
In order to obtain better results in the ranking of the nodes of a given network, in are used dissimilarity measures (specific to the theory of classification and data mining) to enrich the centrality measures in complex networks. This is illustrated with eigenvector centrality, calculating the centrality of each node through the solution of the eigenvalue problem

 * $$W\mathbf{c}=\lambda \mathbf{c}$$

where $$W_{ij}=A_{ij}D_{ij}$$ (coordinate-to-coordinate product) and $$D_{ij}$$ is an arbitrary dissimilarity matrix, defined through a dissimilarity measure, e.g., Jaccard dissimilarity given by

 * $$D_{ij}=1-\dfrac{|V^{+}(i)\cap V^{+}(j)|}{|V^{+}(i)\cup V^{+}(j)|}$$

Where this measure permits us to quantify the topological contribution (which is why is called contribution centrality) of each node to the centrality of a given node, having more weight/relevance those nodes with greater dissimilarity, since these allow to the given node access to nodes that which themselves can not access directly.

Is noteworthy that $$W$$ is non-negative because $$A$$ and $$D$$ are non-negative matrices, so we can use the Perron–Frobenius theorem to ensure that the above problem has a unique solution for λ = λmax with c non-negative, allowing us to infer the centrality of each node in the network. Therefore, the centrality of the i-th node is

 * $$c_i=\dfrac{1}{n}\sum_{j=1}^{n}W_{ij}c_{j}, \,\,\,\,\,\, i=1,\cdots,n$$

where $$n$$ is the number of the nodes in the network. Several dissimilarity measures and networks were tested in obtaining improved results in the studied cases.

title: Centrality


text:
Animaniacs (video game)

Animaniacs (アニマニアクス) is a series of platform video games developed by Konami, based on the TV series of the same name. Two games were developed featuring significantly different gameplay and storylines; one for Super Nintendo Entertainment System, and one for the Sega Mega Drive/Genesis and Game Boy. The SNES and Genesis versions were released in 1994, and the Game Boy version in 1995.

The Game Boy version has a unique soundtrack if played on the Super Game Boy accessory, and is one of the few games to take full advantage of the accessory.

Plot
In the Genesis version, the Warner Siblings, Yakko, Wakko, and Dot, decide to open up a hip-pop culture shop in order to become closer to their favorite movie stars. To this end, they travel across various movie sets in the Warner Bros. studio lot in order to retrieve movie memorabilia to sell. However, once they collect all the memorabilia, Pinky and the Brain attempt to steal them in order to further their world domination plans.

In the SNES version, the Brain once again has another plan to conquer the world by deciding to steal the script of the new Warner Bros. film while it was under development. The CEO of Warner Bros. studio reluctantly asks the Warner Siblings for their assistance to retrieve all 24 pages of the script and foil the Brain's plan, which is the primary objective of the game. The ending of the game depends on how many script pages are collected, with the best ending leading to Warner Bros. being able to complete the film, pleasing the CEO, only to find out that the film was about the Warner Siblings, which pleases them.

Sega Genesis/Game Boy version
The game features four main levels, which can be entered in any order. The player must reach the end of each level and beat the boss to obtain a piece of movie memorabilia. A fifth level will then open to obtain a final piece of movie memorabilia. After clearing all five levels, players travel to the final level where they must fight Pinky and the Brain. Players control Yakko, Wakko, and Dot, switching control between them to use their respective powers accordingly. Yakko uses a paddleball to stun enemies and is also able to push and pull objects such as crates. Wakko uses a mallet that can be used to hit switches, break certain objects, and light fuses. Dot is able to blow kisses which, when used on certain characters, triggers certain actions needed to progress.

The Warner Brothers and Sister have health indicators and a number of lives. The lives can be increased by obtaining either 100 stars or obtaining a small golden form of their faces. Their health is indicated by their faces on the top left of the screen. When they smile, they are healthy, but when they are looking either tired, unhappy, or weak, then they should find health soon (which is found in the forms of several forms of ice cream or sweets, or other kinds of food). The levels are timed.

This version was ported to the Game Boy by Factor 5, but due to space constraints, only three levels are present in this version and certain parts of the three levels are absent. Both the Science Fiction/Space Opera – Space Wars (Space Trucking) and nearly all of the final Action Movie – Once There Was A Man Named Oscar levels are absent from this version. On easy mode, the Game Boy version ends early, on the first three levels. On normal and hard modes, the Game Boy version continues after the player completes the first three levels, goes to Once There Was A Man Named Oscar, and battles Pinky and the Brain.

SNES version
Players navigate the three characters through a linear, three-dimensional playing field. The primary objective of the game is to collect 24 pages of a script, with multiple pages being scattered around different areas of the studio, though the game can be completed without obtaining all of them. Scripts are hidden in stages, with them being placed in hard-to-reach areas and several hidden ones which are revealed by performing certain actions such as moving objects or interacting with characters. The ending of the game, with three endings in total, alternates depending on how many scripts are collected. The game focuses more on parodies of films at the different stages, that are once more based on different genres of movies. Several stages feature boss sections, which must be defeated by harming them with certain objects. The final stage, the Editing Room, is unlocked after completing all the other stages, in which the player must defeat all the bosses previously fought in the form of a boss rush, following by a final battle with Pinky and the Brain.

The characters have no health bar, lives (the game ends when all the characters are defeated/captured, one by one), or special abilities. Characters can be swapped freely in almost all places. Characters are defeated from touching harmful enemies or objects, or being captured by the security guard, Ralph. Defeated/captured characters can be recovered by completing a "Rescue" stage that appears when one or two characters are defeated or captured. Characters can pick up and throw things as well as execute a dash move. If all three are together, they can also stack themselves up to reach higher platforms. The stack move can be performed with two characters, however, the power of the stack is weakened. A slot machine at the bottom of the screen is activated after obtaining a certain number of coins and can be used for a range of power-ups, such as temporary invincibility, bringing back characters who were defeated or captured earlier, and giving or taking away extra coins.

Throughout the game, there are small robots with white blockheads, red bodies, and yellow appendages who work for Pinky and the Brain.

Reception
Reviewing the Genesis version, GamePro assessed that the game successfully appeals to the TV show's preadolescent target audience. They criticized the limited music and absence of voices, but praised the cartoony and detailed graphics and the way the level design requires the player to make regular use of all three characters. They gave the Super NES version a negative review, citing overly simplistic and frustrating gameplay, though they did praise the graphics for their large and colorful sprites and background references to the TV show. Reviewing the Game Boy version, they criticized the slow-moving characters and trial-and-error gameplay, but approved of the graphics and audio and concluded, "The humor and spirit of the Animaniacs lives on in this handheld game."

Super Play was more negative on the SNES version, giving it only 28%.

Digital Press gave the Genesis version 8 out of 10.

Next Generation reviewed the Genesis version of the game, rating it three stars out of five, and stated that "Cutting edge innovation isn't here, but what is here is plenty of fun."

In 1995, Total! ranked Animaniacs 94th on their Top 100 SNES Games calling the game ingenious and funny.

title: Animaniacs (video game)


text:
Andreas Möller

Andreas Möller (born 2 September 1967) is a German former professional footballer who played as an attacking midfielder. He is the head of the youth department at Eintracht Frankfurt.

From 1985 to 2004 Möller played in 429 Bundesliga games for Eintracht Frankfurt, Borussia Dortmund and FC Schalke 04, scoring 110 goals, and also played in Serie A for Juventus FC. He was a member of the Germany teams that won the 1990 FIFA World Cup and UEFA Euro 1996, and is also a Champions League winner, UEFA Cup winner, multiple German champion and DFB Cup winner at club level.

Early life
Möller was born the son of a warehouse worker and a bank clerk in the St. Marien Hospital in Nordend, Frankfurt. He grew up in the district of Sossenheim as an only child in modest circumstances.

Möller's first club was BSC Schwarz-Weiß 1919 Frankfurt, where his father worked as a youth football coach. His coach there was Klaus Gerster, who became his closest friend and later served as an advisor and negotiator throughout his career.

Club career
At club level, Möller played for Eintracht Frankfurt (1985–87, 1990–92, 2003–04), Borussia Dortmund (1988–90, 1994–2000), Juventus (1992–94), and Schalke 04 (2000–03).

Eintracht Frankfurt
Möller began his career at BSC Schwarz-Weiß 1919 Frankfurt and moved to Eintracht Frankfurt in 1981. In 1985 the midfielder won the German A-Youth Championship and in the same year he joined the first-team squad, venturing into professional football. He played his first game in Germany's highest football class on the last day of the 1985–86 season in the 0-1 defeat on 26 April 1986 against Hamburger SV. In the following season he came up with 22 missions. He played more and more into the team structure and on Matchday 5 against 1. FC Kaiserslautern he scored his first professional goal in league play when he converted a penalty kick to make it 1-2; it was his only goal of the season. In the 1987–88 season, the youngster, who was good at dribbling, developed into a top performer. In his first game of the season on matchday 5 against Bayer 04 Leverkusen, Möller scored twice.

Borussia Dortmund
On 17 February 1988, Möller made his debut for Borussia Dortmund, scoring the opening goal against VfL Bochum in the 42nd minute at home; however, the game ended in a 2-1 defeat for the Black and Yellows, despite BVB leading 1-0 up until the 88th minute. On the 26th day of the 1987–88 season, against his future employer, FC Schalke 04, Möller received his first and only red card, but only had to sit out one game. In the 1988–89 DFB Cup season, Möller advanced to the final with his team. There he met SV Werder Bremen. After a clear 4–1 win against the North Germans, his won his first national title during his first spell with the club. He also won the DFL-Supercup with Dortmund in the beginning of the 1989–90 season, where he scored the title-deciding goal in the 88th minute of the final match against Bayern Munich.

Second spell at Eintracht Frankfurt and move to Juventus
Möller was a top performer at Borussia but returned to Frankfurt in the summer of 1990. In the first year after his return, he scored 16 goals in the Bundesliga, setting a personal record that he would not surpass until the end of his career. In the 1991–92 season he missed out on winning the title with Frankfurt on the final day. The season was overshadowed by disputes within the team. Möller was a frequent target of keeper Uli Stein, on the one hand because of his inconsistency, on the other hand because of the many special contractual conditions.

Möller also wanted to play for Eintracht Frankfurt in the 1992–93 season. However, he had promised the Serie A club Juventus an option right for DM 1.3 million, which the club redeemed in March 1992. The Turin side had resold this option right to Atalanta B.C., whom Möller would have had to join if Juventus FC had not exercised the option themselves. FIFA had to provide clarification: Möller was bound by the option and had to move to Italy on 1 July 1992, for which he had to buy himself out of his contract with Eintracht Frankfurt for DM 5 million.

After moving to Italian side Juventus, he won the UEFA Cup in 1993, beating out his former club, Borussia Dortmund, 6–1 on aggregate, with Möller scoring one of the goals and providing three assists across both legs of the final.

Borussia Dortmund (second spell)
Despite performing well at Juventus, Möller decided to return to Germany in the summer of 1994 and signed for Borussia Dortmund for the second time. Upon his return to Dortmund, he won several domestic titles with the club, including consecutive Bundesliga titles in 1995 and 1996. He stayed with the club for a total of six years, scored goals regularly and had the corresponding deployment times. Especially in the championship years 1995 and 1996, Möller showed his class as a playmaker, creator, and scorer. He was considered one of the most prolific midfielders at the time.

His greatest success at club level came in the 1996–97 Champions League: in the final at Munich's Olympic Stadium on 28 May 1997, and saw him once again beating a former team, Turin side Juventus on this occasion, with a 3–1 victory, providing two assists during the match, while his corner also led to the opening goal. He followed up the victory with the Intercontinental Cup later that year, after which he was named Man of the Match.

During this time, however, there was also controversy and debate surrounding Möller, after he feigned a foul inside the opposing box in a game against Karlsruher SC on 13 April 1995, when BVB had been trailing 0–1. The then wrongly awarded penalty led to the equalising goal (1–1), with the final score ending in an eventual 2–1 win for Dortmund. Möller tried to justify his Schwalbe (a word used for a dive in German football jargon, literally meaning "swallow" in Germany) and attacked the KSC coach at the time, Winfried Schäfer. Möller was sentenced to a two-game ban and a fine of DM 10,000 by the DFB sports court. He was the first player to be banned by the DFB because of a dive. National coach Berti Vogts had to temporarily take him out of the national team due to his ban in the league.

In his last year with the Black and Yellows, Möller only made 18 league appearances, being substituted on or off seven times. Reasons for this were the strong competition from players like Lars Ricken, Christian Nerlinger, Miroslav Stević and Vladimir But as well as minor injuries.

Schalke 04
In the summer of 2000, in order to risk a fresh start, Möller decided to sign with arch-rivals Schalke 04 in Dortmund, especially since he received a well-paid offer from Rudi Assauer. Despite criticism, he immediately became a regular there and formed the backbone of Schalke's midfield in his first year with Jörg Böhme, Radoslav Látal and Jiří Němec. Schalke finished second in the Bundesliga at the end of the 2000–01 season, just 1 point behind the Champions Bayern Munich and won the DFB-Pokal. Following season, Schalke successfully defended the DFB-Pokal title after defeating Bayer Leverkusen at the final where Möller scored his team's 3rd goal in a 4–2 victory. After two good years with the Gelsenkirchen side, Möller became more of a supplementary player in the 2002–03 season. Although he made 22 appearances under coaches Frank Neubarth and later Marc Wilmots, he was substituted on or off nine times.

Late career and third spell with Eintracht Frankfurt
For the 2003–04 season, Möller went back to Hessen to his home club Eintracht Frankfurt, which had just been promoted to the Bundesliga. Celebrated by the fans before the season as a great returnee and a guarantee of success, disillusionment quickly spread. Möller only played eleven league games and only played 90 minutes twice. He also did not manage to help the club avoid relegation. Möller played his last professional game on 28 February 2004, when he came on as a substitute in the 89th minute of the 3-1 win against Borussia Mönchengladbach. Three days later he announced his retirement from professional football, bringing his career to an end.

International career
With the Germany national team, Möller was capped 85 times between 1988 and 1999, scoring 29 goals. He took part at five major international tournaments, winning the 1990 World Cup and Euro 96. He also played for his country at Euro 92, where his team reached the final, only to lose 2–0 to Denmark (although Möller did not feature during the match), as well as the 1994 and 1998 World Cups, in which Germany suffered quarter-final eliminations; in the former edition of the tournament, Germany were eliminated following a surprising 2–1 defeat to Bulgaria, while in the latter edition, Germany lost 3–0 to Croatia. Möller did not play in the 1–0 victory over Argentina in the 1990 World Cup Final and was also suspended for Germany's 2–1 golden goal victory over the Czech Republic in the final of Euro 96 after he was booked in the semi-final against hosts England; in the resulting penalty shoot-out of the latter match, following a 1–1 draw after extra-time, Möller scored the winning penalty, which he celebrated by mimicking the bravado of the pose struck earlier in the shoot-out when Paul Gascoigne had converted his penalty.

Style of play
Described by Stephan Uersfeld of ESPN FC as "one of the greatest midfielders of his generation", Möller was a talented, versatile, and complete advanced playmaker, who was known for his unique sprinting speed - his nickname was "Turbo Möller" - combined with range of passing, creativity, vision, intelligence, and technical ability, as well as his agility, reactions, and his speed of thought and execution, which enabled him to play first–time passes; he also had the ability to carry the ball or run forward at defences while in possession. In addition to his creative capabilities and ability to provide assists to teammates, he was also known for his goalscoring, courtesy of his powerful and accurate striking ability with either foot, as well as his heading ability, which allowed him to excel in the air; his offensive qualities also allowed him to be deployed in more advanced roles, as a supporting striker or even as a winger on occasion, in addition to his usual central position as an attacking midfielder behind the strikers. He was also a free kick specialist.

After retirement
After his active career, Möller, together with other former professionals such as Dieter Eilts, obtained a football teacher's license at the German Sport University Cologne. On 20 December 2006 he joined Viktoria Aschaffenburg in the area of sports organization and sponsoring. In June 2007, Möller started his career as football manager at Viktoria Aschaffenburg, playing in the Oberliga Hessen. From 2008 to 2011, he was athletic director for Kickers Offenbach.

On 20 October 2015, Möller was given a job for the Hungary national team. Here he worked as an assistant for Bernd Storck. They played together for Borussia Dortmund when Dortmund won the West German Cup in the 1988–89 season.

On 5 October 2019, Möller returned to Eintracht Frankfurt and was hired as head of the youth department. In order to have more time for his family, he declared in February 2022 that he would not extend his contract beyond the end of the season and would leave the academy after two and a half years. A short time later it was announced that Möller would be leaving on 31st March and that Alexander Richter would take over as his successor on April 1.

Personal life
On 28 April 1992 Möller married a school friend, with whom he has three daughters (born in 1993, 1995, and 2000 respectively). Since the beginning of 2001 he has been in a relationship with another woman, whom he married on 18 August 2007 after his first marriage ended in divorce in 2003.

Outside of football
Möller is a member of the board of trustees of the youth football foundation, which was founded in 2000 by Jürgen Klinsmann, other successful national players and the lecturers of the special football teacher training course. During the 2006 FIFA World Cup he commented on the games of the German national team for the guests of the club ship AIDA. Möller is credited with a classic of football style blossoms. When asked in an interview in 1992 where he would play in the future, he is said to have answered: "Milan or Madrid, the main thing is Italy." In various interviews, Möller stated that he could not remember having made this statement. The sentence was first documented in 1998 in a collage of satirical quotations from Essen's punk rock fanzine Moloko Plus and was made known in Klaus Bittermann's book Vom Feeling her ein gutes Gefühl (1999).

Möller was voted into the BVB Centenary Eleven by the readers of the WAZ media group.

At irregular intervals he worked for television as a co-commentator on football games.

Media
Möller features in EA Sports' FIFA video game series; he was on the cover of the German edition of FIFA 98.

Club

 * 1 Including appearances in 1989 DFB-Supercup, 1995 DFB-Supercup, 1996 DFB-Supercup and 1997 Intercontinental Cup.

Honours
Eintracht Frankfurt Borussia Dortmund
 * German A youth champion: 1985
 * Bundesliga: 1994–95, 1995–96
 * DFB-Pokal: 1988–89
 * DFL-Supercup: 1989, 1995, 1996
 * UEFA Champions League: 1996–97
 * Intercontinental Cup: 1997

Juventus
 * UEFA Cup: 1992–93

Schalke 04
 * DFB-Pokal: 2000–01, 2001–02

Germany
 * FIFA World Cup: 1990
 * UEFA European Championship: 1996
 * US Cup: 1993

Individual
 * kicker Bundesliga Team of the Season: 1988–89, 1989–90, 1990–91, 1991–92, 1995–96, 2000–01
 * Bundesliga top assist provider: 1989–90, 1995–96
 * kicker'' Bundesliga-best offensive midfielder: 1990, 1991
 * Intercontinental Cup MVP of the Match Award: 1997

title: Andreas Möller


text:
User:JH072589

I have a lot of knowledge in motors and how they run. Mainly i am interested and know a lot about vehilcales or forms of transportation. I love reading or receiving information on planes and cars mainly. The cars is a facinating machine that runs so smoothly but there is alot that has to happen when someone drives it. Some people dont realize how critical it is for all arts of a car to be perfect. There are so many steps that have to be taking between the time of stepping on the gas and getting the engine to accelerate. Then with planes it is just amazing how they can get so much thrust to ge such a masive object in the air. The engine that they run of of are each like the size of a middle class house. A plane is an incradible machine that is used daily in todays world. Technology has come so far in that 90 years ago we didnt even have airline like the ones that we have now. Now adays if you want to go some where flying is one of the options.

title: User:JH072589


text:
Wikipedia:Articles for deletion/Fence Post repair

 This page is an archive of the discussion about the proposed deletion of the article below. This page is no longer live. Further comments should be made on the article's talk page rather than here so that this page is preserved as an historic record. The result of the debate was DELETED. dbenbenn | talk 16:57, 14 Feb 2005 (UTC)

Fence Post repair
A how-to. Nothing more than a step by step guide. --InShaneee 16:26, 3 Feb 2005 (UTC)
 * See also: Fence post repair and its current VfD. —Korath (Talk) 15:52, Feb 5, 2005 (UTC)

 * Transwikibooks. They take how-tos, right?  Delete if I'm misremembering. —Korath (Talk) 16:46, Feb 3, 2005 (UTC)
 * Move over to Wiki books - Good information, Wrong place. mydogategodshat 02:05, 4 Feb 2005 (UTC)
 * Even though there are how-to's on Wikipedia, they date back to before Wikibooks and are in the process of being migrated (at a glacial pace, admittedly). But this does not provide a justification for new how-to's on Wikipedia. Transwiki. GeorgeStepanek\talk  20:34, 4 Feb 2005 (UTC)
 * Delete this one too. Wyss 23:59, 5 Feb 2005 (UTC)
 * Transwiki to Wikibooks. Megan1967 05:20, 7 Feb 2005 (UTC)
 * Delete DIY info. Edeans 04:57, 9 Feb 2005 (UTC)

This page is now preserved as an archive of the debate and, like some other VfD subpages, is no longer 'live'. Subsequent comments on the issue, the deletion, or the decision-making process should be placed on the relevant 'live' pages. Please do not edit this page.


text:
User:Drumsofgreenpool17

Matt McClead was born on December 11th, 1987.... He soon devoloped an interest in older music when he was younger and soon got into the band Led Zeppelin... Matt also had an uncle who played drums and to this day still does... Matt would play around on his uncles drum set and little did he know when the year 2003 rolled around he would have a drumset of his own to play on... The first lesson Matt recieved was from his uncle Byron... and this all important lesson was when playing... lay into the groove of the song.. Matt toke this advice very serouisly and ever since Matt has found that playing along to any song is simple to him... In Early November of 2003 A band known as Green Pool formed.. and the lineup at the time was Aaron Melhorn on guitar, Alex Maurer on Guitar, Matt McClead on drums, and Brian "Donkey" Dominik on bass... this lineup soon changed When good friend Adam Diotale got himself a second hand guitar in a pawn shop... actually he got a PRS Standard 22 and a Marshall Full Stack.. but hey whatever works right? ... Adam soon join green pool and peeled the varnish off everyones guitar at band practice... With his shredding techniques that he implied on songs like paranoid... And soon the band was finally born.. you know the rest of the story right? I dont feel like telling it to you... Matt went to florida and recieved his final lessons from Byron.. There wasnt anything else for Byron to teach him... Later about 4 weeks after returning from Florida Green Pool Played its first show with bands known as grindskull... sound docorine... and angelface... the show proved to be awesome indeed.. and Green Pool Hopes to continue playing shows with such hits as elevator and Demise....

title: User:Drumsofgreenpool17


text:
Ford Zeta engine

Developed in the late 1980s by the Ford Motor Company, the Ford Zeta engine was a straight-4, double overhead cam internal combustion engine with which Ford had intended to replace the analogous Pinto and CVH models.

Ford designed the Zeta to share some parts with other Ford engine developments at the time, including the smaller Sigma I-4 and larger Duratec V6. This engine shares its bore and stroke dimensions with the 2-valve CVH engine. Ford Power Products sells the Zeta in 1.8 L and 2.0 L versions as the MVH.

Production of the engines, renamed Zetec (the rename occurred because Lancia owned the "Zeta" trademark), began at Ford's Bridgend plant in Wales in September 1991, with later production added at Cologne, Germany in 1992 and Chihuahua, Chihuahua, Mexico, in 1993. The first Zetecs displaced 1.8 L, with a 2.0 L version arriving quickly afterwards. The final Zeta Zetec was produced on December 10, 2004 at the Bridgend factory with over 3,500,000 built at that location.

The engine fits the Ford T9, B5/iB5, G5M/G25MR, CD4E and MTX-75 gearboxes using the same bell bolt pattern as the Crossflow.

Overview of applications

 * 1992-05/1998 - Ford Mondeo 1.6 90 bhp (Engine codes: L1F, L1J)
 * 05/1998-2001 - Ford Mondeo 1.6 88 bhp (Engine codes: L1N, L1Q)
 * Ford Fiesta 1992–1995 (1.6 90 bhp Si) (1.8 105 bhp S/XR2i 16V) (1.8 130 bhp RS1800)
 * Ford Escort 1992–1998 (Europe) (1.6 90 bhp Si) (1.8 105/130 bhp XR3i) (1.8 115 bhp Si/GTi)
 * 1995–2000 Ford Contour and Mercury Mystique
 * 1999–2002 Mercury Cougar
 * 2000–2003 Ford Escape and Mazda Tribute
 * 2000–2003 Ford Focus
 * 1998-2003 Ford Escort ZX2.
 * Formula Ford 2000 series (2003 – present)

2.0
The 2.0 L Zetec shared its 84.8 mm bore and 88.0 mm stroke with its predecessor, the 2.0 L 2-valve CVH. On top of the 16 Valve DOHC head, the Zetec for the US Market Escort ZX2, Contour, and Cougar gained Variable Valve Timing on the Exhaust Cam, removing its requirement of EGR for US Emissions.

A high 10.2:1 compression ratio and larger valves contributed to the SVT version's much-higher output; while a special ECU tune that modified the Variable Valve Timing, among other settings, contributed to the 10% power increase on the ZX2 S/R.

Applications:
 * 1998-2003 Ford Escort (North America) ZX2, 130 hp (97 kW) and 127 lb·ft (172 Nm)
 * 1999-2000 Ford Escort ZX2 S/R, 143 hp (107 kW) and 146 lb·ft (198 Nm)
 * 2000-2004 Ford Focus, 128 hp (97 kW) and 135 lb·ft (183 Nm)
 * 2002-2004 SVT Focus, 170 hp (127 kW) and 145 lb·ft (197 Nm)
 * 1995-2000 Ford Contour
 * 1995-2000 Mercury Mystique
 * 2001-2005 Ford Escape
 * 2001-2005 Mazda Tribute

Turbo
The European Ford Focus RS featured a turbocharged version of the 2.0 L Zeta unit producing 215 hp and 229 lbft of torque, although it was badged as Duratec-RS.

title: Ford Zeta engine


text:
Glendale Community College (Arizona)

Glendale Community College (GCC) is a public community college in Glendale, Arizona. GCC opened in 1965. Programs include associate degrees, certificate programs, industry-specific training, and university transfer. GCC is a part of the Maricopa County Community College District, one of the largest community college districts in the United States. The main campus is a 147 acre site located at 59th and Olive Avenue in Glendale.

GCC offers classes in various sites throughout the area. GCC North in Phoenix opened in fall 2000 with 839 students from the northern part of Maricopa County. Financial backing donated by New York Architect Ron Elsensohn allowed for a major expansion of the north campus which unveiled in the fall of 2008. GCC also offers the first two years of general education requirements at the North Valley campus of Northern Arizona University also in Phoenix and select classes at other sites such as Valley Vista High School in Surprise.

History
Created in 1962 with one college, the Maricopa County Community College District (MCCCD) currently consists of ten separately accredited colleges. MCCCD is one of the largest community college districts in the United States. In the state of Arizona, GCC is the fifth largest community college by population with 14,400 students attending in 2023.

On April 12, 1965, GCC was established by the Governing Board as the second MCCCD college, and charged with serving the higher educational needs of the West Valley. The college started classes in temporary facilities at Camelback and Maryland as an extension of Phoenix College while the permanent campus was constructed. On April 27, 1965, ground broke on the $3.3 million campus in Glendale. In September 1966 the college moved to its current location at Olive Rd. and 59th Ave, taking part of Sahuaro Ranch to establish its campus. In August 1967, the North Central Association of Colleges and Secondary Schools first accredited GCC as an individual college.

In 2000, the GCC expanded with a North campus opened at 57th Avenue and Happy Valley Road. Accreditation continues today through The Higher Learning Commission / North Central Association and includes both the GCC Main campus and the GCC North site.

Campus
The GCC Main Campus is located at N 59th Ave and E Olive Ave in Glendale. Ground was broken on the campus on April 27, 1965. The architectural drawings for the campus were drawn up by Varney, Sexton, Sydnor Associates of Phoenix. The dedication ceremony was held October 16, 1966. After the campus opened new buildings continued to be constructed throughout the end of the 1960s. The Performing Arts Center opened in 1977. This was followed by the High Tech Center in 1987. In the early 2000s, the main campus underwent an effort to modernize and update, adding the Life Science Building in October of 2008, the Public Safety Sciences building in January of 2010 and renovating the Student Union.

In the early 2000s GCC began planning for construction of the North Campus. Ground was broken on the North Campus on May 7, 2007. RNL Design drew up the plans for many of the North Campus buildings. The new campus was completed in time for the Fall 2008 Semester.

Academics
Glendale Community College has 111 degree and certificate programs.

Athletics
GCC is home of multiple national, regional, and conference championship teams, All-American athletes and Hall of Fame coaches. GCC has produced seven National Junior College Athletic Association (NJCAA) national championship teams: 1967 cross country, 1968 baseball, 1988 football, 1994 women's softball, 1996 women's basketball, 2000 football, 2005 football, 2014 volleyball.

Hall of Fame Athletes:
 * Herb Boetto: First GCC Baseball Coach (1967)
 * Paul LoDuca: GCC Baseball (1991) MLB Los Angeles Dodgers (2001)
 * Pete Pisciotta: GCC Assistant Football Coach (1967) GCC Athletic Director (1975) GCC Head Football Coach (1979-1980)
 * Phillippi Sparks: GCC Football 1988 National Championship Team (NJCAA) and NFL New York Giants (1992)
 * Haley Christiansen: NJCAA Volleyball National Champion (2014)
 * Isaiah Lopez: NJCAA DII (2015 Men's Basketball)
 * Dave Grant: Baseball coach for 35 years
 * 1967 GCC Cross Country Team: NJCAA National Champions
 * Ralph Neighbors: Track coach for 32 years
 * Bob Phillips: Golf All-American, PGA Tour, 6 time Player of the Year, Southwest PGA Hall of Fame
 * Joe Kersting: NJCAA 50 Winningest Coaches list for his 16-season record of 114-44-2
 * 1998 GCC Volleyball team: overall 42–2 record; an undefeated tournament championship at the San Diego Mesa Invitational Tournament; an undefeated conference season and ACCAC Conference Championship; an undefeated NJCAA Region 1 Tournament and Championship; a third-place finish at the NJCAA DI National Tournament; three NJCAA All Americans, a Conference MVP and several NJCAA All Tournament recipients.
 * Jeff Huson: MLB baseball player
 * Scott Giddings: first NJCAA individual cross country champion, Arizona Conference individual cross country champion, All American twice, won the Arizona Conference team cross country championship twice, NJCAA team cross country championships, and was awarded GCC Sophomore Athlete of the Year
 * Ron Davis: NBA player

Notable alumni

 * Jake Angeli, conspiracy theorist
 * Jan Brewer, Governor of Arizona, 2009–2015
 * Josh Burns, professional wrestler, played football, went on to play at UMass Amherst; signed to WWE where he performs on the NXT brand under the name Josh Briggs
 * James Ellisor, professional basketball player
 * Vince Furnier, better known today as Alice Cooper
 * Ron Kershaw, award-winning television news director
 * Damon Mays, professional football player
 * Joe Riggs, professional mixed martial artist, former WEC Middleweight Champion; formerly fighting for (Bellator), Strikeforce, and the Ultimate Fighting Championship
 * Ted Sarandos, co-chief executive officer at Netflix
 * Gage Skidmore, photographer
 * Randy Soderman, professional soccer player
 * Rick Soderman, professional soccer player
 * Philippi Sparks, professional football player for the Giants and Cowboys, father of Jordin Sparks, another notable Phoenix native
 * Richard Young, former professional wrestler signed to WWE under the name Ricky Ortiz; played football and earned a scholarship to play for the University of Tulsa

title: Glendale Community College (Arizona)


text:
Talk:Ciao

Ciao in Spanish
Why no mention of the common use of 'ciao' in Spanish?

i di nont ageer

Actually ciao is italian. In spanish, it is spelled chao and is only used in South America and some parts of central america

Hello! I must disagree. In fact, I'm Spaniard and I say chao usually with my compatriots.

 * So do I.

Hello, I am from Argentina and ciao is not pronounced as "chao" in here as the other Southamerican countries but as "chau". ¡Chau! =) --Vokoder (talk) 22:44, 31 July 2008 (UTC)

Hi, I am from Argentina too, and we said chao. The comment above me is an ignorant. I don't know in what jungle do you live that "chau" is a real word in spanish. Also, I had friends form other countries, and they said "Chao". So, if you want to put fake information, make your own wikipedia. — Preceding unsigned comment added by 67.84.35.55 (talk) 19:15, 27 November 2012 (UTC)

List of greetings
What's the point of the list of greetings? Shouldn't there rather be a greetings category?

 * Indeed the list is out of place here. It may belong to an article on greeting phrase or somehing like that. Here one should keep only a list of cognates of the word "ciao", in those languages that have them. (In Brazil, for instance, it should be Tchau! and not ''Oi!".) Jorge Stolfi 01:32, 7 January 2006 (UTC)

Vietnamese
The Vietnamese word for "hello" and "goodbye" is "chào". While it sounds like Italian, it is not derived from Italian but is a native word. DHN 22:41, 29 August 2006 (UTC)

 * you could note that in the list of the article, or even in the beginning. 80.30.16.130 (talk) 20:31, 21 November 2007 (UTC)

Twents
When I lived in Delden, in the Twente part of Overijssel, the Netherlands, Twents speakers commonly said "tjo" (english pronunciation: "cho") as a greeting. I've always assumed it was derived from Ciao, just like "tjuus" or "ajuus" comes from "adieu." I can't find any references for this, though. 198.51.251.199 (talk) 16:42, 22 February 2008 (UTC) I lived in the same town, and I've always had the same theory. 173.48.42.185 (talk) 23:42, 19 September 2013 (UTC)

Greeting that means hello and goodbye
Also, "Ciao"is commonly used in french meaning "goodBye"

Is there a word for the type of greeting that means both hello and goodbye (such as Ciao or Aloha)?

An oxymoron?82.16.176.249 (talk) 00:32, 8 March 2009 (UTC)

Milanese?
"A Milanese proverb/tongue-twister says "Se gh'inn gh'inn, se gh'inn no s-ciào" (If they are - meaning money - they are, if they aren't. In Italian: "Oh, va be', s-ciào" (Oh, well, never mind)" The first sentence is probably in Veneto and not in Milanese. Moreover in Milanese the form "s-ciào" is not used. The second sentence although written in Italian is not Italian, maybe is used in some regions like Veneto. --192.33.238.6 19:06, 29 August 2007 (UTC)
 * That's right. I'm milanese, and that's not milanese dialect. Moreover, the second sentence should be italian spoken by a venitian or something like that.--83.189.204.255 (talk) 09:43, 14 December 2007 (UTC)

 * Not Milanese? How so?
 * s'ciàvo, s'ciào inter. addio; ciao; e ~! pazienza!
 * (Vallardi, Dizionario Milanese Tascabile, 1997)
 * The latter meaning is exactly what is being exposed by this part of the article. And of course, "se" means "if", and "g'hinn" means "there are", both perfectly Milanese.
 * LjL (talk) 15:18, 19 April 2009 (UTC)

Meaning of phrase
I removed this sentence since I could not make sense of it:
 * The rich people and the Hebrews were often repurchased from the original communities.

Would the author care to clarify its intended meaning? Jorge Stolfi (talk) 11:59, 27 February 2008 (UTC)

 * I think the meaning could have been: "The people from a rich family, who could afford the price, and the Jews, for whose price took charge the entire community (incidentally, the Jewish community in Venice was one of the more prosperous of the world at those times), albeit if not rich". —Preceding unsigned comment added by 212.14.141.113 (talk) 08:35, 13 October 2008 (UTC)

Description of gesture
Why is the description of the ciao hand gesture more like an 'external wave' than the more familiar 'double self wave'? This seems odd to me. —Preceding unsigned comment added by 99.142.94.213 (talk) 13:14, 3 October 2008 (UTC)

Origin of hand-waving gesture
Someone added the claim that the gesture and the word were introduced in Brazil together by Italian immigrants (which means around 1900). Both claims need confirmation. Note that we have no date for the spread of the word to other languages. The word it may have come to Brazil from Italy before 1900, or may have come via some other language (Portuguese, French, Spanish, ...). As for the hand-waving gesture, we need evidence for or against the common origin theory. --Jorge Stolfi (talk) 06:18, 11 November 2008 (UTC)

Slavery in Venice
I deleted the sentences below, since they lack references and appear to be disputed (Tartars in the 4th--10th century?) and are not very pertinent to the subject of the article. They should be moved to the Venice article or some such. --Jorge Stolfi (talk) 06:29, 11 November 2008 (UTC)

 * " The institution of slavery existed in Venice during the very Early Middle Ages (4th-10th century) when the slaves were usually young Tartars bought in Tana (near Azov) or, more rarely, Muslims captured on the sea during wars. In the High Middle Ages the slaves could also be non-Catholic Christians from the Balkans, such as Slavs and Greeks. In Venice there were also few slaves that came from Black Africa (as depicted, eg., by Vittore Carpaccio). The status of slaves in Medieval Venice was not very different from that of servants, and they were often freed in testaments . "

Why is "Chalo fir milenge" of Hindi based on "Ciao"???
The word "chalo" is derived from "chal"na or "to walk". I don't think it is derived from, or has any relation with "ciao", although the stylized pronunciation of the word rhymes with "ciao", with the "la" hardly stressed. Elncid (talk) 10:15, 17 May 2010 (UTC)
 * I think whoever wrote this article just looked for words that sound like ciao and then claim that it's derived from it. Some words in the list have nothing to do with the Italian ciao. DHN (talk) 23:05, 28 June 2010 (UTC)

Swedish etymological equivalent
I think it's worth noting that Swedish has a greeting phrase which has a virtually identical etymology, but with a separate development. The modern word tjenare'nbhjbiubhi' (appr. "hi there, hiya") derives from (er ödmjuke) tjänare'' ("(your humble) servant") and is attested since 1775 in one of Carl Michael Bellman's songs. It's only used in greeting, not in parting, though, and it's somewhat more informal than ciao.

Peter Isotalo 17:03, 4 August 2010 (UTC)

"variations" section without sources
I have no written references for that - and I doubt that references such may exist, being those forms very informal - but as a native speaker, I confirm what is described in the "variations" section. --Paginazero (talk) 19:47, 23 September 2010 (UTC)

Third person singular?!!
It is to be highly stressed that in Italy ciao is used only in informal contexts, i.e. among family members, relatives, friends, in other words with those one would address with tu (second person singular) as opposed to Lei (third person singular);

This makes no sense. How can you address someone in the third person? — Preceding unsigned comment added by 87.82.228.164 (talk) 13:56, 5 August 2011 (UTC)

In Italian language it's used to adress someone in the third person in formal contexts. — Preceding unsigned comment added by 87.0.92.108 (talk) 15:19, 27 September 2011 (UTC)

Huh?? I agree with 87.82.228.164 above - what does "address someone in the third person" mean? Til Eulenspiegel (talk) 15:32, 27 September 2011 (UTC)

 * Are you asking what the common grammatical phrase 'third person' means?? In English in very formal situations we may say 'Helly Mr Roberts', this would be using the third person singular in a way. In formal situations use a third person singular verb (like plays, is, reads...) and / or a third person singular pronoun (he, she, Bob, Mr Roberts).  In informal situations Itlians use a second person singular (you) pronoun and a second person singular verb (are, read, play...) just as we do in English.  Use Ciao in informal situations.  Use buon giorno in more formal situations.--37.182.20.175 (talk) 00:47, 1 December 2013 (UTC)

Well, if you have to considere such ignorant people... I'll explain you in an easy way: I say "How are you?" to a friend of mine, but I have to say "How is She?" to a teacher, even if he's a male. — Preceding unsigned comment added by 82.48.169.70 (talk) 16:09, 10 May 2014 (UTC)

Vietnamese
The article implied that the word chào was introduced into Vietnamese via 13th century Italian traders. While this is certainly a plausible hypothesis, I didn't think the source that was used to support this is very reliable. It appears to list correspondences/coincidences between words in Vietnamese and a wide range of modern European languages, marking some of them as having a shared origin, but the author doesn't seem to have any linguistic credentials or etymological evidence to support his claims. While I'm not a linguist myself, the etymologies given look very dubious to me and are demonstratively incorrect in some cases (sĩ, tính, and truyền are all Sino-Vietnamese vocabulary). While it would be okay to note the coincidence between ciao and chào I don't think it should be listed with the rest of the loanwords without evidence from a more reliable source. 169.229.95.185 (talk) 09:25, 10 December 2011 (UTC)

I'm ITalian, usage un dialects
Here in Italy we have some good and funny dialects which use different forms of "ciao". We can expand it. — Preceding unsigned comment added by 151.51.226.157 (talk) 12:46, 18 May 2012 (UTC)

Farsi
The Farsi words on the list are just three Farsi phrases for "goodbye," none of which bear any similarity to ciao. — Preceding unsigned comment added by 137.99.82.107 (talk) 19:45, 1 August 2012 (UTC)

Technically, ciao comes from some old italian abbreviation of "I am your slave". Persians too, also say "I am your slave" (fadat besham). I hope a mention of this written in the article. — Preceding unsigned comment added by 99.225.225.249 (talk) 02:48, 12 February 2015 (UTC)

Verbal Analog for Servus?
Is the etymology possibly a conjugation of a late Latin verb such as 'servere?'

Use in Spain
--Xareu bs (talk) 16:32, 25 April 2016 (UTC)In Spain the word chao is used in informal situations, but in no way only by young people as an original greeting. It's become very common in every day usage.

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Ciao. 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/20071018173236/http://bartleby.com/61/22/C0352200.html to http://www.bartleby.com/61/22/C0352200.html

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 15:02, 29 November 2017 (UTC)

title: Talk:Ciao