Patents by Inventor Erik Vee

Erik Vee 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: 9556440
    Abstract: The present invention concerns a method of producing a desired gene product in a recombinant gene expression system, said method comprising expressing said gene from a Pm promoter-based expression system using at least two mutant elements selected from: (i) a mutant Pm promoter; (ii) a mutant mRNA leader; and (iii) a mutant XyIS; wherein said mutant elements each comprise one or more mutations which enhance expression of said desired gene. Particularly combinations of a mutant Pm promoter and a mutant mRNA leader are concerned. Isolated nucleic acid molecules, vectors, host cells, libraries, expression systems, methods of enhancing expression, obtaining nucleic acid molecules and identifying combination mutants which enhance expression, artificially constructed operons and their uses are also encompassed.
    Type: Grant
    Filed: December 20, 2007
    Date of Patent: January 31, 2017
    Assignee: VECTRON BIOSOLUTIONS AS
    Inventors: Rahmi Lale, Laila Berg, Ingrid Bakke, Trond Erik Vee Aune, Svein Valla
  • Publication number: 20150348086
    Abstract: Methods and systems are disclosed which allow shifting inventory to fulfill guaranteed delivery advertisement contracts. Inventory may be allocated from a supply of unallocated inventory to one or more advertisers in accordance with guaranteed delivery agreements. Inventory may be reserved for the one or more advertisers from the remaining supply of unallocated inventory. Inventory may then be allocated to an additional advertiser by using unallocated inventory or shifted inventory, or a combination of unallocated inventory and shifted inventory. The shifted inventory is shifted out of the allocation for the first advertiser and the shifted inventory is replaced by the reserve inventory for the respective advertiser.
    Type: Application
    Filed: August 12, 2015
    Publication date: December 3, 2015
    Applicant: YAHOO! INC.
    Inventors: Erik Vee, Dongni Chen, Peiji Chen, Satyen Kale, Srinath Mandalapu, Chandrashekhar Nagarajan
  • Patent number: 9135632
    Abstract: Methods and systems are disclosed which allow shifting inventory to fulfill guaranteed delivery advertisement contracts. Inventory may be allocated from a supply of unallocated inventory to one or more advertisers in accordance with guaranteed delivery agreements. Inventory may be reserved for the one or more advertisers from the remaining supply of unallocated inventory. Inventory may then be allocated to an additional advertiser by using unallocated inventory or shifted inventory, or a combination of unallocated inventory and shifted inventory. The shifted inventory is shifted out of the allocation for the first advertiser and the shifted inventory is replaced by the reserve inventory for the respective advertiser.
    Type: Grant
    Filed: December 28, 2011
    Date of Patent: September 15, 2015
    Assignee: Yahoo! Inc.
    Inventors: Erik Vee, Dongni Chen, Peiji Chen, Satyen Kale, Srinath Mandalapu, Chandrashekhar Nagarajan
  • Patent number: 8896604
    Abstract: A computer implemented system produces an optimization graph in an online advertising system. The system presents at a computer, a supply of advertising inventory and advertising demand contracts, where each advertising inventory is presented as a supply node and each advertising demand contract is presented as a demand node. The system processes the supply of advertising inventory and the advertising demand contracts. For example, the system partitions the supply nodes into supply partitions and determines whether each supply node is eligible for each demand node. In addition, the system determines the number of eligible supply nodes to be drawn from each supply partition for each demand node.
    Type: Grant
    Filed: January 29, 2010
    Date of Patent: November 25, 2014
    Assignee: Yahoo! Inc.
    Inventors: Sumanth Jagannath, Jason Zien, Javavel Shanmugasundaram, Erik Vee
  • Patent number: 8893131
    Abstract: In a large-scale transaction such as the bulk loading of new records into an ordered, distributed database, a transaction limit such as an insert limit may be chosen, partitions on overfull storage servers may be designated to be moved to underfull storage servers, and the move assignments may be based, at least in part on the degree to which a storage server is underfull and the move and insertion costs of the partitions to be moved.
    Type: Grant
    Filed: April 11, 2008
    Date of Patent: November 18, 2014
    Assignee: Yahoo! Inc.
    Inventors: Raghu Ramakrishnan, Erik Vee, Ramana Yerneni, Utkarsh Srivastava, Brian Frank Cooper, Adam Silberstein
  • Publication number: 20140019232
    Abstract: Techniques are described herein for using an impression-trend technique to provide a display advertising supply forecast. A display advertising supply forecast is an estimate of a number of impressions, which are to occur in a future time period, that have specified attribute values. For example, the specified attribute values may be descriptive of impressions with respect to which an advertiser wishes to place ads. An impression-trend technique is a forecasting technique that uses trends regarding past impressions to forecast a number of future impressions that have specified attribute values. The past impressions include attribute values that are related to the specified attribute values.
    Type: Application
    Filed: September 19, 2013
    Publication date: January 16, 2014
    Applicant: Yahoo! Inc.
    Inventors: Erik Vee, Jayavel Shanmugasundaram, Long Ji Lin, Peiji Chen, Datong Chen, Qi He
  • Publication number: 20140006144
    Abstract: The present application relates to systems and computer-implemented methods for calculating a suggested reserve price associated with an opportunity to realize an online advertisement. In some implementations, data associated with historical online advertisement auctions are clustered based on a reference opportunity for realizing an online advertisement, wherein each historical online advertisement auction of the cluster is associated with a first bid price of higher value and a second bid price of lower value; a dominance relationship between a distribution of the first bid prices of the cluster and a distribution of the second bid prices of the cluster is determined; a reserve price associated with the cluster based on the dominance relationship is calculated; and the reserve price is stored as a suggested reserve price to realize an online advertisement, wherein the suggested reserve price is associated with the reference opportunity that is associated with the cluster.
    Type: Application
    Filed: June 29, 2012
    Publication date: January 2, 2014
    Applicant: Yahoo Inc.
    Inventors: David Pardoe, Patrick R. Jordan, Prabhakar Krishnamurthy, Sergei Vassilvitskii, Erik Vee
  • Patent number: 8554621
    Abstract: Techniques are described herein for using an impression-trend technique to provide a display advertising supply forecast. A display advertising supply forecast is an estimate of a number of impressions, which are to occur in a future time period, that have specified attribute values. For example, the specified attribute values may be descriptive of impressions with respect to which an advertiser wishes to place ads. An impression-trend technique is a forecasting technique that uses trends regarding past impressions to forecast a number of future impressions that have specified attribute values. The past impressions include attribute values that are related to the specified attribute values.
    Type: Grant
    Filed: March 17, 2010
    Date of Patent: October 8, 2013
    Assignee: Yahoo! Inc.
    Inventors: Erik Vee, Jayavel Shanmugasundaram, Long Ji Lin, Peiji Chen, Datong Chen, Qi He
  • Publication number: 20130246161
    Abstract: Systems and methods for adjusting online ads delivery pace derive, in a computer system, a current impression delivery for an ads display contract. A plurality of estimation bands are delivered corresponding to over delivery and under delivery for the ads display contract. A relative distance is determined between the current impression delivery and the plurality of estimation bands. An adjustment factor is selected according to the relative distance. The adjustment factor is sent to a database.
    Type: Application
    Filed: March 16, 2012
    Publication date: September 19, 2013
    Applicant: Yahoo! Inc.
    Inventors: Jason Zien, Erik Vee, Sergei Vassilvitskii, Srinath Mandalapu, Marco Manfai Yu, Peiji Chen, Chandrashekhar Nagarajan, Wenjing Ma
  • Publication number: 20130173384
    Abstract: Methods and systems are disclosed which allow shifting inventory to fulfill guaranteed delivery advertisement contracts. Inventory may be allocated from a supply of unallocated inventory to one or more advertisers in accordance with guaranteed delivery agreements. Inventory may be reserved for the one or more advertisers from the remaining supply of unallocated inventory. Inventory may then be allocated to an additional advertiser by using unallocated inventory or shifted inventory, or a combination of unallocated inventory and shifted inventory. The shifted inventory is shifted out of the allocation for the first advertiser and the shifted inventory is replaced by the reserve inventory for the respective advertiser.
    Type: Application
    Filed: December 28, 2011
    Publication date: July 4, 2013
    Applicant: Yahoo! Inc.
    Inventors: Erik Vee, Dongni Chen, Peiji Chen, Satyen Kale, Srinath Mandalapu, Chandrashekhar Nagarajan
  • Publication number: 20130166395
    Abstract: The present application provides systems and corresponding methods for creating a delivery allocation plan in a network-based environment. The methods may include receiving and storing advertising contracts and data related to the advertising contracts; constructing a bipartite graph based on the received contract data; annotating each demand node; and receiving impression data and other eligible contract data. Thereafter, the method may include for each impression, calculating a first supply value and for each contract, calculating a first demand value. The first demand value may be used to calculate a second supply value and a delivery allocation may be calculated using the second supply value and the second demand value for each contract.
    Type: Application
    Filed: December 21, 2011
    Publication date: June 27, 2013
    Inventors: Sergei Vassilvitskii, Chandrashekhar Nagarajan, Peiji Chen, Jian Yang, John Tomlin, Vijay Bharadwaj, Erik Vee, WenJing Ma
  • Publication number: 20130085868
    Abstract: A system and method for calculating an effective bid per impression are disclosed. The system and method may receive a price per conversion bid of an advertiser and information from at least one user. The information may comprise a user state of the user. In some embodiments, the user state may comprise a number of times that the user has previously viewed the advertisement. The user state may be input into a user behavioral model to determine predictive values of the user behavior. An effective bid per impression may then be calculated based on the predictive values of the user and the advertiser's bid per conversion.
    Type: Application
    Filed: October 3, 2011
    Publication date: April 4, 2013
    Inventors: Patrick Jordan, Mohammad Mahdian, Sergey Vassilvitskii, Erik Vee
  • Patent number: 8311885
    Abstract: An advertisement impression distribution system includes a data processing system operable to generate an allocation plan for serving advertisement impressions. The allocation plan allocates a first portion of advertisement impressions to satisfy guaranteed demand and a second portion of advertisement impressions to satisfy nonguaranteed demand. The data processing system includes an optimizer configured to establish a relationship between the first portion of advertisement impressions and the second portion of advertisement impressions. The relationship defines a range of proportions of allocation of the first portion and the second portion. The optimizer generates a solution maximizing guaranteed demand fairness, non-guaranteed demand revenue, and click value. The solution identifies a determined proportion of the first portion of advertisement impressions to serve and a determined proportion of the second portion of advertisement impressions to serve.
    Type: Grant
    Filed: October 30, 2009
    Date of Patent: November 13, 2012
    Assignee: Yahoo! Inc.
    Inventors: Oliver Kennedy, Tasos Anastasakos, Jianchang Mao, Erik Vee, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Jian Yang, John Tomlin
  • Patent number: 8229933
    Abstract: An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory. Implementation of the contract index includes retrieval techniques to support multi-valued predicates as well as confidence threshold functions using a multi-level tree representation of multi-valued predicates.
    Type: Grant
    Filed: February 26, 2010
    Date of Patent: July 24, 2012
    Assignee: Yahoo! Inc.
    Inventors: Marcus Fontoura, Suhas Sadanandan, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Srihari Venkatesan, Jason Zien
  • Publication number: 20120166259
    Abstract: A system and method for adjusting demand parameters to produce an optimized allocation plan for delivering a plurality of impressions to a plurality of contracts for display advertising. The method commences upon receiving a first eligibility graph, the first eligibility graph comprising a plurality of impressions, a plurality of contracts and at least one first demand parameter. For reducing errors in sampling that affect the eligibility graph, demand parameters contained within the first eligibility graph are adjusted, resulting in an adjusted first eligibility graph. Once the adjusted first eligibility graph is available, a network solver is used for solving the adjusted first eligibility graph to produce an adjusted allocation plan, which adjusted allocation plan is used for displaying at least one of the plurality of impressions.
    Type: Application
    Filed: December 28, 2010
    Publication date: June 28, 2012
    Inventors: WenJing Ma, Ramana Yerneni, Erik Vee, Sumanth Jagannath, Jayavel Shanmugasundaram, Chandrashekar Nagarajan, Srinath Mandalapu
  • Publication number: 20120158495
    Abstract: A network based advertisement system includes a supply forecasting system configured to select, from a campaign log database, data that defines a plurality of contracts. Each contract specifies requirements that include contract target audience information and a number of impressions. For each contract, the supply forecasting system identifies one or more opportunity samples with characteristics that match contract target audience information of the contract. Each opportunity sample is associated with a weight that corresponds to a number of opportunities with similar characteristics. An optimizer associates the opportunity samples with the contract and then determines whether the opportunity samples are associated with other contracts. The optimizer then limits the number of opportunities associated with the samples that are allocatable to the contract based at least in part on a function of requirements of other contracts associated with the one or more samples.
    Type: Application
    Filed: December 20, 2010
    Publication date: June 21, 2012
    Inventors: Jayavel Shanmugasundaram, Datong Chen, Sumanth Jagannath, Erik Vee, Ramana Yerneni
  • Publication number: 20120004957
    Abstract: Methods, systems, and apparatuses for generating supply forecasts for advertisement impressions are provided. Supply forecasts for future advertisement inventory are enabled to be determined that match attribute values received from a requester in a query or “contract.” Such supply forecasts may be determined based on cumulative or non-cumulative supply forecast values, and may be determined based on time series of supply forecast values for individual impressions or for blocks of impressions.
    Type: Application
    Filed: July 2, 2010
    Publication date: January 5, 2012
    Applicant: YAHOO! INC.
    Inventors: Datong Chen, Erik Vee, Jayanth Anandaram, Qi He, Jayavel Shanmugasundaram, Peiji Chen
  • Publication number: 20110270676
    Abstract: A computer-implemented method and display advertising server network for serving impression opportunities to a frequency-capped guaranteed delivery contract in a system for delivery of display advertising to a user. The method includes steps for receiving, from a computer, an event predicate and a user ID corresponding to the user, retrieving, from an index engine, a set of eligible frequency-capped contracts, wherein an eligible contract comprises at least one target predicate matching at least a portion of the event predicate, and probabilistically selecting for serving, in a computer, the booked contract having a frequency cap specification, only when the selected frequency-capped contract can be served to the user without violating the frequency cap specification.
    Type: Application
    Filed: April 30, 2010
    Publication date: November 3, 2011
    Inventors: Sergei Vassilvitskii, Jayavel Shanmugasundaram, Sumanth Jagannath, Erik Vee, Martin Zinkevich
  • Publication number: 20110246307
    Abstract: A computer-implemented Internet advertising method for serving impression opportunities in a system for delivery of display advertising. The likelihood that a booked contract could be served by a future forecasted user visit is calculated as a probability mass, and associated with the booked contract. The relative sizes of the probability masses of a plurality of eligible contracts is used as a selector in conjunction with a selected pseudo-random number. In exemplary embodiments, a server is configured for receiving an event predicate as a result of a user visit to a web site. Based on the received event predicate, a set of eligible contracts is assembled. Each eligible contract is assigned to exactly one interval selected from a range, the size of the interval corresponding to the probability mass of the eligible contract. The generated pseudo-random number is used for selecting an interval, which operation selects an eligible advertisement for display.
    Type: Application
    Filed: March 31, 2010
    Publication date: October 6, 2011
    Inventors: Martin Zinkevich, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee
  • Publication number: 20110231248
    Abstract: Techniques are described herein for using an impression-trend technique to provide a display advertising supply forecast. A display advertising supply forecast is an estimate of a number of impressions, which are to occur in a future time period, that have specified attribute values. For example, the specified attribute values may be descriptive of impressions with respect to which an advertiser wishes to place ads. An impression-trend technique is a forecasting technique that uses trends regarding past impressions to forecast a number of future impressions that have specified attribute values. The past impressions include attribute values that are related to the specified attribute values.
    Type: Application
    Filed: March 17, 2010
    Publication date: September 22, 2011
    Applicant: YAHOO! INC.
    Inventors: Erik Vee, Jayavel Shanmugasundaram, Long Ji Lin, Peiji Chen, Datong Chen, Qi He