Patents by Inventor Anthony F. Bernard

Anthony F. Bernard 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: 20140164163
    Abstract: An importable electronic template and methods of creating and utilizing the importable template. The template includes an alphanumeric field created by a template creation entity and a response field created by the template creation entity. Data is electronically entered into the response field by a responding entity. The importable electronic template is incorporated into a general purpose electronic template.
    Type: Application
    Filed: September 6, 2013
    Publication date: June 12, 2014
    Applicant: Ariba, Inc.
    Inventors: Anthony F. Bernard, Timothy P. Choate, Godwin Gonsalvez, Dejan Sundeic
  • Publication number: 20120303401
    Abstract: Enterprise systems, methods and computer program products are disclosed for facilitating a flexible assignment of tasks to work item queues according to assignment rules and conditions for a business document. The system comprises associating an application object server response to a client workflow form or control, associating an expression to an assignment rule or condition with the work item queue and creating a default work item queue for an expression or series of ordered expressions that do not evaluate true. During runtime, the flexible workflow task assignment process evaluates the sequence of ordered expressions for a given work item queue until no next expression is to be evaluated and assigning the task to the default work item queue.
    Type: Application
    Filed: May 27, 2011
    Publication date: November 29, 2012
    Applicant: MICROSOFT CORPORATION
    Inventors: Karl E. Tolgu, Babak Nakhayi Ashtiani, Ramesh Gururaja, Anthony F. Bernard, Josh Honeyman, Sukumar Rathnam
  • Patent number: 8095451
    Abstract: An auction methodology wherein individual demands are bid in lots and an aggregation of several lots is then run as an individual lot to determine if the buyer can attract a lower price offering from bidders by selecting to award the total volume of all of the individual lots to one bidder. A bidder-specific transformation factor for the aggregate lot is computed by combining selected transformed values (one for each lot) that take into account that bidder's price offerings for individual lots and the buyer-specified transformation factors for that bidder. Each bidder is then invited to bid a discount percentage for the aggregate lot. This discount percentage is then used along with the bidder-specific transformation factor to generate that bidder's transformed value for the aggregate lot. The bidder with the lowest transformed value for the aggregate lot may be selected as the winning bidder.
    Type: Grant
    Filed: August 30, 2007
    Date of Patent: January 10, 2012
    Assignee: Ariba, Inc.
    Inventors: Christopher J. Smith, Anthony F. Bernard, William D. Rupp
  • Patent number: 7921053
    Abstract: An auction is conducted by obtaining, from a buyer, information associated with a product to be purchased using an auction, where the buyer purchases the product from a winning bidder. The obtained information associated with the product is made available to at least a first bidder and a second bidder. A first bid that includes a first price and a first non-price information is received from the first bidder. A second bid that includes a second price and a second non-price information is received, from the second bidder. Non-price information is associated with (1) a description of a particular product a given bidder will provide in the event the given bidder wins the auction and/or (2) delivery of a product by the given bidder in the event the given bidder wins the auction. A first comparison value is generated based at least in part on the first price and the first non-price information. A second comparison value is generated based at least in part on the second price and the second non-price information.
    Type: Grant
    Filed: June 1, 2007
    Date of Patent: April 5, 2011
    Assignee: Ariba, Inc.
    Inventors: Sam E. Kinney, Jr., Vincent F. Rago, Glen T. Meakem, Robert G. Stevens, David J. Becker, Anthony F. Bernard, William D. Rupp, Daniel C. Heckmann, Julia L. Rickert, Shane M. Tulloch, Jennifer L. Riddle, Nikki A. Sikes, John P. Levis, III
  • Patent number: 7813966
    Abstract: Controlling overtime in an auction is disclosed. A first time interval and a second time interval are defined. A first closing time for a first lot is also defined. A first bid is received for the first lot. A second bid is received for the first lot. A correlation between the second bid and the first bid is determined. The first closing time is extended using the second time interval if the correlation between the second bid and the first bid satisfies a trigger criterion. The trigger criterion is selected from a group consisting of a rank behind market and a quantity behind market.
    Type: Grant
    Filed: October 31, 2007
    Date of Patent: October 12, 2010
    Assignee: Ariba, Inc.
    Inventors: Marc Alaia, David J. Becker, Anthony F. Bernard, Daniel C. Heckmann, Sam E. Kinney, Jr., Glen T. Meakem, Vincent F. Rago, Jason Reneau, Frederick W. Roberts, William D. Rupp, Robert G. Stevens
  • Patent number: 7792707
    Abstract: Control of overtime in an auction is disclosed. A first time interval, a second time interval, and a first closing time for a first lot are defined. It is determined that at least one new bid for the first lot is received during the first time interval. The new bid is received close to the first closing time. The first closing time is extended using the second time interval if the correlation between the new bid and the at least one other bid satisfies a trigger criterion that is based on a rank of the new bid and the at least one other bid.
    Type: Grant
    Filed: October 11, 2007
    Date of Patent: September 7, 2010
    Assignee: Ariba, Inc.
    Inventors: Marc Alaia, David J. Becker, Anthony F. Bernard, Daniel C. Heckmann, Sam E. Kinney, Jr., Glen T. Meakem, Vincent F. Rago, Jason W. Reneau, Frederick W. Roberts, William D. Rupp, Robert G. Stevens
  • Patent number: 7599878
    Abstract: A method of conducting an auction in at least two rounds is disclosed. The method includes conducting the first auction round, applying a rule to an occurrence in the first auction round, and conducting the second auction round in accordance with the application of the rule to the occurrence in the first auction round. A system for conducting an auction in at least two rounds is also disclosed. The system includes a sponsor processor, a first bidder processor communicating with the sponsor processor, and a second bidder processor communicating with the sponsor processor. In the system, the sponsor processor contains instructions which, when executed by the processor, cause the processor to conduct the first auction round, apply a rule to an occurrence in the first auction round, and conduct a second auction round in accordance with the applied rule.
    Type: Grant
    Filed: December 29, 2000
    Date of Patent: October 6, 2009
    Assignee: Ariba, Inc.
    Inventors: Scott W. Atkinson, Anthony F. Bernard, William D. Rupp, Daniel C. Heckmann, Vincent F. Rago
  • Patent number: 7571137
    Abstract: A method and system for conducting electronic auctions is described. A dynamic lot closing extension feature avoids collisions in closing times of multiple lots by dynamically extending the closing time of a subsequent lot if a preceding lot's closing time is extended to be too close to the subsequent lot's then-currently scheduled closing time. Scheduled closing times can be extended with a flexible overtime feature, in which the properties of the event triggering the extension and the duration of the overtime period(s) can be tailored to a particular auction, particular lots of products within an auction, and to the particular time within an auction process. The bidding status of a lot can be set to a “pending” status after the nominal closing time for submission of bids to allow bidders to alert the auction coordinator of technical problems in submission of bids. This allows the possibility for a lot to be return to open status for further bidding by all bidders.
    Type: Grant
    Filed: October 31, 2007
    Date of Patent: August 4, 2009
    Assignee: Ariba, Inc.
    Inventors: Marc Alaia, David J. Becker, Anthony F. Bernard, Daniel C. Heckmann, Sam E. Kinney, Jr., Glen T. Meakem, Vincent F. Rago, Jason W. Reneau, Frederick W. Roberts, William D. Rupp, Robert G. Stevens
  • Patent number: 7558746
    Abstract: Information about a first lot and a second lot is displayed. The information includes a first closing time for the first lot, and a second closing time for the second lot. The second closing time is later than the first closing time. Responsive to the receipt of a bid for the first lot within a first predefined timer interval of the first closing time, an updated first closing time for the first lot is determined. The updated first closing time is displayed. If the updated first closing time is less than a second predefined time interval from the second closing time, an updated second closing time is displayed.
    Type: Grant
    Filed: August 7, 2006
    Date of Patent: July 7, 2009
    Assignee: Ariba, Inc.
    Inventors: Marc Alaia, David J. Becker, Anthony F. Bernard, Daniel C. Heckmann, Sam E. Kinney, Jr., Glen T. Meakem, Vincent F. Rago, Jason Reneau, Frederick W. Roberts, William D. Rupp, Robert G. Stevens
  • Patent number: 7444299
    Abstract: An auction methodology wherein individual demands are bid in lots and an aggregation of several lots is then run as an individual lot to determine if the buyer can attract a lower price offering from bidders by selecting to award the total volume of all of the individual lots to one bidder. A bidder-specific transformation factor for the aggregate lot is computed by combining selected transformed values (one for each lot) that take into account that bidder's price offerings for individual lots and the buyer-specified transformation factors for that bidder. Each bidder is then invited to bid a discount percentage for the aggregate lot. This discount percentage is then used along with the bidder-specific transformation factor to generate that bidder's transformed value for the aggregate lot. The bidder with the lowest transformed value for the aggregate lot may be selected as the winning bidder.
    Type: Grant
    Filed: August 30, 2007
    Date of Patent: October 28, 2008
    Assignee: Ariba, Inc.
    Inventors: Christopher J. Smith, Anthony F. Bernard, William D. Rupp
  • Publication number: 20080162330
    Abstract: A method of conducting an auction in at least two rounds is disclosed. The method includes conducting the first auction round, applying a rule to an occurrence in the first auction round, and conducting the second auction round in accordance with the application of the rule to the occurrence in the first auction round. A system for conducting an auction in at least two rounds is also disclosed. The system includes a sponsor processor, a first bidder processor communicating with the sponsor processor, and a second bidder processor communicating with the sponsor processor. In the system, the sponsor processor contains instructions which, when executed by the processor, cause the processor to conduct the first auction round, apply a rule to an occurrence in the first auction round, and conduct a second auction round in accordance with the applied rule.
    Type: Application
    Filed: October 30, 2007
    Publication date: July 3, 2008
    Inventors: Scott W. Atkinson, Anthony F. Bernard, William D. Rupp, Daniel C. Heckmann, Vincent F. Rago
  • Publication number: 20080162332
    Abstract: A method and system for conducting electronic auctions is described. A dynamic lot closing extension feature avoids collisions in closing times of multiple lots by dynamically extending the closing time of a subsequent lot if a preceding lot's closing time is extended to be too close to the subsequent lot's then-currently scheduled closing time. Scheduled closing times can be extended with a flexible overtime feature, in which the properties of the event triggering the extension and the duration of the overtime period(s) can be tailored to a particular auction, particular lots of products within an auction, and to the particular time within an auction process. The bidding status of a lot can be set to a “pending” status after the nominal closing time for submission of bids to allow bidders to alert the auction coordinator of technical problems in submission of bids. This allows the possibility for a lot to be return to open status for further bidding by all bidders.
    Type: Application
    Filed: October 31, 2007
    Publication date: July 3, 2008
    Inventors: Marc Alaia, David J. Becker, Anthony F. Bernard, Daniel C. Heckmann, Sam E. Kinney, Glen T. Meakem, Vincent F. Rago, Jason W. Reneau, Frederick W. Roberts, William D. Rupp, Robert G. Stevens
  • Patent number: 7395238
    Abstract: A method and system for conducting electronic auctions is described. A dynamic lot closing extension feature avoids collisions in closing times of multiple lots by dynamically extending the closing time of a subsequent lot if a preceding lot's closing time is extended to be too close to the subsequent lot's then-currently scheduled closing time. Scheduled closing times can be extended with a flexible overtime feature, in which the properties of the event triggering the extension and the duration of the overtime period(s) can be tailored to a particular auction, particular lots of products within an auction, and to the particular time within an auction process. The bidding status of a lot can be set to a “pending” status after the nominal closing time for submission of bids to allow bidders to alert the auction coordinator of technical problems in submission of bids. This allows the possibility for a lot to be return to open status for further bidding by all bidders.
    Type: Grant
    Filed: April 11, 2001
    Date of Patent: July 1, 2008
    Assignee: Ariba, Inc.
    Inventors: Marc Alaia, David J. Becker, Anthony F. Bernard, Daniel C. Heckmann, Sam E. Kinney, Jr., Glen T. Meakem, Vincent F. Rago, Jason Reneau, Frederick W. Roberts, William D. Rupp, Robert G. Stevens
  • Publication number: 20080154763
    Abstract: A first lot and a second lot are presented to a plurality of bidders in a multi-lot electronic auction between an originator and the plurality of bidders. A closing time of the first lot precedes a closing time of the second lot. Bids are received from the plurality of bidders for the first lot. A closing time of the first lot is extended by an incremental amount of time upon an occurrence of an overtime trigger. If the difference in time between the extended closing time of the first lot precedes a closing time of the second lot by less than a minimum time interval, the closing time of the second lot is extended by the incremental amount of time.
    Type: Application
    Filed: October 30, 2007
    Publication date: June 26, 2008
    Inventors: Marc Alaia, David J. Becker, Anthony F. Bernard, Daniel C. Heckmann, Sam E. Kinney, Glen T. Meakem, Vincent F. Rago, Jason W. Reneau, Frederick W. Roberts, William D. Rupp, Robert G. Stevens
  • Publication number: 20080147533
    Abstract: A method and system for conducting electronic auctions is described. A dynamic lot closing extension feature avoids collisions in closing times of multiple lots by dynamically extending the closing time of a subsequent lot if a preceding lot's closing time is extended to be too close to the subsequent lot's then-currently scheduled closing time. Scheduled closing times can be extended with a flexible overtime feature, in which the properties of the event triggering the extension and the duration of the overtime period(s) can be tailored to a particular auction, particular lots of products within an auction, and to the particular time within an auction process. The bidding status of a lot can be set to a “pending” status after the nominal closing time for submission of bids to allow bidders to alert the auction coordinator of technical problems in submission of bids. This allows the possibility for a lot to be return to open status for further bidding by all bidders.
    Type: Application
    Filed: October 31, 2007
    Publication date: June 19, 2008
    Inventors: Marc Alaia, David J. Becker, Anthony F. Bernard, Daniel C. Heckmann, Sam E. Kinney, Glen T. Meakem, Vincent F. Rago, Jason W. Reneau, Frederick W. Roberts, William D. Rupp, Robert G. Stevens
  • Publication number: 20080133377
    Abstract: A method and system for conducting electronic auctions is described. A dynamic lot closing extension feature avoids collisions in closing times of multiple lots by dynamically extending the closing time of a subsequent lot if a preceding lot's closing time is extended to be too close to the subsequent lot's then-currently scheduled closing time. Scheduled closing times can be extended with a flexible overtime feature, in which the properties of the event triggering the extension and the duration of the overtime period(s) can be tailored to a particular auction, particular lots of products within an auction, and to the particular time within an auction process. The bidding status of a lot can be set to a “pending” status after the nominal closing time for submission of bids to allow bidders to alert the auction coordinator of technical problems in submission of bids. This allows the possibility for a lot to be return to open status for further bidding by all bidders.
    Type: Application
    Filed: October 11, 2007
    Publication date: June 5, 2008
    Inventors: Marc Alaia, David J. Becker, Anthony F. Bernard, Daniel C. Heckmann, Sam E. Kinney, Glen T. Meakem, Vincent F. Rago, Jason W. Reneau, Frederick W. Roberts, William D. Rupp, Robert G. Stevens
  • Patent number: 7346574
    Abstract: An auction methodology wherein individual demands are bid in lots and an aggregation of several lots is then run as an individual lot to determine if the buyer can attract a lower price offering from bidders by selecting to award the total volume of all of the individual lots to one bidder. A bidder-specific transformation factor for the aggregate lot is computed by combining selected transformed values (one for each lot) that take into account that bidder's price offerings for individual lots and the buyer-specified transformation factors for that bidder. Each bidder is then invited to bid a discount percentage for the aggregate lot. This discount percentage is then used along with the bidder-specific transformation factor to generate that bidder's transformed value for the aggregate lot. The bidder with the lowest transformed value for the aggregate lot may be selected as the winning bidder.
    Type: Grant
    Filed: September 6, 2001
    Date of Patent: March 18, 2008
    Assignee: Ariba, Inc.
    Inventors: Christopher J. Smith, Anthony F. Bernard, William D. Rupp
  • Patent number: 7283980
    Abstract: A method and system for conducting electronic auctions is described. A dynamic lot closing extension feature avoids collisions in closing times of multiple lots by dynamically extending the closing time of a subsequent lot if a preceding lot's closing time is extended to be too close to the subsequent lot's then-currently scheduled closing time. Scheduled closing times can be extended with a flexible overtime feature, in which the properties of the event triggering the extension and the duration of the overtime period(s) can be tailored to a particular auction, particular lots of products within an auction, and to the particular time within an auction process. The bidding status of a lot can be set to a “pending” status after the nominal closing time for submission of bids to allow bidders to alert the auction coordinator of technical problems in submission of bids. This allows the possibility for a lot to be return to open status for further bidding by all bidders.
    Type: Grant
    Filed: April 9, 2001
    Date of Patent: October 16, 2007
    Assignee: Ariba, Inc.
    Inventors: Marc Alaia, David J. Becker, Anthony F. Bernard, Daniel C. Heckmann, Sam E. Kinney, Jr., Glen T. Meakem, Vincent F. Rago, Jason Reneau, Frederick W. Roberts, William D. Rupp, Robert G. Stevens
  • Patent number: 7249085
    Abstract: A method and system for conducting electronic online auctions using multi-parameter price equalization bidding is disclosed. Bids defined in a context of a bidder are transformed into a comparative bid parameter that enables a common basis of comparison for the submitted bids. A transformed bid of a first bidder can also be detransformed into a context of a second bidder, thereby enabling each individual bidder to view a comparison of submitted bids in their own context.
    Type: Grant
    Filed: March 31, 1999
    Date of Patent: July 24, 2007
    Assignee: Ariba, Inc.
    Inventors: Sam E. Kinney, Jr., Vincent F. Rago, Glen T. Meakem, Robert G. Stevens, David J. Becker, Anthony F. Bernard, William D. Rupp, Daniel C. Heckmann, Julia L. Rickert, Shane M. Tulloch, Jennifer L. Riddle, Nikki A. Sikes, John P. Levis, III
  • Patent number: 7152043
    Abstract: A method and system for conducting electronic auctions is described. A dynamic lot closing extension feature avoids collisions in closing times of multiple lots by dynamically extending the closing time of a subsequent lot if a preceding lot's closing time is extended to be too close to the subsequent lot's then-currently scheduled closing time. In one embodiment, scheduled closing times can be extended with a flexible overtime feature, in which the properties of the event triggering the extension and the duration of the overtime period(s) can be tailored to a particular auction, particular lots of products within an auction, and to the particular time within an auction process.
    Type: Grant
    Filed: April 11, 2001
    Date of Patent: December 19, 2006
    Assignee: Ariba, Inc.
    Inventors: Marc Alaia, David J. Becker, Anthony F. Bernard, Daniel C. Heckmann, Sam E. Kinney, Jr., Glen T. Meakem, Vincent F. Rago, Jason Reneau, Frederick W. Roberts, William D. Rupp, Robert G. Stevens