Apulon

Apulon (Apoulon, Apula) was a Dacian fortress city close to modern Alba Iulia, Romania from where the Latin name of Apulum is derived. The exact location is believed by many archaeologists to be the Dacian fortifications on top of Piatra Craivii, Craiva, Cricău, about 20 km north of Alba-Iulia.[1]

Apulon
Piatra Craivii
Shown within Romania
Alternative nameDacian Fortress of Piatra Craivii, Dacian Settlement of Piatra Craivii
LocationPiatra Craivii, CraivaAlba County Romania
Coordinates46.209122°N 23.485422°E / 46.209122; 23.485422
Altitude1,010 m (3,314 ft)
History
CulturesApuli
EventsTrajan's Dacian Wars
Reference no.AB-I-s-A-00028
Apula on the Roman Dacia selection from Tabula Peutingeriana

Apulon was an important Dacian political, economic and social center, the capital of the Apuli tribe. It was first mentioned by the Ancient Greek geographer Ptolemy in his Geographia, under the name Apulon. It is also depicted in the Tabula Peutingeriana as an important city named Apula, at the cross road of two main routes: one coming from Blandiana, the other from Acidava. The two roads merge at Apula, with the next stop on the route being Brucla.

After the southern part of Dacia became a province of the Roman Empire, the capital of the Dacia Apulensis district was established here, and the city was known as Apulum.[2] Apulum was one of the largest centers in Roman Dacia and the seat of the XIII Gemina Legion. The castra at Apulum is the largest in Romania, occupying 37,5 ha (750 x 500 m2).

  • View from Măgulici Hill, Ighiu
  • View from Craiva's valley
  • Wall from Piatra Craivii Dacian Fortress in display at the National Museum of the Union, Alba Iulia
  • Wall from Piatra Craivii Dacian Fortress
  • Import items from the Roman world found at Dacian settlement of Piatra Craivii,
  • Late Bronze Age vessels and bronze objects, from various locations in Alba County, including Piatra Craivii
  • Dacian bronze rings (1st century BC) found on site - on display in the Roman Museum Manching.
gollark: Interesting question. Probably. I don't know how you could construct that.
gollark: I think that technically makes it not a *regular* regular expression.
gollark: My thing works by building a weirdly structured finite-state machine which matches permutations of "regex", then converting it to a different flat one usable by the `greenery` library, then using it to very slowly convert that into a regex.
gollark: I made a regex which matches all anagrams of regex: `e(e(g(rx|xr)|r(gx|xg)|x(gr|rg))|g(e(rx|xr)|r(ex|xe)|x(er|re))|r(e(gx|xg)|g(ex|xe)|x(eg|ge))|x(e(gr|rg)|g(er|re)|r(eg|ge)))|g(e(e(rx|xr)|r(ex|xe)|x(er|re))|r(e(ex|xe)|xe{2})|x(e(er|re)|re{2}))|r(e(e(gx|xg)|g(ex|xe)|x(eg|ge))|g(e(ex|xe)|xe{2})|x(e(eg|ge)|ge{2}))|x(e(e(gr|rg)|g(er|re)|r(eg|ge))|g(e(er|re)|re{2})|r(e(eg|ge)|ge{2}))`.
gollark: Depends on the database you're using and what the driver code does. In general no.

See also

Notes
  1. "Archived copy". Archived from the original on 2012-02-11. Retrieved 2013-03-25.CS1 maint: archived copy as title (link)
  2. Apulum @Livius.orgl
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.