Patents by Inventor Nicholas de Jong

Nicholas de Jong 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).

  • Patent number: 10481291
    Abstract: An imager and method for imaging fluid of a subsurface formation is disclosed. The imager includes a housing having a sidewall defining a passage to receive a core sample of the subsurface formation therethrough. The housing is positioned in a downhole tool and has a fluid inlet to receive fluid from the subsurface formation into the passage. The imager also includes a permanent magnet positioned in the sidewall of the housing, a radio frequency coil positioned in the sidewall of the housing between the permanent magnet and the passage, a gradient field in the sidewall of the housing between the permanent magnet and the radio frequency coil, and a chemically-selective imager. The chemically-selective imager is operatively connected to the radio frequency coil to selectively pulse frequencies according to a pulse sequence whereby individual fluid measurements of the sample are generated.
    Type: Grant
    Filed: March 2, 2017
    Date of Patent: November 19, 2019
    Assignee: SHELL OIL COMPANY
    Inventors: Matthias Appel, Benjamin Charles Anger, Hilko de Jong, Lynn Faith Gladden, Michael David Mantle, Andrew John Sederman, Nicholas Philip Ramskill
  • Patent number: 7301792
    Abstract: A programmable finite state machine (FSM) includes, in part, first and second memories, and a selection circuit coupled to each of the memories. Upon receiving a (k+m)-bit word representative of the k-bit input symbol and the m-bit current state, the first memory supplies one ore more matching transition rules stored therein. The selection circuit selects the most specific of the supplied rules. The transition rules are stored in the first memory in a ranking order of generality. The second memory receives the selected transition rule and supplies the next state of the FSM. The first memory may be a ternary content addressable memory and the second memory may be a static random access memory. The contents of both the content addressable memory and the static random memory is determined by an algorithm which minimizes the number of terms required to represent the next-state transition functions.
    Type: Grant
    Filed: June 6, 2006
    Date of Patent: November 27, 2007
    Assignee: Sensory Networks, Inc.
    Inventors: Stephen Gould, Robert Matthew Barrie, Darren Williams, Nicholas de Jong
  • Publication number: 20070230445
    Abstract: An architecture for an integrated circuit apparatus and method that allows significant performance improvements for signature based network applications. In various embodiments the architecture allows high throughput classification of packets into network streams, packet reassembly of such streams, filtering and pre-processing of such streams, pattern matching on header and payload content of such streams, and action execution based upon rule-based policy for multiple network applications, simultaneously at wire speed. The present invention is improved over the prior art designs, in performance, flexibility and pattern database size.
    Type: Application
    Filed: October 6, 2006
    Publication date: October 4, 2007
    Applicant: Sensory Networks, Inc.
    Inventors: Robert Barrie, Stephen Gould, Darren Williams, Nicholas de Jong
  • Publication number: 20070195814
    Abstract: An architecture for an integrated circuit apparatus and method that allows significant performance improvements for signature based network applications. In various embodiments the architecture allows high throughput classification of packets into network streams, packet reassembly of such streams, filtering and pre-processing of such streams, pattern matching on header and payload content of such streams, and action execution based upon rule-based policy for multiple network applications, simultaneously at wire speed. The present invention is improved over the prior art designs, in performance, flexibility and pattern database size.
    Type: Application
    Filed: October 6, 2006
    Publication date: August 23, 2007
    Applicant: Sensory Networks, Inc.
    Inventors: Robert Barrie, Stephen Gould, Darren Williams, Nicholas de Jong
  • Patent number: 7219319
    Abstract: A programmable finite state machine (FSM) includes, in part, first and second memories, and a selection circuit coupled to each of the memories. Upon receiving a (k+m)-bit word representative of the k-bit input symbol and the m-bit current state, the first memory supplies one ore more matching transition rules stored therein. The selection circuit selects the most specific of the supplied rules. The transition rules are stored in the first memory in a ranking order of generality. The second memory receives the selected transition rule and supplies the next state of the FSM. The first memory may be a ternary content addressable memory and the second memory may be a static random access memory. The contents of both the content addressable memory and the static random memory is determined by an algorithm which minimizes the number of terms required to represent the next-state transition functions.
    Type: Grant
    Filed: June 6, 2006
    Date of Patent: May 15, 2007
    Assignee: Sensory Networks, Inc.
    Inventors: Stephen Gould, Robert Matthew Barrie, Darren Williams, Nicholas de Jong
  • Publication number: 20060253816
    Abstract: A programmable finite state machine (FSM) includes, in part, first and second memories, and a selection circuit coupled to each of the memories. Upon receiving a (k+m)-bit word representative of the k-bit input symbol and the m-bit current state, the first memory supplies one ore more matching transition rules stored therein. The selection circuit selects the most specific of the supplied rules. The transition rules are stored in the first memory in a ranking order of generality. The second memory receives the selected transition rule and supplies the next state of the FSM. The first memory may be a ternary content addressable memory and the second memory may be a static random access memory. The contents of both the content addressable memory and the static random memory is determined by an algorithm which minimizes the number of terms required to represent the next-state transition functions.
    Type: Application
    Filed: June 6, 2006
    Publication date: November 9, 2006
    Applicant: SENSORY NETWORKS, INC.
    Inventors: Stephen Gould, Robert Barrie, Darren Williams, Nicholas de Jong
  • Publication number: 20060221658
    Abstract: A programmable finite state machine (FSM) includes, in part, first and second memories, and a selection circuit coupled to each of the memories. Upon receiving a (k+m)-bit word representative of the k-bit input symbol and the m-bit current state, the first memory supplies one ore more matching transition rules stored therein. The selection circuit selects the most specific of the supplied rules. The transition rules are stored in the first memory in a ranking order of generality. The second memory receives the selected transition rule and supplies the next state of the FSM. The first memory may be a ternary content addressable memory and the second memory may be a static random access memory. The contents of both the content addressable memory and the static random memory is determined by an algorithm which minimizes the number of terms required to represent the next-state transition functions.
    Type: Application
    Filed: June 6, 2006
    Publication date: October 5, 2006
    Applicant: Sensory Networks, Inc.
    Inventors: Stephen Gould, Robert Barrie, Darren Williams, Nicholas de Jong
  • Patent number: 7082044
    Abstract: A programmable finite state machine (FSM) includes, in part, first and second memories, and a selection circuit coupled to each of the memories. Upon receiving a (k+m)-bit word representative of the k-bit input symbol and the m-bit current state, the first memory supplies one ore more matching transition rules stored therein. The selection circuit selects the most specific of the supplied rules. The transition rules are stored in the first memory in a ranking order of generality. The second memory receives the selected transition rule and supplies the next state of the FSM. The first memory may be a ternary content addressable memory and the second memory may be a static random access memory. The contents of both the content addressable memory and the static random memory is determined by an algorithm which minimizes the number of terms required to represent the next-state transition functions.
    Type: Grant
    Filed: March 12, 2004
    Date of Patent: July 25, 2006
    Assignee: Sensory Networks, Inc.
    Inventors: Stephen Gould, Robert Matthew Barrie, Darren Williams, Nicholas de Jong
  • Publication number: 20060120137
    Abstract: A programmable finite state machine (FSM) includes, in part, first and second memories, and a selection circuit coupled to each of the memories. Upon receiving a (k+m)-bit word representative of the k-bit input symbol and the m-bit current state, the first memory supplies one ore more matching transition rules stored therein. The selection circuit selects the most specific of the supplied rules. The transition rules are stored in the first memory in a ranking order of generality. The second memory receives the selected transition rule and supplies the next state of the FSM. The first memory may be a ternary content addressable memory and the second memory may be a static random access memory. The contents of both the content addressable memory and the static random memory is determined by an algorithm which minimizes the number of terms required to represent the next-state transition functions.
    Type: Application
    Filed: March 12, 2004
    Publication date: June 8, 2006
    Applicant: Sensory Networks, Inc.
    Inventors: Stephen Gould, Robert Barrie, Darren Williams, Nicholas de Jong