Indiana County–Jimmy Stewart Airport

Indiana County–Jimmy Stewart Airport (IATA: IDI, ICAO: KIDI, FAA LID: IDI) (Indiana County Airport or Jimmy Stewart Field) is a county-owned public airport two miles (3 km) east of the borough of Indiana, in Indiana County, Pennsylvania.[1] The airport is about 65 miles (105 km) northeast of Pittsburgh and is in the Pittsburgh Combined Statistical Area. It is classified as a business service airport by the Pennsylvania Bureau of Aviation.

Indiana County–Jimmy Stewart Airport

Indiana County Airport (Jimmy Stewart Field)
Summary
Airport typePublic
OwnerIndiana County, Pennsylvania
LocationIndiana, Pennsylvania
Elevation AMSL1,405 ft / 428 m
Websitewww.JimmyStewartAirport.com
Runways
Direction Length Surface
ft m
11/29 5,500 1,677 Asphalt
Statistics (2007)
Aircraft operations26,100
Based aircraft45
Source: FAA[1] and airport web site[2]

The airport was named after silver-screen legend Jimmy Stewart, who hails from Indiana, PA.

Facilities

The airport covers 276 acres (112 ha) and has one asphalt runway, 11/29, 4,001 x 75 ft (1,220 x 23 m). The runway has medium intensity runway lighting (MIRL). The airport has three nonprecision approaches (LOC RWY 28, GPS 10, GPS 28).[1]

In the year ending March 31, 2007 the airport had 26,100 aircraft operations, average 71 per day: 95% general aviation, 3% military and 2% air taxi. 45 aircraft are based at the airport: 89% single-engine, 9% multi-engine and 2% ultralight.[1]

The Indiana County Airport Authority has received approval and funding for a new 5500 x 100 ft runway and will allow the installation of an instrument landing system (ILS). The old runway will become a parallel taxiway.

gollark: It's entirely possible that the P = NP thing could be entirely irrelevant to breaking encryption, actually, as it might not provide a faster/more computationally efficient algorithm for key sizes which are in use.
gollark: Well, that would be inconvenient.
gollark: Increasing the key sizes a lot isn't very helpful if it doesn't increase the difficulty of breaking it by a similarly large factor.
gollark: I'm not sure what P = NP would mean for that. Apparently doing that is non-polynomial time, and a constructive P = NP proof would presumably let you construct a polynomial-time algorithm.
gollark: Asymmetric cryptography stuff relies on it being impractically hard to do some things, such as factor large semiprime numbers.

References
  1. FAA Airport Master Record for IDI (Form 5010 PDF), effective 2007-10-25
  2. Indiana County Jimmy Stewart Airport, official web site


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