Patent application number | Description | Published |
20090300009 | Behavioral Targeting For Tracking, Aggregating, And Predicting Online Behavior - A pre-computed concept map represents concepts, concept metadata, and relationships between the plurality of concepts. Online user behavior may be predicted by correlating one or more online events of a user with one or more features of the concept map, aggregating a concept map history of the user to obtain online behavior over time, aggregating online behavior of the user and one or more other users to obtain aggregated online user behavior, and predicting future online behavior of the user based at least in part on the online behavior of the user and the aggregated online user behavior. The predicted behavior may be used to target ads that the user is likely to find relevant. | 12-03-2009 |
20100114879 | IDENTIFYING RELATED CONCEPTS OF URLS AND DOMAIN NAMES - A solution for identifying related concepts of URLs and domain names includes using structural parsing to extract information from user input comprising a URL or domain name. The information includes one or more of a protocol, a location, and a subdirectory. Semantic parsing of the information is used to identify a first one or more concepts represented by one or more tokens within the extracted information. A content association map is queried to retrieve a second one or more concepts related to the first one or more concepts. Each of the concepts represents a unit of thought, expressed by a term, letter, or symbol. The concept association map includes a representation of concepts, concept metadata, and relationships between the concepts. The first one or more concepts and the second one or more concepts are ranked, and the ranked concepts are stored for displaying to one or more users of the computer platform. | 05-06-2010 |
20140067535 | Concept-level User Intent Profile Extraction and Applications - Methods and systems for extracting intents and intent profiles of users, as inferred from the different activities they execute and data they share on social media sites, and then (i) monetization of such intents via targeted advertisements, and (ii) enhancement of user experience via organization of their contact lists and conversations and posts based on their content and conceptual context. | 03-06-2014 |
Patent application number | Description | Published |
20090281900 | Discovering Relevant Concept And Context For Content Node - Discovering relevant concepts and context for content nodes to determine a user's intent includes identifying one or more concept candidates in a content node based at least in part on one or more statistical measures, and matching concepts in a concept association map against text in the content node. The concept association map represents concepts, concept metadata, and relationships between the concepts. The one or more concept candidates are ranked to create a ranked one or more concept candidates based at least in part on a measure of relevance. The ranked one or more concept candidates is expanded according to one or more cost functions. The expanded set of concepts is stored in association with the content node. | 11-12-2009 |
20110113032 | GENERATING A CONCEPTUAL ASSOCIATION GRAPH FROM LARGE-SCALE LOOSELY-GROUPED CONTENT - A method for generating a conceptual association graph from structured content includes grouping content nodes into one or more topically biased clusters, the content nodes comprising structured digital content and unstructured digital content, the grouping based at least in part on the connectedness of each content node member to other content node members in the same cluster. The method also includes, responsive to the grouping, tagging the content nodes with one or more descriptive concepts. The method also includes, responsive to the tagging, establishing one or more associations between the one or more concepts, the one or more associations indicating a relevance of the one or more associations, the indicating based at least in part on patterns of co-occurrence of concepts in the tagged content nodes. | 05-12-2011 |
20120084358 | METHODS AND APPARATUS FOR DISTRIBUTED COMMUNITY FINDING - Methods and apparatus for a new approach to the problem of finding communities in complex networks relating to a social definition of communities and percolation are disclosed. Instead of partitioning the graph into separate subgraphs from top to bottom a local algorithm (communities of each vertex) allows overlapping of communities. The performance of an algorithm on synthetic, randomly-generated graphs and real-world networks is used to benchmark this method against others. An heuristic is provided to generate a list of communities for networks using a local community finding algorithm. Unlike diffusion based algorithms, The provided algorithm finds overlapping communities and provides a means to measure confidence in community structure. It features locality and low complexity for exploring the communities for a subset of network nodes, without the need for exploring the whole graph. | 04-05-2012 |
20130046797 | METHODS AND APPARATUS FOR DISTRIBUTED COMMUNITY FINDING - Methods and apparatus for a new approach to the problem of finding communities in complex networks relating to a social definition of communities and percolation are disclosed. Instead of partitioning the graph into separate subgraphs from top to bottom a local algorithm (communities of each vertex) allows overlapping of communities. The performance of an algorithm on synthetic, randomly-generated graphs and real-world networks is used to benchmark this method against others. An heuristic is provided to generate a list of communities for networks using a local community finding algorithm. Unlike diffusion based algorithms, The provided algorithm finds overlapping communities and provides a means to measure confidence in community structure. It features locality and low complexity for exploring the communities for a subset of network nodes, without the need for exploring the whole graph. | 02-21-2013 |
20130046842 | METHODS AND APPARATUS FOR DISTRIBUTED COMMUNITY FINDING - Methods and apparatus for a new approach to the problem of finding communities in complex networks relating to a social definition of communities and percolation are disclosed. Instead of partitioning the graph into separate subgraphs from top to bottom a local algorithm (communities of each vertex) allows overlapping of communities. The performance of an algorithm on synthetic, randomly-generated graphs and real-world networks is used to benchmark this method against others. An heuristic is provided to generate a list of communities for networks using a local community finding algorithm. Unlike diffusion based algorithms, The provided algorithm finds overlapping communities and provides a means to measure confidence in community structure. It features locality and low complexity for exploring the communities for a subset of network nodes, without the need for exploring the whole graph. | 02-21-2013 |
20140351237 | SYSTEMS AND METHODS FOR CREATING, NAVIGATING, AND SEARCHING INFORMATIONAL WEB NEIGHBORHOODS - Systems and methods for the creation of hierarchical networks of overlapping informational web neighborhoods using percolation crawling. Each neighborhood comprises a set of closely linked pages that share a common set of concepts and intent and purpose. The neighborhoods represent web pages that share a common set of underlying concepts and semantic associations. Each such neighborhood can be semantically tagged. | 11-27-2014 |
Patent application number | Description | Published |
20110307524 | UNIFIED CONCURRENT CHANGES TO DATA, SCHEMA, AND APPLICATION - Changes are managed in a multi-user database application environment. Proposed changes are collected, including changes to data, schema, and/or application descriptions. A user may specify foreign key relationships between items belonging to one or more of these categories. A view is produced showing the impact proposed changes would have on the environment if successfully committed. The user's proposed changes are ordered according to their dependencies, and submitted for committal together in a single transaction, subject to optimistic concurrency and consistency checks. For example, a proposed change to a data value may be inconsistent with a change which removed a data element containing the data value. The commitment operation may return identifiers and other return values, in addition to indicating whether the commitment was successful. | 12-15-2011 |
20140280290 | SELECTION AND DISPLAY OF ALTERNATIVE SUGGESTED SUB-STRINGS IN A QUERY - Suggesting replacements for search sub-strings to a user. A method includes receiving a query string from a user including a plurality of search sub-strings in the query string. The method further includes determining semantically valid replacements of one or more search sub-strings in the query string. The method further includes suggesting to the user semantically valid replacements of one or more of the search sub-strings to allow the user to modify the original query string. | 09-18-2014 |
20140372481 | CROSS-MODEL FILTERING - Presenting data from different data providers in a correlated fashion. The method includes performing a first query on a first data set controlled by a first entity to capture a first set of data results. The method further includes performing a second query on a second data set controlled by a second entity to capture a second set of data results. The method includes receiving a selection of one or more results from the first data set. The method further includes using the one or more selected results, consulting a relationship ontology that correlates data stored in different data stores controlled by different entities, to identify one or more relationships between data in the selected results set and the second data set. | 12-18-2014 |
20150015504 | INTERACTIVE DIGITAL DISPLAYS - The description relates to an interactive digital display. One example includes a display device configured to receive user input and recognize commands relative to data visualizations. The system also includes a graphical user interface configured to be presented on the display device that allows users to interact with the data visualizations via the user commands. | 01-15-2015 |
Patent application number | Description | Published |
20110234456 | LONG TERM COMPACT SATELLITE MODELS - An improved network enabled extended ephemeris navigation system includes a network server able to collect ephemeris, clock, and almanac information from orbiting GPS satellites, and to use that information to build up extended ephemeris predictions that will be valid and useful for at least a week. A mobile client is able to request and use the extended ephemeris predictions to search for and track orbiting GPS satellites visible to it. The improvement is characterized by a satellite position and clock compact model construction and database unit that constructs a compact short-term satellite model to be sent first in response to a request for extended ephemeris predictions from the mobile client, and that constructs several consecutive long-term satellite models each representing a unique portion of a day in at least a seven day series. | 09-29-2011 |
20120056782 | SATELLITE NAVIGATION RECEIVERS WITH SELF-PROVIDED FUTURE EPHEMERIS AND CLOCK PREDICTIONS - An improved extended ephemeris navigation receiver includes a fully autonomous satellite navigation receiver for receiving microwave transmissions from orbiting navigation system satellites, and able to demodulate navigation messages that include the ephemerides for those navigation system satellites. The improvements include a force model of the accelerations acting on a particular satellite vehicle, and are exclusive to the receiver. A single observation of the ephemeris for each SV is input and propagated days into the future by integrating each SV's orbital position with its corresponding force model. The fully autonomous satellite navigation receiver thereafter has available to it extended ephemeris predictions that can be used as substitutes when said navigation messages from the respective SV cannot otherwise be immediately obtained and demodulated. | 03-08-2012 |
20130307722 | Automatic Detection of Mode of Transportation by Analyzing Signal Strength of Received GNSS Signals and Speed - Object of the present invention is to provide a method to reduce power consumption of location based services applications, that run on mobile devices, by utilizing processor and positioning resources only when location changes. A method also is provided for detecting or inferring mode of transportation of user of a GNSS-enabled mobile device, such as smart phone, tablet, etc. Modes of transportation consist of: traveling on foot, biking, motor biking, driving or riding on a car, riding on bus, and riding on train. This method is based on analyzing signal strength information of GNSS signals received at location of the user and speed. The latter is used to make distinction between travelling on foot, biking, and motor biking modes. GNSS signal cannot penetrate metal, therefore when the mobile device is inside a vehicle, such as car, bus, or train, GNSS signals that their path collides with roof or metal body of the vehicle would be weak and have low SNR. | 11-21-2013 |
20140111027 | Method for Reducing Power Consumption of Location Based Applications Running on Mobile Devices - Power consumption of location based services applications, that run on mobile devices, is reduced by utilizing processor and positioning resources only when location changes. A method also is provided for detecting or inferring mode of transportation of user of a GNSS-enabled mobile device. Modes of transportation consist of: traveling on foot, biking, motor biking, driving or riding on a car, riding on bus, and riding on train. This method is based on analyzing signal strength information of GNSS signals received at location of the user and speed. The latter is used to make distinction between travelling on foot, biking, and motor biking modes. GNSS signal cannot penetrate metal, therefore when the mobile device is inside a vehicle, such as car, bus, or train, GNSS signals that their path collides with roof or metal body of the vehicle would be weak and have low SNR. | 04-24-2014 |
20140129123 | Data Exchange Protocol to Enable Server-Based Traffic Related Alert Systems via Mobile Devices - Object of the present invention is to provide a data exchange protocol to enable mobile device based alert systems to deliver traffic related alerts to drivers. The protocol is based on running first order Kinematic model for motion of vehicles on both Client and Server sides. Each Client only sends to the server minimum samples of the motion that are sufficient enough to keep lateral (perpendicular to moving direction of vehicle) and longitudinal (along moving direction of vehicle) position errors bounded. Position error here is defined as difference between original motion sample and sample derived from transmitted samples on the server. | 05-08-2014 |
20150070213 | LOCATION DETERMINATION IN MULTI-SYSTEM GNNS ENVIRONMENT USING CONVERSION OF DATA INTO A UNIFIED FORMAT - Accurate long term satellite models for satellites include satellites of different navigation systems. Such a model is derived for a non-GPS satellite that broadcasts native orbital model data specified as valid within a first time period. Initial position and velocity data are determined from the native orbital model data, and orbit integration is performed to determine an orbital arc in an earth-centered-earth-fixed frame over a second time period longer than the first time period. Initial estimates of GPS or GPS-like orbit parameters are determined for the non-GPS satellite, and the orbital arc and the initial estimates of the GPS or GPS-like orbit parameters are input to an orbit parameter solver that determines GPS or GPS-like parameters that fit the orbital arc and is used to determine final orbital model parameters in GPS or GPS-like format for the non-GPS satellite. | 03-12-2015 |