Subscribe: Untitled
http://www.freepatentsonline.com/rssfeed/rssapp707.xml
Added By: Feedage Forager Feedage Grade B rated
Language: English
Tags:
based  content  data  database  device  information  media  method  nodes  plurality  query  search  set  system  user 
Rate this Feed
Rate this feedRate this feedRate this feedRate this feedRate this feed
Rate this feed 1 starRate this feed 2 starRate this feed 3 starRate this feed 4 starRate this feed 5 star

Comments (0)

Feed Details and Statistics Feed Statistics
Preview: Untitled

Untitled





 



SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR SHARING TENANT INFORMATION UTILIZING A MULTI-TENANT ON-DEMAND DATABASE SERVICE

Thu, 25 Aug 2016 08:00:00 EDT

In accordance with embodiments, there are provided mechanisms and methods for sharing tenant information utilizing a multi-tenant on-demand database service. These mechanisms and methods for sharing tenant information utilizing a multi-tenant on-demand database service can allow automatic sharing of information owned by a first tenant with other tenants of the multi-tenant on-demand database service. In this way, collaboration among tenants of the multi-tenant on-demand database service may be enabled via the sharing of the tenant information.



SPARSE GRAPH CREATION DEVICE AND SPARSE GRAPH CREATION METHOD

Thu, 25 Aug 2016 08:00:00 EDT

A selective PEG algorithm, creating a sparse matrix while maintaining row weight/column weight at arbitrary multi-levels, and in the process, inactivating an arbitrary edge so that a minimum loop formed between arbitrary nodes is enlarged or performing constrained interleaving, so that encoding efficiency in the case where a matrix space is narrow is improved.



AUTOMATIC CRM DATA ENTRY

Thu, 25 Aug 2016 08:00:00 EDT

A method for data processing includes obtaining from multiple different organizations (24, 52, 54, 56) customer relationship management (CRM) records (110) and communication records (90). Reference vectors (130) of feature values are computed for the communication records in a training set. Global weights are computed for the feature values by evaluating the reference vectors for all of the different organizations. For each organization, respective company weights are computed by evaluating specifically the reference vectors computed over the CRM records and communication records belonging to the organization. For each person belonging to a given organization, respective user weights are computed for the feature values by evaluating specifically the reference vectors computed over the communication records that identify the person as the user. The weights are applied in order to assign the communication records that are not in the training set to respective ones of the CRM records.



Centralized Receipt Repository

Thu, 25 Aug 2016 08:00:00 EDT

The system tracks transaction information as it goes to the acquiring network; where it is associated with the card type, matched to the issuer, and sent via the IS08583 authorization stream for approval. Elements are extracted from the IS08583 message to represent the payment receipt then sent to and stored in a centralized payment receipt repository (CRR). A real-time record of the payment is recorded and a message confirmation notice is sent to the mobile device. The message confirmation sent to the mobile device contains merchant specific data. The real-time message contains transaction details and allows for additional functionality to classify the transaction as a “business” or “personal” expense or other expense type. Additional functionality allows a user to capture a photo of the payment receipt. All of the transaction, classification information, payment receipt photographs, and history is stored on backend servers and can be accessed via a user's account. The system produces reports from the stored information directly on the mobile device, or to any computer or device, which has internet or networking capabilities. The system will create both personal and business reports. A user can access the stored and classified information and save it to a predefined format using the mobile interface. The user can export this information in a variety of formats. The main functionality of this invention is to capture transaction history, create digital images of payment receipts, organize the payment receipts by category or other designated purpose reports based on stored transaction and payment receipt information, and export the report information to a file in any data format with separation, saves time, and enable a user to have an instant accessible location to view and manage payment receipt.



METHODS AND SYSTEMS FOR IDENTIFYING TARGET USERS OF CONTENT

Thu, 25 Aug 2016 08:00:00 EDT

The disclosed embodiments illustrate methods and systems for identifying one or more target users, of a first content, from a social network. The disclosed method includes generating a graph comprising one or more nodes, representative of one or more users of the social network, and one or more edges connecting the one or more nodes. Thereafter, a first set of nodes is selected from the one or more nodes based on at least a first score and/or a second score. Finally, a third set of nodes is selected from the first set of nodes based on at least a polarity score associated with a second set of nodes, determined based on at least a first weight and a second weight, connected to each node in the first set of nodes, wherein the third set of nodes represents the one or more target users.



Systems and Methods for Non-Linear Content Creation

Thu, 25 Aug 2016 08:00:00 EDT

A system includes a memory configured to store a plurality of tools and a processor configured to use the plurality of tools. The processor uses the plurality of tools to retrieve historical information relating to a storyline, retrieve user information relating to user interactions with the storyline, provide the historical information and the user information for incorporating into the content, and generate the content using the historical information and the user information.



Grouping Recommended Search Queries in Card Clusters

Thu, 25 Aug 2016 08:00:00 EDT

In one embodiment, a method includes receiving, from a client system of a first user of a communication network, an input from the first user to access a card-stack interface, generating one or more card clusters from a plurality of cards, each card comprising a query referencing a query-domain associated with the communication network and zero or more query-filters for the query-domain, wherein each query-filter references one or more objects of the communication network, each card cluster comprising one or more cards from the plurality of cards, the cards being formed into card clusters based on a card-affinity between the cards, and sending, to the client system in response to the input from the first user, the card-stack interface for display to the first user, wherein the card-stack interface comprises one or more of the card clusters.



SELECTIVE MAP MARKER AGGREGATION

Thu, 25 Aug 2016 08:00:00 EDT

The selective aggregation of marker objects on a map is disclosed. A plurality of marker objects is received in response to a query. The marker objects are each defined by a set of coordinates to a specific location on the map. The map is segregated into a plurality of bounding areas each defined by a set of bounding coordinates. A bounding area count of the number of marker objects having coordinates within a first one of the bounding areas is generated. The bounding area count is compared to a predetermined threshold. If the bounding area count is greater, a first aggregate marker is displayed in the first one of the bounding areas of the map. Otherwise, each of the marker objects within the first one of the bounding areas of the map is displayed. The marker objects are positioned according to the set of coordinates associated therewith.



SYSTEM AND METHOD FOR IMPROVING ACCESS TO SEARCH RESULTS

Thu, 25 Aug 2016 08:00:00 EDT

Aspects of the disclosure provide a system and method for prerendering of search result pages. A search engine may process search queries received from a client. The search engine may determine one or more search results in response to the search query. One or more of the search results may be associated with prerender instructions, such that when the search results are received by the client, the client prerenders the search results associated with the prerender instructions. Prerender instructions may be associated with the search results in various manners, including ranking the search results based on relevance, or ranking the search results based on the likelihood of selection. Metrics and analytical data may be collected from the client to improve the search result prerendering process.



APPARATUS AND METHOD OF OPERATING CUSTOMIZED PROPOSAL SERVICE

Thu, 25 Aug 2016 08:00:00 EDT

An apparatus and method for operating a customized proposal service are provided. The apparatus includes a database (DB) configured to store use pattern information about one or more client devices, a communication module configured to communicate with the one or more client devices, and a processor configured to provide recommended information for a proposal service field based on a use pattern of a first client device, provide a second client with modified recommended information by reflecting feedback information when the feedback information about the provided recommended information is received from the first client device, and receive feedback information about the modified recommended information from the second client and evaluate the recommended information and the modified recommended information.



EFFICIENT RETRIEVAL OF FRESH INTERNET CONTENT

Thu, 25 Aug 2016 08:00:00 EDT

Aspects of the technology described herein increase the efficiency of a search session by determining whether fresh content is likely to be responsive to the user's query. Whether fresh content is likely to be responsive to a specific query is determined by retrieving social media posts that are responsive to the query. The social media posts are evaluated for virality, which is the tendency of a social media post to be circulated rapidly and widely from one Internet user to another. The virality of a social media post can be determined by comparing a number of times the social media post has been re-communicated by individual users. Queries that return viral social media posts may be classified as seeking fresh content.



PROACTIVE KNOWLEDGE OFFERS

Thu, 25 Aug 2016 08:00:00 EDT

A system and method for proactively making knowledge offers. A processor is configured to gather information on interactions by a user with resources provided by an enterprise having a customer contact center. The processor anticipates need of the user based on the gathered information, and generates a query based on the anticipated need. Prior to the user expressly requesting knowledge relating to a particular topic, the processor proactively identifies and suggests the knowledge to the user based on the generated query. The processor receives feedback relating to the suggested knowledge and outputs based on the feedback, a relevance score for the suggested knowledge.



Mitigating Subjectively Disturbing Content Through the Use of Context-Based Data Gravity Wells

Thu, 25 Aug 2016 08:00:00 EDT

A processor-implemented method, system, and/or computer program product mitigate subjectively disturbing content. A context-based data gravity wells membrane supports one or more gravity wells, which hold subjectively disturbing synthetic context-based objects made up of a non-contextual data object, a first context object, and a second context object. The first context object defines the non-contextual data object, and the second context object describes how subjectively disturbing content generated by combining the non-contextual data object and the first context object is according to predefined parameters described by the second context object. New content is passed across the context-based data gravity wells membrane. Subjectively disturbing content from the new content is trapped by the context-based data gravity well in response to a non-contextual data object and context objects from the new content matching those of the context-based data gravity well, thereby reducing a level of subjective discomfort imposed by the new content.



CONSTRUCTION OF BOOLEAN SEARCH STRINGS FOR SEMANTIC SEARCH

Thu, 25 Aug 2016 08:00:00 EDT

A system for information retrieval accessing any number of search engines over a distributed network or local network is presented. The system includes one or more pre-built ontologies or lexicons, representing areas of knowledge. The system includes a settings panel where searchers can preset default languages, default ontologies, and target search engines. The system includes an application that receives a variety of searcher input from a user interface such as a spinning wheel, or from a scrolling list. Through such selections, the application subsequently builds a Boolean search engine string of terms. The Boolean search string is then passed to the target search engine for retrieving semantically accurate search results. The Boolean search string provides a tight range on the search parameters and thereby delivers higher quality results that are more precise.



METHOD AND APPARATUS FOR GENERATING PARALLEL LOOKUP REQUESTS UTILIZING A SUPER KEY

Thu, 25 Aug 2016 08:00:00 EDT

The invention describes a network lookup engine for generating parallel network lookup requests for input packets, where each packet header is parsed and represented by a programmable parser in a format, namely a token, which is understandable by the engine. Each token can require multiple lookups in parallel in order to speed up the packet processing time. The sizes of lookup keys varies depending on the content of the input token and the protocols programmed for the engine. The engine generates a super key per token, representing all parallel lookup keys wherein the content of each key can be extracted from the super key through an associated profile identification. The network lookup engine is protocol-independent which means the conditions and rules for generating super keys are full programmable so that the engine can be reprogrammed to perform a wide variety of network features and protocols in a software-defined networking (SDN) system.



MULTI-INPUT PLAYLIST SELECTION

Thu, 25 Aug 2016 08:00:00 EDT

A device includes a processor and an interface. The processor is configured to identify a base topic of a personalized media stream. The processor is also configured to identify a first media item based on first data from a first source. The first data is assigned a first weighting of the first source based on an identified level of familiarity associated with the base topic and an identified level of popularity in another personalized media stream. The processor is also configured to build a collection of candidate media items that includes the first media item and a second media item. The processor is further configured to order the collection of candidate media items to form the personalized media stream. Ordering the collection includes ordering the first media item within the collection based on the first weighting. The interface is configured to communicate the personalized media stream to a client device.



METHODS FOR IDENTIFYING AUDIO OR VIDEO CONTENT

Thu, 25 Aug 2016 08:00:00 EDT

The disclosed technology generally relates to methods for identifying audio and video entertainment content. One claim recites network server comprising: an input for receiving data representing audio uploaded to said network server; memory for storing the data representing audio; one or more processors configured for processing the data representing audio to yield fingerprint data; memory for storing fingerprint data; one or more processors configured for: determining whether the fingerprint data incurs a potential match with the stored fingerprint data, the potential match indicating an unreliability in the match below a predetermined threshold; and issuing a call, upon a condition of unreliability in the match, requesting at least a first reviewer and a second reviewer to review the data representing audio; an interface for receiving results from the first reviewer and results from the second reviewer; and one or more processors configured for weighting results from the first reviewer differently than results from the second reviewer, and determining whether to allow public access to the data representing audio based at least in part on weighted results. Of course other combinations and claims are provided.



LOCAL CONTEXT SEARCH RESULTS IMPROVEMENTS

Thu, 25 Aug 2016 08:00:00 EDT

A method, system, and/or computer program product handles a query generated by a user of one of multiple local network devices that are coupled to a network. Multiple system queries request states of the local network devices. Query statements, responsive to the system queries and being sent to a wide area network search engine, are intercepted. A natural language query, which is a logical query that is answered by one of the multiple query statements, is generated from one of the multiple query statements. An unstructured query, from a user, about a state of a particular device is received. The unstructured query from the user is compared with the natural language query in order to determine if a match between the query from the user with the natural language query exceeds a predetermined threshold value.



INFERENCE OF QUERY RELATIONSHIPS BASED ON RETRIEVED ATTRIBUTES

Thu, 25 Aug 2016 08:00:00 EDT

Various example embodiments are provided for inferring relationships between a first query comprising a plurality of first terms and a second query comprising a plurality of second terms. In an example, queries are related based on the identification of common terms between the queries. One or more dissimilar terms are identified between the plurality of first terms and the plurality of second terms. A first number of dissimilar terms included in the first query and a second number of dissimilar terms included in the second query are identified. A weight is assigned to the relationship between the first query and the second query based on a difference between the first number and the second number.



PROVIDING ANSWERS TO QUESTIONS USING LOGICAL SYNTHESIS OF CANDIDATE ANSWERS

Thu, 25 Aug 2016 08:00:00 EDT

A method, system and computer program product for generating answers to questions. In one embodiment, the method comprises receiving an input query, decomposing the input query into a plurality of different subqueries, and conducting a search in one or more data sources to identify at least one candidate answer to each of the subqueries. A ranking function is applied to each of the candidate answers to determine a ranking for each of these candidate answers; and for each of the subqueries, one of the candidate answers to the subquery is selected based on this ranking. A logical synthesis component is applied to synthesize a candidate answer for the input query from the selected the candidate answers to the subqueries. In one embodiment, the procedure applied by the logical synthesis component to synthesize the candidate answer for the input query is determined from the input query.



PROVIDING ANSWERS TO QUESTIONS USING LOGICAL SYNTHESIS OF CANDIDATE ANSWERS

Thu, 25 Aug 2016 08:00:00 EDT

A method, system and computer program product for generating answers to questions. In one embodiment, the method comprises receiving an input query, decomposing the input query into a plurality of different subqueries, and conducting a search in one or more data sources to identify at least one candidate answer to each of the subqueries. A ranking function is applied to each of the candidate answers to determine a ranking for each of these candidate answers; and for each of the subqueries, one of the candidate answers to the subquery is selected based on this ranking. A logical synthesis component is applied to synthesize a candidate answer for the input query from the selected the candidate answers to the subqueries. In one embodiment, the procedure applied by the logical synthesis component to synthesize the candidate answer for the input query is determined from the input query.



Identifying System Performance Patterns in Machine Data

Thu, 25 Aug 2016 08:00:00 EDT

Methods and apparatus consistent with the invention provide the ability to organize and build understandings of machine data generated by a variety of information-processing environments. Machine data is a product of information-processing systems (e.g., activity logs, configuration files, messages, database records) and represents the evidence of particular events that have taken place and been recorded in raw data format. In one embodiment, machine data is turned into a machine data web by organizing machine data into events and then linking events together.



DATA PROCESSING METHOD AND DEVICE FOR INTERNET ENTITY ANALYSIS

Thu, 25 Aug 2016 08:00:00 EDT

The present disclosure discloses a data processing method and device for Internet entity analysis. The data processing method includes: acquiring a first entity state and a second entity state; acquiring first indicator data and second indicator data, the first indicator data being indicator data of the first entity state and the second indicator data being indicator data of the second entity state; and acquiring a corresponding relationship between the entity state and the indicator data, the corresponding relationship including a first corresponding relationship and a second corresponding relationship, the first corresponding relationship being a corresponding relationship between the first entity state and the first indicator data and the second corresponding relationship being a corresponding relationship between the second entity state and the second indicator data. By the present disclosure, correspondence between the indicator data of the Internet entity and all historical states of the Internet entity is implemented.



SCALABLE TOPOLOGICAL SUMMARY CONSTRUCTION USING LANDMARK POINT SELECTION

Thu, 25 Aug 2016 08:00:00 EDT

An example method comprises receiving data points, determining at least one size of a plurality of subsets based on a constraint of at least one computation device or an analysis server, transferring each of the subsets to different computation devices, each computation device selecting a group of data points to generate a first sub-subset of landmarks, add non-landmark data points that have the farthest distance to the closest landmark to create an expanded sub-subset of landmarks, create an analysis landmark set based on a combination of expanded sub-subsets of expanded landmarks from different computation devices, perform a similarity function on the analysis landmark set, generate a cover of the mathematical reference space to create overlapping subsets, cluster the mapped landmark points based on the overlapping subsets, create a plurality of nodes, each node being based on the clustering, each landmark point being a member of at least one node.



CLASSIFYING A DOCUMENT USING PATTERNS

Thu, 25 Aug 2016 08:00:00 EDT

Classifying a document using identified patterns includes determining frequent patterns related to a topical classification based on identification of a first group of resources; determining frequent anti-patterns that are related to a non-topical classification based on identification of a second group of resources; an classifying the document based on the frequent patterns and the frequent anti-patterns.



ZERO-DATA LOSS RECOVERY FOR ACTIVE-ACTIVE SITES CONFIGURATIONS

Thu, 25 Aug 2016 08:00:00 EDT

A system for providing continuous availability comprises a second computing site that is geographically remote from a first computing site. The second computing site comprises a storage unit configured to store units of work data and data synchronously replicated from the first computing site. The second computing site further comprises a group of workloads configured to process the units of work data asynchronously replicated from the first computing site. The second computing site further comprises a software replication module configured not to replicate any data while the first computing site is available.



ZERO-DATA LOSS RECOVERY FOR ACTIVE-ACTIVE SITES CONFIGURATIONS

Thu, 25 Aug 2016 08:00:00 EDT

A system for providing continuous availability comprises a second computing site that is geographically remote from a first computing site. The second computing site comprises a storage unit configured to store units of work data and data synchronously replicated from the first computing site. The second computing site further comprises a group of workloads configured to process the units of work data asynchronously replicated from the first computing site. The second computing site further comprises a software replication module configured not to replicate any data while the first computing site is available.



RELAXING TRANSACTION SERIALIZABILITY WITH STATEMENT-BASED DATA REPLICATION

Thu, 25 Aug 2016 08:00:00 EDT

Consistency of replicated data copies with statement-based replication is provided without requiring transaction serializability. At a subordinate replication node, a transaction start message, replicated data modification statements, and a transaction commit message are received for a next committed transaction from a master replication node, wherein the transaction start message carries a master transaction identifier, an invisibility list consisting of identifiers of other master transactions that had started and not yet committed when this master transaction started, and an earliest invisible master transaction identifier. The master transaction identifier, invisibility list, and earliest invisible transaction identifier are mapped to subordinate transaction identifiers to preserve an order of transaction identifiers from the master replication node. A subordinate transaction is started with the mapped subordinate transaction identifier and with an invisibility list consisting of the mapped subordinate transaction identifiers for the master invisibility list for execution of the received data modification statements.



GROUPING OF DATA POINTS IN DATA ANALYSIS FOR GRAPH GENERATION

Thu, 25 Aug 2016 08:00:00 EDT

Autogrouping is described. An example method includes receiving a data set, building a first partition of subsets of the data set, computing a first subset score for each subset using a scoring function, generating a next partition including at least one subset that includes the elements of two or more subsets of the first partition, computing a second subset score for each subset of the next partition using the scoring function, defining a max score for each particular subset using a max score function, each max score being based on maximal subset scores of that particular subset and at least the subsets of the first partition related to that particular subset, selecting output subsets, selection of each of the output subsets being made using a maximum score of previously computed subset scores, and generating a report indicating an output partition, the output subsets being associated with the received data set.



CROSS-ONTOLOGY MULTI-MASTER REPLICATION

Thu, 25 Aug 2016 08:00:00 EDT

A system and method providing cross-ontology multi-master replication is described. In a first embodiment a method for cross-ontology multi-master replication comprising the steps of: obtaining, at an importing site, an exporting site ontology and a set of one or more database changes; wherein the exporting site ontology defines a set of one or more data types; and after mapping the exporting site ontology to an importing site ontology, incorporating the set of one or more database changes into a database including mapping each of one or more data types of the set of data types to a data type defined by the importing site ontology using an ontology map.



AGGREGATION FRAMEWORK SYSTEM ARCHITECTURE AND METHOD

Thu, 25 Aug 2016 08:00:00 EDT

Database systems and methods that implement a data aggregation framework are provided. The framework can be configured to optimize aggregate operations over non-relational distributed databases, including, for example, data access, data retrieval, data writes, indexing, etc. Various embodiments are configured to aggregate multiple operations and/or commands, where the results (e.g., database documents and computations) captured from the distributed database are transformed as they pass through an aggregation operation. The aggregation operation can be defined as a pipeline which enables the results from a first operation to be redirected into the input of a subsequent operation, which output can be redirected into further subsequent operations. Computations may also be executed at each stage of the pipeline, where each result at each stage can be evaluated by the computation to return a result. Execution of the pipeline can be optimized based on data dependencies and re-ordering of the pipeline operations.



MEDIA DEVICE KNOWLEDGE BASE

Thu, 25 Aug 2016 08:00:00 EDT

A media content distribution service identifies a type of media device sending a request to the service over a network and to dynamically adapt content requested by the media device based on the identification. A request sent by a media device may, for example, identify a media content item a user desires to view at the media device, specify a search query for media content items, or otherwise request interaction with the service. According an embodiment, a media content distribution service may use information known about an identified media device type to dynamically adapt media content or other requested resources for display by the media device. By dynamically adapting media content and other resources based on an identified media device type, the media content distribution service may provide access to the services that is compatible with a wide range of media devices having varying device specifications and capabilities.



PROTECTED DATA TRANSFER

Thu, 25 Aug 2016 08:00:00 EDT

A data management controller for a data processing system, the data processing system being capable of running one or more user space applications, each user space application defining: (i) one or more interface storage locations with which the data management controller can interact, each interface storage location being capable of storing interface data; and (ii) one or more services for processing data, each service interacting with at least one interface storage location during a processing run; the data management controller being configured to: (i) register each of the interface storage locations as an input data location or an output data location in response to the user space application so identifying the respective interface storage location to the data management controller; (ii) register the output data locations of user space applications as designated inputs to input data locations of one or more other user space applications; and (iii) in response to a user space application signalling that a processing run of a service is complete, initiate copying of the interface data stored in the output data locations with which that user space application interacts to the input data locations to which those output data locations are the designated inputs.



SQL EXTENDED WITH TRANSIENT FIELDS FOR CALCULATION EXPRESSIONS IN ENHANCED DATA MODELS

Thu, 25 Aug 2016 08:00:00 EDT

A database language (e.g. SQL) is extended to define a transient field whose value is derived from data stored in a database. The value of the transient field is calculated by the database engine for consumption as needed by the application layer, for example as part of a particular data model. The value of the transient field may not be materialized as a persistent field in the underlying database table, or may be selectively materialized based upon a heuristic or hint. Certain embodiments may implement the transient field as a basic elaboration on standard SQL utilizing an identifier. Some embodiments may implement the transient field as an entity where SQL has been extended to accommodate concepts of a higher-level Entity Relationship Model (ERM). The use of constants and/or floating values (e.g. a current time) in connection with transient fields, is also disclosed.



SYSTEM AND METHOD FOR AGGREGATING QUERY RESULTS IN A FAULT-TOLERANT DATABASE MANAGEMENT SYSTEM

Thu, 25 Aug 2016 08:00:00 EDT

A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. Metadata objects are stored in a set of regions distributed among the nodes across the array. A given region is identified by hashing a metadata object attribute and extracting a given set of bits of a resulting hash value. A method of managing query results comprises: receiving, by a first node of the plurality of independent nodes from a client application, a request for a list of objects with a criterion; issuing by the first node a query to all the nodes based on the received request; processing the query by each node over the regions in the node using the metadata objects stored in the regions; aggregating and filtering by the first node results of the query from all the nodes; and returning by the first node the aggregated and filtered results to the client application.



RECOMMENDATION FOR AN INDIVIDUAL BASED ON A MOOD OF THE INDIVIDUAL

Thu, 25 Aug 2016 08:00:00 EDT

Generating recommendations for an individual based on a mood of the individual. Receiving information corresponding to one or more activities associated with an individual over a period of time. The received information corresponding to the one or more activities associated with the individual is processed to detect a mood of the individual. A recommendation is generated for the individual based on the detected mood of the individual and a future event associated with the individual. The future event has an occurrence at a later time instance.



PARALLEL TRANSACTIONAL-STATISTICS COLLECTION FOR IMPROVING OPERATION OF A DBMS OPTIMIZER MODULE

Thu, 25 Aug 2016 08:00:00 EDT

A method and associated system for improving the operation of an optimizer module of a database-management system. A processor of a computer system captures and stores information about the database's recent transactions, where the captured information describes how each transaction altered the logical description of the database or revised data stored in the database. The processor uses this captured information to update stored metadata that identifies the database's logical structure, and to further update stored database statistics that describe characteristics of the data stored in the database. These updated statistics are then returned to the production database's optimizer module, which uses them to determine how to efficiently respond to database-access requests.



SYSTEMS AND METHODS FOR QUANTILE DETERMINATION IN A DISTRIBUTED DATA SYSTEM

Thu, 25 Aug 2016 08:00:00 EDT

In accordance with the teachings described herein, systems and methods are provided for estimating quantiles for data stored in a distributed system. In one embodiment, an instruction is received to estimate a specified quantile for a variate in a set of data stored at a plurality of nodes in the distributed system. A plurality of data bins for the variate are defined that are each associated with a different range of data values in the set of data. Lower and upper quantile bounds for each of the plurality of data bins are determined based on the total number of data values that fall within each of the plurality of data bins. The specified quantile is estimated based on an identified one of the plurality of data bins that includes the specified quantile based on the lower and upper quantile bounds.



Systems and Methods for Quantile Estimation in a Distributed Data System

Thu, 25 Aug 2016 08:00:00 EDT

In accordance with the teachings described herein, systems and methods are provided for estimating quantiles for data stored in a distributed system. In one embodiment, an instruction is received to estimate a specified quantile for a variate in a set of data stored at a plurality of nodes in the distributed system. A plurality of data bins for the variate are defined that are each associated with a different range of data values in the set of data. Lower and upper quantile bounds for each of the plurality of data bins are determined based on the total number of data values that fall within each of the plurality of data bins. The specified quantile is estimated based on an identified one of the plurality of data bins that includes the specified quantile based on the lower and upper quantile bounds.



DOCUMENT SEARCH APPARATUS AND DOCUMENT SEARCH METHOD

Thu, 25 Aug 2016 08:00:00 EDT

A document search apparatus receives a request (search request) from a user, and issues to a document set management system a search query that constructed in accordance with the limits on the use of a search service. A storage unit stores a plurality of search terms. A generation unit selects two or more of the search terms. The generation unit determines a combination of search terms to be selected such that the size of the search query is equal to or less than a first threshold, and such that an estimated value of the number of documents to be retrieved by the document set management system in response to the search query is equal to or less than a second threshold.



SYSTEMS AND METHODS OF USING AN ARTIFICIALLY INTELLIGENT DATABASE MANAGEMENT SYSTEM AND INTERFACES FOR MOBILE, EMBEDDED, AND OTHER COMPUTING DEVICES

Thu, 25 Aug 2016 08:00:00 EDT

The current disclosure generally relates to database management systems (DBMSs) and may be generally directed to methods and systems of using artificial intelligence (i.e. machine learning and/or anticipation functionalities, etc.) to learn a user's use of a DBMS, store this “knowledge” in a knowledgebase, and anticipate the user's future operating intentions. The current disclosure may also be generally directed to associative methods and systems of constructing DBMS commands. The current disclosure may also be generally directed to methods and systems of using a simplified DBMS command language (SDCL) for associative DBMS command construction. The current disclosure may also be generally directed to arfificially intelligent methods and systems for associative DBMS command construction. The current disclosure may also be generally directed to methods and systems for associative DBMS command construction through voice input. Other methods, systems, features, elements and/or their embodiments are also disclosed.



SERVICE INTERFACE FOR EVENT DATA STORE

Thu, 25 Aug 2016 08:00:00 EDT

A processing device receives a query from a service, the query comprising a first field value, a time period and a content request. The processing device performs a first search of a data store using the first field value to identify a plurality of events having the time period and at least one field that comprises the first field value and determines a first subset of the plurality of events associated with a first context definition. The processing device determines a plurality of fields specified in the first context definition and further determines, for events in the first subset, field values of one or more fields specified in the first context definition. The processing device determines, from the field values of the one or more fields specified in the first context definition, content that satisfies the content request and generates a response to the query that comprises the content.



METHOD AND APPARATUS FOR IDENTIFYING MEDIA FILES BASED UPON CONTEXTUAL RELATIONSHIPS

Thu, 25 Aug 2016 08:00:00 EDT

A method, apparatus and computer program product are provided to facilitate the identification of one or more media files stored on respective ones of a plurality of user devices. In the context of a method, a current context is determined. The method also automatically identifies one or more media files stored on respective ones of a plurality of user devices based upon a relationship between a context associated with the respective media file and the current context. The method also causes the one or more media files to be transferred to an output device for presentation. A corresponding apparatus and computer program product are also provided.



SEARCH QUERY BASED FORM POPULATOR

Thu, 25 Aug 2016 08:00:00 EDT

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for populating a form using a search query. In one aspect, a method include actions of providing a form for display on a user device. Additional actions include, while a particular field of the form is selected, receiving a request to perform a search query, in response to receiving the request, receiving one or more query terms, obtaining a result of performing a search query that includes the one or more query terms, and automatically populating the particular field of the form with the result of the search query.



ALGORITHMIC CHANGING IN A STREAMING ENVIRONMENT

Thu, 25 Aug 2016 08:00:00 EDT

A stream computing application may permit one job to connect to a data stream of a different job. As more jobs dynamically connect to the data stream, the connections may have a negative impact on the performance of the stream computing application. A variety of performance indicators (e.g., CPU utilization or tuple rate) may be monitored to determine if the dynamic connections are harming performance. If they are, the stream algorithm may be modified to mitigate the effects of the dynamic connections.



WINDOW MANAGEMENT FOR STREAM PROCESSING AND STREAM REASONING

Thu, 25 Aug 2016 08:00:00 EDT

Disclosed is a system and method for providing data required for resolving a query. A data receiving module may receive a dataset captured by a plurality of sensors. A logic manager module may create a space for storing the dataset in a window of a plurality of windows. The logic manager module may further receive the query from a user. In one aspect, the query may either be registered query or an ad-hoc query. A window manager module may determine the data based upon the query. The window manager module may further resize the window when the query is the registered query. A learning module may select a maximum size window having a maximum size amongst the plurality of windows when the query is the ad-hoc query. A data facilitating module may provide the data in order to resolve the query.



Normalization and Extraction of Log Data

Thu, 25 Aug 2016 08:00:00 EDT

Extracting data from traffic logs using regular expressions. A traffic log is received from a network device. A characterization of an extraction of data from the traffic log is determined. The traffic log is parsed by applying a first regular expression to the traffic log according to the characterization of the extraction of data from the traffic log to generate parsed data. Data is extracted from the traffic log by applying a second regular expression to the parsed data according to the characterization of the extraction of data from the traffic log to generate extracted data.



METHOD FOR EN PASSANT WORKLOAD SHIFT DETECTION

Thu, 25 Aug 2016 08:00:00 EDT

Embodiments of the present invention provide systems, methods, and computer program products for detecting shifts in types of workloads handled by a relational database management system. Embodiments of the present invention can afford relational database administrators with the ability to leverage information pertinent to the current type of workload being handled by the relational database management system. Furthermore, embodiments of the present invention provide relational database administrators with information in regard to system workload states and workload transitions.



QUERY OPTIMIZATION ADAPTIVE TO SYSTEM MEMORY LOAD FOR PARALLEL DATABASE SYSTEMS

Thu, 25 Aug 2016 08:00:00 EDT

A method for adaptively generating a query execution plan for a parallel database distributed among a cluster of data nodes includes receiving memory usage data from a multiple data nodes including network devices, calculating a representative memory load corresponding to the data nodes based on the memory usage data, categorizing a memory mode corresponding to the data nodes based on the calculated representative memory load, calculating an available work memory corresponding to the data nodes based on the memory mode, and generating the query execution plan for the data nodes based on the available work memory, wherein the memory usage data is based on monitored individual memory loads associated with the data nodes and the query execution plan corresponds to the currently available work memory.



Method of Optimizing Queries Execution on a Data Store

Thu, 25 Aug 2016 08:00:00 EDT

A method and a server to optimize query execution on a data store are disclosed. The query execution in the present disclosure is optimized by grouping one or more queries, requiring same portion of data from the data store, into one or more groups. Grouping of the one or more queries into the one or more groups is achieved from one or more metadata included in the one or more queries specified by a user who wishes to retrieve the results based on the one or more metadata. The one or more queries grouped under the one or more groups are executed that involves scanning of the data store only for once. In such way, each query is returned with required results from the data store with minimum latency.