Anton Elschnig

Anton Elschnig (22 August 1863 – 1939) was an ophthalmologist born in Leibnitz, Austria.

In 1886, he received his medical doctorate at the University of Graz, and later worked as an assistant at ophthalmology clinics in Graz and Vienna. In 1892 he obtained his habilitation at Graz, and from 1907 to 1933 was a full professor and head of the eye clinic at the University of Prague.

He is best known for performing corneal transplants in the early days of keratoplasty, being credited with developing a method introduced by Arthur von Hippel (1841-1916).[1] Elschnig described this surgical procedure in the "Archives of Ophthalmology" (1930, 4: 165-173).

He was the publisher of the second and third editions of the Graefe-Saemisch Handbuch der gesammten Augenheilkunde.

Eponymous ophthalmic terms
  • "Elschnig's conjunctivitis": Conjunctivitis associated with hyperplasia of the tarsal gland.
  • "Elschnig's pearls": Pearl-like clusters formed by growth of epithelial cells on the lens capsule in secondary cataract formation.
  • "Elschnig's spots": phenomena of black flecks surrounded by yellow or red halos as seen by ophthalmoscope. It occurs in cases of advanced hypertensive retinopathy, represent focal choroidal infarcts.
gollark: Oh, right, array indexing.
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.
  1. Who Named It (bibliography)


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