Patents by Inventor Jeffrey B. Winner

Jeffrey B. Winner 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: 20190279230
    Abstract: In one embodiment, a social-networking system identifies a first plurality of users of the online social network, wherein the first plurality of users each share one or more user attributes, accesses, from a tracking database, tracking information of online activities of the first plurality of users with respect to a plurality of content objects, each content object having an associated stored value, calculates, for each content object, a first probability of interaction with the content object by the first plurality of users based on the accessed tracking information, calculates, for each content object, an expected value based on the associated stored value and the first probability of interaction, and sends, to a client device of a first user of the first plurality of users, one or more of the content objects based on the calculated expected values.
    Type: Application
    Filed: May 30, 2019
    Publication date: September 12, 2019
    Inventors: Jeffrey B. Winner, Nicholas Galbreath
  • Patent number: 10373173
    Abstract: Relevant content is prepared and selected for delivery to a member of a network based, in part, on prior online activities of the other members of the network, and the closeness of the member's relationship with the other members of the network. The relevant content may be an online ad, and is selected from a number of candidate online ads based on click-through rates of groups that are predefined with respect to the member and with respect to certain attributes. An online ad's revenue-generating potential may be considered in the selection process.
    Type: Grant
    Filed: June 14, 2004
    Date of Patent: August 6, 2019
    Assignee: Facebook, Inc.
    Inventors: Jeffrey B. Winner, Nicholas Galbreath
  • Publication number: 20080059447
    Abstract: A system, method and computer program product are provided. In use, feedback relating to tags associated with a plurality of profiles is received. In addition, a search query is received. Further, a subset of the profiles is identified based on the search query. The subset of the profiles is also ranked based on the feedback. Moreover, the subset of the profiles is displayed based on the ranking.
    Type: Application
    Filed: August 24, 2006
    Publication date: March 6, 2008
    Inventors: Jeffrey B. Winner, Hongche Liu, Jaideep Singh, Jatinder Bhatti
  • Patent number: 6851604
    Abstract: A computer implemented method and system for providing price updates is provided. Data is received by a system. The received data is filtered by the system to identify triggers in the received data. Actions related to identified triggers are performed by the system. Business rule compliance is performed according to a business rule hierarchy. Updated prices are provided.
    Type: Grant
    Filed: October 2, 2002
    Date of Patent: February 8, 2005
    Assignee: Demand Tec Inc.
    Inventors: Jay R. Girotto, Krishna Venkatraman, Rob Parkin, Jeffrey B. Winner, Cristos J. Goodrow
  • Publication number: 20040094616
    Abstract: A computer implemented method and system for providing price updates is provided. Data is received by a system. The received data is filtered by the system to identify triggers in the received data. Actions related to identified triggers are performed by the system. Business rule compliance is performed according to a business rule hierarchy. Updated prices are provided.
    Type: Application
    Filed: October 2, 2002
    Publication date: May 20, 2004
    Applicant: DemandTec Inc.
    Inventors: Jay R. Girotto, Krishna Venkatraman, Rob Parkin, Jeffrey B. Winner, Cristos J. Goodrow
  • Patent number: 6546364
    Abstract: A scheduling engine and an associated workflow engine may be configured to build workflows that describe sequences of tasks to be performed in a dynamically changing environment. The workflow engine may be configured to monitor the execution of the tasks within the environment and to provide the scheduling engine with information regarding deviations of task executions from the workflows. When such deviations are detected, the workflow engine may trigger the scheduling engine to rebuild the workflows for as yet uncompleted tasks. The scheduling engine may receive the information regarding the deviations via a declarative model of the physical environment. In general, the tasks may be a set of job requests to be processed in a manufacturing environment (e.g., a print shop). Also, the scheduling engine may be made up of an aggregate planner and a detailed scheduler. Aggregate plans for the jobs may be first made for the jobs and then passed to the detailed scheduler for timelining, etc.
    Type: Grant
    Filed: December 18, 1998
    Date of Patent: April 8, 2003
    Assignee: Impresse Corporation
    Inventors: Yuri V. Smirnov, Phillip C. Nelson, Jeffrey B. Winner, Yuh-Wen Soung, Cristos J. Goodrow, John L. Flight
  • Patent number: 6347256
    Abstract: A directed graph includes a first number of state nodes and a second number of task nodes. The task nodes are interconnected with the state nodes to define one or more paths through the directed graph, each of the paths including an alternating series of one or more of the state nodes and one or more of the task nodes. Thus, any predecessor state node in one of the paths represents a precondition for a subsequent task node along that path. Further, any following state node of that task node represents a result of applying one or more actions that correspond to the task node. The state nodes may be virtual representations of inventory items of a manufacturing environment. Thus, collectively the state nodes may define a bill of materials for the manufacturing environment. Similarly, the task nodes may each define a virtual representation of a manufacturing process within the manufacturing environment. In other words, the task nodes may collectively define routings for the manufacturing environment.
    Type: Grant
    Filed: November 2, 1998
    Date of Patent: February 12, 2002
    Assignee: printCafe System, Inc.
    Inventors: Yuri V. Smirnov, Phillip C. Nelson, Jeffrey B. Winner, Yuh-Wen Soung, John L. Flight
  • Patent number: 6321133
    Abstract: An order promising scheme includes the ability to query a hierarchical scheduling module configured to generate workflows for a series of jobs to be processed in a manufacturing environment to determine the earliest reasonable completion time for one or more additional jobs to be processed in the manufacturing environment. The querying may involve first querying an aggregate planning level of the hierarchical scheduling module to determine whether the one or more additional jobs may be processed. Further, the querying may require querying a detailed scheduling level of the hierarchical scheduling module to determine whether the one or more additional jobs may be processed in the event that the aggregate planning level returns a negative reply to the first query by the order promising module. The querying of the hierarchical scheduling module may be performed in response to user inquiries submitted via a user interface.
    Type: Grant
    Filed: December 4, 1998
    Date of Patent: November 20, 2001
    Assignee: Impresse Corporation
    Inventors: Yuri V. Smirnov, Phillip C. Nelson, Jeffrey B. Winner, Cristos J. Goodrow
  • Patent number: 6279009
    Abstract: A workflow generated from a declarative model of a real world process represents the procedural steps to accomplish the process. In one embodiment, the declarative model may include a first number of state nodes and a second number of task nodes interconnected with the state nodes. In such cases, generating a workflow may be accomplished by choosing one of a number of paths through the model, each of the paths comprising an alternating series of one or more of the state nodes and one or more of the task nodes with any predecessor state node in one of the paths representing a precondition for a subsequent task node along the one of the paths and any following state node of the subsequent task node along the one of the paths representing a result of applying one or more actions that correspond to that task node. As part of a computer assisted scheduling system, the model may be configured to receive updates reflecting changes in the real-world manufacturing environment.
    Type: Grant
    Filed: December 4, 1998
    Date of Patent: August 21, 2001
    Assignee: Impresse Corporation
    Inventors: Yuri V. Smirnov, Phillip C. Nelson, Jeffrey B. Winner, Yuh-Wen Soung, Cristos J. Goodrow
  • Patent number: 6278901
    Abstract: An aggregate plan for a set of job requests to be processed in a manufacturing environment may be produced given capacities for resources of the manufacturing environment, the capacities being represented by bins in multiple dimensions, some of which may be used by the jobs on an alternative basis. In such a scheme, producing the aggregate plan may be accomplished by selecting a subset of the job requests according to a procedure for packing the bins. For example, packing the bins may be accomplished by selecting from among ordered lists of the job requests grouped according to costs for one or more of the resources. The ordered lists of job requests may be ordered in terms of value. In some cases, at least some of the job requests may have different values versus cost for different ones of the resources. Each alternative be represented as a separate bin.
    Type: Grant
    Filed: December 18, 1998
    Date of Patent: August 21, 2001
    Assignee: Impresse Corporation
    Inventors: Jeffrey B. Winner, Phillip C. Nelson, Cristos J. Goodrow