Patents by Inventor Richard J. Anderson
Richard J. Anderson has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20240131267Abstract: An injection apparatus, including: a needle configured to be inserted into a tissue; a light source to deliver light to the tissue to generate reflected light; a detector to detect the reflected light from the tissue; a processor coupled to the detector and configured to: analyze the reflected light from the tissue to identify a tissue type associated with the reflected light, and provide an output to a user based on the identified tissue type.Type: ApplicationFiled: February 25, 2022Publication date: April 25, 2024Inventors: Molly Wanner, William Farinelli, Richard Rox Anderson, Joseph A. Gardecki, Matthew J. Beatty, Guillermo J. Tearney
-
Publication number: 20240109492Abstract: A rearview mirror assembly that includes a housing and a printed circuit board (PCB) located in the housing. The rearview mirror assembly further includes a monitoring system that includes an image capturing module, an illumination source connected to the PCB, and an optical element aligned with the illumination source. The optical element is configured to redirect an illumination from the illumination source toward an occupant position in an automobile.Type: ApplicationFiled: October 2, 2023Publication date: April 4, 2024Applicant: GENTEX CORPORATIONInventors: Kasen Keith Anderson, Steven J. Veenman, Brett C. Pothoof, Richard T. Fish, JR., Joshua D. Lintz
-
Publication number: 20240100899Abstract: A method of on-demand energy delivery to an active suspension system is disclosed. The suspension system includes an actuator body, a hydraulic pump, an electric motor, a plurality of sensors, an energy storage facility, and a controller. The method includes disposing an active suspension system in a vehicle between a wheel mount and a vehicle body, detecting a wheel event requiring control of the active suspension; and sourcing energy from the energy storage facility and delivering it to the electric motor in response to the wheel event.Type: ApplicationFiled: June 28, 2023Publication date: March 28, 2024Applicant: ClearMotion, Inc.Inventors: Zackary Martin Anderson, Marco Giovanardi, Clive Tucker, Jonathan R. Leehey, Colin Patrick O'Shea, Johannes Schneider, Vladimir Gorelik, Richard Anthony Zuckerman, Patrick W. Neil, Tyson David Sawyer, Ross J. Wendell
-
Patent number: 9910878Abstract: Techniques and systems for processing within-distance queries are provided. A query for geometry objects within a query distance of a query geometry is received. An in-memory R-tree (IMR-tree) is generated for the query geometry. The IMR-tree includes nodes corresponding to edges of the query geometry. An R-tree index for a plurality of candidate geometries is accessed. At least one node of the R-tree index is processed by: generating an expanded bounding geometry based on the query distance, and using the IMR-tree to determine a topological relationship between the expanded bounding geometry and the query geometry. When the expanded bounding geometry intersects the query geometry, if at least one within-distance test is satisfied, the candidate geometries associated with the selected node are added to a result set. Otherwise, if the selected node is a non-leaf node of the R-tree index, child nodes of the selected node are processed.Type: GrantFiled: August 5, 2014Date of Patent: March 6, 2018Assignee: Oracle International CorporationInventors: Ying Hu, Siva Ravada, Daniel Geringer, Richard J. Anderson
-
Patent number: 9620596Abstract: A method including forming a diamond material on the surface of a substrate; forming a first contact and a separate second contact; and patterning the diamond material to form a nanowire between the first contact and the second contact. An apparatus including a first contact and a separate second contact on a substrate; and a nanowire including a single crystalline or polycrystalline diamond material on the substrate and connected to each of the first contact and the second contact.Type: GrantFiled: September 18, 2014Date of Patent: April 11, 2017Assignee: Sandia CorporationInventors: Alfredo M. Morales, Richard J. Anderson, Nancy Y. C. Yang, Jack L. Skinner, Michael J. Rye
-
Patent number: 9519680Abstract: An optimized method of processing queries requesting a description of a spatial relationship between a test geometry and a query geometry, such as points, lines, polygons, and collections thereof, is disclosed. A first part of the method finds a first spatial relationship between a minimum bounding rectangle (MBR) of the test geometry and an In-Memory R-tree (IMR-tree) built to describe the query geometry. If the first relationship does not specify the requested description, then a second part of the method uses the IMR-tree of the query geometry to find a second spatial relationship between the test geometry itself and the query geometry. Optimizations are applied to the first part and to the second part. Optimizations in the second part depend on the test geometry.Type: GrantFiled: June 29, 2015Date of Patent: December 13, 2016Assignee: Oracle International CorporationInventors: Ying Hu, Siva Ravada, Richard J. Anderson, Bhuvan Bamba
-
Patent number: 9507880Abstract: Systems, methods, and other embodiments associated with processing regular expressions are described. One example method includes analyzing a rule for a regular expression and deleting the regular expression.Type: GrantFiled: August 17, 2010Date of Patent: November 29, 2016Assignee: ORACLE INTERNATIONAL CORPORATIONInventors: Parthiban Thilagar, Richard J. Anderson, Jr., William A. Wright, Joseph E. Errede, Patrick H. Fry, Raymond L. Pfau, Michael J. Skarpelos
-
Patent number: 9495466Abstract: A method and apparatus for querying a database table containing point spatial data and without indexes is provided. A request for point spatial data in the table includes a query window provided by the user and describing an area of interest in which the user desires the point spatial data contained therein. The query window is tiled to create interior tiles and boundary tiles. A first query is formed to determine the point spatial data contained in the interior tiles. A second query is formed to determine the point spatial data contained within the boundary tiles and also within the query window. The second query includes a function that tests to determine whether the point spatial data within a boundary tile also lies within the query window. The first and second queries are executed in part on an enhanced data storage device and the results joined and returned to the user in answer to the request.Type: GrantFiled: November 27, 2013Date of Patent: November 15, 2016Assignee: ORACLE INTERNATIONAL CORPORATIONInventors: Daniel Geringer, Siva Ravada, Richard J. Anderson, Ying Hu
-
Patent number: 9317529Abstract: Techniques are described for memory-efficient spatial histogram construction. A hierarchical spatial index has leaf nodes and non-leaf nodes, each leaf node representing a bounding region containing a spatial object, each non-leaf node representing a bounding region at least partially containing one or more spatial objects. A plurality of selected nodes is selected from the plurality of non-leaf nodes. The plurality of selected nodes includes an ancestor of each leaf node. For each particular node in the plurality of selected nodes, a weight is determined. The weight is based on the number of spatial objects contained within the bounding region of the particular node. A spatial partitioning of the plurality of selected nodes is determined. A spatial histogram is generated based on the spatial partitioning of the weights of the plurality of selected nodes.Type: GrantFiled: August 14, 2013Date of Patent: April 19, 2016Assignee: Oracle International CorporationInventors: Bhuvan Bamba, Siva Ravada, Ying Hu, Richard J. Anderson
-
Publication number: 20160019248Abstract: Techniques and systems for processing within-distance queries are provided. A query for geometry objects within a query distance of a query geometry is received. An in-memory R-tree (IMR-tree) is generated for the query geometry. The IMR-tree includes nodes corresponding to edges of the query geometry. An R-tree index for a plurality of candidate geometries is accessed. At least one node of the R-tree index is processed by: generating an expanded bounding geometry based on the query distance, and using the IMR-tree to determine a topological relationship between the expanded bounding geometry and the query geometry. When the expanded bounding geometry intersects the query geometry, if at least one within-distance test is satisfied, the candidate geometries associated with the selected node are added to a result set. Otherwise, if the selected node is a non-leaf node of the R-tree index, child nodes of the selected node are processed.Type: ApplicationFiled: August 5, 2014Publication date: January 21, 2016Inventors: Ying Hu, Siva Ravada, Daniel Geringer, Richard J. Anderson
-
Publication number: 20150317358Abstract: An optimized method of processing queries requesting a description of a spatial relationship between a test geometry and a query geometry, such as points, lines, polygons, and collections thereof, is disclosed. A first part of the method finds a first spatial relationship between a minimum bounding rectangle (MBR) of the test geometry and an In-Memory R-tree (IMR-tree) built to describe the query geometry. If the first relationship does not specify the requested description, then a second part of the method uses the IMR-tree of the query geometry to find a second spatial relationship between the test geometry itself and the query geometry. Optimizations are applied to the first part and to the second part. Optimizations in the second part depend on the test geometry.Type: ApplicationFiled: June 29, 2015Publication date: November 5, 2015Inventors: Ying Hu, Siva Ravada, Richard J. Anderson, Bhuvan Bamba
-
Patent number: 9154572Abstract: Systems, methodologies, media, and other embodiments associated with processing network communications are described. One embodiment of a method includes processing data requests including changing an input/output (I/O) communications type for processing the data requests.Type: GrantFiled: June 22, 2010Date of Patent: October 6, 2015Assignee: ORACLE INTERNATIONAL CORPORATIONInventors: Parthiban Thilagar, Richard J. Anderson, Jr., William A. Wright, Joseph E. Errede, Patrick H. Fry, Raymond L. Pfau, Fang Chen, Shu Ling
-
Patent number: 9104770Abstract: An optimized method of processing queries requesting a description of a spatial relationship between a test geometry and a query geometry, such as points, lines, polygons, and collections thereof, is disclosed. A first part of the method finds a first spatial relationship between a minimum bounding rectangle (MBR) of the test geometry and an In-Memory R-tree (IMR-tree) built to describe the query geometry. If the first relationship does not specify the requested description, then a second part of the method uses the IMR-tree of the query geometry to find a second spatial relationship between the test geometry itself and the query geometry. Optimizations are applied to the first part and to the second part. Optimizations in the second part depend on the test geometry.Type: GrantFiled: February 28, 2013Date of Patent: August 11, 2015Assignee: ORACLE INTERNATIONAL CORPORATIONInventors: Ying Hu, Siva Ravada, Richard J. Anderson, Bhuvan Bamba
-
Publication number: 20150149479Abstract: A method and apparatus for querying a database table containing point spatial data and without indexes is provided. A request for point spatial data in the table includes a query window provided by the user and describing an area of interest in which the user desires the point spatial data contained therein. The query window is tiled to create interior tiles and boundary tiles. A first query is formed to determine the point spatial data contained in the interior tiles. A second query is formed to determine the point spatial data contained within the boundary tiles and also within the query window. The second query includes a function that tests to determine whether the point spatial data within a boundary tile also lies within the query window. The first and second queries are executed in part on an enhanced data storage device and the results joined and returned to the user in answer to the request.Type: ApplicationFiled: November 27, 2013Publication date: May 28, 2015Applicant: Oracle International CorporationInventors: Daniel Geringer, Siva Ravada, Richard J. Anderson, Ying Hu
-
Publication number: 20150049944Abstract: Techniques are described for memory-efficient spatial histogram construction. A hierarchical spatial index has leaf nodes and non-leaf nodes, each leaf node representing a bounding region containing a spatial object, each non-leaf node representing a bounding region at least partially containing one or more spatial objects. A plurality of selected nodes is selected from the plurality of non-leaf nodes. The plurality of selected nodes includes an ancestor of each leaf node. For each particular node in the plurality of selected nodes, a weight is determined. The weight is based on the number of spatial objects contained within the bounding region of the particular node. A spatial partitioning of the plurality of selected nodes is determined. A spatial histogram is generated based on the spatial partitioning of the weights of the plurality of selected nodes.Type: ApplicationFiled: August 14, 2013Publication date: February 19, 2015Applicant: Oracle International CorporationInventors: Bhuvan Bamba, Siva Ravada, Ying Hu, Richard J. Anderson
-
Publication number: 20150041810Abstract: A method including forming a diamond material on the surface of a substrate; forming a first contact and a separate second contact; and patterning the diamond material to form a nanowire between the first contact and the second contact. An apparatus including a first contact and a separate second contact on a substrate; and a nanowire including a single crystalline or polycrystalline diamond material on the substrate and connected to each of the first contact and the second contact.Type: ApplicationFiled: September 18, 2014Publication date: February 12, 2015Inventors: Alfredo M. Morales, Richard J. Anderson, Nancy Y.C. Yang, Jack L. Skinner, Michael J. Rye
-
Patent number: 8852998Abstract: A method including forming a diamond material on the surface of a substrate; forming a first contact and a separate second contact; and patterning the diamond material to form a nanowire between the first contact and the second contact. An apparatus including a first contact and a separate second contact on a substrate; and a nanowire including a single crystalline or polycrystalline diamond material on the substrate and connected to each of the first contact and the second contact.Type: GrantFiled: August 29, 2012Date of Patent: October 7, 2014Assignee: Sandia CorporationInventors: Alfredo M. Morales, Richard J. Anderson, Nancy Y. C. Yang, Jack L. Skinner, Michael J. Rye
-
Publication number: 20140244635Abstract: An optimized method of processing queries requesting a description of a spatial relationship between a test geometry and a query geometry, such as points, lines, polygons, and collections thereof, is disclosed. A first part of the method finds a first spatial relationship between a minimum bounding rectangle (MBR) of the test geometry and an In-Memory R-tree (IMR-tree) built to describe the query geometry. If the first relationship does not specify the requested description, then a second part of the method uses the IMR-tree of the query geometry to find a second spatial relationship between the test geometry itself and the query geometry. Optimizations are applied to the first part and to the second part. Optimizations in the second part depend on the test geometry.Type: ApplicationFiled: February 28, 2013Publication date: August 28, 2014Applicant: ORACLE INTERNATIONAL CORPORATIONInventors: Ying Hu, Siva Ravada, Richard J. Anderson, Bhuvan Bamba
-
Patent number: 8812488Abstract: Techniques are described for generating histograms for a multidimensional space. In the presence of large spatial objects, fuzzy splitting techniques are utilized to recursively divide the multidimensional space into partitions, where a single spatial object may belong to multiple partitions. Large spatial objects are essentially broken down into smaller objects that may allow for more efficient partitioning of the multidimensional space. A count of spatial objects in each partition yields a spatial histogram. A spatial object that belongs to multiple partitions may have a weighted count for each of the multiple partitions, based on the extent to which the spatial object overlaps with each partition. Thus, an object that is split among a handful of partitions will only contribute a fraction of a count to each partition. Small partitions having relatively few objects are avoided by refusing to subdivide a partition whose members drop below a threshold number.Type: GrantFiled: August 16, 2012Date of Patent: August 19, 2014Assignee: Oracle International CorporationInventors: Bhuvan Bamba, Richard J. Anderson, Ying Hu, Siva Ravada
-
Publication number: 20140052711Abstract: Techniques are described for generating histograms for a multidimensional space. In the presence of large spatial objects, fuzzy splitting techniques are utilized to recursively divide the multidimensional space into partitions, where a single spatial object may belong to multiple partitions. Large spatial objects are essentially broken down into smaller objects that may allow for more efficient partitioning of the multidimensional space. A count of spatial objects in each partition yields a spatial histogram. A spatial object that belongs to multiple partitions may have a weighted count for each of the multiple partitions, based on the extent to which the spatial object overlaps with each partition. Thus, an object that is split among a handful of partitions will only contribute a fraction of a count to each partition. Small partitions having relatively few objects are avoided by refusing to subdivide a partition whose members drop below a threshold number.Type: ApplicationFiled: August 16, 2012Publication date: February 20, 2014Applicant: ORACLE INTERNATIONAL CORPORATIONInventors: Bhuvan Bamba, Richard J. Anderson, Ying Hu, Siva Ravada