Vladivostok Presidential Cadet School

The Vladivostok Presidential Cadet School (Russian: Владивостокское президентское кадетское училище; ВПКУ) is Russian Navy Nakhimov Naval School located in the Far Eastern city of Vladivostok, acting a branch of the boarding school in Saint-Petersburg.

Cadets of the school during the Vladivostok Victory Day Parade in 2019.

History

On 24 August 2013, Defense Minister Sergei Shoigu wrote a letter to President Vladimir Putin with a proposal to establish a presidential cadet school in the Far Eastern Federal District. The proposal was approved by President Putin, and on 29 October, the school was created.[1] Rear Admiral Vladimir Burakov was appointed head of the school. The school year began on 1 September 2014 and on 25 October, the first solemn dedication of pupils took place. In 2016, it was reorganized as a branche of the Nakhimov Naval School in Saint Petersburg.[2] On 31 August 2016, Putin visited the school to announce its new status.[3][4][5] It graduated its first set of students in June 2019.[6]

Other information

The school is located on the grounds of the Pacific Higher Naval School.[7] The standard term of study is seven years from the 5th to 11th grades. Every year, 80 students are recruited for study at the school. Students engage in specialized courses aimed at preparing them for a future in the Russian Armed Forces as well as the private sector. Cadets study the English language, an oriental language ​​of their choice (Chinese or Japanese) as well as topics unique to the navy and naval life (ship modeling, marine robotics, the history of navigation).

gollark: ```python# parsita-based pseudocode syntax parserfrom stmt import *from parsita import *from parsita.util import constantdef compose(f, g): return lambda x: f(g(x))def map_expr(x): start, end = x if end == "": return start return Op([start, end[1]], end[0])def map_unop_expr(x): return Op(x[1], x[0])def aliases(name, aliases): p = lit(name) for alias in aliases: p |= (lit(alias) > (lambda _: name)) return pclass ExprParser(TextParsers): ε = lit("") IntLit = reg("\-?[0-9]+") > compose(IntLit, int) StrLit = "'" >> reg("[^']*") << "'" > StrLit # TODO escapes (not in "spec" but could be needed) FloatLit = reg("\-?[0-9]+\.[0-9]+") > compose(FloatLit, float) Identifier = reg("[a-zA-Z_]+[a-zA-Z_0-9]*") > Var BracketedExpr = "(" >> Expr << ")" UnaryOperator = lit("NOT") Start = FloatLit | StrLit | IntLit | BracketedExpr | (UnaryOperator & Expr > map_unop_expr) | Identifier # avoid left recursion problems by not doing left recursion # AQA pseudocode does not appear to have a notion of "operator precedence", simplifying parsing logic nicely BinaryOperator = aliases("≤", ["<="]) | aliases("≠", ["!="]) | aliases("≥", [">="]) | lit("DIV") | lit("MOD") | lit("AND") | lit("OR") | reg("[+/*\-=<>]") End = (BinaryOperator & Expr) | ε Expr = (Start & End) > map_exprparse = ExprParser.Expr.parsex = parse("1+2+3 != 6 AND NOT 4 AND x + y")if isinstance(x, Failure): print(x.message)else: print(x.value)```
gollark: <@332271551481118732> Expression parsing is done, I think.
gollark: I wonder if AQA pseudocode *does* have operator precedence. We may need to harvest exam papers.
gollark: This will allow 3% more efficient harnessing of character set anomalies.
gollark: The parser supports anomalous unicode, muahaha.

See also

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.