title: Selection algorithm

abstract: In computer science, a selection algorithm is an algorithm for finding the k th smallest value in a collection of ordered values, such as numbers. The value that it finds is called the k th order statistic. Selection includes as special cases the problems of finding the minimum, median, and maximum element in the collection. Selection algorithms include quickselect, and the median of medians algorithm. When applied to a collection of n values, these algorithms take linear time, O as expressed using big O notation. For data that is already structured, faster algorithms may be possible; as an extreme case, selection in an already-sorted array takes time O.

text:
# Selection algorithm

In computer science, a **selection algorithm** is an algorithm for finding the $k$th smallest value in a collection of ordered values, such as numbers. The value that it finds is called the $k$th order statistic. Selection includes as special cases the problems of finding the minimum, median, and maximum element in the collection. Selection algorithms include quickselect, and the median of medians algorithm. When applied to a collection of $n$ values, these algorithms take linear time, $O(n)$ as expressed using big O notation. For data that is already structured, faster algorithms may be possible; as an extreme case, selection in an already-sorted array takes time $O(1)$.

## Problem statement

An algorithm for the selection problem takes as input a collection of values, and a number $k$. It outputs the $k$th smallest of these values, or, in some versions of the problem, a collection of the $k$ smallest values. For this to be well-defined, it should be possible to sort the values into an order from smallest to largest; for instance, they may be integers, floating-point numbers, or some other kind of object with a numeric key. However, they are not assumed to have been already sorted. Often, selection algorithms are restricted to a comparison-based model of computation, as in comparison sort algorithms, where the algorithm has access to a comparison operation that can determine the relative ordering of any two values, but may not perform any other kind of arithmetic operations on these values.

To simplify the problem, some works on this problem assume that the values are all distinct from each other, or that some consistent tie-breaking method has been used to assign an ordering to pairs of items with the same value as each other. Another variation in the problem definition concerns the numbering of the ordered values: is the smallest value obtained by setting $k=0$, as in zero-based numbering of arrays, or is it obtained by setting $k=1$, following the usual English-language conventions for the smallest, second-smallest, etc.? This article follows the conventions used by Cormen et al., according to which all values are distinct and the minimum value is obtained from $k=1$.

With these conventions, the maximum value, among a collection of $n$ values, is obtained by setting $k=n$. When $n$ is an odd number, the median of the collection is obtained by setting $k=(n+1)/2$. When $n$ is even, there are two choices for the median, obtained by rounding this choice of $k$ down or up, respectively: the *lower median* with $k=n/2$ and the *upper median* with $k=n/2+1$.

## Algorithms

### Sorting and heapselect

As a baseline algorithm, selection of the $k$th smallest value in a collection of values can be performed by the following two steps:

* Sort the collection
* If the output of the sorting algorithm is an array, retrieve its $k$th element; otherwise, scan the sorted sequence to find the $k$th element.

The time for this method is dominated by the sorting step, which requires $\Theta (n\log n)$ time using a comparison sort. Even when integer sorting algorithms may be used, these are generally slower than the linear time that may be achieved using specialized selection algorithms. Nevertheless, the simplicity of this approach makes it attractive, especially when a highly-optimized sorting routine is provided as part of a runtime library, but a selection algorithm is not. For inputs of moderate size, sorting can be faster than non-random selection algorithms, because of the smaller constant factors in its running time. This method also produces a sorted version of the collection, which may be useful for other later computations, and in particular for selection with other choices of $k$.

For a sorting algorithm that generates one item at a time, such as selection sort, the scan can be done in tandem with the sort, and the sort can be terminated once the $k$th element has been found. One possible design of a consolation bracket in a single-elimination tournament, in which the teams who lost to the eventual winner play another mini-tournament to determine second place, can be seen as an instance of this method. Applying this optimization to heapsort produces the heapselect algorithm, which can select the $k$th smallest value in time $O(n+k\log n)$. This is fast when $k$ is small relative to $n$, but degenerates to $O(n\log n)$ for larger values of $k$, such as the choice $k=n/2$ used for median finding.

### Pivoting

Many methods for selection are based on choosing a special "pivot" element from the input, and using comparisons with this element to divide the remaining $n-1$ input values into two subsets: the set $L$ of elements less than the pivot, and the set $R$ of elements greater than the pivot. The algorithm can then determine where the $k$th smallest value is to be found, based on a comparison of $k$ with the sizes of these sets. In particular, if $k\leq |L|$, the $k$th smallest value is in $L$, and can be found recursively by applying the same selection algorithm to $L$. If $k=|L|+1$, then the $k$th smallest value is the pivot, and it can be returned immediately. In the remaining case, the $k$th smallest value is in $R$, and more specifically it is the element in position $k-|L|-1$ of $R$. It can be found by applying a selection algorithm recursively, seeking the value in this position in $R$.

As with the related pivoting-based quicksort algorithm, the partition of the input into $L$ and $R$ may be done by making new collections for these sets, or by a method that partitions a given list or array data type in-place. Details vary depending on how the input collection is represented. The time to compare the pivot against all the other values is $O(n)$. However, pivoting methods differ in how they choose the pivot, which affects how big the subproblems in each recursive call will be. The efficiency of these methods depends greatly on the choice of the pivot. If the pivot is chosen badly, the running time of this method can be as slow as $O(n^{2})$.

* If the pivot were exactly at the median of the input, then each recursive call would have at most half as many values as the previous call, and the total times would add in a geometric series to $O(n)$. However, finding the median is itself a selection problem, on the entire original input. Trying to find it by a recursive call to a selection algorithm would lead to an infinite recursion, because the problem size would not decrease in each call.
* Quickselect chooses the pivot uniformly at random from the input values. It can be described as a prune and search algorithm, a variant of quicksort, with the same pivoting strategy, but where quicksort makes two recursive calls to sort the two subcollections $L$ and $R$, quickselect only makes one of these two calls. Its expected time is $O(n)$. For any constant $C$, the probability that its number of comparisons exceeds $Cn$ is superexponentially small in $C$.
* The Floyd–Rivest algorithm, a variation of quickselect, chooses a pivot by randomly sampling a subset of $r$ data values, for some sample size $r$, and then recursively selecting two elements somewhat above and below position $rk/n$ of the sample to use as pivots. With this choice, it is likely that $k$ is sandwiched between the two pivots, so that after pivoting only a small number of data values between the pivots are left for a recursive call. This method can achieve an expected number of comparisons that is $n+\min(k,n-k)+o(n)$. In their original work, Floyd and Rivest claimed that the $o(n)$ term could be made as small as $O({\sqrt {n})}$ by a recursive sampling scheme, but the correctness of their analysis has been questioned. Instead, more rigorous analysis has shown that a version of their algorithm achieves $O({\sqrt {n\log n})}$ for this term. Although the usual analysis of both quickselect and the Floyd–Rivest algorithm assumes the use of a true random number generator, a version of the Floyd–Rivest algorithm using a pseudorandom number generator seeded with only logarithmically many true random bits has been proven to run in linear time with high probability.

* The median of medians method partitions the input into sets of five elements, and uses some other non-recursive method to find the median of each of these sets in constant time per set. It then recursively calls itself to find the median of these $n/5$ medians. Using the resulting median of medians as the pivot produces a partition with $\max(|L|,|R|)\leq 7n/10$. Thus, a problem on $n$ elements is reduced to two recursive problems on $n/5$ elements (to find the pivot) and at most $7n/10$ elements (after the pivot is used). The total size of these two recursive subproblems is at most $9n/10$, allowing the total time to be analyzed as a geometric series adding to $O(n)$. Unlike quickselect, this algorithm is deterministic, not randomized. It was the first linear-time deterministic selection algorithm known, and is commonly taught in undergraduate algorithms classes as an example of a divide and conquer that does not divide into two equal subproblems. However, the high constant factors in its $O(n)$ time bound make it slower than quickselect in practice, and slower even than sorting for inputs of moderate size.
* Hybrid algorithms such as introselect can be used to achieve the practical performance of quickselect with a fallback to medians of medians guaranteeing worst-case $O(n)$ time.

### Factories

The deterministic selection algorithms with the smallest known numbers of comparisons, for values of $k$ that are far from $1$ or $n$, are based on the concept of *factories*, introduced in 1976 by Arnold Schönhage, Mike Paterson, and Nick Pippenger. These are methods that build partial orders of certain specified types, on small subsets of input values, by using comparisons to combine smaller partial orders. As a very simple example, one type of factory can take as input a sequence of single-element partial orders, compare pairs of elements from these orders, and produce as output a sequence of two-element totally ordered sets. The elements used as the inputs to this factory could either be input values that have not been compared with anything yet, or "waste" values produced by other factories. The goal of a factory-based algorithm is to combine together different factories, with the outputs of some factories going to the inputs of others, in order to eventually obtain a partial order in which one element (the $k$th smallest) is larger than some $k-1$ other elements and smaller than another $n-k$ others. A careful design of these factories leads to an algorithm that, when applied to median-finding, uses at most $2.942n$ comparisons. For other values of $k$, the number of comparisons is smaller.

### Parallel algorithms

Parallel algorithms for selection have been studied since 1975, when Leslie Valiant introduced the parallel comparison tree model for analyzing these algorithms, and proved that in this model selection using a linear number of comparisons requires $\Omega (\log \log n)$ parallel steps, even for selecting the minimum or maximum. Researchers later found parallel algorithms for selection in $O(\log \log n)$ steps, matching this bound. In a randomized parallel comparison tree model it is possible to perform selection in a bounded number of steps and a linear number of comparisons. On the more realistic parallel RAM model of computing, with exclusive read exclusive write memory access, selection can be performed in time $O(\log n)$ with $O(n/\log n)$ processors, which is optimal both in time and in the number of processors. With concurrent memory access, slightly faster parallel time is possible in general, and the $\log n$ term in the time bound can be replaced by $\log k$.

### Sublinear data structures

When data is already organized into a data structure, it may be possible to perform selection in an amount of time that is sublinear in the number of values. As a simple case of this, for data already sorted into an array, selecting the $k$th element may be performed by a single array lookup, in constant time. For values organized into a two-dimensional array of size $m\times n$, with sorted rows and columns, selection may be performed in time $O{\bigl (}m\log(2n/m){\bigr )}$, or faster when $k$ is small relative to the array dimensions. For a collection of $m$ one-dimensional sorted arrays, with $k\_{i}$ items less than the selected item in the $i$th array, the time is $\textstyle O{\bigl (}m+\sum \_{i=1}^{m}\log(k\_{i}+1){\bigr )}$.

Selection from data in a binary heap takes time $O(k)$. This is independent of the size $n$ of the heap, and faster than the $O(k\log n)$ time bound that would be obtained from best-first search. This same method can be applied more generally to data organized as any kind of heap-ordered tree (a tree in which each node stores one value in which the parent of each non-root node has a smaller value than its child). This method of performing selection in a heap has been applied to problems of listing multiple solutions to combinatorial optimization problems, such as finding the k shortest paths in a weighted graph, by defining a state space of solutions in the form of an implicitly defined heap-ordered tree, and then applying this selection algorithm to this tree. In the other direction, linear time selection algorithms have been used as a subroutine in a priority queue data structure related to the heap, improving the time for extracting its $k$th item from $O(\log n)$ to $O(\log ^{\*}n+\log k)$; here $\log ^{\*}n$ is the iterated logarithm.

For a collection of data values undergoing dynamic insertions and deletions, the order statistic tree augments a self-balancing binary search tree structure with a constant amount of additional information per tree node, allowing insertions, deletions, and selection queries that ask for the $k$th element in the current set to all be performed in $O(\log n)$ time per operation. Going beyond the comparison model of computation, faster times per operation are possible for values that are small integers, on which binary arithmetic operations are allowed. It is not possible for a streaming algorithm with memory sublinear in both $n$ and $k$ to solve selection queries exactly for dynamic data, but the count–min sketch can be used to solve selection queries approximately, by finding a value whose position in the ordering of the elements (if it were added to them) would be within $\varepsilon n$ steps of $k$, for a sketch whose size is within logarithmic factors of $1/\varepsilon $.

## Lower bounds

The $O(n)$ running time of the selection algorithms described above is necessary, because a selection algorithm that can handle inputs in an arbitrary order must take that much time to look at all of its inputs. If any one of its input values is not compared, that one value could be the one that should have been selected, and the algorithm can be made to produce an incorrect answer. Beyond this simple argument, there has been a significant amount of research on the exact number of comparisons needed for selection, both in the randomized and deterministic cases.

Selecting the minimum of $n$ values requires $n-1$ comparisons, because the $n-1$ values that are not selected must each have been determined to be non-minimal, by being the largest in some comparison, and no two of these values can be largest in the same comparison. The same argument applies symmetrically to selecting the maximum.

The next simplest case is selecting the second-smallest. After several incorrect attempts, the first tight lower bound on this case was published in 1964 by Soviet mathematician Sergey Kislitsyn. It can be shown by observing that selecting the second-smallest also requires distinguishing the smallest value from the rest, and by considering the number $p$ of comparisons involving the smallest value that an algorithm for this problem makes. Each of the $p$ items that were compared to the smallest value is a candidate for second-smallest, and $p-1$ of these values must be found larger than another value in a second comparison in order to rule them out as second-smallest. With $n-1$ values being the larger in at least one comparison, and $p-1$ values being the larger in at least two comparisons, there are a total of at least $n+p-2$ comparisons. An adversary argument, in which the outcome of each comparison is chosen in order to maximize $p$ (subject to consistency with at least one possible ordering) rather than by the numerical values of the given items, shows that it is possible to force $p$ to be at least $\log \_{2}n$. Therefore, the worst-case number of comparisons needed to select the second smallest is $n+\lceil \log \_{2}n\rceil -2$, the same number that would be obtained by holding a single-elimination tournament with a run-off tournament among the values that lost to the smallest value. However, the expected number of comparisons of a randomized selection algorithm can be better than this bound; for instance, selecting the second-smallest of six elements requires seven comparisons in the worst case, but may be done by a randomized algorithm with an expected number of 6.5 comparisons.

More generally, selecting the $k$th element out of $n$ requires at least $n+\min(k,n-k)-O(1)$ comparisons, in the average case, matching the number of comparisons of the Floyd–Rivest algorithm up to its $o(n)$ term. The argument is made directly for deterministic algorithms, with a number of comparisons that is averaged over all possible permutations of the input values. By Yao's principle, it also applies to the expected number of comparisons for a randomized algorithm on its worst-case input.

For deterministic algorithms, it has been shown that selecting the $k$th element requires $\bigl (}1+H(k/n){\bigr )}n+\Omega ({\sqrt {n})$ comparisons, where $H(x)=x\log \_{2}{\frac {1}{x}+(1-x)\log \_{2}{\frac {1}{1-x}}}$ is the binary entropy function. The special case of median-finding has a slightly larger lower bound on the number of comparisons, at least $(2+\varepsilon )n$, for $\varepsilon \approx 2^{-80}$.

## Exact numbers of comparisons

Knuth supplies the following triangle of numbers summarizing pairs of $n$ and $k$ for which the exact number of comparisons needed by an optimal selection algorithm is known. The $n$th row of the triangle (starting with $n=1$ in the top row) gives the numbers of comparisons for inputs of $n$ values, and the $k$th number within each row gives the number of comparisons needed to select the $k$th smallest value from an input of that size. The rows are symmetric because selecting the $k$th smallest requires exactly the same number of comparisons, in the worst case, as selecting the $k$th largest.

0 1    1 2    3    2 3    4    4    3 4    6    6    6    4 5    7    8    8    7    5 6    8   10   10   10   8    6 7    9   11   12   12   11   9    7 8   11   12   14   14   14   12   11   8 9   12   14   15   16   16   15   14   12   9

Most, but not all, of the entries on the left half of each row can be found using the formula $n-k+(k-1){\bigl \lceil }\log \_{2}(n+2-k){\bigr \rceil }.$ This describes the number of comparisons made by a method of Abdollah Hadian and Milton Sobel, related to heapselect, that finds the smallest value using a single-elimination tournament and then repeatedly uses a smaller tournament among the values eliminated by the eventual tournament winners to find the next successive values until reaching the $k$th smallest. Some of the larger entries were proven to be optimal using a computer search.

## Language support

Very few languages have built-in support for general selection, although many provide facilities for finding the smallest or largest element of a list. A notable exception is the Standard Template Library for C++, which provides a templated `nth_element` method with a guarantee of expected linear time.

Python's standard library includes `heapq.nsmallest` and `heapq.nlargest` functions for returning the smallest or largest elements from a collection, in sorted order. The implementation maintains a binary heap, limited to holding $k$ elements, and initialized to the first $k$ elements in the collection. Then, each subsequent item of the collection may replace the largest or smallest element in the heap if it is smaller or larger than this element. The algorithm's memory usage is superior to heapselect (the former only holds $k$ elements in memory at a time while the latter requires manipulating the entire dataset into memory). Running time depends on data ordering. The best case is $O((n-k)+k\log k)$ for already sorted data. The worst-case is $O(n\log k)$ for reverse sorted data. In average cases, there are likely to be few heap updates and most input elements are processed with only a single comparison. For example, extracting the 100 largest or smallest values out of 10,000,000 random inputs makes 10,009,401 comparisons on average.

Since 2017, Matlab has included `maxk()` and `mink()` functions, which return the maximal (minimal) $k$ values in a vector as well as their indices. The Matlab documentation does not specify which algorithm these functions use or what their running time is.

## History

Quickselect was presented without analysis by Tony Hoare in 1965, and first analyzed in a 1971 technical report by Donald Knuth. The first known linear time deterministic selection algorithm is the median of medians method, published in 1973 by Manuel Blum, Robert W. Floyd, Vaughan Pratt, Ron Rivest, and Robert Tarjan. They trace the formulation of the selection problem to work of Charles L. Dodgson (better known as Lewis Carroll) who in 1883 pointed out that the usual design of single-elimination sports tournaments does not guarantee that the second-best player wins second place, and to work of Hugo Steinhaus circa 1930, who followed up this same line of thought by asking for a tournament design that can make this guarantee, with a minimum number of games played (that is, comparisons).


title: Platyhomonopsis

abstract: Platyhomonopsis is a genus of moths belonging to the family Tortricidae. It contains only one species, Platyhomonopsis dentata, which is found in China (Guizhou).

text:
# Platyhomonopsis

***Platyhomonopsis*** is a genus of moths belonging to the family Tortricidae. It contains only one species, ***Platyhomonopsis dentata***, which is found in China (Guizhou).

## InfoBox

| *Platyhomonopsis* | |
| --- | --- |
|
| Scientific classification | |
| Domain: | Eukaryota |
| Kingdom: | Animalia |
| Phylum: | Arthropoda |
| Class: | Insecta |
| Order: | Lepidoptera |
| Family: | Tortricidae |
| Tribe: | Archipini |
| Genus: | *Platyhomonopsis*
Wang & Li, 2005 |
| Species: | ***P. dentata*** |
| Binomial name | |
| ***Platyhomonopsis dentata***
Wang & Li, 2005 | |
|


title: Dodgeville, Iowa

abstract: Dodgeville is an unincorporated community, in Des Moines County, Iowa, United States.

text:
# Dodgeville, Iowa

**Dodgeville** is an unincorporated community, in Des Moines County, Iowa, United States.

## History

Founded in the 1800s, Dodgeville's population was just 17 in 1902, but had increased to 115 by 1925. The population was 33 in 1940.

## Notable person

## InfoBox

| Dodgeville, Iowa | |
| --- | --- |
| Unincorporated community | |
| St. Mary's Church in Dodgeville | |
| Dodgeville, Iowa | |
| Coordinates: 40°56′35″N 91°10′51″W / 40.94306°N 91.18083°W / 40.94306; -91.18083 | |
| Country | United States |
| State | Iowa |
| County | Des Moines |
| Elevation | 738 ft (225 m) |
| Time zone | UTC-6 (Central (CST)) |
| Summer (DST) | UTC-5 (CDT) |
| Area code | 319 |
| GNIS feature ID | 455937 |


title: Svatá Maří

abstract: Svatá Maří is a municipality and village in Prachatice District in the South Bohemian Region of the Czech Republic. It has about 600 inhabitants.

text:
# Svatá Maří

**Svatá Maří** is a municipality and village in Prachatice District in the South Bohemian Region of the Czech Republic. It has about 600 inhabitants.

## Administrative parts

The villages of Brdo, Smrčná, Štítkov, Trhonín and Vícemily are administrative parts of Svatá Maří.

## Etymology

Svatá Maří was named after the church consecrated to Saint Mary Magdalene (in Czech popularly called *svatá Maří Magdaléna*).

## Geography

Svatá Maří is located about 13 kilometres (8 mi) northwest of Prachatice and 47 km (29 mi) west of České Budějovice. It lies in the Bohemian Forest Foothills, the southern tip of the municipal territory extends into the Bohemian Forest. The highest point is a nameless hill with an altitude of 872 metres (2,861 ft).

## History

The first written mention of Svatá Maří is from 1352 as *S. Marie in Laz*. The name *Svatá Maří* was first documented in 1543.

## Demographics

Historical population
| Year Pop. ±%  1869 1,041       1880 1,058 +1.6%  1890 1,015 −4.1%  1900 1,069 +5.3%  1910 1,108 +3.6% | Year Pop. ±%  1921 1,001 −9.7%  1930 932 −6.9%  1950 644 −30.9%  1961 653 +1.4%  1970 553 −15.3% | Year Pop. ±%  1980 460 −16.8%  1991 448 −2.6%  2001 495 +10.5%  2011 546 +10.3%  2021 593 +8.6% |
| --- | --- | --- |
| Source: Censuses | | |

## Transport

There are no railways or major roads passing through the municipality.

## Sights

The main landmark of Svatá Maří is the Church of Saint Mary Magdalene. Originally a Gothic building, it was rebuilt in the Baroque style in the 18th century.

## InfoBox

| Svatá Maří | |
| --- | --- |
| Municipality | |
| Church of Saint Mary Magdalene | |
|  | |
| Svatá MaříLocation in the Czech Republic | |
| Coordinates: 49°3′53″N 13°49′53″E / 49.06472°N 13.83139°E / 49.06472; 13.83139 | |
| Country | Czech Republic |
| Region | South Bohemian |
| District | Prachatice |
| First mentioned | 1352 |
| Area | |
| Total | 12.71 km2 (4.91 sq mi) |
| Elevation | 765 m (2,510 ft) |
| Population (2024-01-01) | |
| Total | 605 |
| Density | 48/km2 (120/sq mi) |
| Time zone | UTC+1 (CET) |
| Summer (DST) | UTC+2 (CEST) |
| Postal codes | 383 01, 384 81, 385 01 |
| Website | www.svatamari.cz |


title: Seeadler-class fast attack craft

abstract: The Type 141 Seeadler-class fast attack craft differs from Type 140 Jaguar-class fast attack craft only in the installation of other, later more powerful diesel engine. The Seeadler class was replaced in service with the Bundesmarine by the Type 143 Albatros class.

text:
# Seeadler-class fast attack craft

The **Type 141 *Seeadler*-class fast attack craft** differs from Type 140 *Jaguar*-class fast attack craft only in the installation of other, later more powerful diesel engine.

The *Seeadler* class was replaced in service with the Bundesmarine by the Type 143 *Albatros* class.

## List of boats

| NATO
pennant
number | German
pennant
number | Name | Callsign | Shipbuilder | Launched | Com-
missioned | Decom-
missioned | Fate |
| --- | --- | --- | --- | --- | --- | --- | --- | --- |
| P6068 | S6 | *Seeadler* | DBWE | Lürssen | 1 February 1958 | 29 August 1958 | 30 July 1976 | To Hellenic Navy as *Esperos* (decommissioned 21 December 2004) |
| P6069 | S7 | *Albatros* |  |  |  | 27 January 1959 | 19 December 1975 | To Hellenic Navy, for cannibalization |
| P6070 | S8 | *Kondor* |  |  |  | 24 February 1959 | 25 July 1976 | To Hellenic Navy as *Lailaps* |
| P6071 | S9 | *Greif* |  |  |  | 3 March 1959 | 30 April 1976 | To Hellenic Navy as *Kyklos* |
| P6072 | S10 | *Falke* |  |  |  | 14 April 1959 | 26 August 1975 | To Hellenic Navy as *Kataigis* |
| P6073 | S11 | *Geier* |  |  |  | 3 June 1959 | 27 June 1975 | To Hellenic Navy as *Tyfon* |
| P6074 | S25 | *Bussard* |  |  |  | 21 March 1959 | 28 November 1975 | To Hellenic Navy, for cannibalization |
| P6075 | S26 | *Habicht* |  |  |  | 21 May 1959 | 24 August 1976 | To Hellenic Navy as *Kataurus* |
| P6076 | S27 | *Sperber* |  |  |  | 1 July 1959 | 27 December 1976 | To Hellenic Navy, for cannibalization |
| P6077 | S28 | *Kormoran* |  |  |  | 9 November 1959 | 26 November 1976 | To Hellenic Navy as *Scorpius* |

## InfoBox

| Kondor in 1967 | |
| --- | --- |
| Class overview | |
| Name | *Seeadler* class |
| Builders | Lurssen, Bremen-Vegesack |
| Operators |  |
| Preceded by | *Jaguar* class |
| Succeeded by | *Zobel* class |
| In commission | 1958–1976 |
| Completed | 10 |
| Retired | 10 |
| General characteristics | |
| Type | Torpedo boat (fast attack craft) |
| Displacement | 183.4 tonnes standard, 210 tonnes full load |
| Length | 42.6 m (139 ft 9 in) |
| Beam | 7.1 m (23 ft 4 in) |
| Draught | 2.3 m (7 ft 7 in) |
| Propulsion | * 4 Maybach MD 871 diesel engines, 3000 PS each (replaced by MD 872 engines with 3600 PS in the late 1960s) * 4 propeller shafts, driving three-bladed propellers of 1.15 m diameter * Bunker: 30 t diesel, 1.12 t lubricants, 2 t fresh water |
| Speed | * 30 knots (56 km/h; 35 mph) cruise * 36 knots (67 km/h; 41 mph) max (later around 43.5kts ) |
| Range | 700 nautical miles (1,300 km; 810 mi) at 35 knots (65 km/h; 40 mph) |
| Complement | 39 officers and enlisted |
| Sensors and
processing systems | Navigation radar, Surveillance radar |
| Armament |  |


# Cardinal electors for the May 1605 papal conclave

The papal conclave of May 1605 was convened on the death of Pope Leo XI and ended with the election of Camillo Borghese as Pope Paul V on 16 May 1605. It was the second of two papal conclaves in 1605, with Leo dying on 27 April 1605, twenty-six days after he was elected in the March–April 1605 papal conclave.

Pope Nicholas II had reserved the right to elect the pope to the cardinal bishops, priests, and deacons of Rome in 1059. The cardinal bishops were the highest rank, being the bishops of the ancient suburbicarian dioceses. Cardinal priests ranked next, serving as the titular head of historically important churches in Rome. Last ranked the cardinal deacons, who were nominally assigned one of the ancient diaconia where traditionally deacons had administered the material possessions of the Church of Rome. Cardinals were required to have been ordained at least to the rank of their order within the College of Cardinals, but could also be ordained to a higher order.

In 1586, Pope Sixtus V had mandated that the maximum number of cardinals be seventy. Of these, the College of Cardinals had sixty-nine total members at the time of Clement VIII's death. Following Leo's election, Girolamo Agucchi had also died on 27 April, the same day as Leo, reducing the total number of cardinals in the College by two. The electors present had been created by six different popes: Pius IV, Gregory XIII, Sixtus V, Gregory XIV, Innocent IX, and Clement VIII. Clement's creations were the most numerous, as he had created thirty-nine of the cardinal electors. Innocent IX had created one of the conclave's electors, Gregory XIV had created five, Sixtus V had created eleven, Gregory XIII had created three, and Pius IV had created one.

## Cardinal electors

Fifty-nine total cardinals entered the conclave, and Paolo Emilio Zacchia and Carlo Gaudenzio Madruzzo participated in the conclave, assenting to the final vote, but did not enter the proceedings because they were sick.

| Name | Rank | Created cardinal by | Nationality | Sources |
| --- | --- | --- | --- | --- |
| Tolomeo Gallio | Bishop | Pius IV | Italian |  |
| François de Joyeuse | Bishop | Gregory XIII | French |  |
| Domenico Pinelli | Bishop | Sixtus V | Italian |  |
| Girolamo Bernerio | Bishop | Sixtus V | Italian |  |
| Agostino Valier | Priest | Gregory XIII | Italian |  |
| Antonio Maria Gallo | Priest | Sixtus V | Italian |  |
| Antonmaria Sauli | Priest | Sixtus V | Italian |  |
| Benedetto Giustiniani | Priest | Sixtus V | Italian |  |
| Giovanni Evangelista Pallotta | Priest | Sixtus V | Italian |  |
| Federico Borromeo | Priest | Sixtus V | Italian |  |
| Francesco Maria del Monte | Priest | Sixtus V | Italian |  |
| Gregorio Petrocchini | Priest | Sixtus V | Italian |  |
| Mariano Pierbenedetti | Priest | Sixtus V | Italian |  |
| Paolo Emilio Sfondrati | Priest | Gregory XIV | Italian |  |
| Ottavio Paravicini | Priest | Gregory XIV | Italian |  |
| Ottavio d'Aquaviva d'Aragona | Priest | Gregory XIV | Italian |  |
| Flaminio Piatti | Priest | Gregory XIV | Italian |  |
| Giovanni Antonio Facchinetti de Nuce | Priest | Innocent IX | Italian |  |
| Pietro Aldobrandini | Priest | Clement VIII | Italian |  |
| Francesco Maria Tarugi | Priest | Clement VIII | Italian |  |
| Ottavio Bandini | Priest | Clement VIII | Italian |  |
| Anne d'Escars de Givry | Priest | Clement VIII | French |  |
| Giovanni Francesco Biandrate di San Giorgio Aldobrandini | Priest | Clement VIII | Italian |  |
| Camillo Borghese | Priest | Clement VIII | Italian |  |
| Caesar Baronius | Priest | Clement VIII | Italian |  |
| Lorenzo Bianchetti | Priest | Clement VIII | Italian |  |
| Francisco de Ávila | Priest | Clement VIII | Spanish |  |
| Francesco Mantica | Priest | Clement VIII | Italian |  |
| Pompeio Arrigoni | Priest | Clement VIII | Italian |  |
| Bonifazio Bevilacqua Aldobrandini | Priest | Clement VIII | Italian |  |
| Alfonso Visconti | Priest | Clement VIII | Italian |  |
| Domenico Toschi | Priest | Clement VIII | Italian |  |
| Paolo Emilio Zacchia | Priest | Clement VIII | Italian |  |
| Franz von Dietrichstein | Priest | Clement VIII | German |  |
| Robert Bellarmine | Priest | Clement VIII | Italian |  |
| François de Sourdis | Priest | Clement VIII | French |  |
| Séraphin Olivier-Razali | Priest | Clement VIII | French |  |
| Domenico Ginnasi | Priest | Clement VIII | Italian |  |
| Antonio Zapata y Cisneros | Priest | Clement VIII | Spanish |  |
| Filippo Spinelli | Priest | Clement VIII | Italian |  |
| Carlo Conti | Priest | Clement VIII | Italian |  |
| Carlo Gaudenzio Madruzzo | Priest | Clement VIII | German |  |
| Jacques Davy Duperron | Priest | Clement VIII | French |  |
| Innocenzo del Bufalo-Cancellieri | Priest | Clement VIII | Italian |  |
| Giovanni Delfino | Priest | Clement VIII | Italian |  |
| Giacomo Sannesio | Priest | Clement VIII | Italian |  |
| Girolamo Pamphili | Priest | Clement VIII | Italian |  |
| Ferdinando Taverna | Priest | Clement VIII | Italian |  |
| Anselmo Marzato | Priest | Clement VIII | Italian |  |
| Erminio Valenti | Priest | Clement VIII | Italian |  |
| Francesco Sforza | Deacon | Gregory XIII | Italian |  |
| Alessandro Peretti di Montalto | Deacon | Sixtus V | Italian |  |
| Odoardo Farnese | Deacon | Gregory XIV | Italian |  |
| Cinzio Passeri Aldobrandini | Deacon | Clement VIII | Italian |  |
| Bartolomeo Cesi | Deacon | Clement VIII | Italian |  |
| Andrea Baroni Peretti Montalto | Deacon | Clement VIII | Italian |  |
| Alessandro d'Este | Deacon | Clement VIII | Italian |  |
| Giovanni Battista Deti | Deacon | Clement VIII | Italian |  |
| Silvestro Aldobrandini | Deacon | Clement VIII | Italian |  |
| Giovanni Andrea Doria | Deacon | Clement VIII | Italian |  |
| Carlo Emanuele Pio di Savoia | Deacon | Clement VIII | Italian |  |

## Citations

1. Hsia 2005, p. 99.
2. Pattenden 2017, p. 14.
3. Encyclopædia Britannica 1911, pp. 321–322.
4. Pattenden 2017, p. 18.
5. Gauchat 1960, p. 8.
6. Freiherr von Pastor 1952, p. 4.
7. Freiherr von Pastor 1952, pp. 28–29.
8. Freiherr von Pastor 1952, p. 5.
9. Gauchat 1960, p. 9.
10. Freiherr von Pastor 1952, p. 28.
11. Martinich 1999, p. 35.
12. Eubel & van Gulik 1913, p. 40.
13. Eubel & van Gulik 1913, p. 47.
14. Eubel & van Gulik 1913, p. 51.
15. Gauchat 1960, p. 47.
16. Eubel & van Gulik 1913, p. 52.
17. Squarzina 1997, p. 766.
18. Eubel & van Gulik 1913, p. 53.
19. Eubel & van Gulik 1913, p. 54.
20. Giannini 2015.
21. Cardella 1793, p. 324.
22. Gauchat 1960, p. 4.
23. Gauchat 1960, p. 5.
24. Gauchat 1960, p. 6.
25. Herbermann et al. 1913, p. 529.
26. Freiherr von Pastor 1952, p. 13.
27. Gauchat 1960, p. 7.
28. Eubel & van Gulik 1913, p. 50.
29. The British Museum.
* Baumgartner, Frederic J. (2003). *Behind Locked Doors*. Palgrave Macmillan. ISBN 978-0-312-29463-2.
* Boudinhon, Auguste (1911). "Cardinal". In Chisholm, Hugh (ed.). *Encyclopædia Britannica*. Vol. 5 (11th ed.). Cambridge University Press. pp. 321–323.
* "Cardinal Odoardo Farnese (Biographical details)". *The British Museum*. Retrieved 10 May 2018.
* Cardella, Lorenzo (1793). *Memorie storiche de' cardinali della santa romana Chiesa* \[*Memories of the Cardinals of the Holy Roman Church*\] (in Italian). Vol. V. Rome: Stamperia Pagliarini. OCLC 42022804.
* Freiherr von Pastor, Ludwig (1952) \[1899\]. Graf, Ernest (ed.). *The History of the Popes*. Vol. XXV. London: B. Herder Book Co. OCLC 221543126.
* Eubel, Konrad; van Gulik, Wilhelm (1913). *Hierarchia catholica medii et recentioris aevi* \[*The Catholic Hierarchy of the Middle and Recent Ages*\] (in Latin). Vol. 3. Monasterii Sumptibus et typis librariae Regensbergianae. OCLC 55180223.
* Giannini, Massimo Carlo (2015). "Piatti, Flaminio". *Dizionario Biografico degli Italiani \[The Italian Biographical Dictionary\]* (in Italian). **83**.
* Gauchat, Patrick (1960). *Hierarchia catholica medii et recentioris aevi* \[*The Catholic Hierarchy of the Middle and Recent Ages*\] (in Latin). Vol. 4. Monasterii Sumptibus et typis librariae Regensbergianae. OCLC 55180223.
* Herbermann, Charles George; Pace, Edward Aloysius; Pallen, Condé Bénoist; Shahan, Thomas Joseph; Wynne, John Joseph (1913). *The Catholic Encyclopedia: An International Work of Reference on the Constitution, Doctrine, Discipline, and History of the Catholic Church*. Vol. 10. Encyclopedia Press.
* Hsia, R. Po-Chia (2005). *The World of Catholic Renewal, 1540–1770*. Cambridge University Press. ISBN 978-0-521-84154-2.
* Martinich, A.P. (1999). *Hobbes: A Biography*. Cambridge University Press. ISBN 9780521495837.
* Pattenden, Miles (2017). *Electing the Pope in early modern Italy, 1450–1700*. Oxford: Oxford University Press. ISBN 978-0-19-879744-9. OCLC 980220999.
* Squarzina, Silvia Danesi (1997). "The Collections of Cardinal Benedetto Giustiniani. Part I". *The Burlington Magazine*. **139** (1136): 766–791. JSTOR 887781.


title: Capture of Tucson (1846)

abstract: The Capture of Tucson was an uncontested United States entry into the Mexican city of Tucson, Sonora, now the present day Tucson, Arizona. The would-be combatants were provisional Mexican Army troops and the American Army's "Mormon Battalion". Tucson temporarily 'fell' in December 1846 without resistance but was immediately reoccupied two days later by the Mexican forces once the US troops moved on.

text:
# Capture of Tucson (1846)

The **Capture of Tucson** was an uncontested United States entry into the Mexican city of Tucson, Sonora, now the present day Tucson, Arizona. The would-be combatants were provisional Mexican Army troops and the American Army's "Mormon Battalion". Tucson temporarily 'fell' in December 1846 without resistance but was immediately reoccupied two days later by the Mexican forces once the US troops moved on.

## Capture

The Mexican–American War began after Thornton's Defeat in 1846. This same year a battalion of Mormon men was recruited by the United States Army in western Iowa and dispatched with General Steven Watts Kearny's "Army of the West" across what they considered the "Great Western Desert". The mission assigned to the Mormon Battalion was to create a continuous wagon road from Santa Fe to San Diego—the first into southern California.

The American force, of around 499 riflemen and officers, were commanded by Lieutenant Colonel Philip St. George Cooke. Only an effective force of 360 took part in the trek across the Arizona desert. Previously, about 150 physically unfit men and some eighty-four women and children family members trailing the Battalion towards Santa Fe had been sent to the trapper/trader compound 'el pueblo' (modern Pueblo Colorado) on the Arkansas River.

Marching towards Tucson in November 1846, the Mormon Battalion fought their only battle and it was against wild cattle which attacked them near the San Pedro River. After the "Battle of the Bulls", as it is humorously known, the force turned west towards Tucson, where it seemed they might have to really fight the Mexican garrison of Fort Tucson, a former Spanish presidio.

The Mexican force consisted of around 200 men, most likely infantry and cavalry plus two small brass cannons, as well as an unknown force of men from the garrisons of Tubac, Santa Cruz and Fronteras.

The Mexican Captain Antonio Comaduran had received about three days warning of the approaching Americans. Following an exchange of information between the two commanders and parlays regarding safe passage on the 100-mile shorter and easier route through Tucson, Comaduran refused permission to the US Army to enter Tucson, much less would he agree to surrender the presidio. Each side took token prisoners, then released them as tokens of good faith. Tensions were running high and getting higher as Cooke's force approached.

Realizing he was outnumbered, Captain Comaduran decided to withdraw without fighting. He also advised many civilians to abandon Tucson with him. The Mexican forces retreated to San Xavier about 8 1/2 miles southwest of Tucson. On December 16, 1846, the US Army unit arrived at the south end of Tucson and prepared to enter the town. Even though the muskets were loaded and bayonets affixed, Col Cooke paused to remind his troops of his Order No 19, given 13 December:

"We came not to make war against Sonora, and less still to destroy an unimportant outpost of defense against Indians. But we will take the straight course before us and overcome all resistance. But, shall I remind you that the American soldier ever shows justice and kindness to the unarmed and unresisting; the property of individuals you will hold sacred - the *people* of Sonora are not our enemies."

No fighting occurred as the small army entered Tucson, passed along the west wall of the Mexican military compound, then camped a half-mile north of town on a small flowing creek. The Americans began to assure the frightened and staring population of their friendly intentions. Many of the Mormon men were interested in trading for food and clothing. One man related later that a twenty-eight star American flag temporarily flew over Tucson for the first time though neither Cooke nor any other journalist makes any mention of it.

"The author (Sgt. Daniel Tyler) remembers, with much gratitude, the silver-haired Mexican, of perhaps more than three score years and ten, who, when signs of thirst were given, ran to the brook ..., dipped up his water, and ... with cheerful countenance, delivered the refreshing and much needed draught. He has doubtless, long since, been gathered to his fathers; if so, peace to his ashes. Surely, 'I was athirst, and he gave me drink.'"

Lieutenant Colonel Cooke's soldiers had been low on food, so the Mexicans bartered meat and bread for cloth, buttons and pins, but only a little food was transferred to the Mormons through trade. Cooke estimated about 1,500 bushels of wheat grain had been left behind by the Mexican garrison as 'public' (government) property. Cooke ordered 25 bushels of this confiscated for his command's wagon mules and two quarts as food for every three soldiers. All told, Cooke appropriated about 30 bushels of wheat—about 2% of the Mexican 'public' wheat stores. None was taken from private families. Tyler goes on to relate that, "Quinces and semi-tropical fruits were also purchased here, as well as beans, corn, etc."

On 17 December, Cooke determined to make an expedition to the Catholic Indian Mission San Xavier del Bac with about 50 armed men, but they were spotted, prompting the Mexican Army to retreat further south towards the Tubac presidio to avoid an unnecessary fight. That night, some of the sentries created a temporary excitement by signaling that Mexican troops were attempting to attack. Within the hour it was determined to be a false alarm and most of the men tried to get a little more rest.

The morning of the 18th, Cooke ended their temporary occupation and continued his march towards the next settlement, the Pima Villages, 75 miles distant across a nearly water-less flat plain. The Mexican forces and inhabitants returned to their unmolested and undespoiled city. Tucson, with about 400-500 inhabitants in 1846, would officially become an American community ten years later in 1856, following the Gadsden Purchase.

* Smith, Justin Harvey. *The War with Mexico*. 2 vol (1919). Pulitzer Prize winner. full text online.
* Harte, John Bret, 2001, *Tucson: Portrait of a Desert Pueblo*. American Historical Press, Sun Valley, California. (ISBN 1-892724-25-1).
* Dobyns, Henry F., 1976, *Spanish Colonial Tucson*. University of Arizona Press, Tucson. (ISBN 0-8165-0546-2).
* Drachman, Roy P., 1999, *From Cowtown to Desert Metropolis: Ninety Years of Arizona Memories*. Whitewing Press, San Francisco. (ISBN 1-888965-02-9).

## InfoBox

| Capture of Tucson | |
| --- | --- |
| Part of the Mexican–American War | |
|
*The Mormon Battalion at the Gila River (Gila Bend, AZ) by George M. Ottinger.* | |
| Date December 16, 1846  Location Tucson, Sonora
Modern Day: Tucson, Arizona  Result  United States victory | |
| Belligerents | |
| United States | Mexico |
| Commanders and leaders | |
| Philip St. George Cooke | Antonio Comaduran |
| Strength | |
| 360 | 200 |


title: Caripraea

abstract: Caripraea is a genus of moths in the family Geometridae.

text:
# Caripraea

***Caripraea*** is a genus of moths in the family Geometridae.

* Pitkin, Brian & Jenkins, Paul. "Search results Family: Geometridae". *Butterflies and Moths of the World*. Natural History Museum, London.

## InfoBox

| *Caripraea* | |
| --- | --- |
|
| Scientific classification | |
| Kingdom: | Animalia |
| Phylum: | Arthropoda |
| Class: | Insecta |
| Order: | Lepidoptera |
| Family: | Geometridae |
| Subfamily: | Ennominae |
| Genus: | ***Caripraea*** |
|


title: Cariphalte

abstract: Cariphalte is a brand of hot-pour rubberised bitumen sealant manufactured by Shell Bitumen, used for race track and expansion joints. It was released for commercial use in 1986 and has been used on Cleveland and Kent concrete roadways including Dartford Crossing, the A4, the A10, the M2, and the M20. There are two brands of Cariphalte. Cariphalte DM, the first brand, is a "styrene block co-polymer, styrene-butadiene-styrene (SBS)". Cariphalte DA, the second brand, is "used for friction course mixtures".

text:
# Cariphalte

**Cariphalte** is a brand of hot-pour rubberised bitumen sealant (bitumen technology) manufactured by Shell Bitumen, used for race track and expansion joints. It was released for commercial use in 1986 and has been used on Cleveland and Kent concrete roadways including Dartford Crossing, the A4, the A10, the M2, and the M20.

There are two brands of Cariphalte. Cariphalte DM, the first brand, is a "styrene block co-polymer, styrene-butadiene-styrene (SBS)". Cariphalte DA, the second brand, is "used for friction course mixtures".

1. An, Yanqing; Zianzhi, Shao (September 2014). "Effect of Aging on Rheological Property of Cariphalte Modified Asphalt". *Applied Mechanics and Materials*. 638–640: 1149–1152. doi:10.4028/www.scientific.net/AMM.638-640.1149. ISSN 1660-9336. S2CID 110387911. Archived from the original on 2021-03-01. Retrieved 2021-03-01  via ProQuest.
2. Hua, Tan (September 2014). "Study of Rheological Properties of Cariphalte Modified Asphalt". *Applied Mechanics and Materials*. 638–640: 1185–1189. doi:10.4028/www.scientific.net/AMM.638-640.1185. ISSN 1660-9336. S2CID 109288830. Archived from the original on 2021-03-01. Retrieved 2021-03-01  via ProQuest.
3. "Tackling Reflective Cracks". *Civil Engineering*. Morgan Grampian: 30. May 1988. ISSN 0305-6473. Retrieved 2021-03-01  via Internet Archive.
4. Hunter, Robert N. (1997) \[1994\]. *Bituminous Mixtures in Road Construction*. London: Thomas Telford. p. 36. ISBN 0-7277-1683-2. Retrieved 2021-03-01  via Google Books.

## Further reading


abstract: Sekyere Afram Plains is one of the constituencies represented in the Parliament of Ghana. It elects one Member of Parliament (MP) by the first past the post system of election. Sekyere Afram Plains is located in the Sekyere Afram Plains District in the Ashanti Region of Ghana.

text:
# Sekyere Afram Plains (Ghana parliament constituency)

**Sekyere Afram Plains** is one of the constituencies represented in the Parliament of Ghana. It elects one Member of Parliament (MP) by the first past the post system of election. Sekyere Afram Plains is located in the Sekyere Afram Plains District in the Ashanti Region of Ghana.

## Boundaries

The seat is located within the Sekyere Afram Plains District of the Ashanti Region of Ghana. This constituency was part of the newly created constituency for 2012 general elections in Ghana.

## Elections

2016 Ghanaian parliamentary election: Sekyere Afram Plains
*Source:*
| Party | | Candidate | Votes | % | ±% |
| --- | --- | --- | --- | --- | --- |
|  | National Democratic Congress | Alex Adomako Mensah | 5,644 | 60.85 |  |
|  | New Patriotic Party | Joseph Owusu | 3,549 | 38.26 |  |
|  | Great Consolidated Popular Party | Peter Marfo | 82 | 0.88 |  |
| Majority | | | 2,095 | 9.88 | 22.59 |

2012 Ghanaian parliamentary election: Sekyere Afram Plains
*Source\[\]*
| Party | | Candidate | Votes | % | ±% |
| --- | --- | --- | --- | --- | --- |
|  | National Democratic Congress | Jacob Kofi Dankwah | 5,701 | 63.26 |  |
|  | New Patriotic Party | Bright Owusu-Kwarteng | 1,882 | 20.88 |  |
|  | Independent Candidate | Samuel Kwame Amponsah | 1,131 | 12.55 |  |
|  | National Democratic Party | Jambeidu Eliasu Bansumah | 209 | 2.32 |  |
|  | Independent Candidate | Mohammed Mumin Musah | 89 | 0.99 |  |
| Majority | | | 3,819 | 9.88 | 42.38 |

'

## InfoBox

| Sekyere Afram Plains | |
| --- | --- |
| constituency<br>for the Parliament of Ghana | |
|  | |
| District | Sekyere Afram Plains District |
| Region | Ashanti Region of Ghana |
| Current constituency | |
| Party | National Democratic Congress (Ghana) |


title: Car Stereo Wars

abstract: Car Stereo Wars are a pop band formed in Melbourne, Australia in 2000.

text:
# Car Stereo Wars

**Car Stereo Wars** are a pop band formed in Melbourne, Australia in 2000.

## History

Car Stereo Wars were formed in Melbourne in 2000 by Jason White and Matt Gillman after meeting at a computer animation course. They were joined soon after by Alyssa Doe on vocals and went on to release their first EP "Project A." The song "Broken" was then picked up for Ministry of Sounds Chillout Sessions and subsequently signed to Ministry of Sound Australia and released "They Asked me to be in a Movie" EP in 2003. The single "Come to Nothing" was then added to the playlist of a subsequent Ministry of Sound chillout compilation.

The band released their debut album in 2008 "For Your Comfort and Safety" and has enjoyed recent commercial success with the track "Come to Nothing" being used in a Tic Tac television commercial in the United States and available as a free download from the Tic Tac USA website. The track has also been used in an advertisement for DELL Computers.

## Live Shows

It is rare to see the band play live however they have made several trips to the United States for music festivals. In 2001 Car Stereo Wars travelled to Austin, Texas to play at the annual SXSW festival, then in 2003 traveled again to the U.S to play at legendary CBGB's in New York as part of the CMJ Music Marathon The band has also played some shows in their hometown Melbourne, usually only to support an album or E.P launch.

## Members

The current members are:

* Alyssa Doe: 2002–present (vocals, keyboards, tuba)
* Jason White: 2000–present (bass, guitar, and vocals)
* Matt Gillman: 2000–present (guitar, bass, keyboards)
* Sean Ashbrooke: 2003–present (guitar)
* Graeme Luther: 2003–present (drums)
* David Meagher 2007–2011 (guitar/keyboards)

## Discography

### Albums

* *For your Comfort and Safety* (2008)

### Compilations

### EPs

* *Project A* (2000)
* *They Asked Me to Be in a Movie* (2003)

## InfoBox

| Car Stereo Wars | |
| --- | --- |
|  | |
| Background information | |
| Origin | Melbourne, Australia |
| Genres | Pop, electronica, trip hop |
| Years active | 2000 - present |
| Labels | Independent (2004-Present)
Ministry of Sound (Australia, 2003–2006) |
|  | |
| Members | Alyssa Doe
Jason White
Matt Gillman
Sean Ashbrooke
Graeme Luther |
|  | |
| Website | carstereowars.com |


title: Car Tape 2

abstract: Car Tape 2 is a 2010 album by the Australian singer-songwriter Lisa Miller. It was the follow-up to 2002's Car Tape. It was released in Australia on 24 April 2010 by Raoul Records and Other Tongues. Car Tape 2 was, like Miller's three previous albums, nominated in the ARIA Awards for "Best Adult Contemporary Album".

text:
# Car Tape 2

***Car Tape 2*** is a 2010 album by the Australian singer-songwriter Lisa Miller. It was the follow-up to 2002's *Car Tape*. It was released in Australia on 24 April 2010 by Raoul Records and Other Tongues. *Car Tape 2* was, like Miller's three previous albums, nominated in the ARIA Awards for "Best Adult Contemporary Album".

## InfoBox

| Car Tape 2 | |
| --- | --- |
|  | |
| Studio album by Lisa Miller | |
| Released | April 24, 2010 (2010-04-24) |
| Label | Raoul Records |
| Lisa Miller chronology | |
| *Morning in the Bowl of Night*
(2007) ***Car Tape 2***
(2010) *Meet the Misses*
(2012) | |


title: Search game

abstract: A search game is a two-person zero-sum game which takes place in a set called the search space. The searcher can choose any continuous trajectory subject to a maximal velocity constraint. It is always assumed that neither the searcher nor the hider has any knowledge about the movement of the other player until their distance apart is less than or equal to the discovery radius and at this very moment capture occurs. The game is zero sum with the payoff being the time spent in searching. As mathematical models, search games can be applied to areas such as hide-and-seek games that children play or representations of some tactical military situations. The area of search games was introduced in the last chapter of Rufus Isaacs' classic book "Differential Games" and has been developed further by Shmuel Gal and Steve Alpern. The princess and monster game deals with a moving target.

text:
# Search game

A **search game** is a two-person zero-sum game which takes place in a set called the search space. The searcher can choose any continuous trajectory subject to a maximal velocity constraint. It is always assumed that neither the searcher nor the hider has any knowledge about the movement of the other player until their distance apart is less than or equal to the discovery radius and at this very moment capture occurs. The game is zero sum with the payoff being the time spent in searching. As mathematical models, search games can be applied to areas such as hide-and-seek games that children play or representations of some tactical military situations. The area of search games was introduced in the last chapter of Rufus Isaacs' classic book "Differential Games" and has been developed further by Shmuel Gal and Steve Alpern. The princess and monster game deals with a moving target.

## Strategy

A natural strategy to search for a stationary target in a graph (in which arcs have lengths) is to find a minimal closed curve L that covers all the arcs of the graph. (L is called a Chinese postman tour). Then, traverse L with probability 1/2 for each direction. This strategy seems to work well if the graph is Eulerian. In general, this random Chinese postman tour is indeed an optimal search strategy if and only if the graph consists of a set of Eulerian graphs connected in a tree-like structure. A misleadingly simple example of a graph not in this family consists of two nodes connected by three arcs. The random Chinese postman tour (equivalent to traversing the three arcs in a random order) is not optimal, and the optimal way to search these three arcs is complicated.

## Unbounded domains

In general, the reasonable framework for searching an unbounded domain, as in the case of an online algorithm, is to use a normalized cost function (called the competitive ratio in Computer Science literature). The minimax trajectory for problems of these types is always a geometric sequence (or exponential function for continuous problems). This result yields an easy method to find the minimax trajectory by minimizing over a single parameter (the generator of this sequence) instead of searching over the whole trajectory space. This tool has been used for the linear search problem, i.e., finding a target on the infinite line, which has attracted much attention over several decades and has been analyzed as a search game. It has also been used to find a minimax trajectory for searching a set of concurrent rays. Optimal searching in the plane is performed by using exponential spirals. Searching a set of concurrent rays was later re-discovered in Computer Science literature as the 'cow-path problem'.

1. Rufus Isaacs, *Differential Games*, John Wiley and Sons, (1965),
2. S. Gal, *Search Games*, Academic Press, New York (1980)
3. S. Alpern and S. Gal, *The Theory of Search Games and Rendezvous*, Springer (2003).
4. Gal, Shmuel (2001). "On the optimality of a simple strategy for searching graphs". *International Journal of Game Theory*. **29** (4): 533–542. doi:10.1007/s001820000056.
5. Beck, Anatole; Newman, D.J. (1970). "Yet More on the linear search problem". *Israel Journal of Mathematics*. **8** (4): 419–429. doi:10.1007/BF02798690.
6. M. Chrobak, A princess swimming in the fog looking for a monster cow, ACM Sigact news, 35(2), 74–78 (2004).
7. MY Kao, JH Reif and SR Tate, Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem, SODA 1993.


title: Sektenmuzik

abstract: Sektenmuzik was a Berlin-based independent record label until mid-2012, formed by German rappers Sido and B-Tight. Sektenmuzik was founded at the end of 2006 and beginning of 2007 by Sido and B-Tight, also known as the duo A.i.d.S. The duo was formed from the rap crew Die Sekte, which has been active since 1998. It features Vokalmatador, Sido, B-Tight, Rhymin Simon, and.

text:
# Sektenmuzik

**Sektenmuzik** was a Berlin-based independent record label until mid-2012, formed by German rappers Sido and B-Tight.

Sektenmuzik was founded at the end of 2006 and beginning of 2007 by Sido and B-Tight, also known as the duo A.i.d.S. The duo was formed from the rap crew Die Sekte, which has been active since 1998. It features Vokalmatador, Sido, B-Tight, Rhymin Simon, and.

## Artists

The following artists were former Sektenmuzik artists:

* B-Tight
* Tony D
* Alpa Gun
* Bendt
* Fuhrmann
* Greckoe
* Freddy Cool
* Koeppen
* Schmökill
* Viruz
* Diego (producer)
* DJ Werd (DJ)

The following artists are members of Die Sekte, but are signed to another label:

* Sido (signed to Universal)
* MOK (released three times over Sektenmuzik)

## Release

### Albums

| Year | Title | Artist | Chart position<br>(Germany) |
| --- | --- | --- | --- |
| 2006 | *Badboys* | MOK |  |
| | *Das Beste* | |  |
| | *Badboys 2* | |  |
| 2007 | *Sampler 1* | Sektenmuzik |  |
| | *Geladen und entsichert* | Alpa Gun | 18 |
| | *Ein Level weiter* | Greckoe | 31 |
| | *Psychose* | Grüne Medizin |  |
| | *HARRYge Angelegenheit* | Harris |  |
| 2008 | *Sampler 2* | Sektenmuzik | 14 |
| | *Aufstand auf den billigen Plätzen* | Alpa Gun |  |
| | *2 Chaoten* | Fuhrmann & Bendt |  |
| | *Typisch Griechisch* | Greckoe |  |
| | *Ab in Club* | Harris, DJ Sweap & Pfund 500 |  |
| 2009 | *Sampler 3* | Sektenmuzik |  |
| | *Die Sekte* | Die Sekte |  |

## InfoBox

| Sektenmuzik | |
| --- | --- |
| Founded | 2006 |
| Founder | Sido and B-Tight |
| Genre | Hip hop, rap, gangsta rap |
| Country of origin | Germany |
| Location | Berlin |
| Official website | sektenmuzik.net |


title: Selection Sixteen

abstract: Selection Sixteen is the fourth studio album by English electronic musician Squarepusher, released on 8 November 1999 by Warp. According to the CD, the cover art is from a film called Acid Trayners 4, which seems to be different pictures of an oscilloscope. Throughout the album, the bass, hooked to an audio/midi converter, plays an important part in the composition of synth and drum parts.

text:
# Selection Sixteen

Professional ratings
| Review scores | |
| --- | --- |
| Source | Rating |
| Allmusic |  |

***Selection Sixteen*** is the fourth studio album by English electronic musician Squarepusher, released on 8 November 1999 by Warp. According to the CD, the cover art is from a film called *Acid Trayners 4*, which seems to be different pictures of an oscilloscope. Throughout the album, the bass, hooked to an audio/midi converter, plays an important part in the composition of synth and drum parts.

## Track listing

| No. | Title | Length |
| --- | --- | --- |
| 1. | "The 'Eye" | 2:17 |
| 2. | "Square Rave" | 3:01 |
| 3. | "Time Borb" | 1:03 |
| 4. | "Dedicated Loop" | 3:47 |
| 5. | "Tomorrow World" | 4:56 |
| 6. | "Cool Veil" | 0:32 |
| 7. | "Schizm Track #1" | 5:07 |
| 8. | "Freeway" | 1:37 |
| 9. | "Snake Pass" | 3:30 |
| 10. | "Yo" | 0:28 |
| 11. | "Mind Rubbers" | 4:05 |
| 12. | "Tesko" | 0:20 |
| 13. | "Acid Tape Track" | 3:53 |

## "Anti-Greylord Protection Scheme Prelude"

Most releases of *Selection Sixteen* include "Anti-Greylord Protection Scheme Prelude", which was originally released as a separate EP with a slightly different track order. "Ceephax Mix" was created by Squarepusher's brother, Andy Jenkinson, aka Ceephax Acid Crew.

On the original release, "Schizm Track #2 Mix" is the first track.

1. "8 Bit Mix #1" – 1:04
2. "8 Bit Mix #2" – 0:55
3. "Schizm Track #2 Mix" – 3:45
4. "Ceephax Mix" (remixed by Andy Jenkinson) – 6:02

## InfoBox

| Selection Sixteen | |
| --- | --- |
|  | |
| Studio album by Squarepusher | |
| Released | 8 November 1999 |
| Genre | Drum and bass, acid techno |
| Length | 46:30 |
| Label | Warp |
| Producer | Tom Jenkinson |
| Squarepusher chronology | |
| *Maximum Priest E.P.*
(1999) ***Selection Sixteen***
(1999) *Go Plastic*
(2001) | |


title: Cara (app)

abstract: Cara is an image sharing platform and social network for artists and creatives to share portfolios. It is available both as an app and as a website, and is run by founder Zhang Jingna and a group of volunteers. Cara states that it is "creators-first" and was founded to protect human artists from rapidly-proliferating AI-generated art on larger social media platforms such as Instagram and Facebook.

text:
# Cara (app)

**Cara** is an image sharing platform and social network for artists and creatives to share portfolios. It is available both as an app and as a website, and is run by founder Zhang Jingna and a group of volunteers. Cara states that it is "creators-first" and was founded to protect human artists from rapidly-proliferating AI-generated art on larger social media platforms such as Instagram and Facebook.

## History

### Creation

Cara was founded by Zhang Jingna for artists against AI-scraping. Zhang has also stated that she has purposely avoided venture funding for Cara, as she does not want outside influence from investors to interfere with the interests of the platform and the artists on it. Zhang is among a group of many creators, including George R. R. Martin and *The New York Times*, who have filed lawsuits against large tech companies like Google over freely scraping the internet for content to use in their AI training data, much of which is copyrighted.

Cara opened for public testing on January 2, 2023. After Meta announced its decision to train its AI on all user-created content starting June 26, 2024, Cara quickly rose in popularity, growing from around 40,000 users to 650,000 in a single week, as artists migrated to avoid having their art trained on without proper procedures for compensation.

## Features

User accounts on Cara can be "portfolio" or "community" accounts. Community accounts are the default. All accounts have the same user experience, but portfolio accounts receive a status badge.

Cara uses third-party content moderation services from Hive to prevent AI-generated art from being uploaded onto the site. Its "About" page states that Cara will not "host AI-generated portfolios unless the rampant ethical and data privacy issues around datasets are resolved via regulation."

Cara automatically tags its art with "NoAI" tags, a form of voluntary exclusion protocol to discourage AI scrapers.

On December 1, 2023, Cara introduced support for Glaze, a tool developed by SAND Lab at the University of Chicago. Artists could "glaze" their art during upload to disincentivize style mimicry by AI image generators. The images are subtly altered to data-poison any AI models trained on them, increasing the rate of output errors. On May 29, 2024, the feature was paused for community accounts over "security and access issues" concerning "abnormal usage patterns where people are creating multiple Cara accounts and maxing out daily Glaze credits uses".

## Reception

Miles Klee at *Rolling Stone* noted Cara as an example of a broader public backlash against over-hyped low-quality generative AI products. *The Independent* interviewed a tattoo artist who believed the growth of Cara was also driven by "general dissatisfaction with existing platforms and their lack of engagement," an issue that existed before social media platforms announced their plans to train generative AI on user data.

Tom May at *Creative Boom* interviewed artists who felt cautious optimism but also exhaustion at the prospect of rebuilding their audiences on a small platform. Some interviewees expressed concerns that Cara may be too "artist-centric," and that one of its weak points is a lack of a non-artist audience to gain exposure to artists. May also pointed out that companies such as Google and OpenAI started out with good intentions just as Cara did, but later reneged on their mottos and mission statements in the name of profit.

## InfoBox

Cara
| Type of site |  |
| --- | --- |
| Available in | English |
| Founder(s) | Zhang Jingna |
| URL | cara.app |
| Registration | Optional |
| Launched | December 15, 2022 (2022-12-15) |
| Current status | Active |


title: Selimiye, Milas

abstract: Selimiye is a neighbourhood of the municipality and district of Milas, Muğla Province, Turkey. Its population is 4,859 (2022). Before the 2013 reorganisation, it was a town (belde). In the vicinity are the ruins of the ancient city of Euromus.

text:
# Selimiye, Milas

**Selimiye** is a neighbourhood of the municipality and district of Milas, Muğla Province, Turkey. Its population is 4,859 (2022). Before the 2013 reorganisation, it was a town (*belde*). In the vicinity are the ruins of the ancient city of Euromus.

## InfoBox

| Selimiye | |
| --- | --- |
| Neighbourhood | |
| SelimiyeLocation in TurkeySelimiyeSelimiye (Turkey Aegean) | |
| Coordinates: 37°24′00″N 27°39′25″E / 37.400°N 27.657°E / 37.400; 27.657 | |
| Country | Turkey |
| Province | Muğla |
| District | Milas |
| Population (2022) | 4,859 |
| Time zone | UTC+3 (TRT) |


title: Selimiye, Osmaneli

abstract: Selimiye is a village in the Osmaneli District, Bilecik Province, Turkey. Its population is 295 (2021).

text:
# Selimiye, Osmaneli

**Selimiye** is a village in the Osmaneli District, Bilecik Province, Turkey. Its population is 295 (2021).

## InfoBox

| Selimiye | |
| --- | --- |
| Village | |
| SelimiyeLocation in TurkeySelimiyeSelimiye (Marmara) | |
| Coordinates: 40°19′55″N 30°03′37″E / 40.3320°N 30.0602°E / 40.3320; 30.0602 | |
| Country | Turkey |
| Province | Bilecik |
| District | Osmaneli |
| Population (2021) | 295 |
| Time zone | UTC+3 (TRT) |


title: Carbohydrate loading

abstract: Carbohydrate loading, commonly referred to as carb-loading, or carbo-loading, is a strategy used by endurance athletes, such as marathoners and triathletes, to reduce fatigue during an endurance event by maximizing the storage of glycogen in the muscles and liver. Carbohydrate consumption is increased in the days before an endurance event. Carbohydrate loading is generally recommended for endurance events lasting longer than 90 minutes. Foods with low glycemic indices are generally preferred for carbo-loading due to their minimal effect on serum glucose levels. Low glycemic foods commonly include vegetables, whole wheat pasta, and grains. Many endurance athletes have large pasta dinners the night before an event. Since muscles also use amino acids extensively when functioning within aerobic limits, meals should also include adequate protein. Large portions before a race can, however, decrease race-day performance if the digestive system has not had the time to process the food regimen.

text:
# Carbohydrate loading

**Carbohydrate loading**, commonly referred to as **carb-loading**, or **carbo-loading**, is a strategy used by endurance athletes, such as marathoners and triathletes, to reduce fatigue during an endurance event by maximizing the storage of glycogen (or energy) in the muscles and liver. Carbohydrate consumption is increased in the days before an endurance event.

Carbohydrate loading is generally recommended for endurance events lasting longer than 90 minutes. Foods with low glycemic indices are generally preferred for carbo-loading due to their minimal effect on serum glucose levels. Low glycemic foods commonly include vegetables, whole wheat pasta, and grains. Many endurance athletes have large pasta dinners the night before an event. Since muscles also use amino acids extensively when functioning within aerobic limits, meals should also include adequate protein. Large portions before a race can, however, decrease race-day performance if the digestive system has not had the time to process the food regimen.

## Without depletion

Research in the 1980s led to a modified carbo-loading regimen that eliminates the depletion phase, instead calling for increased carbohydrate intake (to about 70% of total calories) and decreased training for three days before the event.

## Short workout

A new carbo-loading regimen developed by scientists at the University of Western Australia calls for a normal diet with light training until the day before the race. On the day before the race, the athlete performs a very short, extremely high-intensity workout (such as a few minutes of sprinting) then consumes 12 g of carbohydrate per kilogram of lean mass over the next 24 hours. The regimen resulted in a 90% increase in glycogen storage when compared to before the carbo-load, which is comparable to or higher than the results achieved with other 2 day – 6 day carbo-loading regimes.

## Transient hypoglycemia

Carbohydrate ingestion within 2 hours before aerobic exercise triggers elevated levels of insulin in the blood which may dramatically decrease serum glucose levels. This can limit aerobic performance, especially in events lasting longer than 60 minutes. This is known as transient or reactive hypoglycemia, and can be a limiting factor in elite athletes. Individuals susceptible to hypoglycemia are especially at risk for elevated insulin responses and thus will likely suffer from performance-limiting transient hypoglycemia if they do not follow the correct regimen.

## Diet composition

The composition of carbohydrates in the athlete's diet during carbohydrate loading is as important as their share of the overall caloric regimen .

Most dietary carbohydrates consist of varying proportions of two simple sugars, glucose and fructose. Fructose may be metabolized into liver glycogen, but it is ineffective at raising muscle glycogen levels (which is the objective of carbohydrate loading). Consequently, sources of high-fructose carbohydrates, such as fruit and sugar-based foods, are less than optimal for the task. The classic carb-loading meal is pasta, whose caloric content is primarily due to starch, a polymer of glucose. Other high-starch meals which include bread, rice, and potatoes are also part of the correct regimen.

## Further reading


title: Seat (Buttermere)

abstract: Seat or Seat (Buttermere) is a minor Fell in the English Lake District. It has a height of 561 m (1840 ft). Seat is over-shadowed by Haystacks and High Crag. Its location is on the south-western corner of Buttermere in the North Western Fells.

text:
# Seat (Buttermere)

**Seat** or **Seat (Buttermere)** is a minor Fell in the English Lake District. It has a height of 561 m (1840 ft). Seat is over-shadowed by Haystacks and High Crag. Its location is on the south-western corner of Buttermere in the North Western Fells.

## Topography

Seat is cushioned in between Haystacks and High Crag in the North Western Fells. Seat has an abundance of small Crags and the summit is reasonably flat. At the bottom of Seat is Buttermere, which was once joined with Crummock Water to the north. On the western side of Seat is Ennerdale Forest in the Ennerdale Valley. Seat's neighboring mountains include Fleetwith Pike, Haystacks, High Crag, High Stile, Red Pike and Dodd. Beyond Seat to the north-west the land diminishes towards the coastal plain of Cumberland.

## Ascents

The ascent favoured by many is from the south-eastern corner of Buttermere, From Gatesgarth Farm, across the road from the Farm Car park and out towards the ascent at the bottom of Haystacks. Haystacks would commonly be the first port of call with options to go north towards Seat and High Crag then High Stile, Red Pike, Dodd and then back alongside the lake back to the Farm, or south towards Fleetwith Pike. The other main ascent is the opposite, starting at the north of the lake from the village of Buttermere and up to Red Pike then to High Stile, High Crag, then finally onto Seat and Haystacks. Other ascents which are less common include the ascent via Scarth Gap from Ennerdale Forest.

## Summit and View

Seat has two summits; a Southern and the Northern, with the Northern Summit being the true summit. The summit cairn is on the top of a small crag. The cairn is a collection of rocks and a bit of rusted metal on top. From the summit, High Crag can immediately be seen to the north, and Haystacks to the South, the view to the East is of Buttermere valley and to the west Ennerdale Forest and valley.

http://www.leaney.org/lake\_district\_fells.php?fell\_id=seat

http://www.stridingedge.net/Birkett%20Fells/Birkett%20A-Z%20fells/Seat.htm

1. "Leaney Mountain profile: Seat". Leaney. Retrieved 9 January 2012.
2. "Leaney Mountain profile: Seat". Leaney. Retrieved 9 January 2012.

54°30′33″N 3°15′31″W / 54.5093°N 3.2587°W / 54.5093; -3.2587

## InfoBox

| Seat (Buttermere) | |
| --- | --- |
| Seat (middle left) from the summit tarn on Haystacks | |
| Highest point | |
| Elevation | 561 m (1,841 ft) |
| Listing | Leaney Birkett |
| Geography | |
|  | |
| Location | Cumbria, England |
| Parent range | Lake District, North-Western Fells |
| OS grid | NY186134 |
| Topo map | OS *Explorer* OL4 |


title: Seləli

abstract: Seləli is a village in the Qubadli Rayon of Azerbaijan.

text:
# Seləli

39°11′47″N 46°44′11″E / 39.19639°N 46.73639°E / 39.19639; 46.73639

**Seləli** (also, **Selali** and **Silali**) is a village in the Qubadli Rayon of Azerbaijan.

## InfoBox

| Seləli | |
| --- | --- |
| Seləli | |
| Coordinates: 39°11′47″N 46°44′11″E / 39.19639°N 46.73639°E / 39.19639; 46.73639 | |
| Country | Azerbaijan |
| Rayon | Qubadli |
| Time zone | UTC+4 (AZT) |
| Summer (DST) | UTC+5 (AZT) |


title: Semecarpus reticulatus

abstract: Semecarpus reticulatus is a tree species in the family Anacardiaceae. It can be found in China (Yunnan), Laos, northern Thailand and Viet Nam; no subspecies are listed in the Catalogue of Life.

text:
# Semecarpus reticulatus

***Semecarpus reticulatus*** (aka ***S. reticulata***) is a tree species in the family Anacardiaceae. It can be found in China (Yunnan), Laos, northern Thailand and Viet Nam (where it may be called *sựng mạng*); no subspecies are listed in the Catalogue of Life.

1. Lecomte PH (1907) In: *Bull. Soc. Bot. France 54: 610*
2. "Semecarpus reticulatus Lecomte | Plants of the World Online | Kew Science". *plantsoftheworldonline.org*. Retrieved 20 September 2018.
3. Roskov Y.; Kunze T.; Orrell T.; Abucay L.; Paglinawan L.; Culham A.; Bailly N.; Kirk P.; Bourgoin T.; Baillargeon G.; Decock W.; De Wever A. (2014). Didžiulis V. (ed.). "Species 2000 & ITIS Catalogue of Life: 2014 Annual Checklist". Species 2000: Reading, UK. Retrieved 26 May 2014.

## InfoBox

| *Semecarpus reticulatus* | |
| --- | --- |
|
| Scientific classification | |
| Kingdom: | Plantae |
| *Clade*: | Tracheophytes |
| *Clade*: | Angiosperms |
| *Clade*: | Eudicots |
| *Clade*: | Rosids |
| Order: | Sapindales |
| Family: | Anacardiaceae |
| Subfamily: | Anacardioideae |
| Genus: | *Semecarpus* |
| Species: | ***S. reticulatus*** |
| Binomial name | |
| ***Semecarpus reticulatus***<br>Lecomte | |
|
| Synonyms | |
| *Semecarpus reticulata* Lecomte | |


title: Seki Station (Mie)

abstract: Seki Station is a passenger railway station of West Japan Railway Company (JR-West) located in the city of Kameyama, Mie Prefecture, Japan.

text:
# Seki Station (Mie)

**Seki Station** (関駅, *Seki-eki*) is a passenger railway station of West Japan Railway Company (JR-West) located in the city of Kameyama, Mie Prefecture, Japan.

## Lines

Seki Station is served by the Kansai Main Line and is located 65.6 rail kilometres from the terminus of the line at Nagoya Station and 5.7 rail kilometers from Kameyama Station.

## Layout

The station consists of two side platforms serving two tracks, connected by a footbridge.

### Platforms

| **Westbound** | Kansai Line | for Iga-Ueno and Kamo |
| --- | --- | --- |
| **Eastbound** | Kansai Line | for Kameyama |

## History

Seki Station was opened on December 25, 1890 with the extension of the Kansai Railway from Yokkaichi Station to Tsuge Station. The Kansai Railway was nationalized on October 1, 1907, becoming part of the Imperial Government Railways (IGR), which became Japan National Railways (JNR) after World War II. Freight operations were discontinued from April 1, 1972. With the privatization of JNR on April 1, 1987, the station came under the control of JR-West.

## Passenger statistics

In fiscal 2019, the station was used by an average of 434 passengers daily (boarding passengers only).

## Surrounding area

Media related to Seki Station (Mie) at Wikimedia Commons

## InfoBox

| Seki Station
関駅 | |
| --- | --- |
| JR-West regional rail station | |
| Seki Station | |
| General information | |
| Location | 664, Shinjo, Sekichō, Kameyama-shi, Mie-ken 519-1111
Japan |
| Coordinates | 34°50′57″N 136°23′40″E / 34.849178°N 136.394567°E / 34.849178; 136.394567 |
| Owned by | West Japan Railway Company (JR-West) |
| Operated by | Kameyama City Tourism Association |
| Line(s) |  |
| Distance | 5.7 km (3.5 mi) from Kameyama |
| Platforms | 2 side platforms |
| Tracks | 2 |
| Train operators | JR-West |
| Bus stands | 1 |
| Connections | **Kameyama City Community Bus**: Western A Route at Seki-eki-mae |
| Construction | |
| Structure type | At grade |
| Bicycle facilities | Available |
| Accessible | None |
| Other information | |
| Website | Official website |
| History | |
| Opened | 25 December 1890 (1890-12-25) |
| Passengers | |
|  | |
| 2019 | 434 daily |
|  | |
|  | |
| Services   Preceding station    JR-West   Following station  Kabuto
toward Kamo   Kansai Line   Kameyama
Terminus | |
|  | |
|  | |
|  | |
| Location  Seki StationLocation within Mie PrefectureSeki StationSeki Station (Japan) | |


title: Carl Parcher Russell

abstract: Carl Parcher Russell was a historian, ecologist, and administrator. Russell was born January 18, 1894, in Fall River, Wisconsin. He joined the National Park Service (NPS) in 1923 as a Naturalist in Yosemite National Park. In 1931 he received a Ph.D. in Ecology from the University of Michigan. He served as an officer for the NPS for 34 years, from 1923 until his retirement in 1957. He was the Chief Naturalist of Yosemite from 1923 to 1929. He specialized in frontier history, studying its material culture in minute detail, and documented pioneer life for the NPS and others. Russell served in several regional positions in the NPS, including NPS Chief Naturalist of Yosemite (1923–1929), regional director, and Yosemite National Park Superintendent. Russell retired from the park service in 1957, and he died at his home in Orinda, California, on June 19, 1967, after a heart attack.

text:
# Carl Parcher Russell

**Carl Parcher Russell** (January 18, 1894 – June 19, 1967) was a historian, ecologist, and administrator.

Russell was born January 18, 1894, in Fall River, Wisconsin. He joined the National Park Service (NPS) in 1923 as a Naturalist in Yosemite National Park. In 1931 he received a Ph.D. in Ecology from the University of Michigan. He served as an officer for the NPS for 34 years, from 1923 until his retirement in 1957. He was the Chief Naturalist of Yosemite from 1923 to 1929. He specialized in frontier history, studying its material culture in minute detail, and documented pioneer life for the NPS and others.

Russell served in several regional positions in the NPS, including NPS Chief Naturalist of Yosemite (19231929), regional director, and Yosemite National Park Superintendent. Russell retired from the park service in 1957, and he died at his home in Orinda, California, on June 19, 1967, after a heart attack.

## Books by Carl P. Russell

* *One Hundred Years in Yosemite* (1931, 1947, 1957)
* *Guns on the Early Frontiers* (1957)
* *Firearms, Traps and Tools of the Mountain Men* (posthumously, 1967) ISBN 0-8263-0465-6
* Besides books, Russell wrote several articles for *Yosemite Nature Notes* and NPS and historical journals, and papers for various conferences.

## Online article by Carl P. Russell

## InfoBox

| Carl Parcher Russell | |
| --- | --- |
| Carl and Betty Russell, 1925 | |


title: Selective adsorption

abstract: In surface science, selective adsorption is the effect when minima associated with bound-state resonances occur in specular intensity in atom-surface scattering. In crystal growth, selective adsorption refers to the phenomenon where adsorbing molecules attach preferentially to certain crystal faces. An example of selective adsorption can be demonstrated in the growth of Rochelle salt crystals. If copper ions are added to solution during the growth process, some crystal faces will slow down as copper apparently becomes a barrier to adsorption. However, by then adding sodium hydroxide to the solution, the preferred crystal faces will change once again.

text:
# Selective adsorption

In surface science, **selective adsorption** is the effect when minima associated with bound-state resonances occur in specular intensity in atom-surface scattering.

In crystal growth, selective adsorption refers to the phenomenon where adsorbing molecules attach preferentially to certain crystal faces.

An example of selective adsorption can be demonstrated in the growth of Rochelle salt crystals. If copper ions are added to solution during the growth process, some crystal faces will slow down as copper apparently becomes a barrier to adsorption. However, by then adding sodium hydroxide to the solution, the preferred crystal faces will change once again.

## Discovery

Pronounced intensity minima were first observed in 1930 by Theodor Estermann, Otto Frisch, and Otto Stern, during a series of gas-surface interaction experiments attempting to demonstrate the wave nature of atoms and molecules. The phenomenon has been explained in 1936 by John Lennard-Jones and Devonshire in terms of resonant transitions to bound surface states.

## Significance

The selective adsorption binding energies can supply information on the gas-surface interaction potentials by yielding the vibrational energy spectrum of the gas atom bound to the surface. Starting from the 1970s, it has been extensively studied, both theoretically and experimentally. Energy levels measured with this technique are available for many systems.

* Hulpke, E. (1992). *Helium Atom Scattering from Surfaces*. Springer. p. 168. ISBN 9783662027745.
* Torres, Zuleika Medina (2008). "Selective adsorbtion". *Theoretical Studies of Gas-surface interactions*. pp. 7–8.


title: Fiske & Meginnis

abstract: Fiske & Meginnis, Architects was an architecture firm partnership from 1915–1924 between Ferdinand C. Fiske (1856–1930) and Harry Meginnis in Lincoln, Nebraska. Twelve of the buildings they designed are listed on the National Register of Historic Places (NRHP). The two men have additional buildings listed on the National Register with other partnerships or individually credited. Related firms were Fiske and Dieman, Fiske, Meginnis and Schaumberg, and Meginnis and Schaumberg. Ferdinand C. Fiske was born in New York and raised in Iowa. He was educated at Cornell University and moved to Lincoln during the building boom of 1887 and practiced there the rest of his life. He was a founding partner of firms including Fiske & Dieman (1898–1912); Fiske & Miller (1912–1924); and Fiske, Meginnis, & Schaumberg (1924–1925). Harry Meginnis did not receive an education in architecture but learned through the construction business. He worked under Fiske at Fiske & Dieman (1901–1909) in their Lincoln office as a draftsman. He had brief stints at several firms in Indianapolis including DuPont & Hunter (1907–1909); H.L. Bass Co. (1909–1914); and Broakie & Meginnis (1914–1915). In 1915, Meginnis returned to Lincoln to start Fiske & Meginnis (1915–1924) and Fiske, Meginnis, & Schaumberg (1924–1925). Meginnis went on to establish Meginnis and Schaumberg (1925–1943) with Edward G. Schaumberg. It lasted until Meginnis died in 1943. While Fiske and his partners worked under many different styles, Fiske & Meginnis mostly worked within the English Revival realm combined with the Prairie style that Frank Lloyd Wright was concerned with at the time. They were also involved in a significant number of industrial warehouse projects in Lincoln, namely in the Haymarket District.

text:
# Fiske & Meginnis

**Fiske & Meginnis, Architects** was an architecture firm partnership from 1915–1924 between **Ferdinand C. Fiske** (1856–1930) and **Harry Meginnis** in Lincoln, Nebraska. Twelve of the buildings they designed are listed on the National Register of Historic Places (NRHP). The two men have additional buildings listed on the National Register with other partnerships or individually credited. Related firms were **Fiske and Dieman**, **Fiske, Meginnis and Schaumberg**, and Meginnis and Schaumberg.

Ferdinand C. Fiske was born in New York and raised in Iowa. He was educated at Cornell University and moved to Lincoln during the building boom of 1887 and practiced there the rest of his life. He was a founding partner of firms including Fiske & Dieman (1898–1912); Fiske & Miller (1912–1924); and Fiske, Meginnis, & Schaumberg (1924–1925).

Harry Meginnis did not receive an education in architecture but learned through the construction business. He worked under Fiske at Fiske & Dieman (1901–1909) in their Lincoln office as a draftsman. He had brief stints at several firms in Indianapolis including DuPont & Hunter (1907–1909); H.L. Bass Co. (1909–1914); and Broakie & Meginnis (1914–1915). In 1915, Meginnis returned to Lincoln to start Fiske & Meginnis (1915–1924) and Fiske, Meginnis, & Schaumberg (1924–1925). Meginnis went on to establish Meginnis and Schaumberg (1925–1943) with Edward G. Schaumberg. It lasted until Meginnis died in 1943.

While Fiske and his partners worked under many different styles, Fiske & Meginnis mostly worked within the English Revival realm (Elizabethan, Georgian, and Tudor among others) combined with the Prairie style that Frank Lloyd Wright was concerned with at the time. They were also involved in a significant number of industrial warehouse projects in Lincoln, namely in the Haymarket District.

## Selected works

### Reese House

Located within the Mount Emerald and Capitol Additions District, the Reese House was designed by Fiske and Meginnis in 1907. The Reese House was designed with false-timber work and stucco and large overhanging eaves over the porches placing it into the Tudor-Revival/Prairie-Style category that Fiske & Meginnis were known for especially in their residential projects. This residence was designed for Manoah Bostic Reese and his family who was the chief justice of the Nebraska Supreme Court and also the Dean for the College of Law at the University of Nebraska-Lincoln.

### Lincoln Municipal Lighting and Waterworks Building

Though it currently stands as an apartment building, Fiske and Meginnis’ A Street landmark was originally built as the Lincoln Municipal Lighting and Waterworks Plant. Much like many of their other public works together, Fiske and Meginnis designed a building easily classified as neoclassical revival. Three, large, and light blue smoke stacks protrude through the flat roof, while the large structure and exterior facade of the building consists of a slightly darker red brick, trimmed with limestone and buff bricks on the cornices. The focal east and north facades are punctured with what appears to be two stories of large glass windows with round heads. But behind this deceptive façade lies a factory-like interior, renovated into apartments. The large first floor and first floor windows leave room for an attic floor above.

### Antelope Grocery

Built in 1922, Antelope grocery was constructed as a mixed use (commercial and apartment) building. The two-story brick and stucco structure makes use of architectural elements common to period houses. The store includes a visual usage of Tudor revival-styled elements within the construction and has undergone multiple renovations while retaining a high degree of architectural integrity. This includes the current existence of its original metal framed store-front windows. The lower level of the building remains business, while the upper level is mainly residential apartments. As far as the exterior is concerned, stucco and half-timber form the cladding which traces up to a truncated steeply pitched roof capped with a flat decking. The main modifications to the building's exterior include re roofing and addition of protective glazing over the transoms.

## Complete works

Fiske & Meginnis practiced many styles of architecture, which lead to a wide variety of commissions. The firm designed residences, public works buildings, libraries, schools for all levels of education, and warehouses.

| Building | Address | Architectural<br>Classification | Partners | Year | Historic |
| --- | --- | --- | --- | --- | --- |
| \**Agriculture Hall | East campus |  | Fiske and Dieman | 1904 | NO |
| Antelope Grocery | 2406 J Street | Tudor Revival | Fiske and Meginnis | 1922 | YES |
| Auld Public Library | 537 N. Webster, Red Cloud, NE | Classical Revival | Fiske and Meginnis | 1917 | YES |
| \*Carter Transfer Warehouse | 311 N. 8th | Warehouse | Fiske and Meginnis | 1916 | YES |
| \***Charles Stuart House | 1830 E Street | Western Stick | Fiske | 1910 | YES |
| Clinton Elementary School | 1520 N. 29th Street | Elizabethan Revival | Fiske, Meginnis and Schaumberg | 1925 | NO |
| \**College Activities Building | East Campus |  | Meginnis and Schaumberg | 1926 | NO |
| Edgar Burnett House | 3526 Holdrege Street |  |  |  |  |
| Elliot Elementary School | 225 S. 25th Street |  | Fiske and Meginnis | 1922 | NO |
| Fairbury Jr/Sr High School | Fairbury, NE | Georgian Revival/ Modernistic | Fiske and Meginnis | 1923 | YES |
| Federal Trust Building | 134 S. 13th Street | Gothic Revival | Meginnis and Schaumberg | 1927 | YES |
| \**Food and Nutrition Building | East Campus |  | Meginnis and Schaumberg | 1941 | NO |
| Frank Spaulding House | 2221 Sheridan Boulevard | Mission | Fiske | 1909 | YES |
| George and Hazel Abel House | 2335 Sheridan Boulevard |  |  |  |  |
| George Fawell House | 2401 Ryons Street | Period Revival | Fiske | 1916 | YES |
| Gillen House | 2245 A Street | 19th and Early 20th Century Revival | Fiske and Meginnis | 1903 | YES |
| \*Grainger Brothers Complex | 733-737 P Street | Warehouse | Fiske and Dieman | 1906 | YES |
| \*Grainger Brothers Grocery Warehouse | 105 N. 8th Street | Warehouse | Fiske and Meginnis | 1912 | YES |
| Hartley Elementary School | 730 N. 33rd Street |  | Fiske and Meginnis | 1920 | NO |
| Hayward School Addition | 1215 N. 9th Street | Georgian Revival | Fiske, Meginnis, and Schaumberg | 1925 | YES |
| \***H.E. Sidles House | 2110 A Street | Prairie School House | Fiske | 1913 | YES |
| \*Home Economics Building | East Campus |  | Fiske and Dieman | 1905 | NO |
| \***J.R. Moyer House | 1140 S. 20th Street | Colonial Revival | Fiske and Meginnis | 1916 | YES |
| \*Lincoln Drug Company Building | 801 P Street | warehouse | Fiske | 1905 | YES |
| \*Lincoln Fixture and Supply Co. Building | 826 P Street | warehouse | Fiske and Meginnis | 1922 | YES |
| Loup City Township Carnegie Library | 625 N Street, Loup City, NE | Neoclassical Revival | Fiske and Meginnis | 1917 | YES |
| \**Love Memorial Co-op Hall | East Campus |  | Meginnis and Schaumberg | 1941 | NO |
| \***Mayor Don Lover House | 1953 B Street | Tudor Revival | Fiske and Meginnis | 1916 | YES |
| \***Meeker Anderson House | 1950 C Street | Tudor Revival/ Prairie style | Fiske | 1916 | YES |
| \**Mueller Tower | City Campus |  | Meginnis and Schaumberg | 1949 | NO |
| Municipal Lighting and Waterworks Plant | 2901 A Street | Neoclassical Revival | Fiske and Meginnis | 1921 | YES |
| \***N.C. Rogers House | 2145 B Street | Jacobethan Revival | Fiske and Miller | 1914 | YES |
| \***Old Delta Upsilon House | 1701 E Street | Eclectic Revival | Meginnis and Schaumberg | 1931 | YES |
| Prescott Elementary School | 2024 S. 20th Street | Elizabethan Revival | Fiske and Meginnis | 1920 | NO |
| \*** The Reese House | 1990 C Street | Tudor Revival/ Prairie | Fiske and Meginnis | 1907 | YES |
| \*** Senator Elmer J. Burkett House | 1944 B Street | Prairie | Fiske and Miller | 1914 | YES |
| \*Stacy Brothers Fruit Co. | 800 P Street | warehouse | Fiske | 1912 | YES |
| \*** The Stuart Aunties House | 1935 D Street | Tudor Revival/ Prairie | Fiske | 1911 | YES |
| \***W.E Chapin House | 1979 D Street | Tudor Revival/ Prairie | Fiske and Miller | 1913 | YES |
| \***Whitney-Stephenson-Merritt House | 1965 B Street | Second Italian Renaissance Revival | Fiske | 1916 | YES |
| Whittier Junior High School | 2200 Vine Street | Neoclassical Revival | Fiske and Meginnis | 1923 | NO |
|

* buildings in Historic Haymarket District \** buildings on the University of Nebraska Lincoln’s campus \*** houses in Mount Emerald Historic District


title: Parsenn

abstract: Parsenn is a ski area near Davos, Switzerland, offering 35 ski runs. The Parsenn area is the largest and most modern of Davos' five mountains. The recently updated Parsenn "red railway" funicular covers the difference of 1,100 metres (3,609 ft) up to the Weissfluhjoch ridge. One can also get from Klosters to Gotschna/Parsenn with a large cable car which runs from here run up to 17 kilometres (10.6 mi) into the Prättigau valley.

text:
# Parsenn

**Parsenn** is a ski area near Davos, Switzerland, offering 35 ski runs.

The Parsenn area is the largest and most modern of Davos' five mountains.

The recently updated Parsenn "red railway" funicular covers the difference of 1,100 metres (3,609 ft) up to the Weissfluhjoch ridge. One can also get from Klosters to Gotschna/Parsenn with a large cable car which runs from here run up to 17 kilometres (10.6 mi) into the Prättigau valley.

46°50′N 9°49′E / 46.84°N 9.81°E / 46.84; 9.81