Patents by Inventor Lara S. Crawford

Lara S. Crawford 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: 20180165772
    Abstract: Embodiments of the present invention provide a system for tiered greening of power consumption on shared equipment. The system improves significantly over previous systems by allowing large organizations to utilize renewable (“green”) power progressively, fulfilling customer stipulations of power quantity, quality, and delivery, and apportioning the cost fairly among customers. During operation, the system obtains a plurality of Service Level Agreements (SLAs) detailing power consumption by a plurality of jobs from a plurality of customers, wherein the SLAs specify a level of green power generated from renewable sources, and green power quality and delivery requirements. The system then apportions the power consumption to a respective job, in satisfaction of the job's SLA, yielding a net increase in a total level of green power of the plurality of jobs. The system may then control the shared equipment to execute the job according to the apportioned power consumption.
    Type: Application
    Filed: December 14, 2016
    Publication date: June 14, 2018
    Applicant: Palo Alto Research Center Incorporated
    Inventors: Lara S. Crawford, Daniel H. Greene
  • Publication number: 20180081347
    Abstract: The system and method described below allow for real-time control over positioning of a micro-object. A movement of at least one micro-object suspended in a medium can be induced by a generation of one or more forces by electrodes proximate to the micro-object. Prior to inducing the movement, a simulation is used to develop a model describing a parameter of an interaction between each of the electrodes and the micro-object. A function describing the forces generated by an electrode and an extent of the movement induced due to the forces is generated using the model. The function is used to design closed loop policy control scheme for moving the micro-object towards a desired position. The position of the micro-object is tracked and taken into account when generating control signals in the scheme.
    Type: Application
    Filed: March 24, 2017
    Publication date: March 22, 2018
    Inventors: Ion Matei, Jeng Ping Lu, Saigopal Nelaturi, Julie A. Bert, Lara S. Crawford, Armin R. Volkel, Eugene M. Chow
  • Patent number: 9374314
    Abstract: One embodiment of the present invention provides a system for balancing loads between two physical resources. During operation, for each physical resource, the system establishes resource-usage models for a plurality of jobs that share the physical resource, identifies quality-of-service (QoS) levels associated with the jobs, and computes a QoS balance point for the physical resource based on the resource-usage models and the QoS ratings. The QoS balance point indicates a rating of QoS, above which substantial resource provisioning is required. In response to detecting a difference between a first QoS balance point associated with a first physical resource and a second QoS balance point associated with a second physical resource, the system identifies one or more jobs to be moved between the first and second physical resources such that the difference between the first and the second QoS balance points is reduced.
    Type: Grant
    Filed: November 28, 2012
    Date of Patent: June 21, 2016
    Assignee: PALO ALTO RESEARCH CENTER INCORPORATED
    Inventors: Daniel H. Greene, Lara S. Crawford, John Hanley
  • Patent number: 9092265
    Abstract: One embodiment of the present invention provides a system for provisioning physical resources shared by a plurality of jobs. During operation, the system establishes resource-usage models for the jobs, ranks the jobs based on quality of service (QoS) requirements associated with the jobs, and provisions the jobs for a predetermined time interval in such a way that any unused reservations associated with a first subset of jobs having higher QoS rankings are distributed to other remaining jobs with preference given to a second subset of jobs having a highest QoS ranking among the other remaining jobs. Provisioning the jobs involves making reservations for the jobs based on the resource-usage model and corresponding QoS requirements associated with the jobs.
    Type: Grant
    Filed: December 3, 2012
    Date of Patent: July 28, 2015
    Assignee: PALO ALTO RESEARCH CENTER INCORPORATED
    Inventors: Daniel H. Greene, Lara S. Crawford, Maurice K. Chu, John Hanley
  • Patent number: 8819103
    Abstract: Controllers communicate commands in terms of goals and constraints. A goal is an objective. A constraint is information regarding how the goal is to be achieved. For example, a constraint may specify when, or how much of, a resource may be used to achieve a goal. Additionally, or alternatively, a constraint may specify an acceptable or expected accuracy or tolerance regarding how the goal is achieved. Each controller is expected to achieve assigned goals in accord with associated constraints. Thereby, system communication may be reduced. If controllers achieve goals according to specified constraints, the controllers do not need to provide updates or be updated regarding the status of activities of other controllers or regarding other operational context information. In some embodiments, commands are generally not acknowledged. Instead, serving controllers respond to a command with an error message if a goal cannot be met in accord with an associated constraint.
    Type: Grant
    Filed: April 8, 2005
    Date of Patent: August 26, 2014
    Assignee: Palo Alto Research Center, Incorporated
    Inventors: Markus P. J. Fromherz, Lara S. Crawford, Haitham A. Hindi
  • Patent number: 7873962
    Abstract: Respective coordinators are spawned or activated to coordinate activities with regard to respective tasks. Where the respective tasks require cooperative efforts of a plurality of controllers, the respective coordinators ensure cooperative efforts by generating and communicating cooperative commands to the plurality of controllers. The coordinators may act as clearinghouses for system data, selectively requesting and relaying system information to appropriate controllers. For example, a document processing system activates respective coordinators for respective sheets of print media. The respective coordinators orchestrate the transportation of the sheets by sequentially orchestrating the activities of sequentially selected pluralities of transportation actuator controllers. Selected sheet position information from sensors and/or from models maintained by the actuator controllers may be relayed by the coordinators to selected actuator controllers as appropriate to the sheet transportation tasks.
    Type: Grant
    Filed: April 8, 2005
    Date of Patent: January 18, 2011
    Assignee: Xerox Corporation
    Inventors: Lara S. Crawford, Haitham A. Hindi, Markus P. J. Fromherz, Craig Eldershaw, Wheeler Ruml, Kimon D. Roufas
  • Patent number: 7791741
    Abstract: A new process is synchronized to an existing process in the face of a communications delay (d) by collecting a history of delayed measurements and states of the existing process. This history and predetermined information regarding the behavior of the existing process are used to simulate the existing process forward in time to a current time, thereby computing a current process state. Once the current state is computed, the new process, driven by the same information, maintains synchronization with the existing process. In a document processor the method of synchronizing can be applied to tightly coupled modules. For example, a print media transport system includes a plurality of transport modules. Each transport module includes a plurality of transport actuators and an associated controller. Print media may be driven by actuators of plural modules contemporaneously. Modules about to receive media are synchronized to modules already transporting the media.
    Type: Grant
    Filed: April 8, 2005
    Date of Patent: September 7, 2010
    Assignee: Palo Alto Research Center Incorporated
    Inventors: Haitham A. Hindi, Lara S. Crawford
  • Patent number: 7706007
    Abstract: A method for synchronizing the control efforts of a plurality of controllers includes determining an apply time for using updated information. The apply time can take into account worst case processing and/or communication delays across a system. Reacting to the updated information only after at the apply time ensures that all system elements are able to react to the updated information in concert. A time stamp indicates when the data was collected. The apply time indicates when the data can be used. Process modeling or simulation is used to estimate system status at the apply time based on the system status at the time of the time stamp, the updated information, and predetermined information regarding the behavior of the system over time. In a document processor, the method allows tightly coupled modules, such as sheet transportation modules, to behave in a cooperative manner when separate modules are in contact with the same sheet.
    Type: Grant
    Filed: April 8, 2005
    Date of Patent: April 27, 2010
    Assignee: Palo Alto Research Center Incorporated
    Inventors: Lara S. Crawford, Haitham A. Hindi
  • Patent number: 7577107
    Abstract: A method is presented for message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes having attribute values. The method includes determining local attributes for each of the nodes in the ad-hoc network and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node, with a neighboring node being a node that is one hop away. Each message transmitted over the ad-hoc network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type.
    Type: Grant
    Filed: June 3, 2003
    Date of Patent: August 18, 2009
    Assignee: Palo Alto Research Center Incorporated
    Inventors: Ying Zhang, Markus P. J. Fromherz, Lara S. Crawford, Yi Shang
  • Patent number: 7577108
    Abstract: A method is presented for a learning-based strategy utilized within message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes. The method includes determining local attributes for each of the nodes and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node. Each message transmitted over the network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type. Cost estimation is utilized to converge on an optimal message path.
    Type: Grant
    Filed: June 3, 2003
    Date of Patent: August 18, 2009
    Assignee: Palo Alto Research Center Incorporated
    Inventors: Ying Zhang, Markus P. J. Fromherz, Yi Shang, Sergei Vassilvitskii, Lara S. Crawford
  • Patent number: 7089220
    Abstract: A cooperative solving method for controlling a plurality of constraint problem solvers identifies complexity criteria, which provide direction for selecting and for transitioning between constraint problem solvers. The method includes randomly selecting a test point and determining whether the test point satisfies a first complexity criterion. A first constraint problem solver is selected, and an alternate test point is identified by the first solver if the complexity criterion has not been satisfied. If the alternate test point is a problem solution, it is transmitted to the system. If the alternate test point is not a problem solution or if the original randomly-selected test point satisfies the complexity criterion, a second constraint solver selects a new test point. If the new test point is a problem solution, it is transmitted to the system; if the new test point is not a solution, the cooperative solver is restarted.
    Type: Grant
    Filed: June 24, 2003
    Date of Patent: August 8, 2006
    Assignee: Palo Alto Research Center Incorporated
    Inventors: Markus P. J. Fromherz, Yi Shang, Lara S. Crawford
  • Patent number: 7089221
    Abstract: A method for feedback control of cooperative problem solving for real-time applications in complex systems utilizes solvers parameterized by control variables. The method includes initializing the time setting and selecting at least one solver parameter value. The solver is operated with the selected solver parameter value or values for a specified interim and the operational conditions are reviewed. A solution is transmitted to the system if a solution quality condition is satisfied. The solver continues to operate if the solution quality condition is not satisfied and the performance differential is not greater than a specified threshold. If the solution quality condition is unsatisfied, but the performance differential exceeds the threshold, at least one alternate solver parameter value is selected and the solver is operated with the new solver parameter value for a specified interim. The solver continues to operate until the solution quality condition is satisfied.
    Type: Grant
    Filed: June 24, 2003
    Date of Patent: August 8, 2006
    Assignee: Palo Alto Research Center Incorporated
    Inventors: Markus P. J. Fromherz, Lara S. Crawford, Yi Shang
  • Publication number: 20040267680
    Abstract: A method for feedback control of cooperative problem solving for real-time applications in complex systems utilizes solvers parameterized by control variables. The method includes initializing the time setting and selecting at least one solver parameter value. The solver is operated with the selected solver parameter value or values for a specified interim and the operational conditions are reviewed. A solution is transmitted to the system if a solution quality condition is satisfied. The solver continues to operate if the solution quality condition is not satisfied and the performance differential is not greater than a specified threshold. If the solution quality condition is unsatisfied, but the performance differential exceeds the threshold, at least one alternate solver parameter value is selected and the solver is operated with the new solver parameter value for a specified interim. The solver continues to operate until the solution quality condition is satisfied.
    Type: Application
    Filed: June 24, 2003
    Publication date: December 30, 2004
    Applicant: Palo Alto Research Center Incorporated
    Inventors: Markus P.J. Fromherz, Lara S. Crawford, Yi Shang
  • Publication number: 20040267679
    Abstract: A cooperative solving method for controlling a plurality of constraint problem solvers identifies complexity criteria, which provide direction for selecting and for transitioning between constraint problem solvers. The method includes randomly selecting a test point and determining whether the test point satisfies a first complexity criterion. A first constraint problem solver is selected, and an alternate test point is identified by the first solver if the complexity criterion has not been satisfied. If the alternate test point is a problem solution, it is transmitted to the system. If the alternate test point is not a problem solution or if the original randomly-selected test point satisfies the complexity criterion, a second constraint solver selects a new test point. If the new test point is a problem solution, it is transmitted to the system; if the new test point is not a solution, the cooperative solver is restarted.
    Type: Application
    Filed: June 24, 2003
    Publication date: December 30, 2004
    Applicant: Palo Alto Research Center Incorporated
    Inventors: Markus P.J. Fromherz, Yi Shang, Lara S. Crawford
  • Publication number: 20040246904
    Abstract: A method is presented for message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes having attribute values. The method includes determining local attributes for each of the nodes in the ad-hoc network and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node, with a neighboring node being a node that is one hop away. Each message transmitted over the ad-hoc network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type.
    Type: Application
    Filed: June 3, 2003
    Publication date: December 9, 2004
    Applicant: Palo Alto Research Center, Incorporated
    Inventors: Ying Zhang, Markus P.J. Fromherz, Lara S. Crawford, Yi Shang
  • Publication number: 20040246900
    Abstract: A method is presented for a learning-based strategy utilized within message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes. The method includes determining local attributes for each of the nodes and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node. Each message transmitted over the network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type. Cost estimation is utilized to converge on an optimal message path.
    Type: Application
    Filed: June 3, 2003
    Publication date: December 9, 2004
    Applicant: Palo Alto Research Center, Incorporated
    Inventors: Ying Zhang, Markus P.J. Fromherz, Yi Shang, Sergei Vassilvitskii, Lara S. Crawford