John W Harper

US Patent:

7024401, Apr 4, 2006

Filed:

Jul 2, 2001

Appl. No.:

09/897853

Inventors:

John William Harper - San Jose CA, US
Gordon Robert Slishman - Morgan Hill CA, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/30

US Classification:

707 2, 707 4, 707 7, 707100

Abstract:

A system and method utilizing random sampling for partition analysis on very large databases. The method utilizes a random sampling algorithm that provides results accurate to within a few percentage points for large homogeneous databases. The accuracy is not affected by the size of the database and is determined primarily by the size of the sample. The system and method for approximate partition analysis reduces the time required for an analysis to a fraction of the time required for an exact analysis. The reduction in time thereby permits more frequent and timely analyses of database partition sizes.

US Patent:

7028054, Apr 11, 2006

Filed:

Jul 2, 2001

Appl. No.:

09/897803

Inventors:

John William Harper - San Jose CA, US
Gordon Robert Slishman - Morgan Hill CA, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/30

US Classification:

707200, 707205, 711100, 711173

Abstract:

A database management system and method for administration and replication having a built-in random sampling facility for approximation partition analysis on very large databases. The method utilizes a random sampling algorithm that provides results accurate to within a few percentage points for large homogeneous databases. The accuracy is not affected by the size of the database and is determined primarily by the size of the sample. The system and method for approximate partition analysis reduces the time required for an analysis to a fraction of the time required for an exact analysis. The database management system is configured with the random sampling facility built-in thereby enabling even greater efficiency by reducing communication overhead between an analysis program and the database management system to a fraction of the overhead required when sampling is performed by a separate analysis program. The reduction in time thereby permits frequent and timely analyses for replication and administration of database partitions.

US Patent:

7397964, Jul 8, 2008

Filed:

Jun 24, 2004

Appl. No.:

10/876039

Inventors:

Ralph Brunner - Cupertino CA, US
Kok Chen - Sunnyvale CA, US
John Harper - San Francisco CA, US

Assignee:

Apple Inc. - Cupertino CA

International Classification:

G06K 9/40

US Classification:

382264, 382265, 348597

Abstract:

A Gaussian blur approximation is applied to an image by repeated down-sampling operations followed by an up-sample operation. By using a truncated Gaussian filter as the down-sample filter, the frequency spectrum removed during down-sampling operations closely approximates the frequency spectrum lost during a true Gaussian blur operation. While any “good” up-sample filter may be used, up-sampling via linear interpolation may be especially beneficial in systems having a dedicated graphics processing unit. One benefit of the described technique is that it is computationally less costly to implement than a Gaussian blur. Another benefit is that this computational benefit increases as the size of the blur increases—becoming significant even for small blurs. Yet another benefit of the invention is that a judicious selection of pixel address to convolve with the filter leads to substantially reduced number of texture lookups required to effect a convolution.

US Patent:

7506194, Mar 17, 2009

Filed:

Mar 24, 2004

Appl. No.:

10/808040

Inventors:

Chandrashekhar Appanna - Cupertino CA, US
Ruchi Kapoor - Santa Clara CA, US
Barry Friedman - Sunnyvale CA, US
Himanshu Shah - Milpitas CA, US
Gargi Nalawade - Santa Clara CA, US
Shyam Suri - Fremont CA, US
John Harper - Mountain View CA, US

Assignee:

Cisco Technology, Inc. - San Jose CA

International Classification:

G06F 11/00

US Classification:

714 3, 714 23

Abstract:

Methods and apparatus for efficiently enabling routing states to be recovered after a failover or during a software upgrade in a system which supports graceful restart and stateful switchover are disclosed. According to one aspect of the present invention, a method for restarting a network device which has a plurality of routers and is in communication with a first peer being arranged to support graceful restart and a second peer includes performing a graceful restart with respect to the first peer. A peer transparent failover is performed with respect to the second peer. The graceful restart and the peer transparent failover are performed in response to a failure associated with the network device.

US Patent:

7652678, Jan 26, 2010

Filed:

Oct 1, 2004

Appl. No.:

10/957557

Inventors:

Ralph Brunner - Cupertino CA, US
John Harper - San Francisco CA, US

Assignee:

Apple Inc. - Cupertino CA

International Classification:

G09G 5/377

US Classification:

345629

Abstract:

Techniques to generate partial display updates in a buffered window system in which arbitrary visual effects are permitted to any one or more windows (e. g. , application-specific window buffers) are described. Once a display output region is identified for updating, the buffered window system is interrogated to determine which regions within each window, if any, may effect the identified output region. Such determination considers the consequences any filters associated with a window impose on the region needed to make the output update.

US Patent:

7707307, Apr 27, 2010

Filed:

Jan 9, 2003

Appl. No.:

10/340371

Inventors:

Kevin George Miles - Reading, GB
Ian Michael Charles Shand - Cobham, GB
Stewart Frederick Bryant - Redhill, GB
Stefano Benedetto Previdi - Wavre, BE
John Anthony Harper - Mountain View CA, US
Clarence Filsfils - Brussels, BE

Assignee:

Cisco Technology, Inc. - San Jose CA

International Classification:

G06F 15/173
G01R 31/08

US Classification:

709239, 709242, 709238, 709241, 370238, 370229, 370232, 370235

Abstract:

A method is disclosed for constructing a backup route from a source node around an adjacent component. The source node derives a first set of nodes reachable from it without traversing the adjacent component and a second set of nodes from which a neighbor node of adjacent components is reachable without traversing the adjacent component. The source node then constructs a backup route via an intermediate node in the intersection of the first and second sets.

US Patent:

7872652, Jan 18, 2011

Filed:

Jan 7, 2007

Appl. No.:

11/620709

Inventors:

Andrew Platzer - Santa Clara CA, US
John Harper - San Francisco CA, US

Assignee:

Apple Inc. - Cupertino CA

International Classification:

G06T 15/00

US Classification:

345473, 345522, 715746

Abstract:

The application programming interface operates in an environment with user interface software interacting with multiple software applications or processes in order to synchronize animations associated with multiple views or windows of a display of a device. The method for synchronizing the animations includes setting attributes of views independently with each view being associated with a process. The method further includes transferring a synchronization call to synchronize animations for the multiple views of the display. In one embodiment the synchronization call includes the identification and the number of processes that are requesting animation. The method further includes transferring a synchronization confirmation message when a synchronization flag is enabled. The method further includes updating the attributes of the views from a first state to a second state independently. The method further includes transferring a start animation call to draw the requested animations when both processes have updated attributes.

US Patent:

7885179, Feb 8, 2011

Filed:

Mar 29, 2006

Appl. No.:

11/393166

Inventors:

Stewart Frederick Bryant - Green Park Reading, GB
Ian Michael Charles Shand - Cobham, GB
John Harper - Mountain View CA, US

Assignee:

Cisco Technology, Inc. - San Jose CA

International Classification:

G01R 31/08
G06F 11/00
H04L 12/28
H04L 12/56

US Classification:

370216, 370217, 370389, 370392

Abstract:

A method of constructing a repair path around a non-available component in a data communications network is described. The data communications network has, as components, nodes and links therebetween defining a network topology. The non-available component is a member of a shared risk group of components commonly renderable non-available. The method comprises the step, performed at a repairing node, of identifying as a repair target a neighbour component of the non-available component. The method further comprises the step of constructing a repair network topology omitting the shared risk group. The method further comprises the step of constructing a repair path to the repair target in the repair topology.