The Judge Group - New England Feb 2008 - Jun 2013
Vice President - New England / IT and Engineering
Judge Technical Services Jun 1999 - Dec 2007
Sr. Technical Recruiter
Education:
Wentworth Institute of Technology 1988 - 1992
Cranston High School West 1980 - 1984
Skills:
Recruiting Information Technology Consulting Finance Professional Services Account Management Sales Management Social Networking
Clinical Assistant Professor at University of Virginia
Location:
Charlottesville, Virginia
Industry:
Medical Practice
Work:
University of Virginia - Charlottesville, Virginia Area since Jul 2013
Clinical Assistant Professor
New York University 2011 - 2013
Rheumatology Fellow
United Medical Center 2010 - 2011
Hospitalist
Howard University Hospital 2007 - 2010
Physician
National Institutes of Health - Bethesda 2006 - 2007
Intramural Research Trainee
Education:
Howard University 2001 - 2006
Doctor of Medicine (MD), Medicine
Columbia University in the City of New York 1996 - 2000
BA, Art History
Dr. Potter graduated from the Thomas Jefferson University, Jefferson Medical College in 1979. He works in Hattiesburg, MS and specializes in Family Medicine. Dr. Potter is affiliated with Forrest General Hospital.
Dr. Potter graduated from the Howard University College of Medicine in 2006. He works in Olney, MD and 1 other location and specializes in Rheumatology.
Medical School Tulane University School of Medicine Graduated: 1998
Languages:
English
Description:
Dr. Potter graduated from the Tulane University School of Medicine in 1998. He works in Washington, NC and 2 other locations and specializes in Diagnostic Radiology and Neuroradiology. Dr. Potter is affiliated with Vidant Beaufort Hospital, Vidant Duplin Hospital, Vidant Edgecombe Hospital, Vidant Medical Center and Vidant Roanoke Chowan Hospital.
Ralph Clayton Taylor - Deland FL Daniel B. Clifton - Rockledge FL David Gotwalt - Los Gatos CA Michael A. Mang - Oviedo FL Thomas A. Piazza - Granite Bay CA Jeffrey D. Potter - Winter Springs FL
Assignee:
Intel Corporation - Santa Clara CA
International Classification:
G09G 536
US Classification:
345611, 345606, 345441
Abstract:
A method and system for rendering a feature, such as a line, for display on an array of pixels. With this method, the line is identified on the pixel array, the line is expanded into a polygon, and color values are determined for the pixels within the polygon. Also, an antialiasing region is identified in the polygon, and blend values are computed for the pixels in this antialiasing region. Then, the color values determined for the pixels in the antialiasing region are modified as a function of these computed blend values. The pixels in the antialiasing region may then be shown at their modified color values, while the pixels that are in the polygon but not in the antialising region may be shown at their original determined color value. Preferably, the blend values for the pixels in the antialiasing region are calculated as a function of the locations of the pixels in that region. For example, the blend value for each of these pixels may be calculated as a function of four values, each one representing the Manhattan distance from the pixel to a respective one of the edges of the polygon.
Michael Mantor - Orlando FL, US John Austin Carey - Winter Springs FL, US Ralph Clayton Taylor - Deland FL, US Thomas A. Piazza - Granite Bay CA, US Jeffrey D. Potter - Winter Springs FL, US Angel E. Socarras - Lake Mary FL, US
A 3D rendering texture caching scheme that minimizes external bandwidth requirements for texture and increases the rate at which textured pixels are available. The texture caching scheme efficiently pre-fetches data at the main memory access granularity and stores it in cache memory. The data in the main memory and texture cache memory is organized in a manner to achieve large reuse of texels with a minimum of cache memory to minimize cache misses. The texture main memory stores a two dimensional array of texels, each texel having an address and one of N identifiers. The texture cache memory has addresses partitioned into N banks, each bank containing texels transferred from the main memory that have the corresponding identifier. A cache controller determines which texels need to be transferred from the texture main memory to the texture cache memory and which texels are currently in the cache using a least most recently used algorithm. By labeling the texture map blocks (double quad words), a partitioning scheme is developed which allow the cache controller structure to be very modular and easily realized.
Michael Mantor - Orlando FL, US John Carey - Winter Springs FL, US Ralph Taylor - Deland FL, US Thomas Piazza - Granite Bay CA, US Jeffrey Potter - Winter Springs FL, US Angel Socarras - Lake Mary FL, US
International Classification:
G09G 5/00
US Classification:
345582000
Abstract:
A 3D rendering texture caching scheme that minimizes external bandwidth requirements for texture and increases the rate at which textured pixels are available. The texture caching scheme efficiently pre-fetches data at the main memory access granularity and stores it in cache memory. The data in the main memory and texture cache memory is organized in a manner to achieve large reuse of texels with a minimum of cache memory to minimize cache misses. The texture main memory stores a two dimensional array of texels, each texel having an address and one of N identifiers. The texture cache memory has addresses partitioned into N banks, each bank containing texels transferred from the main memory that have the corresponding identifier. A cache controller determines which texels need to be transferred from the texture main memory to the texture cache memory and which texels are currently in the cache using a least most recently used algorithm. By labeling the texture map blocks (double quad words), a partitioning scheme is developed which allow the cache controller structure to be very modular and easily realized. The texture cache arbiter is used for scheduling and controlling the actual transfer of texels from the texture main memory into the texture cache memory and controlling the outputting of texels for each pixel to an interpolating filter from the cache memory.
Method For Resolving Priority Between A Calligraphically-Displayed Point Feature And Both Raster-Displayed Faces And Other Calligraphically-Displayed Point Features In A Cig System
Gregory C. Buchner - South Daytona FL Jeffrey D. Potter - Port Orange FL Walter R. Steiner - Ormond Beach FL
International Classification:
G06F 1562
US Classification:
395122
Abstract:
A method for determining the proper occulation relationship between a calligraphic point and at least one of another calligraphic point and a surface in a raster image, divides the total image screen into an array of spans, each containing an ordered set of pixels which may be further divided into an array of subpixels; determines which of the subpixels on the total screen lie inside each of the raster surfaces and calligraphic points which must be considered for the image totality; then orders the distance of each of the raster surfaces from the viewing point and also orders the distance of each of the point features from the viewing point; and then compares the ordered distances of each point to at least one of the raster surface distances and other point distances to determine which of subpixels of the point or surface/other point are occluded and which subpixels are visible.
Method And Apparatus To Efficiently Interpolate Polygon Attributes In Two Dimensions At A Prescribed Clock Rate
Thomas A. Piazza - Granite Bay CA R. Scott Hartog - Orlando FL Michael Mantor - Orlando FL Jeffrey D. Potter - Winter Springs FL Ralph Clayton Taylor - Deland FL Michael A. Mang - Oviedo FL
Assignee:
Real 3D, Inc. - Orlando FL
International Classification:
G06T 100 G06F 1500
US Classification:
345501
Abstract:
A rasterizer comprised of a bounding box calculator, a plane converter, a windower, and incrementers. For each polygon to be processed, a bounding box calculation is performed which determines the display screen area, in spans, that totally encloses the polygon and passes the data to the plane converter. The plane converter also receives as input attribute values for each vertex of the polygon. The plane converter computes planar coefficients for each attribute of the polygon, for each of the edges of the polygon. The plane converter unit computes the start pixel center location at a start span and a starting coefficient value at that pixel center. The computed coefficients also include the rate of change or gradient, for each polygon attribute in the x and y directions, respectively. The plane converter also computes line coefficients for each of the edges of the polygon. Line equation values are passed through to the windower where further calculations allow the windower to determine which spans are either covered or intersected by the polygon.
Robert F. Stone - New Smyrna FL Jeffrey D. Potter - Port Orange FL William S. Beamon - Ormond Beach FL
Assignee:
General Electric Company - Syracuse NY
International Classification:
G06F 1568
US Classification:
364518
Abstract:
In computer image generation (CIG) systems, image data for defining pixel modulation values and for supporting a display having a predetermined resolution are determined for defining a scene. For some applications, such as for representing background and/or peripheral areas, it may be acceptable to use data having a lower resolution than the predetermined resolution. Method and apparatus for taking a portion of the image data obtain derived data by a predetermined combination of the portion of image data. Lines of composed data supplied to a display device include a sequence of pixel modulation values selected from the portion of image data and the derived data. In one embodiment the number of lines supported by the image data is doubled with each line containing 50% image data and 50% derived data. Pixel modulation values may be oversampled between adjacent lines of the display for obtaining derived data. Respective composed data for a plurality of display devices may be obtained from a respective plurality of portions of the image data, thus obviating the need to provide additional video processing channels along with associated hardware.
Youtube
I Knew You Were Muggle (Taylor Swift Parody) ...
This might be the spiciest song Jeffrey has ever sang about Harry Pott...
Duration:
4m 48s
Cooking for Geeks | Jeff Potter | Talks at Go...
Jeff Potter comes to the Google Cambridge office to talk about his boo...
Duration:
56m 52s
Heathers meet Jeffrey Bezos! K3 Sisters #shor...
Born in 1964 Jeffrey Jeffrey Bezos come on Jeffrey you can do it break...
Duration:
16s
Jeffrey Potter Hitting 2023 Boston '21
Prospect Select - Boston Select 2021 filmed by SkillShow. New England ...
Duration:
1m 19s
Nancy J Davis Art winner Jeffrey Potter Memor...
- The 14th National Juried Members Exhibition juried show winner Nancy...
ToledoPresident at Potter Development Past: President at Technology Concepts Products I have been involved in processing machinery and product development for 20 years. I have been the lead facilitator in over 50 US Patents and have developed a... I have been involved in processing machinery and product development for 20 years. I have been the lead facilitator in over 50 US Patents and have developed a proprietary product development system