Abstract: Embodiments of the present invention are directed to facilitating data model acceleration in association with an external data system. In accordance with aspects of the present disclosure, at a core engine, a search request associated with a data model is received. The data model generally designates one or more fields, from among a plurality of fields, that are of interest for subsequent searches. Thereafter, it is determined that an accelerated data model summary associated with the data model is stored at an external data system remote from the core engine that received the search request. The accelerated data model summary includes field values associated with the one or more fields designated in the data model. A search for the received search request is initiated using the accelerated data model summary at the external data. A set of search results relevant to the search request is obtained and provided to a user device for display to a user.

Abstract: A process for mining existing views to generate new views is provided herein. A request to generate a proposed view combining a plurality of tables in a database may be received. One or more existing views in the database applicable to the request may be identified. The applicable existing views may include the plurality of tables in the request. One or more paths combining the plurality of tables may be identified in the respective one or more existing views. The identified one or more paths may be provided. One or more scores for the one or more paths may be generated and provided along with the one or more paths. A path may be automatically selected based on the scores or a path may be selected by a user. A view may be generated based on the selected path.

Abstract: Systems and methods for visualizing and manipulating graph databases in accordance embodiments of the invention are disclosed. In one embodiment of the invention, a graph database manipulation device includes a processor and a memory configured to store a graph database manipulation application, wherein the graph database manipulation application configures the processor to obtain a graph database including a set of nodes and a set of edges, determine a source node within the set of nodes, locate a set of related nodes based on the source node and the set of edges, recursively locate a set of sub-related nodes based on the set of related nodes and the set of edges, generate a representation of the set of related nodes from the perspective of the source node, and recursively update the generated representation of the set of sub-related nodes from the perspective of the source node and the related nodes.

Abstract: Embodiments are directed to facilitating data model acceleration in association with an external data system. In some embodiments, at a core engine, a search request associated with a data model is received. The data model generally designates one or more fields, from among a plurality of fields of interest for subsequent searches. Thereafter, it is determined that an accelerated data model summary associated with the data model is stored at an external data system remote from the core engine that received the search request. The accelerated data model summary includes field values associated with the one or more fields designated in the data model. A search for the received search request is initiated using the accelerated data model summary at the external data. A set of search results relevant to the search request is obtained and provided to a user device for display to a user.

Abstract: 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.

Abstract: Prepending a name object or setting a type of a software object to a name and prepending a value object to the software object provides inheritance of a name value pattern by the software object to establish particular types or classes of attributes of the software object without modification of the software object itself that is thus strongly typed and accessible by type.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for evaluating recursive predicates and exiversal predicates. One of the methods includes receiving an expression having an exiversal quantifier that specifies a condition x and a condition y. The expression is transformed into a second expression having multiple recursive calls, the second expression having a first non-negated term with a first recursive call in the condition y, and a second negated term with a second recursive call in the condition y. The second expression is evaluated using evaluation predicates that include a single delta predicate that replaces only the recursive call in the first non-negated term to identify data elements in the relation having at least one attribute satisfying the condition x and the condition y, and, for each attribute of the data element satisfying the condition x, the attribute also satisfies the condition y.

Abstract: Provided are a method, apparatus and a cloud detection system for detecting a network device. The method includes that a detection packet library is created based on characteristic information and service configuration of a network device; characteristic information and service configuration of a to-be-detected network device are acquired; a detection packet is matched in the detection packet library according to the acquired characteristic information and service configuration of the to-be-detected network device, and the to-be-detected network device is detected by using the matched detection packet.

Abstract: Prepending a name object or setting a type of a software object to a name and prepending a value object to the software object provides inheritance of a name value pattern by the software object to establish particular types or classes of attributes of the software object without modification of the software object itself that is thus strongly typed and accessible by type.

Abstract: A semantic query over an RDF database is received with RDF database statistics and access methods for evaluating triple patterns in the query. The semantic query is expressed as a parse tree containing triple patterns and logical relationships among the triple patterns. The parse tree and access methods create a data flow graph containing a plurality of triple pattern and access method pair nodes connected by a plurality of edges, and an optimal flow tree through the data flow graph is determined such that costs are minimized and all triple patterns in the semantic query are contained in the optimal flow tree. A structure independent execution tree defining a sequence of evaluation through the optimal flow tree is created and is transformed into a database structure dependent query plan. This is used to create an SQL query that is used to evaluate the semantic query over the RDF database.

Abstract: Prepending a name object or setting a type of a software object to a name and prepending a value object to the software object provides inheritance of a name value pattern by the software object to establish particular types or classes of attributes of the software object without modification of the software object itself that is thus strongly typed and accessible by type.

Abstract: Multiquery optimization is performed in the context of RDF/SPARQL. Heuristic algorithms partition an input batch of queries into groups such that each group of queries can be optimized together. The optimization incorporates an efficient algorithm to discover the common sub-structures of multiple SPARQL queries and an effective cost model to compare candidate execution plans. No assumptions are made about the underlying SPARQL query engine. This provides portability across different RDF stores.

Abstract: The described implementations relate to recursive streaming queries. One technique processes a recursive streaming query through a query graph. The technique also detects when output produced by executing the query graph advances to a specific point.

Abstract: Disclosed is an improved approach for implementing an on-demand scheduler in a mobile device and the structures to support realtime on-demand schedulers. A lightweight word-based structure is disclosed for storing scheduling-related data on the mobile device. Using this lightweight word-based structure enables on-demand and real-time scheduling. This type of lightweight structure also permits scheduling activities to be performed in a disconnected mode, which can then be later synchronized with the server to confirm the booking In addition to appointment scheduling, this technique can also be implemented for scheduling of any type of resource.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for expressing and evaluating aggregation functions, including aggregation functions in the context of recursive aggregates, in data languages that implement fixed point semantics. One of the methods includes receiving input specifying, explicitly or implicitly, an aggregation function agg having an input type and an output type, a relation s that has a domain and a range and that represents one or more entities to be aggregated over, and a relation t that is a relation from the range of s to the input type of the aggregation function agg; and evaluating an aggregation construct agg* to calculate a relation between the domain of s and the output type of the aggregation function agg according to agg*(s, t)={(m, agg(n))|?d: (m,d)?s,n??{|t(y)|y?s(m)|}}.

Abstract: Provided are a method, system, and computer program product for determining entity relationship information for identity records to add to an entity database. For each selected identity record of a plurality of identity records, an individual query on selected attribute values of the selected identity record is applied against at least one set of entity records to determine a candidate list of the entity records in the at least one set determined to be related to the selected identity record based on the selected attribute values of the selected identity record. Entity relationship information on entity records from the candidate list that are determined to be related to the selected identity record are stored in the entity database.

Abstract: A method and apparatus for extending LCDS imaging data stream imaging capabilities. An imaging data stream can be modified to permit the imaging data stream to implement at least one full-color call for rendering full-color forms and full-color jobs via at least one rendering device within a rendering system. This can be accomplished by creating and associating at least one full-color extension with a syntax of the imaging data stream in order to implement the at least one full-color call in an extensible set of color spaces, and also compactly decoding, storing indexing and searching the at least one full-color call within a particular job. In addition, an LCDS imaging data stream can be modified to provide an image substitution pathway to permit at least one full-color image included in said LCDS imaging data stream to be substituted for monochrome images or highlight color images.

Abstract: It is presented a method for notifying at least a first condition in an industrial system by means of a monitoring system in order to draw the attention of an operator monitoring the industrial system to the at least one condition. The method comprises displaying (S1) the first condition in a first portion of a display screen of the monitoring system, determining (S2) by means of eye tracking an area where a user focuses on the display screen, the area where the user focuses differing from the first portion, and alerting (S3) the user of the first condition in order to allow the user to be notified of the first condition in the industrial system. A monitoring system is also presented herein.

Abstract: In a system manages a plurality of pieces of sensor information in a plant, or the like, it can be reducing an amount of data stored in a database and easily a processing for searching a place of an anomaly and an anomaly cause. A database management method for use in a computer for managing a database, the database management method including: a step of analyzing a query; a step of generating a first inquiry for searching the database for compressed data; a step of generating a second inquiry for executing a search of time-series data; a step of extracting given data from the obtained time-series data, based on a response result of the second inquiry; and a step of generating an output result by extracting data to be output to a client computer from the given data.

Abstract: Systems and methods for identifying which video segment is being displayed on a screen of a television system. The video segment is identified by deriving data from the television signals, the derived data being indicative of the video segment being displayed on the screen. This feature can be used to extract a viewer's reaction (such as changing the channel) to a specific video segment (such as an advertisement) and reporting the extracted information as metrics. The systems and methods may further provide contextually targeted content to the television system. The contextual targeting is based on not only identification of the video segment being displayed, but also a determination concerning the playing time or offset time of the particular portion of the video segment being currently displayed.

Abstract: Method for retrieving data from an object database stored in a server (220) as a network (501) of objects (502) connected via links (503), said method including the steps of: storing (301) said object database in a server (220); forming (302) at a client (210) a request for a requested object (903) of a predetermined identity in said database and objects (904) connected to said requested object (903); transmitting (303) said request from said client (210) to said server (220) over a computer network (230); creating a data package containing said requested object (903) and objects connected to said requested object; and transmitting (306) said data package to said client. The invention furthermore relates to a system for retrieving data from an object database, a server, a computer program, a computer program product and a computer system.

Abstract: Implementations of the present disclosure include actions of actions of receiving a search query from a searching user, determining that the search query corresponds to a trigger query and, in response, providing data associated with the first set of authoritative users for potential display to the searching user, determining a second set of authoritative users based on the first set of authoritative users, for each authoritative user in the second set of authoritative users, receiving a contact status between the authoritative user and the searching user within a social networking service, and transmitting instructions to display data associated with authoritative users of the second set of authoritative users with search results responsive to the search query, the data including the contact status for each authoritative user in the second set of authoritative users.

Abstract: A method and a system for efficient search of string patterns characterized by positional relationships in a character stream are disclosed. The method is based on grouping string patterns of a dictionary into at least two string sets and performing string search processes of a text of the character stream based on individual string sets with the outcome of a search process influencing a subsequent search process. A system implementing the method comprises a dictionary processor for generating string sets with corresponding text actions and search actions, a conditional search engine for locating string patterns belonging to at least one string set in a text according to a current search state, a text operator for producing an output text according to search results, and a search operator for determining a subsequent search state.

Abstract: The current application discloses a database management system that provides multiple-input, multiple-output-per-input user-defined-function-based operations. The database management system comprises at least one processor and electronic memory, a database-query processor, executed on a computer processor controlled by computer instructions stored in a computer-readable memory, that makes multiple calls to a multiple-input, multiple-output-per-input user-defined-function, in each call transmitting a next input to the multiple-input, multiple-output-per-input user-defined-function, and the multiple-input, multiple-output-per-input user-defined-function, executed on a computer processor controlled by computer instructions stored in a computer-readable memory, that uses three different memory buffers, the contents of which are maintained for three different time periods, to compute and return to the database-query processor multiple outputs in response to at least one of the multiple inputs.

Abstract: A stream data processing computer comprises: a query execution module to receive an input stream of stream data, manage execution order of operators for executing a query, and output an output stream, the operators including static recursive execution modules, a judge operator, and a dynamic recursive execution module; and a memory including a temporal store to store data generated in executing the query. The static recursive execution modules are configured to conduct a recursive number of static recursive execution of the query. The judge operator is configured to determine whether a preset condition is met after the recursive number of static recursive execution of the query. The dynamic recursive execution module is configured, if the preset condition is not met, to continue execution of the query by dynamic recursive execution from a last result of a last module of the static recursive execution modules, based on a dynamic recursive value.

Abstract: Embodiments are directed towards providing a list of potential friends to a user based on an analysis of friends' contact lists. The user may provide a subset of friends within a contact list for analysis, along with a degree of separation over which to perform the analysis, and/or a minimum threshold number of occurrences for identifying a candidate friend. The subset of friends' contact lists may then be recursively traversed and merged, where common friends may be identified as members of a candidate set for suggesting friends to the user. In one embodiment, the candidate members may be retained within the candidate set if there is a commonality between the friends and the candidate that exceeds the minimum threshold. The candidate list may also be rank order using various approaches, including a weighted energy diffusion model based in part on a number of communications between the candidates.

Abstract: A computer-implemented method includes obtaining a database table, the database table including data arranged in a plurality of rows and a plurality of columns, each column of data being associated with a different tag that specifies a category for data in the column, using one or more processors to identify a first predictive model, from a collection of predictive models, that can be applied to the database table to generate a predictive output, in which identifying the first predictive model is based on one or more of the different tags, adding a name associated with the first predictive model to a set of names of predictive models that are compatible with the database table, and providing the set of names of predictive models to a client device.

Abstract: A method and an apparatus for word quality mining and evaluating are disclosed. The method includes: calculating a Document Frequency (DF) of a word in mass categorized data; evaluating the word in multiple single-aspects according to the DF of the word; and evaluating the word in multiple aspects according to the multiple single aspect evaluations to obtain an importance weight of the word. According to the solution of the present invention, the importance of the word in the mass categorized data may be evaluated, and words with high quality may be obtained through an integrated evaluation.

Abstract: Systems and methods for identifying which video segment is being displayed on a screen of a television system. The video segment is identified by deriving data from the television signals, the derived data being indicative of the video segment being displayed on the screen. This feature can be used to extract a viewer's reaction (such as changing the channel) to a specific video segment (such as an advertisement) and reporting the extracted information as metrics. The systems and methods may further provide contextually targeted content to the television system. The contextual targeting is based on not only identification of the video segment being displayed, but also a determination concerning the playing time or offset time of the particular portion of the video segment being currently displayed.

Abstract: The present disclosure includes a system and method for determining proximity to topics of content items (e.g., an advertisement or “ad”). In some implementations, a method includes identifying search criteria associated with keywords of a content item. The keywords used in determining whether or not to embed the content item in Web pages including search results. Numerical scores for the search criteria is determined based, at least in part, on a topic of the content item, the numerical score indicative of proximity to the topic of the content item.

Abstract: REVISE this to be consistent with the new claim 1 . . . The present disclosure includes a system and method for identifying negative keywords associated with advertisements. In some implementations, a method for advertising includes identifying one or more keywords associated with an advertisement. The keywords used to embed the advertisement in web pages such as those including search results. By identifying, from the plurality of search criterion, a subset of search criterion as being off-topic to the advertisement item, one or more negative keywords may be derived from the subset of off-topic search criterion in order to limit the embedding of non-relevant advertisements in web page content.

Abstract: Methods, and systems, including computer programs encoded on computer-readable storage mediums, including a method for determining a relevance of search keywords to an advertisement. The method includes accessing ad keyword data specifying an ad keyword associated with an advertisement; identifying a keyword cluster specifying terms related to a topic of the advertisement; determining whether the ad keyword occurs in the at least one keyword cluster; identifying one or more search keywords to which the advertisement is responsive; determining whether the one or more search keywords occur in the at least one keyword cluster; and determining, by one or more data processors, a relevance of the one or more search keywords to the advertisement based on the determination of whether the ad keyword occurs in the at least one keyword cluster and the determination of whether the one or more search keywords occur in the at least one keyword cluster.

Abstract: A system includes a computer(s) coupled to a data storage device(s) that stores a training data repository and a predictive model repository. The training data repository includes retained data samples from initial training data and from previously received data sets. The predictive model repository includes at least one updateable trained predictive model that was trained with the initial training data and retrained with the previously received data sets. A new data set is received. A richness score is assigned to each of the data samples in the set and to the retained data samples that indicates how information rich a data sample is for determining accuracy of the trained predictive model. A set of test data is selected based on ranking by richness score the retained data samples and the new data set. The trained predictive model is accuracy tested using the test data and an accuracy score determined.

Abstract: Methods, systems, and apparatus, including computer programs encoded on one or more computer storage devices, for training and retraining predictive models. A series of training data sets for predictive modeling can be received, e.g., over a network from a client computing system. The training data included in the training data sets is different from initial training data that was used with multiple training functions to train multiple trained predictive models stored in a predictive model repository. The series of training data sets are used with multiple trained updateable predictive models obtained from the predictive model repository and multiple training functions to generate multiple retrained predictive models. An effectiveness score is generated for each of the retrained predictive models. A first trained predictive model is selected from among the trained predictive models included in the predictive model repository and the retrained predictive models based on their respective effectiveness scores.

Abstract: Provided is a method for grouping identity records to generate candidate lists to use in an entity and relationship resolution process. A plurality of identity records provide attributes of entities. The received identity records are grouped into a group of identity records. A composite query on values for selected attributes of the identity records in the group is generated and applied to an entity database to obtain composite results of entity records in the entity database matching the attribute values of the composite query. For the identity records in the group, an individual query on attributes of one of the identity records is performed against the composite results of the entity records to determine a candidate list of entity records from the entity database for the identity record.

Abstract: Provided are a method, system, and computer program product for grouping identity records to generate candidate lists to use in an entity and relationship resolution process. Identity records provide attributes of entities and are grouped into a group of identity records. A composite query on values for selected attributes of the identity records in the group is generated and applied to an entity database to obtain composite results of entity records in the entity database. For the identity records in the group, an individual query on attributes of one of the identity records is performed against the composite results of the entity records to determine a candidate list of entity records. Resolution rules are applied to determine entity records in the determined candidate list related to one of the identity records in the group according to the resolution rules.

Abstract: Techniques for defocusing queries over big datasets and dynamic datasets are provided to broaden search results and incorporate all potentially relevant data and avoid overly narrowing queries. An analytic component can receive queries directed at one region of a dataset and analyze the queries to generate inferences about the queries. The queries can then be defocused by a defocusing component and incorporate a larger dataset than originally searched to broaden the queries. The larger dataset can incorporate all, or a part of the original dataset and can also be disparate from the original dataset. Clusters of queries can also be merged and unified to deal with ‘local minima’ issues and broaden the understanding of the dataset. In other embodiments, dynamic data can be monitored and changes tracked, to ensure that all portions of the dataset are being searched by the queries.

Abstract: A source configuration management database (CMDB) is of an information technology (IT) infrastructure that includes an IT resource represented by a configuration item (CI). A target CMDB is of the IT infrastructure that includes the IT resource, too. The given CI is recursively reconciled to the target CMDB from the source CMDB.

Abstract: The present invention discloses a method for querying and controlling a database, particularly, a method for identifying and anti-identifying in the database, and a method for querying an association model in the database in a recursion manner. The present invention further discloses a method for displaying the query result obtained through the query method.

Abstract: Methods and systems are provided, for persistent querying in a federated database system. A federated database system has a plurality of connectable database management system nodes, each database node having at least one database. Persistent querying includes: receiving a query at a first database node and propagating the query from the first database node to other database nodes in the federated database system. A responding database node satisfying the query: obtains a query results set; defines a topic identifier for the query; and publishes subsequent messages relating to the topic identifier when data updates are available. The first database node receives query results sets from one or more responding nodes and the first database node subscribes to topic identifiers for publications of subsequent messages from the responding database nodes. Subsequent messages are published relating to the query along the connection through which the query is returned.

Abstract: Many integrated development environments provide “intelligent feedback” to developers. Current “intelligent feedback” techniques may not work well with source code files comprising context sensitive programming languages because edits to one place in the code may change the meaning of arbitrary other places in the code, thus requiring additional full semantic parses to maintain correctness of the system. As provided herein, context-free “name” parsing may be performed to support entity candidate recursive semantic parsing in determining the meaning of the entity. A name parse may be performed to build and/or update a name table and a range table comprising names of entities and their positions within a source code file. Upon receiving a request to determine the meaning of a selected entity within the source code file, the tables may be queried to determine entity names and locations that are to be semantically parsed to determine a selected entity meaning.

Abstract: To provide an improved user experience for users of a web browser, embodiments of the invention save queries entered by a user via the web browser. The queries may be for execution on different network search services, such as search engines, social networks, message posting services, and the like. At various times in the future, the web browser then executes the saved search queries on their corresponding network search services, identifies search results that are new and highly relevant to the user, and provides the identified search results to the user.

Abstract: A method, system and computer program product is disclosed for intelligent data mining. The method comprises receiving an event from an application, assigning property weights to properties of the event, and building a query from these properties based on the property weights. The method further comprises assigning search engine weights to a group of search engines, selecting at least some of the search engines based on the search engine weights, and sending the built query to the selected search engines. Results from the selected search engines are stored in a knowledge repository and used to adjust the property weights and the search engine weights. The invention may be used to provide an analysis with information about a problem, and to manage a solutions database which can be used for problem determination. The invention provides a low cost solution for collecting relevant information from online sources.

Abstract: A method of organizing, managing, and providing interactive access to data in a database is disclosed, along with a program and a system for implementing the method. Associations between each data Item and at least one ItemSelector are established and stored. A predefined (but modifiable) Vocabulary of ItemSelectors sufficient to describe each Item of the database is created. Presently selected Items are described by a combination of associations defined by an appropriate Boolean combination of each ItemSelector in a presently selected set of ItemSelectors. A user controls the presently selected set by adding an ItemSelector from a presented group, or by removing a previously selected ItemSelector. The system ideally makes available to the user all relevant ItemSelectors—those which, if added to the presently selected set, would result in a set that describes at least one extant data Item. The system ideally makes all presently selected Items available to the user.

Abstract: A search query is received from a single input field of a user interface. A keyword search is performed based on the search query to generate keyword search results. A natural language search is performed of a frequently-asked question (FAQ) database based on the search query to generate FAQ search results. The keyword search results and the FAQ search results are combined in a display page.

Abstract: The present disclosure includes a system and method for identifying negative keywords associated with advertisements. In some implementations, a method for advertising includes identifying one or more keywords associated with an advertisement. The keywords used to embed the advertisement in Web pages such as those including search results. By scoring keywords to identify those keywords that are not relevant to the web page content, one or more negative keywords can be identified in order to limit the embedding of non-relevant advertisements in web page content.

Abstract: To provide an improved user experience for users of a web browser, embodiments of the invention save queries entered by a user via the web browser. The queries may be for execution on different network search services, such as search engines, social networks, message posting services, and the like. At various times in the future, the web browser then executes the saved search queries on their corresponding network search services, identifies search results that are new and highly relevant to the user, and provides the identified search results to the user.

Abstract: Semantic queries are expressed and executed within a relational database. This can be done by defining semantic rules applied to execute the semantic queries using table valued functions and common table expressions, and then simply calling the defined table valued functions to execute the queries.

Abstract: A system and method to reconcile Human Resource databases, including payroll, accounting, tax and travel databases, are provided. The system and method may include a database aggregation component that automatically gathers and stores a plurality of databases in a corporation business information system wherein these databases may be logically related to each other and a database reconciliation component that is capable of querying a database for retrieving data entries based on user instructions or on requests automatically generated according to preset conditions. The reconciliation method may further compare data from logically related databases. If discrepancies exist in a comparison result, the method may provide a drill-down step where data at next level of detail may be retrieved according to automatically generated queries. This reconciliation process of comparison and drill-down for more detail may continue until a preset condition is satisfied or there is no further detail to retrieve.

Abstract: The described implementations relate to recursive streaming queries. One technique processes a recursive streaming query through a query graph. The technique also detects when output produced by executing the query graph advances to a specific point.