BackgroundCheck.run
Search For

Derek M Spain, 53Olathe, KS

Derek Spain Phones & Addresses

Olathe, KS   

Shawnee, KS   

3800 Elizabeth Ct, Laurence, KS 66049   

Overland Park, KS   

25070 Romadelo Dr, Louisburg, KS 66053    913-5332257   

Savannah, GA   

6835 Barton Dr, Shawnee, KS 66203    913-2080803   

Social networks

Derek M Spain
Derek M Spain

Linkedin

Work

Company: J.p. morgan Sep 2012 Position: Vice president

Education

Degree: MBA School / High School: Keller Graduate School of Management 2004 to 2007 Specialities: MBA

Skills

VB.NET • Crystal Reports • ASP.NET • AJAX • C# • PHP • Product Management • .NET • Requirements Analysis • Program Management • Agile Methodologies • Oracle PL/SQL Development • Microsoft SQL Server • System Design

Emails

Industries

Information Technology and Services

Mentions for Derek M Spain

Derek Spain resumes & CV records

Resumes

Derek Spain Photo 35

Vp At J.p. Morgan

Position:
Vice President at J.P. Morgan
Location:
Tampa/St. Petersburg, Florida Area
Industry:
Information Technology and Services
Work:
J.P. Morgan since Sep 2012
Vice President
CSC - Overland Park, KS Oct 2011 - Sep 2012
Product Manager
CSC - Overland Park, KS Jul 2011 - Sep 2011
Software Engineer Leader
CSC Oct 2008 - Jun 2011
Application Developer Senior Professional
Sprint Jul 2004 - Oct 2008
Systems Analyst II
Sprint Feb 2003 - Jun 2004
Business Systems Analyst
Sprint Jul 2001 - Jan 2003
Access Analyst
MIL-SPEC Security Group LLC Jun 1995 - Jun 2001
Co-Owner
US Army Oct 1989 - Feb 1994
Sergeant - 1/75th Ranger Regiment
Education:
Keller Graduate School of Management 2004 - 2007
MBA, MBA
Devry University 2001 - 2004
BS, Computer Information Systems
Skills:
VB.NET, Crystal Reports, ASP.NET, AJAX, C#, PHP, Product Management, .NET, Requirements Analysis, Program Management, Agile Methodologies, Oracle PL/SQL Development, Microsoft SQL Server, System Design

Publications & IP owners

Us Patents

Network Capacity Forecasting And Maintenance

US Patent:
8009575, Aug 30, 2011
Filed:
Oct 12, 2006
Appl. No.:
11/548965
Inventors:
Derek Michael Spain - Olathe KS, US
Shun Calvin Lai - Overland Park KS, US
David Jason Gregory Butler - Kansas City MO, US
Randall Lee Rezac - Baldwin City KS, US
Paul Aaron Woelk - Overland Park KS, US
Assignee:
Sprint Communications Company L.P. - Overland Park KS
International Classification:
G01R 31/08
US Classification:
370252, 709224
Abstract:
Media, systems, and methods for ensuring adequate data-processing capacity in a communications network are provided. An embodiment of the method includes identifying a communications resource to evaluate, determine a maximum capacity that the resource is capable of handling, projecting a capacity-exhaustion timeline, wherein the timeline includes time estimations that are adjusted by an adjusting factor that is based at least in part on an accuracy of prior projection estimates. Determining a more accurate capacity exhaustion timeline allows for more accurate comparison against a time required to add such capacity. Recommends to effect capacity additions can be provided.

Selection And Optimization Of Potential Hub Candidates Within A Network

US Patent:
7693087, Apr 6, 2010
Filed:
Feb 14, 2007
Appl. No.:
11/674848
Inventors:
Marianne Carr - Overland Park KS, US
Sarah E. Price - Merriam KS, US
Derek M. Spain - Olathe KS, US
Mary Ann Strecker - Grandview MO, US
Shun Calvin Lai - Overland Park KS, US
Assignee:
Sprint Communications Company L.P. - Overland Park KS
International Classification:
H04L 12/26
US Classification:
370252, 370229, 370230, 370235
Abstract:
A method, system, and medium are provided for selecting one or more hub aggregation points from a number of candidates on a network. The method begins by obtaining selection criteria for each of the candidates. Using the obtained criteria a score for each candidate is determined. This determination involves assigning intermediate scores for each criteria and applying a weighted multiplier to the intermediate score. The total of the intermediate scores is the overall score for any candidate. The method continues by selecting potential hub aggregation points for further consideration based upon the determined score of each candidate. The method then calculates a least cost route for each point on the network under consideration to each of the selected hub aggregation points. Different combinations of selected hub aggregation points can then be used to iterate through the least cost routing analysis to arrive at a final selection of hub aggregation points.

NOTICE: You may not use BackgroundCheck or the information it provides to make decisions about employment, credit, housing or any other purpose that would require Fair Credit Reporting Act (FCRA) compliance. BackgroundCheck is not a Consumer Reporting Agency (CRA) as defined by the FCRA and does not provide consumer reports.