Wei (rank)

Wei (尉) is the rank held by company-grade officers in the military of both the People's Republic of China and the Republic of China. It currently exists in three grades, shao wei (少尉), zhong wei (中尉) (chung wei using Wade–Giles), and shang wei (上尉). An additional grade, da wei (大尉), formerly existed in the People's Liberation Army, during the period 1955-1965. However, when the use of rank and insignia was restored in 1988, this rank was not re-established. As opposed to the Western tradition of using different names for equivalent ranks in the army and navy, Chinese armed forces use the same rank names for all services, prefixed in the case of the PLA by hai jun (海军) (naval force) or kong jun (空军) (air force).

See also

Glossary of chess

This page explains commonly used terms in chess in alphabetical order. Some of these have their own pages, like fork and pin. For a list of unorthodox chess pieces, see Fairy chess piece; for a list of terms specific to chess problems, see Glossary of chess problems; for a list of chess-related games, see Chess variants.

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

[adjective: prophylactic] Prophylactic techniques include the blockade, overprotection, and the mysterious rook move.

Q

R

S

T

U

V

W

X

Z

References

Bibliography

Rank of a partition

In mathematics, particularly in the fields of number theory and combinatorics, the rank of a partition of a positive integer is a certain integer associated with the partition. In fact at least two different definitions of rank appear in the literature. The first definition, with which most of this article is concerned, is that the rank of a partition is the number obtained by subtracting the number of parts in the partition from the largest part in the partition. The concept was introduced by Freeman Dyson in a paper published in the journal Eureka. It was presented in the context of a study of certain congruence properties of the partition function discovered by the Indian mathematical genius Srinivasa Ramanujan. A different concept, sharing the same name, is used in combinatorics, where the rank is taken to be the size of the Durfee square of the partition.

Definition

By a partition of a positive integer n we mean a finite multiset λ = { λ_k, λ_{k − 1}, . . . , λ₁ } of positive integers satisfying the following two conditions:

Rank (computer programming)

In computer programming, rank with no further specifications is usually a synonym for (or refers to) "number of dimensions"; thus, a bi-dimensional array has rank two, a three-dimensional array has rank three and so on. Strictly, no formal definition can be provided which applies to every programming language, since each of them has its own concepts, semantics and terminology; the term may not even be applicable or, to the contrary, applied with a very specific meaning in the context of a given language.

In the case of APL the notion applies to every operand; and dyads ("binary functions") have a left rank and a right rank.

The box below instead shows how rank of a type and rank of an array expression could be defined (in a semi-formal style) for C++ and illustrates a simple way to calculate them at compile time.

Given the code above the rank of a type T can be calculated at compile time by

and the rank of an array-expression expr by

See also