The American Association of Airport Executives recently made changes to the requirements for the research paper. This is a good thing in that it decreasing the number of pages that are required; however, I find it difficult to decrease the number of pages of my page to meet the requirements. Currently my paper is 27 pages long and I am only half done with the discrepancy life cycle. This means that I may come in at the maximum number of pages for the old requirement, and will have to find a way to decrease the papers length. As I mentioned before the paper is on using computer-technology to assist airports in their Part 139 Self-Inspection Requirements.
I was in the seventh grade when my father brought home an IBM Apex – which could barely be called a computer by today’s standards - and I don’t ever recall a moment of my life not influenced by the computer. Having been raised with computers I feel somewhat comfortable around them, and although I continue to learn more about them everyday I know a lot about their operations and how they could help an airports operation.
By the admission of the FAA there are not many airports that have computerized record keeping systems, and this makes the number of sources for my paper limited to commercial applications that can cost thousands of dollars. I have a fundamental problem with expensive proprietary software applications, and tend to be open source minded so I have no problem providing my time pro-bono to help airports avoid the pitfalls of proprietary software.
But the paper moves along when I find myself with the time and willingness to write. Coming up with good descriptive system analysis comparing paper-based systems to computer-based system is not a simple task. Each comparison must be complete and yield a common theme, that computers are the way records should be done. Think to yourself of ways a paper-based system of checklists works, and how it could work more efficiently with computers. Then find justification for that thought, with sources other then yourself – difficult.