Frederick A Shepard75 Park Ter E 51, New York, NY 10034

Frederick Shepard Phones & Addresses

75 Park Ter E 51, New York, NY 10034 (212) 569-0988

New Hyde Park, NY

Mentions for Frederick A Shepard

Frederick Shepard resumes & CV records

Resumes

Frederick Shepard Photo 19

Portfolio Manager

Location:
4904 Metz Ln, Norwell, MA
Industry:
Financial Services
Work:
Philadelphia Financial
Portfolio Manager
Capital Returns Management
Analyst
Dowling & Partners Jun 2014 - Apr 2017
Equity Research Associate
Wareham Gatemen Jul 2012 - Aug 2013
Starting Pitcher
Education:
Amherst College 2010 - 2014
Bachelors, Bachelor of Arts, Economics, German
Phillips Academy
Amherst Regional High School
Skills:
Powerpoint, Public Speaking, Social Media, Marketing, Facebook, Microsoft Office, Customer Service, Community Outreach, Word, Event Planning, Photoshop, Fundraising, Windows, Social Media Marketing, Blogging, Excel, Event Management, Public Relations, Microsoft Excel
Interests:
Ecommerce
Technology
Baseball
Art
Equity Markets
Languages:
English
German
Spanish
Frederick Shepard Photo 20

Frederick Shepard

Publications & IP owners

Us Patents

Methods And Apparatus For Designing Traffic Distribution On A Multiple-Service Packetized Network Using Multicommodity Flows And Well-Linked Terminals

US Patent:
2007012, May 31, 2007
Filed:
Nov 28, 2005
Appl. No.:
11/287890
Inventors:
Chandra Chekuri - Chatham NJ, US
Sanjeev Khanna - Philadelphia PA, US
Frederick Shepard - Summit NJ, US
International Classification:
H04J 1/16
H04L 12/56
US Classification:
370235000, 370400000
Abstract:
Methods and apparatus are provided for designing traffic distribution in a multiple-service packetized network using such multicommodity flows and well-linked terminals. Arbitrary multicommodity flows are transformed to sets of well-linked terminals. The multicommodity flows are represented in a graph G having a set of k node-pairs st, . . . ,st, each having a positive integer demand dand a positive weight w. The graph G is partitioned into a collection of node-disjoint subgraphs wherein each sub-graph H contains a set of terminals, where {right arrow over (π)} is a non-negative weight function on a set X of nodes in the graph G; and then the set of terminals are clustered to a subset of terminals that is at least -flow-linked or -cut-linked.

NOTICE: You may not use PeopleBackgroundCheck 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. PeopleBackgroundCheck is not a Consumer Reporting Agency (CRA) as defined by the FCRA and does not provide consumer reports.