text:
Dominating set

In graph theory, a dominating set for a graph $G$ is a subset $D$ of its vertices, such that any vertex of $G$ is in $D$, or has a neighbor in $D$. The domination number $γ(G)$ is the number of vertices in a smallest dominating set for $G$.

The dominating set problem concerns testing whether $γ(G) ≤ K$ for a given graph $G$ and input $K$; it is a classical NP-complete decision problem in computational complexity theory. Therefore it is believed that there may be no efficient algorithm that can compute $γ(G)$ for all graphs $G$. However, there are efficient approximation algorithms, as well as efficient exact algorithms for certain graph classes.

Dominating sets are of practical interest in several areas. In wireless networking, dominating sets are used to find efficient routes within ad-hoc mobile networks. They have also been used in document summarization, and in designing secure systems for electrical grids.

Formal definition
Given an undirected graph $G = (V, E)$, a subset of vertices $$D\subseteq V$$ is called a dominating set if for every vertex $$u\in V\setminus D$$, there is a vertex $$v\in D$$ such that $$(u,v)\in E$$.

Every graph has at least one dominating set: if $$D=V=$$ the set of all vertices, then by definition D is a dominating set, since there is no vertex $$u\in V\setminus D$$. A more interesting challenge is to find small dominating sets. The domination number of $G$ is defined as: $$\gamma(G) := \min \{|D| : D \text{ is a dominating set of } G \}$$.

Variants
A connected dominating set is a dominating set that is also connected. If S is a connected dominating set, one can form a spanning tree of G in which S forms the set of non-leaf vertices of the tree; conversely, if T is any spanning tree in a graph with more than two vertices, the non-leaf vertices of T form a connected dominating set. Therefore, finding minimum connected dominating sets is equivalent to finding spanning trees with the maximum possible number of leaves.

A total dominating set (or strongly-dominating set) is a set of vertices such that all vertices in the graph, including the vertices in the dominating set themselves, have a neighbor in the dominating set. That is: for every vertex $$u\in V$$, there is a vertex $$v\in D$$ such that $$(u,v)\in E$$. Figure (c) above shows a dominating set that is a connected dominating set and a total dominating set; the examples in figures (a) and (b) are neither. In contrast to a simple dominating set, a total dominating set may not exist. For example, a graph with one or more vertices and no edges does not have a total dominating set. The strong domination number of $G$ is defined as: $$\gamma^{strong}(G) := \min \{|D| : D \text{ is a strongly-dominating set of } G \}$$; obviously, $$\gamma^{strong}(G) \geq \gamma(G)$$.

A dominating edge-set is a set of edges (vertex pairs) whose union is a dominating set; such a set may not exist (for example, a graph with one or more vertices and no edges does not have it). If it exists, then the union of all its edges is a strongly-dominating set. Therefore, the smallest size of an edge-dominating set is at least $$\gamma^{strong}(G) /2$$.

In contrast, an edge-dominating set is a set D of edges, such that every edge not in D is adjacent to at least one edge in D; such a set always exists (for example, the set of all edges is an edge-dominating set).

A k-dominating set is a set of vertices such that each vertex not in the set has at least k neighbors in the set (a standard dominating set is a 1-dominating set). Similarly, a k-tuple dominating set is a set of vertices such that each vertex in the graph has at least k neighbors in the set (a total dominating set is a 1-tuple dominating set). An $(1 + log n)$-approximation of a minimum k-tuple dominating set can be found in polynomial time. Every graph admits a k-dominating set (for example, the set of all vertices); but only graphs with minimum degree $k − 1$ admit a k-tuple dominating set. However, even if the graph admits k-tuple dominating set, a minimum k-tuple dominating set can be nearly k times as large as a minimum k-dominating set for the same graph; An $(1.7 + log Δ)$-approximation of a minimum k-dominating set can be found in polynomial time as well.

A star-dominating set is a subset D of V such that, for every vertex v in V, the star of v (the set of edges adjacent to v) intersects the star of some vertex in D. Clearly, if G has isolated vertices then it has no star-dominating sets (since the star of isolated vertices is empty). If G has no isolated vertices, then every dominating set is a star-dominating set and vice versa. The distinction between star-domination and usual domination is more substantial when their fractional variants are considered.

A domatic partition is a partition of the vertices into disjoint dominating sets. The domatic number is the maximum size of a domatic partition.

An eternal dominating set is a dynamic version of domination in which a vertex v in dominating set D is chosen and replaced with a neighbor u (u is not in D) such that the modified D is also a dominating set and this process can be repeated over any infinite sequence of choices of vertices v.

Dominating and independent sets
Dominating sets are closely related to independent sets: an independent set is also a dominating set if and only if it is a maximal independent set, so any maximal independent set in a graph is necessarily also a minimal dominating set.

Domination by independent sets
A dominating set may or may not be an independent set. For example, figures (a) and (b) above show independent dominating sets, while figure (c) illustrates a dominating set that is not an independent set.

The independent domination number $i(G)$ of a graph $G$ is the size of the smallest dominating set that is an independent set. Equivalently, it is the size of the smallest maximal independent set. The minimum in $i(G)$ is taken over less elements (only the independent sets are considered), so $γ(G) ≤ i(G)$ for all graphs $G$.

The inequality can be strict - there are graphs $G$ for which $γ(G) < i(G)$. For example, let $G$ be the double star graph consisting of vertices $x_1, \ldots, x_p, a, b, y_1, \ldots, y_q$, where $p, q > 1$. The edges of $G$ are defined as follows: each $xi$ is adjacent to $a$, $a$ is adjacent to $b$, and $b$ is adjacent to each $yj$. Then $γ(G) = 2$ since ${a, b}$ is a smallest dominating set. If $p ≤ q$, then $i(G) = p + 1$ since $\{x_1, \ldots, x_p, b\}$ is a smallest dominating set that is also independent (it is a smallest maximal independent set).

There are graph families in which $γ(G) = i(G)$, that is, every minimum maximal independent set is a minimum dominating set. For example, $γ(G) = i(G)$ if $G$ is a claw-free graph.

A graph $G$ is called a domination-perfect graph if $γ(H) = i(H)$ in every induced subgraph $H$ of $G$. Since an induced subgraph of a claw-free graph is claw-free, it follows that every claw-free graphs is also domination-perfect.

For any graph $G$, its line graph $L(G)$ is claw-free, and hence a minimum maximal independent set in $L(G)$ is also a minimum dominating set in $L(G)$. An independent set in $L(G)$ corresponds to a matching in $G$, and a dominating set in $L(G)$ corresponds to an edge dominating set in $G$. Therefore a minimum maximal matching has the same size as a minimum edge dominating set.

Domination of independent sets
The independence domination number $iγ(G)$ of a graph $G$ is the maximum, over all independent sets $A$ of $G$, of the smallest set dominating $A$. Dominating subsets of vertices requires potentially less vertices than dominating all vertices, so $iγ(G) ≤ γ(G)$ for all graphs $G$.

The inequality can be strict - there are graphs $G$ for which $iγ(G) < γ(G)$. For example, for some integer $n$, let $G$ be a graph in which the vertices are the rows and columns of an $n$-by-$n$ board, and two such vertices are connected if and only if they intersect. The only independent sets are sets of only rows or sets of only columns, and each of them can be dominated by a single vertex (a column or a row), so $iγ(G) = 1$. However, to dominate all vertices we need at least one row and one column, so $γ(G) = 2$. Moreover, the ratio between $γ(G) / iγ(G)$ can be arbitrarily large. For example, if the vertices of $G$ are all the subsets of squares of an $n$-by-$n$ board, then still $iγ(G) = 1$, but $γ(G) = n$.

The bi-independent domination number $iγi(G)$ of a graph $G$ is the maximum, over all independent sets $A$ of $G$, of the smallest independent set dominating $A$. The following relations hold for any graph $G$: $$\begin{align} i(G)&\geq \gamma (G) \geq i\gamma(G) \\ i(G)&\geq i\gamma i(G) \geq i\gamma(G) \end{align}$$

History
The domination problem was studied from the 1950s onwards, but the rate of research on domination significantly increased in the mid-1970s. In 1972, Richard Karp proved the set cover problem to be NP-complete. This had immediate implications for the dominating set problem, as there are straightforward vertex to set and edge to non-disjoint-intersection bijections between the two problems. This proved the dominating set problem to be NP-complete as well.

Algorithms and computational complexity
The set cover problem is a well-known NP-hard problem – the decision version of set covering was one of Karp's 21 NP-complete problems. There exist a pair of polynomial-time L-reductions between the minimum dominating set problem and the set cover problem. These reductions (see below) show that an efficient algorithm for the minimum dominating set problem would provide an efficient algorithm for the set cover problem, and vice versa. Moreover, the reductions preserve the approximation ratio: for any α, a polynomial-time α-approximation algorithm for minimum dominating sets would provide a polynomial-time α-approximation algorithm for the set cover problem and vice versa. Both problems are in fact Log-APX-complete.

The approximability of set covering is also well understood: a logarithmic approximation factor can be found by using a simple greedy algorithm, and finding a sublogarithmic approximation factor is NP-hard. More specifically, the greedy algorithm provides a factor $1 + log|V|$ approximation of a minimum dominating set, and no polynomial time algorithm can achieve an approximation factor better than $c log|V|$ for some $c > 0$ unless P = NP.

L-reductions
The following two reductions show that the minimum dominating set problem and the set cover problem are equivalent under L-reductions: given an instance of one problem, we can construct an equivalent instance of the other problem.

From dominating set to set covering
Given a graph $G = (V, E)$ with $V = {1, 2, ..., n},$ construct a set cover instance $(U, S)$ as follows: the universe $U$ is $V$, and the family of subsets is $S = {S1, S2, ..., Sn}$ such that $Sv$ consists of the vertex $v$ and all vertices adjacent to $v$ in $G$.

Now if $D$ is a dominating set for $G$, then $C = {Sv : v ∈ D}$ is a feasible solution of the set cover problem, with $|C| = |D|$. Conversely, if $C = {Sv : v ∈ D}$ is a feasible solution of the set cover problem, then $D$ is a dominating set for $G$, with $|D| = |C|$.

Hence the size of a minimum dominating set for $G$ equals the size of a minimum set cover for $(U, S)$. Furthermore, there is a simple algorithm that maps a dominating set to a set cover of the same size and vice versa. In particular, an efficient α-approximation algorithm for set covering provides an efficient α-approximation algorithm for minimum dominating sets.

 * For example, given the graph $G$ shown on the right, we construct a set cover instance with the universe $U = {1, 2, ..., 6}$ and the subsets $S1 = {1, 2, 5},$ $S2 = {1, 2, 3, 5},$ $S3 = {2, 3, 4, 6},$ $S4 = {3, 4},$ $S5 = {1, 2, 5, 6},$ and $S6 = {3, 5, 6}.$ In this example, $D = {3, 5}$ is a dominating set for $G$ – this corresponds to the set cover $C = {S3, S5}.$ For example, the vertex $4 ∈ V$ is dominated by the vertex $3 ∈ D$, and the element $4 ∈ U$ is contained in the set $S3 ∈ C$.

From set covering to dominating set
Let $(S, U)$ be an instance of the set cover problem with the universe $U$ and the family of subsets $S = {Si : i ∈ I};$ we assume that $U$ and the index set $I$ are disjoint. Construct a graph $G = (V, E)$ as follows: the set of vertices is $V = I ∪ U$, there is an edge ${i, j} ∈ E$ between each pair $i, j ∈ I$, and there is also an edge ${i, u}$ for each $i ∈ I$ and $u ∈ Si$. That is, $G$ is a split graph: $I$ is a clique and $U$ is an independent set.

Now if $C = {Si : i ∈ D}$ is a feasible solution of the set cover problem for some subset $D ⊆ I$, then $D$ is a dominating set for $G$, with $|D| = |C|$: First, for each $u ∈ U$ there is an $i ∈ D$ such that $u ∈ Si$, and by construction, $u$ and $i$ are adjacent in $G$; hence $u$ is dominated by $i$. Second, since $D$ must be nonempty, each $i ∈ I$ is adjacent to a vertex in $D$.

Conversely, let $D$ be a dominating set for $G$. Then it is possible to construct another dominating set $X$ such that $|X| ≤ |D|$ and $X ⊆ I$: simply replace each $u ∈ D ∩ U$ by a neighbour $i ∈ I$ of $u$. Then $C = {Si : i ∈ X}$ is a feasible solution of the set cover problem, with $|C| = |X| ≤ |D|$.

 * The illustration on the right show the construction for $U = {a, b, c, d, e}, I = {1, 2, 3, 4},$ $S1 = {a, b, c},$ $S2 = {a, b},$ $S3 = {b, c, d},$ and $S4 = {c, d, e}.$

 * In this example, $C = {S1, S4}$ is a set cover; this corresponds to the dominating set $D = {1, 4}.$

 * $D = {a, 3, 4}$ is another dominating set for the graph $G$. Given $D$, we can construct a dominating set $X = {1, 3, 4}$ which is not larger than $D$ and which is a subset of $I$. The dominating set $X$ corresponds to the set cover $C = {S1, S3, S4}.$

Special cases
If the graph has maximum degree Δ, then the greedy approximation algorithm finds an $O(log Δ)$-approximation of a minimum dominating set. Also, let $dg$ be the cardinality of dominating set obtained using greedy approximation then following relation holds, $$ d_g \le N+1 - \sqrt{2M+1}$$, where $N$ is number of nodes and $M$ is number of edges in given undirected graph. For fixed Δ, this qualifies as a dominating set for APX membership; in fact, it is APX-complete.

The problem admits a polynomial-time approximation scheme (PTAS) for special cases such as unit disk graphs and planar graphs. A minimum dominating set can be found in linear time in series–parallel graphs.

Exact algorithms
A minimum dominating set of an $n$-vertex graph can be found in time $O(2nn)$ by inspecting all vertex subsets. show how to find a minimum dominating set in time $O(1.5137n)$ and exponential space, and in time $O(1.5264n)$ and polynomial space. A faster algorithm, using $O(1.5048n)$ time was found by, who also show that the number of minimum dominating sets can be computed in this time. The number of minimal dominating sets is at most $1.7159n$ and all such sets can be listed in time $O(1.7159n)$.

Parameterized complexity
Finding a dominating set of size $k$ plays a central role in the theory of parameterized complexity. It is the most well-known problem complete for the class W[2] and used in many reductions to show intractability of other problems. In particular, the problem is not fixed-parameter tractable in the sense that no algorithm with running time $f(k)nO(1)$ for any function $f$ exists unless the W-hierarchy collapses to FPT=W[2].

On the other hand, if the input graph is planar, the problem remains NP-hard, but a fixed-parameter algorithm is known. In fact, the problem has a kernel of size linear in $k$, and running times that are exponential in $\sqrt{k}$ and cubic in $n$ may be obtained by applying dynamic programming to a branch-decomposition of the kernel. More generally, the dominating set problem and many variants of the problem are fixed-parameter tractable when parameterized by both the size of the dominating set and the size of the smallest forbidden complete bipartite subgraph; that is, the problem is FPT on biclique-free graphs, a very general class of sparse graphs that includes the planar graphs.

The complementary set to a dominating set, a nonblocker, can be found by a fixed-parameter algorithm on any graph.

title: Dominating set


text:
Wikipedia:Articles for deletion/List of names for the human penis

 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 no consensus. Tony Sidaway|Talk 14:04, 30 Apr 2005 (UTC)

List of names for the human penis
Stupid. Transwiki to Wiktionary and delete. Neutralitytalk 03:58, Apr 16, 2005 (UTC)
 * Merge with penis. Firebug 05:21, 16 Apr 2005 (UTC)
 * That's not a good idea. penis is about the actual thing.  This article is all about words, and is largely irrelevant to penis.  We've got a dictionary for words.  Let's use it. Uncle G 16:38, 2005 Apr 16 (UTC)
 * Keep or Merge with the relavent section of the list of sexual slang. Penises are always notable, unless they are merely stubs. Klonimus 06:41, 16 Apr 2005 (UTC)
 * LOL!!! Oh dude, that answer is going on BJAODN later.  Meantime, merge with the sexual slang article. - Lucky 6.9 07:28, 16 Apr 2005 (UTC)
 * It's not even a good list - repetitive and lacks all of the interesting names (that are already listed over on Body parts slang). Merge there. Zack 07:31, 16 Apr 2005 (UTC)
 * I added pecker to the list since it had been omitted. I still think the list should be combined with another article. Firebug 07:54, 16 Apr 2005 (UTC)
 * Delete. Not at all encyclopedic. Sjakkalle 09:31, 16 Apr 2005 (UTC)
 * This is useless duplication. There's a perfectly good entry for penis in Wiktionary that already has both a "Synonyms" section for synonyms and slang terms, and a "Translations" section for translations of the word into other languages (both of which are a lot larger than this list is).  There's also a perfectly good Thesaurus page for "penis" in Wiktionary, too.  Please do your dictionary work in the dictionary, people. Wikipedia is not a dictionary.  Delete. Uncle G 16:38, 2005 Apr 16 (UTC)
 * And since when does size matter?
 * Delete per Uncle G. --TenOfAllTrades | Talk 17:16, 16 Apr 2005 (UTC)
 * redirect to Body_parts_slang BigFatDave 21:52, 16 Apr 2005 (UTC)
 * wiktionary entry in its very purest form. Mikkalai 01:39, 17 Apr 2005 (UTC)
 * Delete, agree with Uncle G, Wiktionary has facilities for synonyms and translation. Also, classic answer Klonimus! --bainer 06:15, 17 Apr 2005 (UTC)
 * Delete, duplicate/redundant list. Megan1967 10:23, 17 Apr 2005 (UTC)
 * Delete. It's already in Wiktionary. --Carnildo 00:15, 26 Apr 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.

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


text:
Talk:Fijación Oral, Vol. 1

Improvement Ideas
I would like too see one Shakira article get a Good Article tag. Fijacion Oral would be a good place to start. We can start by improving the critical reviews section, making a separate commercial reception section, a promotion section that talks about the singles and their chart performance along with a brief paragraph or two about the Oral Fixation Tour. Also, we need to find more information regarding the recording, collaborations, compositions of the songs, etc. to help improve the article. — Preceding unsigned comment added by 99.109.147.18 (talk) 06:52, 23 February 2012 (UTC)

Untitled
I thought the album's name is Fijacion Oral Vol. 1??

singles
Neither Obtener Un Si or Las De la Intuition have charted on the billboard hot latin tracks. Nor have No and Dia De Enero on the Billboard hot 100

http://billboard.com/bbcom/retrieve_chart_history.do?model.vnuArtistId=147604&model.vnuAlbumId=683532 http://www.allmusic.com/cg/amg.dll?p=amg&searchlink=SHAKIRA&sql=11:mflvadokt8wj~T51

24.23.228.148 02:10, 3 July 2006 (UTC)

According to Billboard the following songs charted on the following charts:

Dia Especial - Latin Pop Songs (#26) Las de la Intuicion - Latin Pop Songs (#16) and Latin Songs (#32) — Preceding unsigned comment added by 99.109.147.18 (talk) 06:19, 25 February 2012 (UTC)

Quick comments
These are just brief comments so I didn't include them in the PR:
 * Images need alt text including the album cover
 * The four million sales needs an "as of" date. Erick (talk) 17:11, 27 July 2013 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 1 one external link on Fijación Oral, Vol. 1. 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 http://web.archive.org/web/20140709100356/http://www.hitparade.ch/year.asp?key=2005 to http://hitparade.ch/year.asp?key=2005

When you have finished reviewing my changes, please set the checked parameter below to true or failed to let others know (documentation at ).

Cheers.— InternetArchiveBot  (Report bug) 20:02, 20 July 2016 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 2 external links on Fijación Oral, Vol. 1. 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/20131215011401/http://www.austriancharts.at/2005_album.asp to http://austriancharts.at/2005_album.asp
 * Added archive https://web.archive.org/web/20120618115520/http://www.dutchcharts.nl/jaaroverzichten.asp?year=2005&cat=a to http://dutchcharts.nl/jaaroverzichten.asp?year=2005&cat=a

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) 12:39, 31 December 2016 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 2 external links on Fijación Oral, Vol. 1. 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.rollingstone.com/reviews/album/7369453/review/7471710
 * Added archive https://web.archive.org/web/20131029202345/http://www.estereofonica.com/premios-nuestra-tierra-a-lo-mejor-de-la-musica-colombiana/ to http://www.estereofonica.com/premios-nuestra-tierra-a-lo-mejor-de-la-musica-colombiana/

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) 05:06, 20 May 2017 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Fijación Oral, Vol. 1. 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/20141231193653/http://www.eluniversal.com/2005/06/07/til_art_07316E to http://www.eluniversal.com/2005/06/07/til_art_07316E

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) 21:59, 23 September 2017 (UTC)

title: Talk:Fijación Oral, Vol. 1


text:
GE Infrastructure

GE Infrastructure was a subsidiary of General Electric, formed in 2005 as part of a company-wide reorganization under CEO Jeff Immelt, until it was split apart into GE Technology Infrastructure and GE Energy Infrastructure in another reorganization in 2008. The president and CEO of GE Infrastructure, John G. Rice, was transferred to GE Technology Infrastructure.

When it was active, business units making up GE Infrastructure included:
 * GE Aviation (relocated to GE Technology Infrastructure)
 * GE Commercial Aviation Services (relocated to GE Capital)
 * GE Energy (relocated to GE Energy Infrastructure)
 * GE Energy Financial Services (relocated to GE Capital)
 * GE Oil and Gas (relocated to GE Energy Infrastructure)
 * GE Transportation Systems (relocated to GE Technology Infrastructure)
 * GE Water & Process Technologies (relocated to GE Energy Infrastructure)

title: GE Infrastructure


text: User talk:24.154.44.15

title: User talk:24.154.44.15


text: User talk:68.205.198.2

title: User talk:68.205.198.2


text:
Talk:GE Transportation

History
Boy, this article sure is lacking in the history department. Anyone feel like starting a History section? I have a book that has some basic history of the company, so I'd be happy to take a crack at it if no one else wants to. –BMRR (talk) 23:38, 15 May 2011 (UTC)

Compared to the EMD article (GE's main competitor) it definitely lacks a lot of history - some of which can be found there! The main GE article doesn't touch on the locomotive works much either. Would be nice to have. Lordjim13 (talk) 11:39, 28 September 2021 (UTC)

 * The irony of a GE component being acquired by a former division of Westinghouse, I'm sure was not lost on some people. knoodelhed (talk) 00:16, 24 February 2024 (UTC)

GE C25 EMPD
These were built by GE Transportation in Brazil for Nigeria. I am planning to write an article. If you have more information, please let me know. Biscuittin (talk) 23:49, 31 January 2016 (UTC)
 * Are they in the GE Dash 9 Series? Biscuittin (talk) 23:55, 31 January 2016 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 3 external links on GE Transportation. 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://archive.is/20130124113253/http://www.genewscenter.com/Content/Detail.asp?ReleaseID=3863&NewsAreaID=2&MenuSearchCategoryID= to http://www.genewscenter.com/Content/Detail.asp?ReleaseID=3863&NewsAreaID=2&MenuSearchCategoryID=
 * Added archive https://archive.is/20130202091844/http://sharonherald.com/business/x1208364539/-High-probability-for-layoffs-in-Grove-City-GE-official-says to http://sharonherald.com/business/x1208364539/-High-probability-for-layoffs-in-Grove-City-GE-official-says
 * Added archive https://web.archive.org/web/20100926155450/http://www.railjournal.com/newsflash/ge-hybrid-locomotive-ready-for-the-market-in-2014-15.html to http://www.railjournal.com/newsflash/ge-hybrid-locomotive-ready-for-the-market-in-2014-15.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) 06:52, 4 September 2017 (UTC)

Market share
We claim the North American market is essentially divided 70-30 between only two competitors, GE Transportation and EMD.

I would like to ask those in the know if this really is true still in 2023. Isn't Siemens delivering locomotives to North American operators, for instance?

CapnZapp (talk) 08:22, 16 April 2023 (UTC)

 * Probably outdated and incorrect. There are a few minor players, and Siemens has made major inroads lately. Other builders include MotivePower (though now also a Wabtec subsidiary along with GE Transportation), Brookville Equipment, Railpower Technologies, Alstom, and National Railway Equipment. GE and EMD are the two major builders still. Trainsandotherthings (talk) 12:21, 16 April 2023 (UTC)

title: Talk:GE Transportation


text:
Talk:GE Aerospace

The operating and net income values on this page seem very suspect. Also, the citation is for a completely different company. I suspect someone cut and pasted this from another page and did not update. — Preceding unsigned comment added by Wilsonjd (talk • contribs) 19:43, 13 June 2017 (UTC)

title: Talk:GE Aerospace


text: File:AliciaKeys-SongsInAMinor-music-album.jpg


text: User talk:69.193.81.189

title: User talk:69.193.81.189


text:
Marcos

Marcos may refer to:

People with the given name Marcos

 * Marcos (given name)
 * Marcos family

Sports

 * Surnamed
 * Dayton Marcos, Negro league baseball team from Dayton, Ohio (early twentieth-century)
 * Dimitris Markos, Greek footballer
 * Nélson Marcos, Portuguese footballer
 * Randa Markos, Iraqi-Canadian female mixed martial artist
 * Nicknamed simply as Marcos
 * Marcos Pereira Martins (born 1943), Brazilian football winger
 * Marcos Roberto Silveira Reis (born 1973), Brazilian football goalkeeper
 * Marcos Joaquim dos Santos (born 1975), Brazilian footballer
 * Marcos de Paula (born 1983), Brazilian footballer
 * Marcos Alonso Peña (born 1959), Spanish footballer
 * Named
 * Marcos Ambrose, Australian racing driver currently competing in NASCAR
 * Marcos Baghdatis, Cypriot tennis player
 * Marcos Bristow, Indian badminton player
 * Marcos Hernández (swimmer), Cuban freestyle swimmer
 * Marcos Pizzelli, Brazilian-Armenian footballer
 * Marcos García Barreno, Spanish footballer
 * Marcos Mazzaron, Brazilian cyclist
 * Marcos Carneiro de Mendonça (1894–1988), first goalkeeper of the Brazil national team, later president of Fluminense FC
 * Marcos do Nascimento Teixeira, Brazilian footballer, known as Marcão

Politics

 * Ferdinand Marcos (1917–1989), 10th President of the Philippines (1965–1986)
 * Sandro Marcos, current Representative of Ilocos Norte's First District
 * Bongbong Marcos, former senator and former Representative of Ilocos Norte, 17th President of the Philippines (2022-)
 * Imelda Marcos (born 1929), former First Lady and powerful political figure in the Philippines
 * Imee Marcos, current senator
 * Irene Marcos-Araneta, the daughter of Ferdinand and Imelda Marcos
 * Matthew Marcos Manotoc, son of Imee
 * Mariano Marcos, lawyer and politician in Ilocos Norte, Philippines
 * Michael Marcos Keon, nephew of Ferdinand
 * Pacífico Marcos, younger brother of Ferdinand
 * Subcomandante Marcos, also known as Delegate Zero, spokesperson for the Zapatista Army of National Liberation
 * Rabban Marcos, 13th-century cleric later elected as the Nestorian patriarch, Mar Yaballaha III
 * Markos Moulitsas, owner of the largest political blog in the US, Daily Kos

Geography

 * Marcos, Ilocos Norte, Philippines
 * Marcos Castellanos
 * San Marcos, Antioquia
 * San Marcos, Baja California Sur
 * San Marcos, California
 * San Marcos, Costa Rica
 * San Marcos, Guatemala
 * San Marcos, Guerrero
 * San Marcos, Nicaragua
 * San Marcos, Texas
 * San Marcos (department)
 * Márkos, the Hungarian name for Mărcuş village, Dobârlău Commune, Covasna County, Romania

Automobiles

 * Marcos (automobile), British sportscar manufacturer
 * Marcos Mantis GT, sports car
 * Mini Marcos,

Military

 * USS San Marcos (LSD-25), Casa Grande-class dock landing ship
 * MARCOS, India's elite marine commando force

Television and film

 * Lisa Marcos, Canadian actress
 * Niurka Marcos, Cuban-Mexican singer, dancer and actress
 * Marcos A. Rodriguez, Cuban-American businessman
 * K. G. Markose, Indian Playback singer

Art

 * Lajos Markos, painter
 * Pablo Marcos, artist

Education

 * San Marcos High School (Santa Barbara, California), public high school located in the California central coast city of Santa Barbara
 * Mariano Marcos State University, public university in Ilocos Norte, Philippines

Other

 * Chrysostomos Markose, leader of the Syriac Orthodox Church in India
 * Pacífico Marcos, former president of the Philippine Medical Association
 * Marco's Pizza

title: Marcos


text:
File:Two survivors of The March (1945) at Celle Airfield, Hamburg, Germany.jpg

Summary
Description: Two survivors of The March (1945) at Celle Airfield in April 1945. Source: Scanned from the collection of original snapshots taken by Richard Aldworth using a Voigtländer Bessa I folding camera on 120 roll film. Date: April 18, 1945 Location: Celle Airfield, near Hamburg, Germany Author: Richard Aldworth Permission Released under the GFDL and Creative Commons licenses shown below by David R. Aldworth. Other versions: No


text:
Talk:Ratatat (album)

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Ratatat (album). 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://archive.is/20051101232814/http://www.level1productions.com/movies.php?id=26 to http://www.level1productions.com/movies.php?id=26

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) 10:52, 30 December 2017 (UTC)

title: Talk:Ratatat (album)


text:
User talk:Mowgly~enwiki

Hello and welcome to Wikipedia. Thanks for all your contributions.

Here are some useful links in case you haven't already found them: How to edit a page show preview How to write a great article Naming conventions Help Village pump

I hope you continue to enjoy editing here. -Willmcw 04:06, Apr 16, 2005 (UTC)

PS: Please do not delete relevant information and weblinks from articles. If you feel a need to do so, please dicuss the change in the talk pages of the articles. Thanks -Willmcw 04:06, Apr 16, 2005 (UTC)

Your account will be renamed
Hello,

The developer team at Wikimedia is making some changes to how accounts work, as part of our on-going efforts to provide new and better tools for our users like cross-wiki notifications. These changes will mean you have the same account name everywhere. This will let us give you new features that will help you edit and discuss better, and allow more flexible user permissions for tools. One of the side-effects of this is that user accounts will now have to be unique across all 900 Wikimedia wikis. See the announcement for more information.

Unfortunately, your account clashes with another account also called Mowgly. To make sure that both of you can use all Wikimedia projects in future, we have reserved the name Mowgly~enwiki that only you will have. If you like it, you don't have to do anything. If you do not like it, you can pick out a different name. If you think you might own all of the accounts with this name and this message is in error, please visit Special:MergeAccount to check and attach all of your accounts to prevent them from being renamed.

Your account will still work as before, and you will be credited for all your edits made so far, but you will have to use the new account name when you log in.

Sorry for the inconvenience.

Yours, Keegan Peterzell Community Liaison, Wikimedia Foundation 01:58, 20 March 2015 (UTC)

Renamed
 This account has been renamed as part of single-user login finalisation. If you own this account you can |log in using your previous username and password for more information. If you do not like this account's new name, you can choose your own using this form after logging in: . -- Keegan (WMF) (talk) 16:36, 22 April 2015 (UTC)

title: User talk:Mowgly~enwiki


text: Category:Ratatat albums

title: Category:Ratatat albums


text:
Wikipedia:Articles for deletion/Aaron Suski

 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 no co sensus

Aaron Suski
Tagged with. It looks like vanity. Zzyzx11 | Talk 04:09, 16 Apr 2005 (UTC)
 * Delete - Looking at the history of the article. It seems like deja-vu. Nobody has expanded the article to explain the notability of this person the last time I visited it so delete. --Anonymous Cow 04:16, 16 Apr 2005 (UTC)
 * Commment: Changed my mind on voting. Just searched on this person. Could be a notable person not into the skateboard thing so... no vote. --Anonymous Cow 04:21, 16 Apr 2005 (UTC)
 * Delete, underthe bar of notability, possible vanity. Megan1967 07:36, 16 Apr 2005 (UTC)
 * Keep Google has 1500+ hits for "Aaron Suski" + skateboard. Dsmdgold 20:21, Apr 18, 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:
Talk:Falling Up (Digby album)

VFD
On 18 April 2005, this article was nominated for deletion. The result was keep. See Votes for deletion/Falling Up (album) for a record of the discussion. – ABCD 00:58, 5 May 2005 (UTC)

Fair use rationale for Image:Digby fallingup.jpg
Image:Digby fallingup.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) 13:56, 25 February 2008 (UTC)

title: Talk:Falling Up (Digby album)