Access control lookups may be implemented that support user-configurable and host-configurable processing stages. A request may be received and evaluated to determine whether bypass of user-configured access request processing stages should be bypassed. A lookup may be determined for user-configured access controlled decisions, and the access control decisions can be applied, if not bypassed. A lookup may be determined for a host-configured access control decisions and the access control decisions applied.

Some embodiments of the invention provide a method for performing intrusion detection operations on a host computer. The method receives a data message sent by a machine executing on the host computer. For the data message's flow, the method identifies a set of one or more contextual attributes that are different than layers 2, 3 and 4 header values of the data message. The identified set of contextual attributes are provided to an intrusion detection system (IDS) engine that executes on the host computer to enforce several IDS rules. The IDS engine uses the identified set of contextual attributes to identify a subset of the IDS rules that are applicable to the received data message and that do not include all of the IDS rules enforced by the IDS engine. The IDS engine then examines the subset of IDS rules for the received data message to ascertain whether the data message is associated with a network intrusion activity. For instance, in some embodiments, the IDS engine identifies one rule in the identified subset of IDS rules as matching the received data message, and then processes this rule to determine whether the data message is associated with an intrusion.

A system and method for generating and representing a consolidated resolution tree of a network are provided. The method includes receiving a target fully qualified domain name (FQDN); creating at least one tentative equivalence class (TEC) containing all the internet root domain name servers (DNS); processing the at least one TEC to determine respective consolidated edges and vertices; retrieving nameservers from domain registration records; determining whether additional TECs are to be generated for the retrieved nameserver(s); processing all new TECs to determine respective consolidated edges and vertices, when it is determined that new TECs are to be generated; and generating a resolution tree for display based on the consolidated edges and vertices.

Systems, methods, and software can be used for securing in-tunnel messages. One example of a method includes obtaining a parsed file that comprises two or more sub-feature trees, and each of the two or more sub-feature trees comprise at least one feature layer that comprises features. The method further includes generating a feature vector that identifies the features in the at least one feature layer for each of the two or more sub-feature trees. The method yet further includes mapping the features in the at least one feature layer for each of the one or more sub-feature trees to a corresponding position in the feature vector. By converting features in the parsed file into a feature vector, the method provides an applicable format of the feature vector in wide applications for the parsed file.

The subject technology sends, from a parent node of a hierarchy of views, information related to a preference list, the preference list include preference keys corresponding to respective attributes of a UI, where the hierarchy of views represents the UI. The subject technology receives, at a child node of the parent node, the information related to the preference list. The subject technology updates, by the child node, a particular preference key from the preference list to a particular value, the particular preference key related to an attribute of the UI.

The invention provides a maintenance recommendation system in which an inspection item is presented timely in the halfway of an inspection, accuracy of failure mode identification is improved, a failure mode is identified at an early stage, meanwhile, a time required for investigating a content of the failure is reduced, and a time from device failure to reset is shortened. The maintenance recommendation system includes: a primary storage unit that stores an input inspection result; a failure mode probability calculation unit that is configured to calculate a probability of a failure mode based on the inspection result stored in the primary storage unit; an inspection item search unit that is configured to extract an inspection item with the minimum inspection score from uninspected inspection items; and a main routine operation unit that is configured to narrow down a failure mode candidate and an inspection item candidate from all inspection items.

Determining data availability is disclosed, including: performing a data availability challenge with respect to a claimer node to determine whether the claimer node stores at least some elements included in a base layer in a digital tree corresponding to a data entity; and publishing a first set of elements associated with the base layer of the digital tree and the data availability challenge. Furthermore, encoding auditing is disclosed, including: obtaining a first set of elements associated with a base layer of a digital tree corresponding to a data entity; and generating an encoding validity determination of the digital tree based at least in part on whether the first set of elements is usable to recover a second set of elements associated with the base layer of the digital tree.

This invention allows the semi-automated creation and curation of a knowledge graph based on a query-atom IR ranking engine. This invention cooperates with a domain expert to smoothly and semi-automatically incorporate or restructure textual data in the knowledge graph when a suitable high-confidence response to a query cannot be found. The invention extends the conventional information retrieval approach to consumer interaction by building a structured knowledge graph. Using graph exploration the invention augments the ranking made by the underlying neural model in order to stay in sync with the constantly-changing domain of application. The ultimate goal of this invention is to allow the consistent, cognitive, consumer-driven incorporation and restructuring of relevant unstructured data in a knowledge graph which is generated by mimicking users behaviours.

A method for performing a Tree-Search (TS) on an environment is provided. The method comprises generating a tree for a current state of the environment based on a TS policy, determining a corrected TS policy, and determining an action to apply to the environment based on the corrected TS policy. The tree comprises a plurality of nodes including a root node among the plurality of nodes corresponding to the current state of the environment. Each node other than the root node among the plurality of nodes corresponding to an estimated future state of the environment. The plurality of nodes in the tree are connected by a plurality of edges. Each edge among the plurality of edges is associated with an action causing a transition from a first state to a different sate of the environment.

A computer-implemented method, a computer system and a computer program product analyze conversations. The method includes capturing a conversation with a microphone. The conversation comprises a plurality of utterances. The method also includes converting the plurality of utterances into text data using speech recognition algorithms. A speaker is identified and associated for each of the plurality of utterances. The method further includes determining an intent of the conversation. In addition, the method includes, for each determined intent, classifying each of the plurality of utterances based on the associated speaker and a set of categories associated with each of the plurality of utterances. The method also includes determining whether each of the plurality of utterances includes information sensitive to the associated speaker. Finally, the method includes storing the utterance in response to an utterance within the plurality of utterances not including information sensitive to the associated speaker.