Patents by Inventor Charles Gregory Nelson
Charles Gregory Nelson 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: 20230126905Abstract: A header lock assembly includes a header lock pin and mating lead lock collar that provide a releasable coupling for attaching one or more leads to a device. The header lock assembly is configured to engage the lead to assure closure while not applying undue pressure on the lead. One or more notches in the header lock pin allow the lead to pass the header lock pin unimpeded while the header lock assembly is in an unlocked configuration. Rotation of the header lock pin engages a circumferential groove in the lead lock collar to secure the lead to the header. A slot in the top of the header lock pin provides an interface surface with a lead locking tool for rotating the header lock pin. The slot orientation provides a visual indication of the header lock assembly being in a locked or unlocked configuration.Type: ApplicationFiled: January 27, 2021Publication date: April 27, 2023Applicant: INCUBE LABS, LLCInventors: Elmar FISCHER, Charles Gregory NELSON, Paul SPEHR, Kenneth R. COSGROVE
-
Publication number: 20230047024Abstract: A trocar assembly comprises an elongate shaft, a piercing tip at a distal end of the shaft, a handle at a proximal end of the shaft, and a retaining member. When a passer tube is positioned over the shaft, the retaining member engages with an inner surface or an outer surface of the passer tube to retain a position of the passer tube over the shaft.Type: ApplicationFiled: July 26, 2022Publication date: February 16, 2023Inventors: Kyle HORLEN, Charles Gregory NELSON
-
Publication number: 20230026776Abstract: A cuff is described for a target anatomic feature within a body, along with a system for utilizing the cuff. The cuff includes a band defining a circumferential opening extending along a length of the band; and a pair of engagement surfaces defined by or affixed to the cuff, the engagement surfaces structured for application of a spreading force to be distributed continuously along a portion of the circumferential opening, thereby increasing the circumferential opening and expanding the cuff for a closed configuration to an open configuration sized for placement of the cuff. The cuff is structured to remain in the closed configuration in the absence of the spreading force and automatically return to the closed configuration after removal of the spreading force.Type: ApplicationFiled: October 15, 2020Publication date: January 26, 2023Applicant: INCUBE LABS, LLCInventors: Paul SPEHR, Charles Gregory NELSON, Varghese K. GEORGE, Isabell PINA
-
Publication number: 20220241599Abstract: A lead device is provided for a medical treatment apparatus, where the lead device includes protruding anchoring mechanisms for anchoring the lead device in tissue. The anchoring mechanism include permanent anchoring mechanisms, or a combination of permanent and dissolvable anchoring mechanisms, to anchor the device in tissue. The anchoring mechanism resists migration of the lead device in at least one or both axial directions.Type: ApplicationFiled: May 7, 2020Publication date: August 4, 2022Applicant: INCUBE LABS, LLCInventors: Elmar FISCHER, Robert GAFFNEY, Varghese K. GEORGE, Kyle HORLEN, Mir A. IMRAN, Charles Gregory NELSON, Paul SPEHR
-
Publication number: 20220241586Abstract: A lead device is provided for a medical treatment apparatus, where the lead device includes mechanisms for anchoring the lead device in tissue.Type: ApplicationFiled: May 7, 2020Publication date: August 4, 2022Applicant: INCUBE LABS, LLCInventors: Paul SPEHR, Katherine PITTS, Isabell PINA, Charles Gregory NELSON, Kenneth R. COSGROVE
-
Patent number: 7036115Abstract: A tool and method for automatically producing near-optimal code sequences are particularly useful for generating near-optimal code sequences in inner loops, crucial subroutines, and device drivers. As a novel functional and architectural strategy, the invention contemplates applying technologies that would be normally in automatic theorem proving to the problem of automatic code generation. The aspect of the automatic theorem proving is realized by matching followed by planning with satisfiability search. Notably also, the present invention targets a goal-oriented, cycle budget limited code sequence in producing the near-optimal code sequence.Type: GrantFiled: November 20, 2001Date of Patent: April 25, 2006Assignee: Hewlett-Packard Development Company, L.P.Inventor: Charles Gregory Nelson
-
Patent number: 6553362Abstract: The instructions in a computer program are converted into a form of weakest precondition so as to produce a verification condition that is to be evaluated by a theorem prover. In generating the weakest precondition, labels are introduced for values of variables at control join points. In two preferred embodiments, the computer program is converted into a set of guarded commands prior to the application of weakest precondition operators. In one embodiment, as part of the process of generating the verification condition, assignment commands that assign values to variables are removed from the program through use of a “dynamic single assumption” technique. In another embodiment, the weakest precondition is expressed in terms of strongest postconditions. In both embodiments, a simplified verification condition is produced in which duplications of sets of instructions following a choice operator is avoided.Type: GrantFiled: July 16, 2001Date of Patent: April 22, 2003Assignee: Hewlett-Packard Development Company, L.P.Inventors: James Benjamin Saxe, Charles Gregory Nelson, David Luke Detlefs
-
Publication number: 20020124239Abstract: A tool and method for automatically producing near-optimal code sequences are particularly useful for generating near-optimal code sequences in inner loops, crucial subroutines, and device drivers. As a novel functional and architectural strategy, the invention contemplates applying technologies that would be normally in automatic theorem proving to the problem of automatic code generation. The aspect of the automatic theorem proving is realized by matching followed by planning with satisfiability search. Notably also, the present invention targets a goal-oriented, cycle budget limited code sequence in producing the near-optimal code sequence.Type: ApplicationFiled: November 20, 2001Publication date: September 5, 2002Inventor: Charles Gregory Nelson
-
Publication number: 20020083418Abstract: The instructions in a computer program are converted into a form of weakest precondition so as to produce a verification condition that is to be evaluated by a theorem prover. In generating the weakest precondition, labels are introduced for values of variables at control join points. In two preferred embodiments, the computer program is converted into a set of guarded commands prior to the application of weakest precondition operators. In one embodiment, as part of the process of generating the verification condition, assignment commands that assign values to variables are removed from the program through use of a “dynamic single assumption” technique. In another embodiment, the weakest precondition is expressed in terms of strongest postconditions. In both embodiments, a simplified verification condition is produced in which duplications of sets of instructions following a choice operator is avoided.Type: ApplicationFiled: July 16, 2001Publication date: June 27, 2002Inventors: James Benjamin Saxe, Charles Gregory Nelson, David Luke Detlefs
-
Publication number: 20020062476Abstract: The instructions in a computer program are converted into a form of weakest precondition so as to produce a verification condition that is to be evaluated by a theorem prover. In generating the weakest precondition, labels are introduced for values of variables at control join points. In two preferred embodiments, the computer program is converted into a set of guarded commands prior to the application of weakest precondition operators. In one embodiment, as part of the process of generating the verification condition, assignment commands that assign values to variables are removed from the program through use of a “dynamic single assumption” technique. In another embodiment, the weakest precondition is expressed in terms of strongest postconditions. In both embodiments, a simplified verification condition is produced in which duplications of sets of instructions following a choice operator is avoided.Type: ApplicationFiled: July 16, 2001Publication date: May 23, 2002Inventors: James Benjamin Saxe, Charles Gregory Nelson, Cormac Andrias Flanagan
-
Patent number: 6343376Abstract: A system and method for increasing the speed of operation of a theorem prover relating to program verification using adaptive pattern matching technique is disclosed. Source code in a specific programming language is converted to one or more formulae, each representing a specific reformulation of the source code that facilitates program verification. Each formula derived from the source code is converted into an E-graph which is a particular type of a directed acyclic graph having leaf nodes and interior nodes. Some of the nodes of an E-graph may be related to other nodes through equivalence relationships. Equivalence relationships between a group of nodes is stored in a data structure called an equivalence class. A collection of rules defining the grammar of the programming language is stored in an axiom database. Rules and conjectures can dynamically be added to the axiom database. Each rule or conjecture to be tested is converted into a pattern.Type: GrantFiled: October 22, 1998Date of Patent: January 29, 2002Assignee: Computer Computer CorporationInventors: James B. Saxe, Charles Gregory Nelson, David Detlefs
-
Patent number: 6230155Abstract: A method for facilitating the comparison of two computerized documents. The method includes loading a first document into a random access memory (RAM), loading a second document into the RAM, reducing the first document into a first sequence of tokens, reducing the second document into a second sequence of tokens, converting the first set of tokens to a first (multi)set of shingles, converting the second set of tokens to a second (multi)set of shingles, determining a first sketch of the first (multi)set of shingles, determining a second sketch of the second (multi)set of shingles, and comparing the first sketch and the second sketch. The sketches have a fixed size, independent of the size of the documents. The resemblance of two documents is provided using a sketch of each document. The sketches may be computed fairly fast and given two sketches the resemblance of the corresponding documents can be computed in linear time in the size of the sketches.Type: GrantFiled: November 23, 1998Date of Patent: May 8, 2001Assignee: AltaVista CompanyInventors: Andrei Zary Broder, Charles Gregory Nelson
-
Patent number: 5909677Abstract: A method for facilitating the comparison of two computerized documents. The method includes loading a first document into a random access memory (RAM), loading a second document into the RAM, reducing the first document into a first sequence of tokens, reducing the second document into a second sequence of tokens, converting the first set of tokens to a first (multi)set of shingles, converting the second set of tokens to a second (multi)set of shingles, determining a first sketch of the first (multi)set of shingles, determining a second sketch of the second (multi)set of shingles, and comparing the first sketch and the second sketch. The sketches have a fixed size, independent of the size of the documents. The resemblance of two documents is provided using a sketch of each document. The sketches may be computed fairly fast and given two sketches the resemblance of the corresponding documents can be computed in linear time in the size of the sketches.Type: GrantFiled: June 18, 1996Date of Patent: June 1, 1999Assignee: Digital Equipment CorporationInventors: Andrei Zary Broder, Charles Gregory Nelson