Abstract: An illustrative embodiment includes processing parse tree data. A parse tree data structure that is representative of a document object model (DOM) tree data structure is received. Concomitant to receiving the parse tree data structure, an assignment of index values for the DOM nodes consisting of distinct index values for each existing DOM node is received by the processor. Requests to manipulate the parse tree data structure that include node inserts and document order comparisons are also performed.

Abstract: An illustrative embodiment includes processing parse tree data. A parse tree data structure that is representative of a document object model (DOM) tree data structure is received. Concomitant to receiving the parse tree data structure, an assignment of index values for the DOM nodes consisting of distinct index values for each existing DOM node is received by the processor. Requests to manipulate the parse tree data structure that include node inserts and document order comparisons are also performed.

Abstract: A system and method for web application navigation control includes updating navigation data models used in navigation constraints with received data from an end-user or system. Without needing a centralized application-specific controller, from a collection of extensible navigation rules associated with each page of a plurality of pages, the extensible navigation rules are automatically selected which depend on changed data values and need re-evaluation. The navigation constraints associated only with the pages potentially changing their ready state to execute from among the plurality of pages in an entire application are evaluated to determine which pages are ready to run based on updated data from the navigation data models. A preferred page to be actually navigated to next is selected from among a set of all available and ready pages by execution of a set of second and separate navigation constraints using results of the navigation constraints of the evaluating step.

Abstract: A mechanism is provided in a data processing system comprising at least one processor and a memory comprising instructions which, when executed by the at least one processor, causes the at least one processor to train a similar passage cognitive system. The mechanism receives a question and answer key for a question answering cognitive system, the question and answer key comprising a list of question and answer specification pairs. Each question is a text string and each answer specification references one or more text passages from a corpus of information. The mechanism uses the question and answer key to generate a similar passage map for the similar passage cognitive system, the similar passage map comprising a list of text relation pairs. Each text relation pair comprises a sample input text component and a list comprising one or more sample output text components. The mechanism trains a similar passage machine learning model of the similar passage cognitive system using the similar passage map.

Abstract: A system and method for web application navigation control includes updating navigation data models used in navigation constraints with received data from an end-user or system. Without needing a centralized application-specific controller, from a collection of extensible navigation rules associated with each page of a plurality of pages, the extensible navigation rules are automatically selected which depend on changed data values and need re-evaluation. The navigation constraints associated only with the pages potentially changing their ready state to execute from among the plurality of pages in an entire application are evaluated to determine which pages are ready to run based on updated data from the navigation data models. A preferred page to be actually navigated to next is selected from among a set of all available and ready pages by execution of a set of second and separate navigation constraints using results of the navigation constraints of the evaluating step.

Abstract: An illustrative embodiment includes processing parse tree data. A parse tree data structure that is representative of a document object model (DOM) tree data structure is received. The parse tree data structure is projected onto a data structure that includes a binary tree. The projecting includes storing a projection that includes an association between each DOM node and a respective associated binary tree node, thereby creating a map between the parse tree data structure and the binary tree data structure. Requests to manipulate the parse tree and binary tree data structures that include node inserts and document order comparisons are also performed.

Abstract: In analyzing learning content, a social learning system receives from at least one client system in the social learning system a creation of at least one informal course by a learning content creator. Each informal course comprises learning content and metadata describing the learning content and the learning content creator. The social learning system further receives social data from a plurality of client systems in the social learning system for the at least one informal course. When the social learning system receives a query from a learning content administrator system in the social learning system including query parameters, the social learning system searches at least one of the metadata and the social data for one or more informal courses matching the query parameters and returns a list of one or more informal courses matching the query parameters as a query result.

Abstract: In analyzing learning content, a social learning system receives from at least one client system in the social learning system a creation of at least one informal course by a learning content creator. Each informal course comprises learning content and metadata describing the learning content and the learning content creator. The social learning system further receives social data from a plurality of client systems in the social learning system for the at least one informal course. When the social learning system receives a query from a learning content administrator system in the social learning system including query parameters, the social learning system searches at least one of the metadata and the social data for one or more informal courses matching the query parameters and returns a list of one or more informal courses matching the query parameters as a query result.

Abstract: A method, system and computer program product for determining whether the social learning playlist is effective in educating participants. The text of the collection of online materials of a social learning playlist is scanned to identify key concepts (i.e., the most important points) using natural language processing. The user selects a concept from a list of key concepts, which includes these identified key concepts, and a type of question (e.g., true/false) to be used in assessing the understanding of the selected key concept. The selected type of question and answer to the question are generated using analytic analysis and artificial intelligence on the online materials of the playlist. In this manner, by generating appropriate question and answer pairs, where the questions are inserted at selected locations within the playlist, the creator of the playlist is able to assess whether the participants are understanding the key concepts in the playlist.

Abstract: A method, system and computer program product for determining whether the social learning playlist is effective in educating participants. The text of the collection of online materials of a social learning playlist is scanned to identify key concepts (i.e., the most important points) using natural language processing. The user selects a concept from a list of key concepts, which includes these identified key concepts, and a type of question (e.g., true/false) to be used in assessing the understanding of the selected key concept. The selected type of question and answer to the question are generated using analytic analysis and artificial intelligence on the online materials of the playlist. In this manner, by generating appropriate question and answer pairs, where the questions are inserted at selected locations within the playlist, the creator of the playlist is able to assess whether the participants are understanding the key concepts in the playlist.

Abstract: A processing system includes a processor core, a peripheral component, and a flip-flop unit in at least one of the processor core and the peripheral component. The flip-flop unit can include a master latch, and two slave latches coupled to an output of the master latch. The first slave latch is formed over a first doped well region of a semiconductor substrate. The second slave latch is formed over a second doped well region of the semiconductor substrate. A comparator is coupled to an output of the first slave latch and to an output of the second slave latch. An output of the comparator indicates whether a state stored in the first slave latch is the same as a state stored in the second slave latch.

Abstract: A processing system includes a processor core, a peripheral component, and a flip-flop unit in at least one of the processor core and the peripheral component. The flip-flop unit can include a master latch, and two slave latches coupled to an output of the master latch. The first slave latch is formed over a first doped well region of a semiconductor substrate. The second slave latch is formed over a second doped well region of the semiconductor substrate. A comparator is coupled to an output of the first slave latch and to an output of the second slave latch. An output of the comparator indicates whether a state stored in the first slave latch is the same as a state stored in the second slave latch.

Abstract: A computer-implemented method, apparatus, and computer readable storage medium encapsulate user interface components that collect data for a case management solution, while consistently enforcing metadata and constraints. Multiple types of interactive documents are supported, and a configuration indicates the type whose user interface components are to be encapsulated. A wrapper widget is created based on the interactive document type and implements an interface that enables it to interact externally with the case management environment and internally with the interactive document. The wrapper widget injects case property data values, metadata and/or constraints from the case management environment into the interactive document, which then enables editing of the case property data values and the effecting of the metadata and/or enforcing of the constraints.

Abstract: A form is received and loaded. It is determined if a schema structure definition defines one or more choice elements for data of the form. A data structure is created for the data. The data structure includes both a schema structure valid component and a non-validated component. When a user selects one of the choice elements, a first set of zero or more data elements corresponding to the selected choice element are loaded into the schema structure valid component of the data structure. The previous set of zero or more data elements and values associated with the previous set of data elements are then stored in the non-validated component of the data structure.

Abstract: A form is received and loaded. It is determined if a schema structure definition defines one or more choice elements for data of the form. A data structure is created for the data, the data structure includes both a schema structure valid component and a non-validated component. When a user selects one of the choice elements, a first set of zero or more data elements corresponding to the selected choice element are loaded into the schema structure valid component of the data structure. The previous set of zero or more data elements and values associated with the previous set of data elements are then stored in the non-validated component of the data structure.

Abstract: An illustrative embodiment includes processing parse tree data. A parse tree data structure that is representative of a document object model (DOM) tree data structure is received. The parse tree data structure is projected onto a data structure that includes a binary tree. The projecting includes storing a projection that includes an association between each DOM node and a respective associated binary tree node, thereby creating a map between the parse tree data structure and the binary tree data structure. Requests to manipulate the parse tree and binary tree data structures that include node inserts and document order comparisons are also performed.

Abstract: An illustrative embodiment includes processing parse tree data. A parse tree data structure that is representative of a document object model (DOM) tree data structure is received. Concomitant to receiving the parse tree data structure, an assignment of index values for the DOM nodes consisting of distinct index values for each existing DOM node is received by the processor. Requests to manipulate the parse tree data structure that include node inserts and document order comparisons are also performed.

Abstract: A method includes searching a data instance in a modular interactive document to identify completed digital signatures, validating the identified completed digital signatures, generating a signature information table that associates nodes of the data instance with signature information including an indicator of a digital signature status associated with each of the nodes, retrieving a page of the modular interactive document, retrieving data associated with the page and identifying nodes of data associated with user interface elements of the page, retrieving the digital signature status associated with the identified nodes of data associated with the user interface elements of the page from the signature information table, and presenting the page of the modular interactive document to the user on a display, the presented page including data corresponding to the identified nodes and an indication of the digital signature status associated with the data corresponding to the identified nodes.

Abstract: A virtual process system includes a processor, a first physical business process coupled to the processor, and a second physical business process coupled to the processor. The processor is configured to execute a virtual business process according to a virtual business process definition. The processor is further configured to receive a first event relating to the first physical business process and a second event relating to the second physical business process. The processor is further configured to execute a first state transition in response to receiving the first event at the processor and execute a second state transition in response to receiving the second event at the processor and execute a behavior in response to a received event. The received event includes one of the first event or the second event.

Abstract: An embodiment of the disclosure can receive a composite resource document containing at least one resource. An updated manifest resource can be obtained. The updated manifest resource can list all resources in the composite resource document. A set of zero or more (0 . . . N) resources can be indicated. Each indicated resource is one that is to be subtracted from the list of resources in the updated manifest resource in order to create a generated signature reference list of identified resources to be signed. A hash token can be generated using the resources identified in the generated signature reference list to form a signature hash token. The signature hash token can be encrypted with a secret key.