Patents by Inventor Lloyd Reeves

Lloyd Reeves 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: 11947279
    Abstract: A system for sensing material within a container includes a container having a reservoir for storing material and an impact member configured to selectively impart an impulse force on the container to cause vibration of the container. A sensor is configured to sense the vibration of the container upon the impact member imparting the impulse force on the container. Processing circuitry in communication with the sensor is configured to determine an estimate of an amount of the material in the container based on the sensed vibration of the container.
    Type: Grant
    Filed: March 23, 2022
    Date of Patent: April 2, 2024
    Assignee: Lexmark International, Inc.
    Inventors: Alexander Lloyd Chapman, Clare Cabahug Maxino, Neilson Gutay Navarrete, Michael Todd Phillips, Scott Daniel Reeves, Daniel Lee Thomas
  • Patent number: 11947282
    Abstract: A system for an electrophotographic image forming device includes a toner container having a reservoir for storing toner and an impact member configured to selectively impart an impulse force on the toner container to cause vibration of the toner container. A sensor is configured to sense the vibration of the toner container upon the impact member imparting the impulse force on the toner container. Processing circuitry in communication with the sensor is configured to determine an estimate of an amount of toner in the reservoir based on the sensed vibration of the toner container.
    Type: Grant
    Filed: March 23, 2022
    Date of Patent: April 2, 2024
    Assignee: Lexmark International, Inc.
    Inventors: Alexander Lloyd Chapman, Clare Cabahug Maxino, Neilson Gutay Navarrete, Michael Todd Phillips, Scott Daniel Reeves, Daniel Lee Thomas
  • Publication number: 20230370445
    Abstract: Various embodiments set forth a method comprising validating, by a first computing system in a secured computing environment, a demand event generated by an operator, where the operator is authenticated to generate demand events within the secured computing environment and the demand event corresponds to a set of endpoints operating outside the secured computing environment, generating, by the first computing system, an authorization permit associated with the demand event, and sending, from the first computing system to a second computing system outside of the secured computing environment, (i) an indicator of the demand event, and (ii) the authorization permit, where the demand event is usable by the second computing system to generate a demand event command for the set of endpoints, and the authorization permit is usable by the set of endpoints to validate the demand event command
    Type: Application
    Filed: May 12, 2022
    Publication date: November 16, 2023
    Inventors: Connie BRADBURY, Benjamin N. DAMM, Aaron GLASENAPP, Thomas J. BARBOUR, Donald Lloyd REEVES, III
  • Patent number: 11044274
    Abstract: In one embodiment, a method includes accessing policy states associated with a policy, determining that a particular policy state of the policy states should not be pruned, and generating possible next policy states for the particular policy state based on one or more policy actions and one or more costs associated with the respective policy actions, wherein each policy action is associated with one or more probabilities corresponding to one or more possibilities of resulting in one or more of the possible next policy states, wherein the respective cost associated with the policy action is determined based on one or more computing costs of the policy action resulting in the one or more of the possible next policy states in combination with the respective one or more probabilities, and wherein each policy state of the created policy evaluation tree comprises a rule state for each rule of the policy.
    Type: Grant
    Filed: April 16, 2019
    Date of Patent: June 22, 2021
    Assignee: Facebook, Inc.
    Inventors: Kendall Blair Hopkins, Dwayne Lloyd Reeves
  • Publication number: 20190245893
    Abstract: In one embodiment, a method includes accessing policy states associated with a policy, determining that a particular policy state of the policy states should not be pruned, and generating possible next policy states for the particular policy state based on one or more policy actions and one or more costs associated with the respective policy actions, wherein each policy action is associated with one or more probabilities corresponding to one or more possibilities of resulting in one or more of the possible next policy states, wherein the respective cost associated with the policy action is determined based on one or more computing costs of the policy action resulting in the one or more of the possible next policy states in combination with the respective one or more probabilities, and wherein each policy state of the created policy evaluation tree comprises a rule state for each rule of the policy.
    Type: Application
    Filed: April 16, 2019
    Publication date: August 8, 2019
    Inventors: Kendall Blair Hopkins, Dwayne Lloyd Reeves
  • Patent number: 10291652
    Abstract: Technology for improving evaluation of policies comprising multiple rules is disclosed. By generating a policy evaluation tree controlling, for any given policy state, which rules should be evaluated next, policy optimization can be performed off-line prior to policy evaluation. For a policy, a policy evaluation tree can be generated such that each node in the tree corresponds to a policy state and each child node corresponds to a policy state that may result from an action that may be taken from its parent policy state. Policy evaluation trees may be generated by iteratively generating, from an initial policy state, possible next states as child states until a result of the policy is determined. Some next possible policy states may be pruned from the tree based on conditions such as having a high cost of evaluation compared to the likelihood a rule will yield an interesting result.
    Type: Grant
    Filed: July 25, 2014
    Date of Patent: May 14, 2019
    Assignee: Facebook, Inc.
    Inventors: Kendall Blair Hopkins, Dwayne Lloyd Reeves
  • Patent number: 9948653
    Abstract: Technology for policies with reduced associated costs is disclosed. A policy may include an ordered rule set. When evaluated, the highest priority rule in the order that does not skip may control the policy outcome. Rules within a policy may have associated costs, such as data fetch and evaluation costs. In some contexts, it may be less important to evaluate every rule than to evaluate the policy quickly. Reduced policies that have one or more rules removed or that skip evaluation of some rules may be created for these contexts. When a rule of a policy is skipped, it may result in a possibility of a false allow or false deny. In some cases, rules may be duplicative. Removal or skipping of duplicative rules does not increase the possibility of a false allow or false deny. By using reduced policies in identified contexts, policy evaluation costs may be reduced.
    Type: Grant
    Filed: December 31, 2015
    Date of Patent: April 17, 2018
    Assignee: Facebook, Inc.
    Inventors: Maria S. Pimenova, Wendy Weihuan Mu, Dwayne Lloyd Reeves, Kendall Blair Hopkins
  • Publication number: 20160127377
    Abstract: Technology for policies with reduced associated costs is disclosed. A policy may include an ordered rule set. When evaluated, the highest priority rule in the order that does not skip may control the policy outcome. Rules within a policy may have associated costs, such as data fetch and evaluation costs. In some contexts, it may be less important to evaluate every rule than to evaluate the policy quickly. Reduced policies that have one or more rules removed or that skip evaluation of some rules may be created for these contexts. When a rule of a policy is skipped, it may result in a possibility of a false allow or false deny. In some cases, rules may be duplicative. Removal or skipping of duplicative rules does not increase the possibility of a false allow or false deny. By using reduced policies in identified contexts, policy evaluation costs may be reduced.
    Type: Application
    Filed: December 31, 2015
    Publication date: May 5, 2016
    Inventors: Maria S. Pimenova, Wendy Weihuan Mu, Dwayne Lloyd Reeves, Kendall Blair Hopkins
  • Patent number: 9276960
    Abstract: Technology for policies with reduced associated costs is disclosed. A policy may include an ordered rule set. When evaluated, the highest priority rule in the order that does not skip may control the policy outcome. Rules within a policy may have associated costs, such as data fetch and evaluation costs. In some contexts, it may be less important to evaluate every rule than to evaluate the policy quickly. Reduced policies that have one or more rules removed or that skip evaluation of some rules may be created for these contexts. When a rule of a policy is skipped, it may result in a possibility of a false allow or false deny. In some cases, rules may be duplicative. Removal or skipping of duplicative rules does not increase the possibility of a false allow or false deny. By using reduced policies in identified contexts, policy evaluation costs may be reduced.
    Type: Grant
    Filed: April 2, 2014
    Date of Patent: March 1, 2016
    Assignee: FACEBOOK, INC.
    Inventors: Maria S. Pimenova, Wendy Weihuan Mu, Dwayne Lloyd Reeves, Kendall Blair Hopkins
  • Publication number: 20160028769
    Abstract: Technology for improving evaluation of policies comprising multiple rules is disclosed. By generating a policy evaluation tree controlling, for any given policy state, which rules should be evaluated next, policy optimization can be performed off-line prior to policy evaluation. For a policy, a policy evaluation tree can be generated such that each node in the tree corresponds to a policy state and each child node corresponds to a policy state that may result from an action that may be taken from its parent policy state. Policy evaluation trees may be generated by iteratively generating, from an initial policy state, possible next states as child states until a result of the policy is determined. Some next possible policy states may be pruned from the tree based on conditions such as having a high cost of evaluation compared to the likelihood a rule will yield an interesting result.
    Type: Application
    Filed: July 25, 2014
    Publication date: January 28, 2016
    Inventors: Kendall Blair Hopkins, Dwayne Lloyd Reeves
  • Publication number: 20160022920
    Abstract: A lock unit for a syringe provides a proper dose of an agent or medication from the syringe. The lock unit sets the dose of the syringe and is not thereafter affected by subsequent shipping or handling. The lock unit is applied to the plunger to limit the travel of the syringe piston in the syringe barrel thus limiting the dose that is delivered. Optionally, one or more syringes can be provided with a plurality of lock units of differing dimensions each set to deliver a specific dose of the agent when attached to a syringe.
    Type: Application
    Filed: March 14, 2014
    Publication date: January 28, 2016
    Inventor: Timothy Lloyd Reeves
  • Publication number: 20150288718
    Abstract: Technology for policies with reduced associated costs is disclosed. A policy may include an ordered rule set. When evaluated, the highest priority rule in the order that does not skip may control the policy outcome. Rules within a policy may have associated costs, such as data fetch and evaluation costs. In some contexts, it may be less important to evaluate every rule than to evaluate the policy quickly. Reduced policies that have one or more rules removed or that skip evaluation of some rules may be created for these contexts. When a rule of a policy is skipped, it may result in a possibility of a false allow or false deny. In some cases, rules may be duplicative. Removal or skipping of duplicative rules does not increase the possibility of a false allow or false deny. By using reduced policies in identified contexts, policy evaluation costs may be reduced.
    Type: Application
    Filed: April 2, 2014
    Publication date: October 8, 2015
    Applicant: Facebook, Inc.
    Inventors: Maria S. Pimenova, Wendy Weihuan Mu, Dwayne Lloyd Reeves, Kendall Blair Hopkins
  • Patent number: 4366963
    Abstract: A convertible play vehicle comprising an inflatable flotation ring encircling an integral reinforced, load-bearing platform that lies mid-way of the height of the flotation ring and has spaced openings near the circumference thereof that may serve as hand grips and a separable sled portion releasably secured on the underside of the inflatable ring by straps that are attached to the sled and extend over the ring, passing twice through the ring platform via the circumferential openings therein. The inflatable ring may be formed of two circular disks of rubber-like material vulcanized together at their outer circumference and at a concentric circle spaced inwardly therefrom to provide an inflatable endless tube therebetween. The sled may be of fiberglass or plastic with its ends rounded up to accomodate the inflated ring and provided with integral strap-passing eyelets on its upper side and parallel runners extending longitudinally on the underside.
    Type: Grant
    Filed: July 2, 1979
    Date of Patent: January 4, 1983
    Assignee: Funsafe (Canada) Ltd.
    Inventors: Lloyd Reeves, L. W. Sorensen