Daniel B. Hearn
********@*******.***
Objective: A responsible position, with growth potential, utilizing my abilities and experience in information systems. Summary:
** ***** ** *****ience in the IT Industry
Proficient in Mainframe Technologies such as MS, DB2, COBOL, JCL, VSAM, etc. Education:
B.A., Political Science, 1979, University of Delaware, Newark, DE A.S., Data Processing, 1984, Delaware Technical & Community College, Wilmington, DE; (honors: Phi Theta Kappa) Classroom Experience: J Sargent Reynolds Community College, Richmond, VA. Credit coursework in PL/SQL with data modeling, Frontpage 2000 and VB.NET.
University of Richmond Continuing Education (ED2GO) mid-July, 2020 thru mid-May 2021
HTML5 & CSS3 Intro 100% Intermediate 100 % Advanced 97% Wordpress Intro 98% Intermediate 98%
MS SQL Server Intro 100% Intermediate (Exam: 5/17/21) PHP/MySQL Intro 92% Intermediate 94%
Python 86% Javascript 94% Responsive Web Design 97% Mobile Apps with HTML5 97% The Cloud 100%
(Exam: 5/17/21): Designing Effective Websites Advanced Web Pages Linux XML Demo Website: anxiety.cafe
Professional Experience
Virginia Department of Motor Vehicles 4/06 - 9/19
Position: Programmer/Analyst
Technical environment: TSO/ISPF, Adabas, Natural, Easytrieve. I worked in the Motor Carrier section assisting in modifying correspondence programs as per legislative changes. Assisted in writing an application to track drivers and vehicles for Uber and Lyft and billing them annually. Changed and tested programs per internal requests or required by legislative changes. Created and enhanced many online utility programs that assist developers in setting up tests and second level testers to verify that program changes are working as designed. Wrote programs to convert mainframe flat files into ASCII text files and vice versa exchanging data with external vendors. Participated in testing applications and JCL that could potentially be impacted by upgrades to DMV’s operating system Assisted in documenting the daily, weekly, monthly, quarterly, yearly and on request applications for the Motor Carrier system. Global Computer Associates of NJ 8/97 - 12/04
Position: Senior Programmer/Analyst
Technical environment: IBM3090, IBM S/390, TSOISPF, Librarian, COBOL", Telon, Easytrieve, ms DB, DB2, Xpediter, Fileaid.
The two major clients worked for were the Virginia Department of Taxation for 2 years, where I perforrned Y2K tasks and the Virginia Department of Social Services for 5 years, where my biggest assignments were independently developing and testing the DMV Booting system and the Address tracking system. I also helped with the IMS-to-DB2 conversion at DSS by establishing baseline test data on the MS side. The DMV Booting System 's purpose was to identify non-custodial parents who were grossly in arrears in child support and to locate their motor vehicles for booting. Studied several DMV programs to determine how their data was structured and what information would best suit our purposes. Supplied a programmer at DMV with the information required to obtain the vehicle information that we required. Created a system which would automatically send and receive files on a weekly basis without operator intervention and with procedures to notify our programming staff if a request for data has not been replied to by DMV. Created DB2 update programs regarding non-custodial parent's arrearage amount and vehicle make, model, age, license plate number, location and garage jurisdiction and any co- ownership to supply to the appropriate sheriff's department for booting. The Address Tracking System 's purpose was to combine duplicate non-custodial parent addresses in the address database; implement new rules concerning address update and keep an address history for audit, customer service and investigations.
Deborah Harper, whose recommendation accompanies this resume, obtained the State of Virginia
"Excellence in Teaching Awarff' after demonstrating this overhauled system to the staffin the field. The areas involved were the existing address clean up and the ongoing batch and online addresses update programs. Subroutines were written to perfornl various functions. Below is an overview. Address update routine - called the address match subroutine and address history subroutine. Matching addresses were combined unless the sources weren't allowed to be. The best address source was shown with the address and was changed based on several criteria, including when it should be considered a new 'MAIL'. Zip+4 was added for new mail addresses if Finalist found the address on their database. Any changes to information related to the address, but not the address itself, required calling the address history subroutine to preserve older inforrnation. For audit purposes addresses were never deleted or replaced. Therefore all existing addresses had to be matched to the input address to insure that duplicates wouldn't be created. I designed the online screen to allow the displayed address to be used as a template since even a change of a street number would create a new and an old address. Therefore, when the operator changed the street number there is logic to see if an address with that street number already exists and if it does then the screen brings up the other address for the operator to examine. Address history update routine - keeps track of the date ranges that the address came in from various sources, any operator notes, any changes made to the best address source field, phone number, contact info, FIPS code, payee code; also showing the source and date of change.
Address match routine calls are made from a homegrown driver to Pitney Bowes' Finalist for both the incoming and existing a ddress in order to match the two Finalist output addresses. When Finalist can't find either of the two addresses my homegrown address match logic is used to match the addresses. The combination of these two approaches yields a 99.8% correct match rate.
The above subroutines in batch and online format I connected to 7 batch program address sources and 2 online address sources and I performed all unit and systems testing and implementation for this. Cleanup Program — the purpose was to not only get rid of duplication but to retroactively combine the duplicates in the same way as it would be done point forward so that the system would look like it had always worked the way it works presently. The cleanup reduced 2 million addresses by 50%. Parts of the cleanup required some complicated deductive reasoning due to situations that couldn't be reproduced. I recreated the create dates from address keys in different formats and deterrnined the last update dates through various complex formulas based on best source. I swept existing operator notes into the new address history removing duplicate operator information due to existing duplicate note keys.
Performed the cleanup in 7 hours by locating 9 evenly spaced start and end points in the IMS address database and then ran the cleanup concurrently in 9 initiators while offloading the newly formatted address history into flat files instead of updating in place to avoid deadly embrace. I later uploaded the flat files to the IMS address history database. There were a myriad of complex coding issues throughout the project. My contribution to the IMS-to-DB2 conversion involved baseline testing of about 60 MS programs. Small versions of the IMS databases were supplied for personal use by the database administrator. My task was to analyze the IMS programs, create any input files and manipulate the database information if necessary to test the branches of logic and produce output. The data that I supplied to Sogeti, Inc. after my tests were performed were any input and output files and