Patent application number | Description | Published |
20100250527 | SPONSORED SEARCH RESULTS RE-RANKING BASED ON LINKING ASSOCIATIONS - A computer-implemented system and methods of re-ranking sponsored search results by a search engine in response to a search query include: retrieving one or more organic search results and a plurality of sponsored search results (“search results”), along with their respective rankings, associated with a search query; determining a degree of association between each sponsored search result and the other search results through analyzing web links between the search results and other web documents to or from which the search results are at least indirectly linked; calculating a clustering score for each sponsored search result based on their respective degrees of linking association; generating a new ranking score for each sponsored search result based on their respective clustering scores and rankings; and re-ranking, and storing in memory, the plurality of sponsored search results based on the new ranking scores of each respective sponsored search result. | 09-30-2010 |
20110047027 | SYSTEM AND METHOD FOR DETERMINING WHETHER AN AD IS UBIQUITOUS - A method of determining whether an advertisement will be served against a search query calculates the ubiquitous index of the advertisement and if at least the ubiquitous index is below a predefined threshold, the advertisement is served. The ubiquitous index may be based, at least in part, on either the relatedness of a set of search queries against which the advertisement was served over a predetermined period, or a comparison between a click-through rate associated with the advertisement over the predetermined period and an aggregated click-through rate calculated over a set of advertisements available to be served over the predetermined period, or some combination thereof. | 02-24-2011 |
20120030021 | SELECTING ADVERTISEMENTS USING SAME SESSION QUERIES - Techniques are described herein for selecting an advertisement using same session queries. Each occurrence of a query is referred to as a query instance. When a query instance is received from a user, that query instance and other query instances that were received from the user prior to that query instance (i.e., historical query instances) are taken into consideration to select an advertisement to be provided to the user. The query instance in response to which the advertisement is to be provided and the historical query instances that are received at respective time instances that do not precede a threshold time instance are referred to collectively as a session of the user. Accordingly, the session of the user may be described generally as a collection of query instances that are most recently received from the user. | 02-02-2012 |
20120030185 | SPONSORED SEARCH RESULTS RE-RANKING BASED ON LINKING ASSOCIATIONS - A computer-implemented system and methods of re-ranking sponsored search results by a search engine in response to a search query include: retrieving one or more organic search results and a plurality of sponsored search results (“search results”), along with their respective rankings, associated with a search query; determining a degree of association between each sponsored search result and the other search results through analyzing web links between the plurality of sponsored search results, the one or more organic search results, and other web documents to or from which the search results are at least indirectly linked; re-ranking the plurality of sponsored search results based on the degree of association between each respective sponsored search result and the other search results; and storing in memory the plurality of re-ranked sponsored search results in relation to the search query. | 02-02-2012 |
20120072281 | METHOD AND SYSTEM TO MONETIZE DOMAIN QUERIES IN SPONSORED SEARCH - Techniques are provided for enabling relevant search results and advertisement selections to be generated in response to domain queries. A query that is input to a search engine is received. The query is analyzed to determine whether the search query is a domain query. If the query is determined to be a domain query, at least one domain related segment is stripped from the domain query to generate a condensed query, the condensed query is tokenized into at least one token, and the token(s) is/are spell corrected to generate at least one query feature. The query feature(s) may be normalized to generate at least one normalized query feature. The query feature(s) is/are provided to an advertisement selector to be used to select one or more advertisements. | 03-22-2012 |
20120089456 | SYSTEM FOR SEARCH BID TERM SELECTION - A system is disclosed for selecting bid terms for search advertising. A bid term selection tool includes a processor to execute an algorithm to provide suggested bid terms. The algorithm includes a cosine similarity function, a modified cosine similarity function, a penalty factor function, and an expected revenue function. The bid term selection tool aggregates the function of the algorithm for potential bid terms and compares the totals for the potential bid terms to select a relevant bid term. | 04-12-2012 |
20120166277 | VARIATION OF MINIMUM ADVERTISEMENT RELEVANCE QUALITY THRESHOLD BASED ON SEARCH QUERY ATTRIBUTES - Query threshold values are determined to be used to select advertisements to be displayed in response to a search query. A query threshold value is determined for each query based on query attributes characterizing the query, such as a query frequency, query length, whether the query is a navigational query, etc. By generating a threshold value for each query, and using the query threshold value for selecting advertisements to be displayed for the query (e.g., selecting advertisements having quality scores greater than the query threshold value), the advertisements can better correspond to the query, and thus are more likely to be selected by the user. As a result, the user experience can be enhanced and the advertising revenue can be correspondingly increased. | 06-28-2012 |
20120166468 | METHOD AND SYSTEM TO UTILIZE SESSION QUERIES IN REAL TIME TO IMPROVE GEO PRECISION OF SPONSORED LISTINGS - Contextual or cumulative interpretation is applied to individual user queries to improve the accuracy of sponsored and/or non-sponsored search results. Queries are interpreted based on present features derived from a user query in the context of past features derived from qualified past queries such as those previously received during a user query session. Based on contextual interpretation, present features may be augmented using past features. A search is performed using augmented features instead of present features. Contextual interpretation of queries improves search system understanding of the context in which queries are submitted, which is particularly helpful when interpolating query intent to develop features not expressed in a query. Contextual interpretation permits queries to be interpreted and treated more uniformly and more intelligently. As a result, users and advertisers benefit from more precise sponsored and/or non-sponsored search results. As one example, contextual interpretation can improve the geo-precision of sponsored search results. | 06-28-2012 |
Patent application number | Description | Published |
20120059853 | SYSTEM AND METHOD OF LEARNING-BASED MATCHING - Some embodiments match address data in a database system having a corpus of address information stored therein. In some embodiments, an external address data for a company that is associated with a set of locations is received. Some embodiments determine whether the external address data matches existing address data that includes the set of locations using fuzzy matching techniques. In order to determine whether two addresses match, some embodiments perform fuzzy matching techniques that uses learned knowledge to identify aliases in the address pair. In situations where a contact is specified along with the external address data, the contact is tethered to one of the set of locations when the external address data is determined to match an address within the existing address data. Some embodiments create a new location for the company using the external address data when the external address data does not match the existing address data. | 03-08-2012 |
20120066160 | PROBABILISTIC TREE-STRUCTURED LEARNING SYSTEM FOR EXTRACTING CONTACT DATA FROM QUOTES - Systems and methods for updating data stored in a database, such as contact information. An input string is obtained through a search for timely material associated with the stored contact. The input string is parsed using probabilistic tendencies to extract entities corresponding to those stored with the contact. Secondary entities are used to assist in the identification of the primary entities. The contact is then updated (or added if new) using the extracted primary entities. | 03-15-2012 |
20120317121 | METHODS AND SYSTEMS FOR USING DISTRIBUTED MEMORY AND SET OPERATIONS TO PROCESS SOCIAL NETWORKS - Systems and methods for managing and evaluating a social network. The social network is represented as a graph structure and stored in distributed memory. A viable path from one node that is not directly connected to another node in the graph structure may be determined by traversing the graph in stages, moving outward from each node in stages until common midpoint nodes are found providing a connection between the nodes. When midpoint nodes are found, the paths connecting the one node to the other node may be reconstructed. | 12-13-2012 |
20120317149 | METHODS AND SYSTEMS FOR PROCESSING GRAPHS USING DISTRIBUTED MEMORY AND SET OPERATIONS - Systems and methods for operating a database using distributed memory and set operations, and for evaluating graphs stored in the database. Any system may be represented as a graph structure having nodes and edges. The graph structure is stored in a distributed memory system using a key/value schema wherein each node is stored as a key and a set of neighbor nodes is stored as the corresponding value. A short path from one node to another may be determined by traversing the graph in stages, moving outward from each node in stages until common midpoint nodes are found indicating connections between the nodes. When the midpoint nodes are found, the paths connecting the nodes may be reconstructed. | 12-13-2012 |
20130031061 | FRAUD ANALYSIS IN A CONTACT DATABASE - A system and method of identifying fraudulent data in a contact database is disclosed herein. In some embodiments, a set of contact records is received where each of the contact records includes a set of contact field values corresponding to a set of contact fields. Some embodiments determine whether a similar content pattern exists in the contact records using at least one of the set of contact field values. In some embodiments, a determination is made as to whether an unusual content pattern exists in the contact records using at least one of the set of contact field values. The set of contact records is flagged when at least one of the similar content pattern or the unusual content pattern is determined to exist in the contact records. | 01-31-2013 |
20130166489 | SYSTEM AND METHOD FOR USING A STATISTICAL CLASSIFIER TO SCORE CONTACT ENTITIES - A system and method for associating a character string with one or more defined entities of a contact record. An input character string is received. The string is first evaluated to see if the structure of the string is recognized. If not, then the string is compared to entries in a look up table. If the string format is not recognized, and the string is not found in the look up table, then a posterior probability is calculated for a set of defined entities over a limited set of string processing features. The result of probabilistic scoring determines which of the defined entities to associate with the character string. | 06-27-2013 |
20130218904 | SYSTEM AND METHOD FOR INFERRING REPORTING RELATIONSHIPS FROM A CONTACT DATABASE - A system and method for inferring reporting relationships from contact records. Contact records from a single company are identified, and each record is ranked based on the title. A probabilistic analysis is used to compare the number of contacts on the current level with the number of contacts on a lower level, and make a guess as to reporting relationships between contacts on the different levels. If a confidence score of a guessed reporting relationship is high enough, the reporting relationship is accepted, and contact records updated. | 08-22-2013 |
20130297661 | SYSTEM AND METHOD FOR MAPPING SOURCE COLUMNS TO TARGET COLUMNS - A system and method for mapping columns from a source file to a target file. The header for each source column is evaluated heuristically to see if the header matches a predefined entity. The contents of a group of cells in the source column are evaluated probabilistically to determine a probability that the cell contents correspond to at least one of the predefined entities. A score is assigned to the likelihood that the column corresponds to one or more predefined entities. If the score meets a threshold, then the correspondence between the source column and one or more predefined entities is mapped. If the score fails to meets the threshold, then the correspondence between the source column and one or more undefined entities is mapped. Finally, each source column is transformed into a target column in accord with the map. | 11-07-2013 |
20150032729 | MATCHING SNIPPETS OF SEARCH RESULTS TO CLUSTERS OF OBJECTS - Systems and methods are provided for matching snippets of search results to clusters of objects. A system searches information based on objects in a cluster of objects. The system extracts a data snippet from the search results. The system determines whether the data snippet includes data that matches at least one of the objects in the cluster of objects. The system adds the data snippet to the cluster of objects if the data snippet includes data that matches at least one of the objects in the cluster of objects. | 01-29-2015 |
20150032738 | CONFIDENTLY ADDING SNIPPETS OF SEARCH RESULTS TO CLUSTERS OF OBJECTS - Systems and methods are provided for matching snippets of search results to clusters of objects. A system adds a data snippet of a search result to a cluster of objects. The system calculates a confidence score for the add based on the recency, a job title, an email address, and/or a phone number associated with the data snippet. The system stores the add in the customer accessible database if the confidence score is sufficiently high for the add to be stored in the customer accessible database. The system generates a notice for review if the confidence score is not sufficiently high for the add to be stored in the customer accessible database. | 01-29-2015 |
Patent application number | Description | Published |
20100040120 | LOW POWER RADIO COMMUNICATION SYSTEM - A method significantly reduces the average power for radio communication in a communication system, such as a system that has applications requiring low communication latency. The method may use a low power radio communication circuit (e.g., a non-heterodyne receiver) to wait for a communication request, taking advantage of the low power consumption of the radio communication circuit. Subsequent to receiving and validating the communication request, the communication system may switch to a more efficient—but higher power—communication circuit. Thus, effective communication is achieved without making undesirable tradeoffs, such as reduced sensitivity. | 02-18-2010 |
20120167646 | ALIGNMENT-RELATED OPERATION AND POSITION SENSING OF ELECTRONIC AND OTHER LOCKS AND OTHER OBJECTS - A sensing system senses whether or not a lock's bolt ( | 07-05-2012 |
20120169543 | TRUE OMNI-DIRECTIONAL ANTENNA - An antenna and a method for using the antenna in a wireless appliance are provided. The antenna includes a conducting surface having a length and a width; a dielectric slit having a slit length portion oriented along either the length or the width, the slit forming two lips on the conducting surface; the slit having an opening on one of the length and the width, the opening having a flare size; a feed-point element connecting the two lips; wherein the dimensions of the length, the width, the slit length portion, and the flare size are smaller than an effective propagation wavelength of the RF radiation in the antenna. An antenna including a conducting surface having a conductive plate with a plate area defined by a plate perimeter overlaying a portion of a conducting surface is also provided. A method to provide an antenna as above is also disclosed. | 07-05-2012 |
20120171978 | Methods and Systems for Interference Rejection for Low Signals - A radio device and a method to operate a non-heterodyne receiver are provided. The radio device is configured to receive a signal waveform and to provide a wake-up signal to a second communication circuit when the signal waveform is a valid communication request; wherein the second communication circuit switches from a power saving state to an operating state upon receiving the wake-up signal from the non-heterodyne receiver. The non-heterodyne receiver further including an Electromagnetic interference (EMI) rejection circuit, including a narrow band filter and a broadband filter to reject an EMI signal. A filter circuit for a narrow passband circuit is also provided. The filter including a buffer circuit; a crystal oscillator coupled to the output of the buffer circuit; and an inverting amplifier coupled in parallel to the crystal oscillator. | 07-05-2012 |
20130136046 | ESTABLISHMENT OF WIRELESS COMMUNICATIONS - Wireless communication protocols are provided for wireless device discovery, preferably (but not necessarily) with low power consumption. Some protocols are suitable for wireless locks and keys (e.g. smart cards and card readers). | 05-30-2013 |
20130195209 | Low Power Radio Communication System - A method significantly reduces the average power for radio communication in a communication system, such as a system that has applications requiring low communication latency. The method may use a low power radio communication circuit (e.g., a non-heterodyne receiver) to wait for a communication request, taking advantage of the low power consumption of the radio communication circuit. Subsequent to receiving and validating the communication request, the communication system may switch to a more efficient—but higher power—communication circuit. Thus, effective communication is achieved without making undesirable tradeoffs, such as reduced sensitivity. | 08-01-2013 |
20130241694 | NON-CONTACT ELECTRONIC DOOR LOCKS HAVING SPECIALIZED RADIO FREQUENCY BEAM FORMATION - An electronic door lock (“EDL”) is adapted to interact with an electronic key unit having a key antenna and a transmitter configured to transmit a radio frequency (“RF”) signal over the key antenna, the RF signal containing an identification (“ID”) code identifying the electronic key unit. The EDL can include a first antenna adapted to form a first directional radiation beam to receive the RF signal from the key unit, a second antenna adapted to form a second directional radiation beam to receive the RF signal from the key unit, and a processing component adapted to use RF signals received by one or both of the first and second antenna to determine whether the presence of an acceptable ID code is detected on the key. The EDL can determine the location of the key, and whether the key is inside or outside of the room. | 09-19-2013 |
20130247153 | ELECTRONIC APPARATUSES AND METHODS FOR ACCESS CONTROL AND FOR DATA INTEGRITY VERIFICATION - Improved access control systems ( | 09-19-2013 |
20130331711 | ELECTRO-MEDICAL SYSTEM FOR NEURO-MUSCULAR PARALYSIS ASSESSMENT - A computer-implemented method for quantitatively determining a person's neuro-muscular blockade (NMB) level in real-time using at least one sensor attached to the person is provided. The method includes receiving a first input signal from the sensor, wherein the first input signal includes a measurement of a first muscular response, the first muscular response resulting from a baseline stimulus current delivered to the person before administration of NMB agents to the person, and establishing a baseline chronaxie based on the first input signal. The method also includes delivering one or more stimulus currents to the person after the administration of NMB agents to the person, receiving a second input signal from the sensor, wherein the second input signal includes a measurement of one or more muscular responses resulting from the one or more stimulus currents, and determining the person's NMB level based on the second input signal. | 12-12-2013 |
20140159383 | ALIGNMENT-RELATED OPERATION AND POSITION SENSING OF ELECTRONIC AND OTHER LOCKS AND OTHER OBJECTS - A sensing system senses whether or not a lock's bolt ( | 06-12-2014 |
20140376602 | LOW POWER RADIO COMMUNICATION SYSTEM - A method significantly reduces the average power for radio communication in a communication system, such as a system that has applications requiring low communication latency. The method may use a low power radio communication circuit (e.g., a non-heterodyne receiver) to wait for a communication request, taking advantage of the low power consumption of the radio communication circuit. Subsequent to receiving and validating the communication request, the communication system may switch to a more efficient—but higher power—communication circuit. Thus, effective communication is achieved without making undesirable tradeoffs, such as reduced sensitivity. | 12-25-2014 |