Steven L Eddins

US Patent:

8538185, Sep 17, 2013

Filed:

Mar 2, 2012

Appl. No.:

13/411164

Inventors:

Steven L. Eddins - Milford MA, US

Assignee:

The MathWorks, Inc. - Natick MA

International Classification:

G06K 9/40

US Classification:

382254

Abstract:

A computer-implemented method for optimizing bounds checking in a structured lattice having a regular pattern of neighboring nodes, includes the steps of: visiting a node in the lattice in a determined order, including bounds checking the node and performing a neighborhood process on the node; when said node is an interior node, calculating a distance k to a specified node in the determined order; visiting the next k nodes in the determined order without performing bounds checking and performing a neighborhood process on each of the next k nodes; and at least one of displaying or storing a result of the neighborhood process for the node.

US Patent:

8650542, Feb 11, 2014

Filed:

Mar 25, 2011

Appl. No.:

13/072165

Inventors:

Steven L. Eddins - Milford MA, US

Assignee:

The Mathworks, Inc. - Natick MA

International Classification:

G06F 9/44

US Classification:

717123, 717106, 717120

Abstract:

A self-describing function object may be dynamically created based on a set of user provided parameters. In an implementation, a device may receive a request to create the function object based on one or more parameters and determine a number of ordered and hierarchical operations that correspond to the function object. The device may determine textual descriptions corresponding to what is performed by at least one of the ordered and hierarchical operations. The device may output documentation of the ordered and hierarchical operations included in the function object, the documentation including the textual descriptions arranged based on the determined order of the plurality of ordered and hierarchical operations.

US Patent:

8165413, Apr 24, 2012

Filed:

Dec 20, 2006

Appl. No.:

11/641853

Inventors:

Steven L. Eddins - Milford MA, US

Assignee:

The MathWorks, Inc. - Natick MA

International Classification:

G06K 9/40

US Classification:

382254

Abstract:

A computer-implemented method for optimizing bounds checking in a structured lattice having a regular pattern of neighboring nodes, includes the steps of: visiting a node in the lattice in a determined order, including bounds checking the node and performing a neighborhood process on the node; when said node is an interior node, calculating a distance k to a specified node in the determined order; visiting the next k nodes in the determined order without performing bounds checking and performing a neighborhood process on each of the next k nodes; and at least one of displaying or storing a result of the neighborhood process for the node.