Abstract: A hierarchical framework for a library of software process management methodologies includes at a first level of hierarchy, a collection of activities that describe the process, wherein each activity requires the use of a unique skill set domain. At a second level of hierarchy, the framework includes a collection of tasks that describe the activity. At a third level of hierarchy, the framework includes a collection of steps that describe the task. For each methodology, a portion of the activities are categorized across a set of taxonomies common to a plurality of methodologies contained in the library such that the portion of activities is reusable for the plurality of methodologies.

Abstract: Embodiments of the invention provide a novel and non-obvious method, system and computer program product for generating a document taxonomy based upon tag data in groupings of tags. In an embodiment of the invention, a method for generating a document taxonomy based upon tag data in groupings of tags has been claimed. The method includes retrieving into memory of a host computer different groupings of tags for correspondingly different documents providing a bottom-up view of the documents. The method further includes deriving a folksonomy from the groupings of tags for the documents and organizing the folksonomy into a hierarchy of nodes. Of note, each of the nodes can be associated with a different subject in the folksonomy. Finally, the method includes publishing the hierarchy of nodes as a taxonomy for the documents to provide a top-down view of the documents.

Abstract: Computer-implemented systems and methods generate forecasts or estimates with respect to one or more attributes contained in an attribute-based hierarchy. Physical hierarchical data and attribute input data are received so that an attribute-based hierarchy can be created. A mapping table is created that indicates relationships between the attribute-based hierarchy and the physical hierarchy, wherein the attribute-based hierarchy is accessed during model forecasting analysis or model estimation analysis.

Abstract: Disclosed are a method, information processing system, and computer readable medium for processing queries. The method includes receiving a data query for a set of hierarchical markup documents. At least one query path expression is extracted from the data query. The query path is processed against at least one shared hierarchical markup document in a plurality of shared hierarchical markup documents. The plurality of shared hierarchical documents is associated with the set of hierarchical markup documents. In response to the shared hierarchical markup document completely matching the query path expression, a query result for the data query is generated. The query result is based on the processing of the query path expression against at least one of the shared hierarchical markup document and the difference hierarchical markup document.

Abstract: Various embodiments of the invention can be used to organize and prioritize data to optimize the ability to answer business questions and address business needs. A data mapping system may be used to map value driver data elements to business questions to assess which data sets or sources of data are more important than others when assessing the business questions. This can assist in the process of identifying the most useful and accurate data for assessing a business question.

Abstract: A method in a data processing system and apparatus for organizing files, web pages, or web site members organized in a traditional first hierarchical file structure that is on a recordable medium of a data processing system. A user-defined metalabel is assigned to each of the electronic files, web pages, or web site members. The electronic files, web pages, or web site members are organized as a function of the metalabels into a second hierarchical file structure existing simultaneously with the first hierarchical file structure on the recordable medium of the data processing system. The files, web pages, or web site members can be organized or grouped by the metalabels for efficient searching or following conversations of group members on social networking sites.

Abstract: Applications of a domain specific model are described. A domain specific model may encode information about a domain. Information available in the domain specific model may be used to identify a topic of a conversation, such as a topic of a call to a call center. Callers' complaints can be categorized into coarse as well as fine topic categories by analyzing an initial part of a call and by examining a distribution of topic specific descriptive and discriminative features within the initial portion of the call. Once a call has been identified as belonging to a topic, a call-center agent may be prompted with information about the topic, such as questions and answers and actions related to the topic. Generic to specific information may be provided to the agent as the call progresses.

Abstract: Methods, systems, and apparatus, including computer programs encoded on one or more computer storage devices, for caching predictive models are described. Records are obtained, each record including a time of a previously submitted predictive request and an identifier of a trained predictive model. A trained scheduling model is generated using the records as training data. A set of identifiers of trained predictive models are determined from a plurality of trained predictive models that are stored in a secondary memory of a computing system. The target time is inputted to the trained scheduling model. In response, a second predictive output is received that comprises the set of identifiers. A set of trained predictive models are obtained that correspond to the set of identifiers from the secondary memory. The set of trained predictive models are stored in a primary memory of the computing system.

Abstract: A method of creating user-generated reports. The method begins with the step of receiving information related to consumer internet behavior. That information is then assembled into a database having facts and dimensions, in which the database resides on a server, the server being connected to a communications network. The method then provides a report generation system, including a report generation module resident on the server. The module generates a report, beginning with accepting user criteria for generating a report from a front end system resident on a client computer. It then generates from the database a dataset corresponding to the first report and forwards the same to the client computer, and it displays the report generated from the first dataset. The module then reiterates the report generation steps to generate a second report, the first report remaining resident on the client computer.

Abstract: Embodiments herein include systems, methods, software, and data structures to generate and render visualizations of configuration items (CIs) represented in a Configuration Management Database (CMDB). One embodiment includes receiving a request for a CI graph from a client including a focus CI identifier represented in a CMDB. The focus CI may be used to retrieve data of related CIs, the data including CI identifiers. A process is then executed for each retrieved CI identifier to retrieve CI data as a function of the received CI identifier and to build a node XML and an edge XML representation of relations between the CIs. This method also includes aggregating the node and edge XML representations into a single XML document and then translating the document into a markup language document capable of being rendered in a graphical user interface. The markup language document is then transmitted to the requestor.

Abstract: A security system that relates to industrial automation security comprises a component that receives a request to modify security relating to a zone of a factory floor, the zone being less than an entirety of the factory floor. A zonal security component generates security procedures for the zone, the security procedures differ from security procedures implemented on the factory floor outside the zone.

Abstract: Described are techniques for reporting requested information to a client. A bidirectional graph is stored in a cache. The bidirectional graph includes a first set of nodes and a second set of edges between pairs of nodes of the first set, each node of the first set representing an object in an object model of a server. Each edge of the second set between a pair of nodes of the first set represents an association between two objects corresponding to the pair of nodes. A request is received from the client. A response to the request is determined by traversing a portion of the bidirectional graph to extract first information, and filtering the first information in accordance with a usage context customized for the client.

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: Techniques implemented in methods, computer-readable media apparatus, and systems for graphically exploring an in-memory database include: identifying a selected data object; searching an in-memory database for a data element associated with a search term; and determining a relationship between the data element and the selected data object; and generating a displayable graph of the relationship as a path between the data element and the selected data object, the path comprising at least two nodes, where a first node represents the selected data object and a second node represents a node associated with the data element.

Abstract: Hierarchical structures are visualized and navigated using an orbital model. Sibling nodes are orbitally displayed in a generally circular arrangement along an orbital path. Choosing one of the orbitally displayed nodes opens it, moving down in the hierarchy. Nodes which were not chosen are undisplayed, and child node(s) of the chosen node are orbitally displayed. Node movements may be animated. A history displays recently chosen nodes. Choosing a parent node of the orbiting nodes undisplays the child nodes, and the parent node and its siblings are orbitally displayed, thereby moving up in the hierarchy. A user may select nodes from different parts of the hierarchy by moving them into a selection tray. Selected nodes can then be subjected to a specified batch operation. Controls are available for sorting nodes and/or for altering node appearance in the display.

Abstract: Disclosed is an apparatus and method for retrieving multimedia contents represented in a Moving Picture Experts Group (MPEG) 7 by transforming a user query into an MPEG-7 query format. The method for retrieving multimedia contents includes: representing a user query by using an indicator indicating a specific region of a Moving Picture Experts Group 7 (MPEG-7) document and a reference for referring to the indicator; analyzing a meaning of the user query represented by using the indicator and the reference to thereby produce an analysis result; and retrieving multimedia contents according to the analysis result. The present research can satisfy more than two retrieval conditions within the same structure in an MPEG-7 query format and it can also clearly represent that two different MPEG-7 documents are referred to. Since the meaning of a user query is analyzed accurately during retrieval process, it is possible to precisely retrieve multimedia contents.

Abstract: A method of synchronizing a virtual file system is implemented at a computing device. The virtual file system has a hierarchical tree structure including a plurality of tree nodes, each tree node having associated metadata and corresponding to a respective component of the virtual file system. Upon receipt of a request to generate a revision of a virtual file system in at least one storage device, the computing device serializes each tree node's associated metadata into an object, generates an object ID from the serialized object, and stores the object in the storage device if the object ID is not found in an object-storage mapping table associated with the virtual file system. Finally, the computing device inserts the object ID into the object-storage mapping table and stores the object-storage mapping table in the storage device after processing the last tree node.

Abstract: A database system automatically detects a cyclic construct in a XML schema, determines a database representation for the cyclic construct, and maps the XML schema and elements involved in the cyclic construct to the database representation.

Abstract: Systems, methods, and computer-readable media for representing and processing inter-slot co-occurrence constraints on component selection for dynamically generated content items are disclosed. Components available for constructing the content items are organized into a hierarchy of categories. Co-occurrence constraints are specified in terms of categories in the hierarchy rather than explicit enumerated black-lists or white-lists at the component-to-component level. A set of processing rules based on the hierarchical taxonomy are used to expand a set of co-occurrence constraints specified in terms of categories into explicit enumerations of allowed component combinations, and to resolve potential conflicts in the set of co-occurrence constraints in a predictable manner. The explicit enumerations of allowed component combinations can be stored in a relational data table. When constructing a content item, candidate components can be obtained by querying the relational data table.

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: The present invention relates to data processing systems and methods to facilitate debugging, development and execution of multidimensional database queries, such as MDX (Multi-Dimensional eXpressions), for a multidimensional database structure on a computer architecture running on a server, such as an OnLine Analytical Processing Server (OLAP). The expression or query can be broken down and executed incrementally and associated with contextual information which can be viewed by an end-user via an understandable user interface. The advantage is the drastic simplification of very complex computations, giving the user a perspective not available till now. This allows users to better understand multidimensional queries, find errors that occur in the execution and correct such errors.

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: Techniques for processing ontologies include a computer-implemented method of processing an ontology. The method includes storing data in an ontology and partitioning the ontology into a plurality of partitions. The partitions are distributed among a plurality of reasoner instances. The reasoner instances are directed to reason the partitions and the results from the reasoner instances are combined. If data is changed, an inference library resulting from the combined results may be updated by updating only those portions of the inference library affected by the changed data.

Abstract: A method is provided for constructing an ancestral recombination graph. A value K is received representing K extant units. M non-mixing segments are also received. K vertices V are generated. K lineages for each of M trees are associated with each of the K vertices. An ancestral recombination graph is constructed. To construct the ancestral recombination graph, there is repeated, until only one lineage survives for each of the M trees, a process that includes the following. A tree is randomly selected tree. A first vertex v1 and a second vertex v2 are randomly selected. Two adjoining segments in the M non-mixing segments of the first and second vertices are combined together into a single vertex. A separate vertex is generated for at least one remaining segment in each of the M non-mixing segments of the first and second vertices. The vertices V are updated to be vertices that are non-interior vertices.

Abstract: An artificial intelligence system and method for interpreting input from a user and generating a response to the user. The input is converted into an array of concepts which are compared to a database of interrelated concepts. A response is generated based on the concepts in the database and their relationship to the concepts in the input array. The system and method may be implemented in a number of electronic or computer devices to interact with humans or computer systems.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for aggregating on-demand database service data. These mechanisms and methods for aggregating on-demand database service data can enable embodiments to more flexibly summarize data. The ability of embodiments to provide such feature may lead to enhanced aggregation features which may be used for providing more effective ways of summarizing data.

Abstract: Embodiments of the present disclosure provide a method and system for defining one or more custom properties of a term in a hierarchical taxonomy. Embodiments described herein include identifying a term in a term-set using an identifier associated with the term and defining at least one new property for the term. Once the property is defined, the newly defined property is applied to the term.

Abstract: Disclosed is a method for identifying inactive objects in an entity. The inactive objects may be purged from an entity to reduce the size of the entity.

Abstract: A storage unit stores at least one attribute each assigned an attribute identifier uniquely identifying the attribute. Each attribute identifier is associated with at least one piece of equivalent reference data each representing the attribute. Each attribute identifier is not a word representing the attribute, and is made of a symbol having no meaning per se. A weight of association between an attribute identifier and each of at least one piece of equivalent reference data represents a degree of relatedness between the attribute and the piece of equivalent reference data. An operation unit determines whether or not given data is the same as a piece of equivalent reference data, obtains a weight of association between the piece of equivalent reference data determined to be the same and an attribute identifier, and selects the attribute when a sum of at least one weight obtained for the attribute satisfies a predetermined condition.

Abstract: Methods, systems, and apparatus, including computer programs encoded on one or more computer storage devices, for receiving training data for predictive modeling and executing multiple processes simultaneously to generate multiple trained predictive models using the training data and training functions. After executing the processes for an initial runtime, a convergence status of each process is determined that indicates a likelihood that the training function being executed will converge on the training data. Based on the determination, training functions are identified that are not likely to converge and processes that are executing these training functions are terminated. After an ultimate runtime has expired, processes that are still executing training functions that have not yet converged are terminated. An effectiveness score is generated for each of the trained predictive models that were successfully generated and a trained predictive model is selected based on the effectiveness scores.

Abstract: A classification method includes constructing queries from category descriptors representing categories of a taxonomy of hierarchically organized categories. The query constructed for a category c includes a query component based on descriptors of the category c and at least one query component based on descriptors of an ancestor or descendant category of the category c. A documents database is queried using the constructed queries to retrieve pseudo-relevant documents. Language models for the categories of the taxonomy are extracted from the pseudo-relevant documents by inferring a hierarchical topic model representing the taxonomy. An input document is classified by optimizing mixture weights of a weighted combination of categories of the hierarchical topic model respective to the input document.

Abstract: Various embodiments of systems and methods for extraction and grouping of feature words are described herein. Feature words are obtained from a first corpus of text bodies comprising a plurality of reviews. A second corpus is created using a combination of the obtained feature words, verbs and adjectives from the first corpus. The second corpus comprises filtered reviews and each of the filtered reviews pertains to a review. Topics are preliminarily assigned for words in the filtered reviews of the second corpus. For each of the feature words in the second corpus, a topic count is determined for every preliminarily assigned topic. After determining the topic count, one or more of the topics are finally assigned to the feature words based on a topic count value. At least one topic is presented as a group of the feature words for which the at least one topic is assigned based on the topic count value.

Abstract: A computing environment may be represented as a deployable object hierarchy, which may be organized according to an object hierarchy schema that is commonly shared among the computing environment host and the devices that are configured to render the computing environment. A particular object hierarchy schema is presented in detail for representing a computing environment, wherein many objects of the computing environment are modeled as resources that may be distinctly addressable (e.g., in a RESTful object hierarchy.) Many types of objects and properties thereof are presented in order to elucidate an exemplary object hierarchy schema and to illustrate exemplary objects and object hierarchies organized according thereto. Additional properties of various object hierarchy schemas include extensibility, deployability, and object addressing models with various advantages.

Abstract: Methods and arrangements for extracting tuples from a streaming XML document. A query twig is applied to the XML document stream, tuples are extracted from the XML document stream based on the query twig, and a quantity of extracted tuples is limited via foregoing extraction of duplicate tuples extraction of tuples that do not satisfy query twig criteria.

Abstract: Provided are an apparatus for providing a social network service using the relationship of ontology and a method thereof. The apparatus includes: an ontology storage unit storing social ontology defining relationship information between a user and a social network subscriber, service ontology defining position and relationship information of services, and tag ontology defining tag information related to information included in the social ontology and the service ontology; when a service request is inputted from the user, an ontology analysis unit retrieving a tag corresponding to the user's current position and the service request factor by using the relationship of the ontologies stored in the ontology storage unit; a service processing unit extracting the corresponding service on the basis of the retrieved tag information; and a service providing unit providing the user with the extracted service.

Abstract: In one aspect of the invention, a memory is described for facilitating splitting data by taxonomy. The memory is accessed by an application program, and includes one or more top-level categories, where each top-level category comprises a subset of the items; and also includes a category group corresponding to at least one of the top-level categories and the subset of the items belonging to the top-level categories.

Abstract: Described herein is a technology for visualizing data. In accordance with some implementations, dimension metadata is automatically extracted from multiple documents. The extracted dimension metadata may be used to populate one or more relation dimensions. Based on the dimension metadata, one or more relations between the documents are determined along the one or more relation dimensions. A relation graph is presented to represent the documents interconnected by the one or more relations.

Abstract: A manufacturing execution system contains a depicting device for depicting at least a part of a productive process to a hierarchically structured set of entities and an application programming interface for managing data in a data base and for inputting a tree into the application programming interface. The tree representing a hierarchical relationship between at least two entities of the hierarchically structured set of entities. A program device provides a method accessible by the application programming interface. The method is adapted to manipulate the hierarchically structured set of entities. A manipulating device is provided for manipulating the entities of the tree according to the method.

Abstract: One or more collaboration computers connected over the network may collaborate using their web browsers. Each collaboration computer may have one or more window locators that uniquely identify a web browser window on the browser. The web browser window can be a window where one or more events occur during the collaboration. One or more document locators may be derived from information describing a document path from the respective web browser window to a document within the respective web browser window. The document path can be a path in a hierarchical structure that includes the document and the respective web browser window. One or more transfer data structures may contain the window locator and the document locator and may be passed to and from the collaboration computer through a network connection to enable a collaboration session.

Abstract: A key/value store comprising a first tier storage device configured to store information about a plurality of keys for a plurality of values without the values, and a second tier storage device coupled to the first tier storage device and configured to store the values associated with the keys without the keys, wherein the first tier storage device has lower latency and higher throughput than the second tier storage device, and wherein the second tier storage device has higher capacity than the first tier storage device. Also disclosed is a method comprising receiving a key/value operation request at a first tier storage device, mapping a key in the key/value operation request to a locator stored in a second tier storage device if the key/value operation request is valid, and mapping the locator to a value in a third tier storage device if the key has a corresponding locator.

Abstract: A partial reverse key index is described, which allows distributed contention as resources vie to insert data into an index as well as allows range scans to be performed on the index. To do so, before an index entry for a key value is inserted into an index, the key value is transformed using a transformation operation that affects a subset of the order of the key value. The index entry is then inserted based on the transformed key value. Because the transformation operation affects the order of the key value, the transformed values associated with two consecutive key values will not necessarily be consecutive. Therefore, the index entries associated with the consecutive key values may be inserted into unrelated portions of the index.

Abstract: A method is provided for compressing results of a join query. A join order of a result set comprising multiple tuples is determined from the join query, and a nested hierarchy of dictionaries is maintained based on the join order. The nested hierarchy of dictionaries is used to encode each of the tuples of the result set so as to produce an encode tuple, and each of the encoded tuples is transmitted to a client system. Also provided is a method for decompressing results of a join query.

Abstract: Search engine process operates on data collections to expand a user's knowledge about select content (SC) words, data objects, etc. A prioritized hierarchical taxonomic system (H-tax-sys) encompasses some SC is set, input data is classified thereto, and non-matching data (non-SC) is identified. The non-SC are used as a search terms. Additionally-optionally, the process identifies input data as SC per n priority H-tax, and uses these as search terms. Additionally-optionally, input data matching SC is added as search terms. Additionally-optionally, search terms are extracted from the input based upon H-tax. Supplemental documents are gathered, H-tax classified, mapped and represented with and without mapped search terms.

Abstract: A retrieval device, from semi-structured data formed by item elements and value elements, creates aggregated structure information from the semi-structured data by aggregating the plurality of child item elements having the same name and directly connected to parent item elements having the same name, into one child item element. The device receives a retrieval request with an output condition and a constraint condition specified on the aggregate structure information. The device determines whether or not a plurality of query are created according to the retrieval request by checking a branch point at the common item elements between the output condition and the constraint condition in the aggregated structured information. And the device outputs a re-aggregate structure information corresponded to the query showing the branch point which is not expressed in the aggregate structure information to the display device.

Abstract: Systems and methods for automating and increasing the efficiency of access to data using inheritance of access rules within an organization based upon the relationship of positions within the organization and the roles associated with the positions. In one embodiment, a role structure is used in conjunction with a hierarchical organization structure to allow access rules to be inherited by some of the positions from other positions based upon the relationship of positions within the organization and the roles associated with the positions. Access rules can be applied across equivalent or similar positions, yet differentiated between distinct portions of the organization and the distinct roles associated with the positions. Consequently, particular access rules are not necessarily inherited by all of the positions subordinate to a particular position with which the rule originates, and are not necessarily inherited by all of the positions that are associated with a particular role.

Abstract: A business object model, which reflects data that is used during a given business transaction, is utilized to generate interfaces. This business object model facilitates commercial transactions by providing consistent interfaces that are suitable for use across industries, across businesses, and across different departments within a business during a business transaction.

Abstract: Systems and methods for assigning a product category and/or classification to user data based on a taxonomy of makes and models is provided. User data is received and converted to plain text. A taxonomy is provided, having a plurality of categories corresponding with product descriptions based on product makes and models. Rules are associated with the categories in the taxonomy and used to generate a category score for categories in the taxonomy. The category scores are used to assign at least one category from the taxonomy to the user data. A product class may also be assigned to the user data based on the assigned product category.

Abstract: An information processing device includes: a user information obtaining unit configured to obtain information relating to data of content that a user has used; a meta information obtaining unit configured to obtain content meta information corresponding to content that the user has used; a first vector generating unit configured to generate a first user preference vector with each of the obtained content meta information as elements thereof; a second vector generating unit configured to generate a second user preference vector wherein the generated first user preference vector is analyzed and the number of elements of the first user preference vector is compressed; and a user identifying unit configured to identify a user corresponding to a second user preference vector having a high similarity to a second user preference vector determined beforehand from multiple second user preference vectors.

Abstract: An apparatus for controlling subscriptions comprising: a detector operable to detect to a subscription associated with a wildcard topic string; and an analyzer, responsive to the detection of the subscription associated with a wildcard topic string and a topic string of a topic node matching the wildcard topic string, for analyzing a first attribute of the topic node; and means for determining whether a subscriber associated with the subscription should receive a message associated with the topic string of the topic node.

Abstract: A computer-based method for creating data mining task templates for utilization in data mining activities is described. The method includes defining, via a template editor and an associated user interface, a task template for discovery of common patterns occurring within data mining events, generating a task editor/wizard from the task template, creating example tasks via the task template and task editor/wizard, running at least one of the example tasks, and refining the task template using results returned from execution of the at least one of the example tasks.