Patent application number | Description | Published |
20080256051 | CALCULATING IMPORTANCE OF DOCUMENTS FACTORING HISTORICAL IMPORTANCE - A method and system for determining temporal importance of documents having links between documents based on a temporal analysis of the links is provided. A temporal ranking system collects link information or snapshots indicating the links between documents at various snapshot times. The temporal ranking system calculates a current temporal importance of a document by factoring in the current importance of the document derived from the current snapshot (i.e., with the latest snapshot time) and the historical importance of the document derived from the past snapshots. To calculate the current temporal importance of a web page, the temporal ranking system aggregates the importance of the web page for each snapshot. | 10-16-2008 |
20080270377 | CALCULATING GLOBAL IMPORTANCE OF DOCUMENTS BASED ON GLOBAL HITTING TIMES - A calculate importance system calculates the global importance of a web page based on a “mean hitting time.” Hitting time of a target web page is a measure of the minimum number of transitions needed to land on the target web page. Mean hitting time of a target web page is an average number of such transitions for all possible starting web pages. The calculate importance system calculates a global importance score for a web page based on the reciprocal of a mean hitting time. A search engine may rank web pages of a search result based on a combination of relevance of the web pages to the search request and global importance of the web pages based on a global hitting time. | 10-30-2008 |
20080275862 | SPECTRAL CLUSTERING USING SEQUENTIAL MATRIX COMPRESSION - A clustering system generates an original Laplacian matrix representing objects and their relationships. The clustering system initially applies an eigenvalue decomposition solver to the original Laplacian matrix for a number of iterations. The clustering system then identifies the elements of the resultant eigenvector that are stable. The clustering system then aggregates the elements of the original Laplacian matrix corresponding to the identified stable elements and forms a new Laplacian matrix that is a compressed form of the original Laplacian matrix. The clustering system repeats the applying of the eigenvalue decomposition solver and the generating of new compressed Laplacian matrices until the new Laplacian matrix is small enough so that a final solution can be generated in a reasonable amount of time. | 11-06-2008 |
20080313168 | RANKING DOCUMENTS BASED ON A SERIES OF DOCUMENT GRAPHS - Ranking documents based on a series of web graphs collected over time is provided. A ranking system provides multiple transition probability distributions representing different snapshots or times. Each transition probability distribution represents a probability of transitioning from one document to another document within a collection of documents using a link of the document. The ranking system determines a stationary probability distribution for each snapshot based on the transition probability distributions for that snapshot and the stationary probability distribution of the previous snapshot. The stationary probability distributions represent a ranking of the documents over time. | 12-18-2008 |
20090198673 | Forum Mining for Suspicious Link Spam Sites Detection - An anti-spam technique for protecting search engine ranking is based on mining search engine optimization (SEO) forums. The anti-spam technique collects webpages such as SEO forum posts from a list of suspect spam websites, and extracts suspicious link exchange URLs and corresponding link formation from the collected webpages. A search engine ranking penalty is then applied to the suspicious link exchange URLs. The penalty is at least partially determined by the link information associated with the respective suspicious link exchange URL. To detect more suspicious link exchange URLs, the technique may propagate one or more levels from a seed set of suspicious link exchange URLs generated by mining SEO forums. | 08-06-2009 |
20090216868 | ANTI-SPAM TOOL FOR BROWSER - An anti-spam tool works with a web browser to detect spam webpages locally on a client machine. The anti-spam tool can be implemented either as a plug-in module or an integral part of the browser, and manifested as a toolbar. The tool can perform an anti-spam action whenever a webpage is accessed through the browser, and does not require direct involvement of a search engine. A spam detection module installed on the computing device determines whether a webpage being accessed or whether a link contained in the webpage being accessed is spam, by comparing the URL of the webpage or the link with a spam list. The spam list can be downloaded from a remote search engine server, stored locally and updated from time to time. A two-level indexing technique is also introduced to improve the efficiency of the anti-spam tool's use of the spam list. | 08-27-2009 |
20100073374 | CALCULATING A WEBPAGE IMPORTANCE FROM A WEB BROWSING GRAPH - Method for creating a graph representing web browsing behavior, including receiving web browsing behavior data from one or more web browsers; adding a node on the graph for each web page listed in the web browsing behavior data; adding a first link connecting two or more nodes on the graph, wherein the first link representing a hyperlink for accessing a webpage; calculating an amount of time in which each web page is being accessed; determining a number of units of time in the calculated amount of time; adding one or more virtual nodes to the graph based on the number of units of time; and adding a second link connecting two or more virtual nodes on the graph, wherein the second link representing a virtual hyperlink for accessing a webpage. | 03-25-2010 |
20100076910 | CALCULATING WEB PAGE IMPORTANCE BASED ON WEB BEHAVIOR MODEL - Method for determining a webpage importance, including receiving web browsing behavior data of one or more users; creating a model of the web browsing behavior data; calculating a stationary probability distribution of the model; and correlating the stationary probability distribution to the webpage importance. | 03-25-2010 |
20100250555 | Calculating Web Page Importance - The page ranking technique described herein employs a Markov Skeleton Mirror Process (MSMP), which is a particular case of Markov Skeleton Processes, to model and calculate page importance scores. Given a web graph and its metadata, the technique builds an MSMP model on the web graph. It first estimates the stationary distribution of a EMC and views it as transition probability. It next computes the mean staying time using the metadata. Finally, it calculates the product of transition probability and mean staying time, which is actually the stationary distribution of MSMP. This is regarded as page importance. | 09-30-2010 |
20110161330 | CALCULATING GLOBAL IMPORTANCE OF DOCUMENTS BASED ON GLOBAL HITTING TIMES - A calculate importance system calculates the global importance of a web page based on a “mean hitting time.” Hitting time of a target web page is a measure of the minimum number of transitions needed to land on the target web page. Mean hitting time of a target web page is an average number of such transitions for all possible starting web pages. The calculate importance system calculates a global importance score for a web page based on the reciprocal of a mean hitting time. A search engine may rank web pages of a search result based on a combination of relevance of the web pages to the search request and global importance of the web pages based on a global hitting time. | 06-30-2011 |
20110258148 | ACTIVE PREDICTION OF DIVERSE SEARCH INTENT BASED UPON USER BROWSING BEHAVIOR - Many search engines attempt to understand and predict a user's search intent after the submission of search queries. Predicting search intent allows search engines to tailor search results to particular information needs of the user. Unfortunately, current techniques passively predict search intent after a query is submitted. Accordingly, one or more systems and/or techniques for actively predicting search intent from user browsing behavior data are disclosed herein. For example, search patterns of a user browsing a web page and shortly thereafter performing a query may be extracted from user browsing behavior. Queries within the search patterns may be ranked based upon a search trigger likelihood that content of the web page motivated the user to perform the query. In this way, query suggestions having a high search trigger likelihood and a diverse range of topics may be generated and/or presented to users of the web page. | 10-20-2011 |
20110295845 | Semi-Supervised Page Importance Ranking - Importance ranking of web pages is performed by defining a graph-based regularization term based on document features, edge features, and a web graph of a plurality of web pages, and deriving a loss term based on human feedback data. The graph-based regularization term and the loss term are combined to obtain a global objective function. The global objective function is optimized to obtain parameters for the document features and edge features and to produce static rank scores for the plurality of web pages. Further, the plurality of web pages is ordered based on the static rank scores. | 12-01-2011 |
20120100180 | METHODS FOR PROLIFERATION OF ANTIGEN-SPECIFIC T CELLS - Methods for expansion of antigen-specific T cells are provided. Said methods include following steps: generating antigen-specific T cells by stimulation of T cells with antigen A; introducing genes encoding immune recognition molecule specific to major histocompatibility complex (MHC) molecule bound with a peptide derived from antigen B into the antigen A specific T cell to produce bi-specific T cells recognizing both target cells expressing antigen A peptide associated MHC and target cells expressing antigen B peptide associated MHC; stimulating the bi-specific T cells by antigen A for expansion of the bi-specific T cells in vitro or in vivo. Methods of the present invention can be applied to expand various of T cells with specific to cancer cells with tumor antigen peptide loaded MHC molecules for adoptive therapy against unmet medical need such as tumors etc. | 04-26-2012 |
20120143792 | PAGE SELECTION FOR INDEXING - Some implementations provide techniques for selecting web pages for inclusion in an index. For example, some implementations apply regularization to select a subset of the crawled web pages for indexing based on link relationships between the crawled web pages, features extracted from the crawled web pages, and user behavior information determined for at least some of the crawled web pages. Further, in some implementations, the user behavior information may be used to sort a training set of crawled web pages into a plurality of labeled groups. The labeled groups may be represented in a directed graph that indicates relative priorities for being selected for indexing. | 06-07-2012 |
20120143844 | MULTI-LEVEL COVERAGE FOR CRAWLING SELECTION - Some implementations provide techniques for determining which URLs to select for crawling from a pool of URLs. For example, the selection of URLs for crawling may be made based on maintaining a high coverage of the known URLs and/or high discoverability of the World Wide Web. Some implementations provide a multi-level coverage strategy for crawling selection. Further, some implementations provide techniques for discovering unseen URLs. | 06-07-2012 |
20120253927 | MACHINE LEARNING APPROACH FOR DETERMINING QUALITY SCORES - Some implementations generate a mapping function using one or more historic performance indicators for a set of ad-keyword pairs and one or more advertisement metrics extracted from the set of ad-keyword pairs. The mapping function may be applied to map one or more advertisement metrics of a particular ad-keyword pair to determine a quality score for the particular ad-keyword pair. For example, the quality score may be used when determining whether to select an advertisement for display or may be provided as feedback to an advertiser. Additionally, in some implementations, the mapping function may be applied to determine a quality score for a new ad-keyword pair that has not yet accumulated historic information. | 10-04-2012 |
20120253930 | USER INTENT STRENGTH AGGREGATING BY DECAY FACTOR - This application describes a system and method for estimating user intent towards categories of content. The estimation of user intent may be based at least in part on a score for prior user actions and a decay function that is applied to that score to provide an estimate of current user intent. The estimate represents current user intent for time periods in which user actions towards a category of content are negligible or non-existent. | 10-04-2012 |
20120253945 | BID TRAFFIC ESTIMATION - Some implementations provide techniques for estimating impression numbers. For example, a log of advertisement bidding data may be used to generate and train an impression estimation model. In some implementations, an impression estimation component may use a boost regression technique to determine a predicted impression value range based on a proposed bid received from an advertiser. For example, the predicted impression value range may be determined based on a predicted estimation error. Additionally, in some instances, the predicted impression value range may be evaluated using one or more evaluation metrics. | 10-04-2012 |
20120284218 | NEURON DEVICE AND NEURAL NETWORK - A neuron device includes a bottom electrode, a top electrode, and a layer of metal oxide variable resistance material sandwiched between the bottom electrode and the top electrode, in which the neuron device is switched to a normal state upon application of reset pulse, and is switched to an excitation state upon application of stimulus pulses. The neuron device has a comprehensive response to different amplitude, different width of a stimulus voltage pulse and different number of a sequence of stimulus pulses, and provides functionalities of a weighting section and a computing section. The neuron device has a simple structure, excellent scalability, quick speed, low operation voltage, and is compatible with the conventional silicon-based CMOS fabrication process, and thus suitable for mass production. The neuron device is capable of performing many biological functions and complex logic operations. | 11-08-2012 |
20130033922 | RESISTIVE-SWITCHING DEVICE CAPABLE OF IMPLEMENTING MULTIARY ADDITION OPERATION AND METHOD FOR MULTIARY ADDITION OPERATION - The present disclosure provides a resistive-switching device capable of implementing multiary addition operation and a method for implementing multiary addition operation using the resistive-switching device. The resistive-switching device has a plurality of resistance values each corresponding to a respective data value stored by the resistive-switching device and ranging from a high resistance value to a low resistance value. The data value stored by the resistive-switching device is increased by ‘1’ successively with a series of set pulses having a same pulse width and a same voltage amplitude being applied thereto. The data value stored by the resistive-switching device is set to ‘0’ with a reset pulse being applied thereto, and meanwhile a data value stored by a higher-bit resistive-switching device is increased by ‘1’ with a set pulse being applied thereto. In this way, multiary addition operation is implemented. The operation of the resistive-switching device can implement data storage and the multiary addition operation simultaneously, and thus substantially simplifies the circuit structure. As a result, the data storage can be integrated with calculation. | 02-07-2013 |
20130085867 | Niche Keyword Recommendation - A computing device is described herein that is configured to select a subset of keywords from a plurality of keywords based at least on measures of competition associated with the keywords and to suggest the selected subset for bidding. The plurality of keywords is relevant to at least one advertising target. The computing device calculates a measure of competition for a respective keyword based on a number of bidders for the respective keyword and on a number of available advertisement slots in search results provided responsive to queries for the respective keyword. | 04-04-2013 |
20130094281 | METHOD FOR MEASURING DATA RETENTION CHARACTERISTIC OF RESISTIVE RANDOM ACCESS MEMORY DEVICE - A method for measuring data retention characteristic of an RRAM device includes: a) controlling a temperature of a sample stage to maintain the RRAM device at a predetermined temperature; b) setting the RRAM device to a high-resistance state or a low-resistance state; c) measuring data retention time by applying a predetermined voltage to the RRAM device so that a resistive state failure of the RRAM device occurs; d) repeating the steps a)-c) to perform a plurality of measurements; e) calculating a resistive state failure probability F(t) of the RRAM device from the data retention time in the plurality of measurements; and f) fitting the resistive state failure probability F(t), and calculating predicted data retention time t | 04-18-2013 |
20130097011 | Online Advertisement Perception Prediction - An advertisement perception predictor may forecast the effectiveness of an online advertisement in a web page by predicting whether the online advertisement may be perceived by a consumer. The advertisement perception predictor may use a perception model that is trained for determining perception probability values of online advertisements. The perception model may be applied to an online advertisement to determine a perception probability value for the online advertisement. The perception probability value may indicate the likelihood that a consumer is likely to view the online advertisement. | 04-18-2013 |
20130097027 | Task-Based Advertisement Delivery - A task guidance tool that displays instructional steps and associated advertisements may facilitate the accomplishment of a task by users who are otherwise unfamiliar with the task. The task guidance tool may be developed from input data mined from various sources. The task guidance tool may display a series of step pages in which each step page include instructions for accomplishing a corresponding step of the task. Further, one or more step pages of the task guidance tool may be provided with selected advertisements that are displayed with the step instructions. | 04-18-2013 |
20130119337 | RESISTIVE-SWITCHING DEVICE CAPABLE OF IMPLEMENTING MULTIARY ADDITION OPERATION AND METHOD FOR MULTIARY ADDITION OPERATION - A resistive-switching random access memory device includes a memory cell disposed between a bit line and a word line, the memory cell having a resistive-switching element ( | 05-16-2013 |
20130128653 | RESISTIVE RADOM ACCESS MEMORY DEVICE, METHOD FOR MANUFACTURING THE SAME, AND METHOD FOR OPERATING THE SAME - A resistive random access memory device, a method for manufacturing the resistive random access memory device, and a method for operating the resistive random access memory device are disclosed. The resistive random access memory device includes a resistive switching memory element including two electrodes and a layer of variable-resistance material between the two electrodes, wherein the layer of variable-resistance material exhibits bipolar resistive switching behavior; and a Schottky diode including a metal layer and a p-doped semiconductor layer which contact each other, wherein the metal layer of the Schottky diode is coupled to one of the two electrodes of the resistive switching memory element. The present disclosure provides the resistive random access memory device operating in bipolar resistive switching scheme. | 05-23-2013 |
20130197993 | Advertiser Modeling - In a system that supports paid advertisements, as advertisements are awarded ad spots based on contextual relevance to search queries, periodic performance indicators are recorded. The periodic performance indicators represent ad performance during a specific time period. Over time, the periodic performance indicators are aggregated to form historical behavior indicators. A graphical model of advertiser behavior is formulated based on the periodic performance indicators and the historical behavior indicators. The graphical model may then be used to forecast future bid values based on previous advertiser behavior. | 08-01-2013 |
20140347913 | RESISTIVE SWITCHING MEMORY DEVICE AND METHOD FOR OPERATING THE SAME - A resistive switching memory device and a method for operating the same are disclosed. The device includes a plurality of resistive switching memory units arranged in a matrix, each of which includes a switching element and a resistive switching device, and the switching element being connected to a word line at its control terminal, to the resistive switching device at one terminal, and to a bit line at the other terminal; a word line decoder adapted to decode an input address signal to switch on the switching element in at least one of resistive switching memory units; and a driving circuit adapted to apply a voltage pulse whose front edge changes slowly across the resistive switching device by the bit line synchronously with the switching-on of the switching element. Using the scheme of the above embodiments, the durability characteristic of the resistive switching device can be improved, such as degradation of high-low resistance value window and the failure of the device with transition times can be reduced. | 11-27-2014 |