Abstract: A computer implemented method of operating a video management system, the method comprising inputting, into the video management system, a plurality of virtual video streams generated by virtual video cameras within a dynamic 3D virtual environment; receiving, in the computer, at least one command from a user indicative of an instruction to alter a functioning of the dynamic 3D virtual environment and/or a functioning of the video management system; and displaying on a display, from the video management system, at least one virtual video stream and/or at least one alert, alarm and/or message implementing at least one alteration caused by the received command.

Abstract: Apparatus for use in generating a mapping using ontologies, the apparatus including at least one electronic processing device that determines ontologies having respective ontology terms, determines a group of ontology terms from at least one of the ontologies, determines alignment between ontology terms in the ontologies for at least some of the group of ontology terms, the alignment being determined at least partially in accordance with an ontology term meaning of the ontology terms and generates a mapping in accordance with the alignment.

Abstract: A method includes receiving at least one data object and identifying, for a first aspect of the at least one data object, text strings of free form textual information having a first text string type. The method also includes generating updated free form textual information by removing the at least one text string having the first text string type. The method also includes generating one or more feature vectors based on the updated free form textual information using at least one of a unigram, a bigram, and a trigram. The method also includes using an artificial intelligence engine that uses at least one machine learning model configured to provide, using the one or more feature vectors, an output that includes at least one prediction indicating at least one resource domain and a weight value indicating a probability that the at least one resource domain corresponds to the free form textual information.

Abstract: Ontological graph creation via a user interface is disclosed, including: receiving a selection to import an imported ontological subgraph into a current ontological graph; presenting at least a portion of the imported ontological subgraph in a user interface associated with editing the current ontological graph; receiving, via the user interface, a user input to associate a newly defined node associated with the current ontological graph with a previously defined node or edge associated with the presented at least portion of the imported ontological subgraph; and updating a graph database associated with the current ontological graph based at least in part on the user input and the imported ontological subgraph.

Abstract: A method for collecting dark web information is provided. The method for collecting dark web information is performed by a computing device and comprises obtaining a list of onion addresses of a plurality of target dark web sites, accessing at least one of the plurality of target dark web sites, collecting web page information of the accessed dark web site, storing information on the accessed dark web site by analyzing the collected web page information and providing an analysis result of the accessed dark web site by using the stored information on the accessed dark web site.

Abstract: A computer-implemented method is disclosed for a first (P(TM)) to gain knowledge. The method includes: performing a first P(TM(i)) to interact with a P(TM(thing)) to set a first Thing that is representative of content, performing a second P(TM(i)) to interact with the P(TM(thing)) to parse the content of the first Thing as a second Thing that is representative of a statement, performing a third P(TM(i)) to interact with the P(TM(thing)) to evaluate the statement of the second Thing to compute a third Thing that is representative of a performable statement, and performing a fourth P(TM(i)) to interact with the P(TM(thing)) to perform the performable statement of the third Thing, The fourth P(TM(i)), in performing the performable statement, interacts with P(TM(thing)) to set one or more Things that are representative of posterior knowledge.

Abstract: This disclosure relates generally to methods and systems for building an intelligent analytical platform to enable a device fabrication in material science. Material engineers and design engineers may face various challenges with existing knowledge, as more time and efforts are required in finding a relevant knowledge from the existing knowledge, mainly due to the unstructured form, for fabricating new devices. The present disclosure solves the technical problem of finding the relevant knowledge out of the existing knowledge, in a structured form by building an analytical platform. The unstructured format of the existing knowledge of the fabrication process is transformed into a structured format in terms of operation sequence knowledge graphs, using a set of artificial intelligence (AI) and machine learning models, and a knowledge representation model of the fabrication process. The structured format of the existing knowledge is hierarchically arranged to build the analytical platform.

Abstract: A method for visualizing corporate hierarchies is provided. The method comprises receiving a selection of a first company stored in a database and retrieving, from the database, an ultimate parent company of the first company. All other known companies with the same ultimate parent company as the first company are then retrieved from the database. An interactive hierarchical tree diagram is displayed in an interface, wherein the first company, the ultimate parent company, and the other known companies with the same ultimate parent company are displayed as nodes according to parent/child relationships among the companies. Also displayed in the interface, adjacent to the tree diagram, is a collapsible nested tree list comprising the first company, the ultimate parent company, and the other known companies with the same ultimate parent company. The tree diagram and nested tree list have synchronized responses to user input.

Abstract: A system and method for handling records of an organization, the system and method involving: a graphical user interface operable by way of instructions, the graphical user interface can display a contact area including contact information corresponding to an individual related to the user's organization and a periodic table of relationships corresponding to at least one relationship of the selected individual. The operability of the graphical user interface is facilitated by at least one server. The display of the at least one record is facilitated by at least one client device. The at least one client device is capable of connecting with the at least one server via a network. The at least one server is capable of being cloud-based.

Abstract: A data confidence fabric (DCF) is disclosed. The DCF may include a static configuration layer, a dynamic trust insertion layer, and a programmable scoring layer. The DCF may also include edge devices and applications that use the ingested data in some instances. The operation of the DCF allows data to be ingested and associated with a confidence or trustworthiness score. The confidence score can be used by applications that desire access to and use of the ingested data.

Abstract: The present embodiment relates to a machine-to-machine communication (M2M) technique, and to a method for a receiver processing a request message sent by a transmitter, and a device therefor. One embodiment provides a method and a device for an M2M device processing a request message, the method comprising the steps of: receiving, from another M2M device, a request message including response type parameter information; checking the response type parameter information and determining a response mode according to the response type parameter information; and transmitting a response message including a response status code configured so as to be classified according to the determined response mode.

Abstract: Disclosed is an improved method, system, and computer program product for implementing an author profiling tool for receiving data created by a plurality of authors, profiling the plurality of authors by performing semantic analysis upon the data, generating a plurality of author profiles for identifying topics of interest to the author based upon results from the semantic analysis and correlating topics of interest by analyzing the plurality of author profiles to identify common topics between the plurality of authors. These author profiles can be used to identify and correlate topical interests by consumers. An enterprise or business can more effectively market to the consumers based upon this knowledge of the consumers' interests.

Abstract: A method may include obtaining metadata associated with first and second data sets that may be stored at remote computing devices. The method may also include constructing a first database based on the metadata, and performing a first processing task on the first data set. The first processing task may include obtaining raw data of the first data set, and importing the raw data of the first data set into a second database that may be configured as a relational database. The first processing task may also include generating relationships in the second database between entries of the first data set to facilitate anticipated responses to queries. The method may additionally include performing a second processing task different from the first processing task on the second data set, and after performing the first processing task, receiving a query that invokes the first data set, and responding to the query.

Abstract: Aspects of the present invention disclose a method for generating a reasoning query based on a user selection of a generated data visualization of a knowledge graph. The method includes one or more processors generating a knowledge graph of a domain. The method further includes constructing a hierarchy of the knowledge graph. The method further includes generating a data visualization of the domain based at least in part on the hierarchy of the knowledge graph. The method further includes identifying a user selection of one or more nodes of the data visualization. The method further includes generating a reasoning query corresponding to the domain based on the data visualization of the domain and the user selection. The method further includes determining whether the knowledge graph includes a collection of nodes that are on a level of the constructed hierarchy that corresponds to a level of the one or more nodes.

Abstract: Embodiments of the present invention relate to the field of computer technologies, and provide a search method and apparatus to resolve a problem that a reference text, of a text in a professional field, that is determined by using the prior art has relatively low accuracy. The method includes: obtaining n named entities in a current to-be-analyzed target case (S300); determining a first characteristic and a second characteristic (S301); generating, based on the first characteristic and the second characteristic and according to a preset vector generation rule, a target characteristic vector corresponding to the target case (S302); obtaining each historical case in a database and a characteristic vector corresponding to each historical case (S303); and separately calculating a similarity between the target characteristic vector and the characteristic vector corresponding to each historical case, and selecting a historical case whose similarity result meets a preset condition as a reference case (S304).

Abstract: According to one embodiment, a computer program product includes a computer readable storage medium having program instructions embodied therewith. The program instructions are executable by a processor to cause the processor to: identify key concepts in a domain ontology, and define a workload as a set of queries. Terms are extracted from each of the queries, and frequent patterns are detected across the set of queries. Maximal patterns are also identified from the frequent patterns detected, while the key concepts and the maximal patterns are used to create a rich entity. Moreover, identifying the key concepts includes performing centrality analysis of concepts extracted from the domain ontology. Other systems, methods, and computer program products are described in additional embodiments.

Abstract: A method may include acquiring one or more image texts from an image of a document, segmenting the image into one or more sub-images using the one or more image texts, determining, by applying a machine learning model, one or more experimental techniques of one or more experiments for the one or more sub-images, and adding, to a knowledge base, one or more mappings of the one or more sub-images to the one or more experiments.

Abstract: Disclosed is a system for automatically summarizing documents pertaining to a predefined domain. A document finder module enables a web crawler to crawl web resources in order to find a plurality of documents. A keyword determination module determines a set of keywords from the plurality of documents and a rank associated to each keyword of the set of keywords. A clustering module clusters the plurality of documents into one or more clusters. A score computation module identifies a subset of the set of keywords for each cluster upon computing a similarity score, corresponding to each keyword, for each cluster. A summary generation module generates a summary for each cluster based on presence of one or more keywords, of the subset, in each document classified in the cluster.

Abstract: A method may include acquiring one or more image texts from an image of a document, segmenting the image into one or more sub-images using the one or more image texts, determining, by applying a machine learning model, one or more experimental techniques of one or more experiments for the one or more sub-images, and adding, to a knowledge base, one or more mappings of the one or more sub-images to the one or more experiments.

Abstract: Concepts for managing a supervised machine learning model of a set of documents are presented. A system obtains annotated versions of the documents, the documents being annotated by annotators. A conflict between a plurality of annotations of the annotated versions of the documents is identified. The machine learning model includes a set of entities and relations defining relationships between entities. The identified conflict is resolved by at least one of identifying the correct annotation between the conflicting options, splitting the annotated text into two separate entities or relations, generating a new entity at the same or a less specific hierarchical level as the entities or relation in conflict, and/or changing an annotation of the annotated version of the document.

Abstract: An edge server receives a request from a client device to access a resource. The edge server determines whether the requested resource includes a tag within the code of the resource. When the edge server determines there is the tag in the resource, the edge server generates a token, associates the token with the resource (e.g., inserts the token in the code of the resource), and sends the resource to the requesting client device. In response to subsequent requests from the client device for actions to be performed with respect to the resource, the edge server determines whether the action requires a token. When the requested action requires the token, the edge server extracts the token in the request and processes the request after validating the token.

Abstract: The LOCATION-CONSCIOUS SOCIAL NETWORKING APPARATUSES, METHODS, AND SYSTEMS (“LCSN”) transforms user personality and location inputs via LCSN components into match and transaction outputs. LSCN may be a processor-implemented method for location-conscious social networking, involving collecting personality details pertaining to a user, analyzing the personality details and constructing a personality profile for the user. The LCSN may also collect geolocation information from the user and compare it to geolocation data from other users, may use user personality profiles to calculate a compatibility rating between the user and other users, and may send an alert to users if the geolocation data indicates that the user is within a specified distance of another user, and/or if the users are matches for each other. Users may further be able to express anonymous interest in other users by anonymously rating potential matches.

Abstract: Disclosed herein are methods, systems, and apparatuses, including computer programs encoded on computer storage media, for computing numeric representations of words. One of the methods includes obtaining, from a corpus of journals, a plurality of objects. The corpus is analyzed for contextual clues as to the nature of each of these objects. Contextual analysis may include an analysis of particular fields of metadata to do with the objects. Another example of contextual analysis involves identification of an experiment that a group of objects are commonly associated with and merging objects therefrom. A third contextual analysis example makes use of word vectors about each object. Using these contextual analyses, objects are merged together with the context of search results of a search engine.

Abstract: A KVS tree database and operations thereon are described herein. A KVS tree database is a multilevel tree that includes a base level and subsequent levels. The base level includes a heterogeneous kvset in a node, The heterogeneous kvset including entries for multiple KVS trees, such as a first entry for a first KVS tree and a second entry for a second KVS tree, The subsequent level includes a first node including a first homogeneous kvset for the first KVS tree and a second node including a second homogeneous kvset for the second KVS tree. Here, a homogeneous kvset includes nodes from only one KVS tree. The KVS tree database also includes a first determinative mapping of entries between the base level and the subsequent level and a second determinative mapping of entries between subsequent levels.

Abstract: System and techniques for identifying novel information are described herein. A classified experience may be obtained. The classified experience may include a set of attributes. Memory counts of members of the set of attributes for a user may be obtained. A novelty score for the classified experience may be computed by comparing the set of attributes to the memory counts. The classified experience may be presented to the user when the novelty score meets a qualification criterion.

Abstract: Systems and methods for automated local story generation and curation are described. In one example embodiment, a server computer receives content from client devices, and processes the content to identify content characteristics. Stories are then generated based on the characteristics of the received content, and the stories are communicated to client devices. In certain embodiments, selection at a client device of an individual piece of content within a story may further be used by the system to provide the client device with a sub-story that includes pieces of content sharing content characteristics with the characteristics of the selected image or video.

Abstract: According to an aspect, automatically adding new concepts to a concept graph includes receiving a string of text, searching a corpus of data to locate additional text related to the string of text, and extracting concepts from the additional text. The extracted concepts include a subset of concepts in the concept graph. The adding new concepts also includes determining whether the string of text should be linked to an existing concept in the concept graph, performing the linking based on determining that the string of text should be linked to the existing concept in the concept graph and, based on determining that the string of text should not be linked to an existing concept in the concept graph, adding a new concept to the concept graph. The new concept is associated with the string of text.

Abstract: Technologies are described for facilitating query execution. A data network is received. The data network includes a plurality of nodes. Each of the nodes is associated with a portion of stored data. User input is received defining at least one semantic tag. User input is received associating the at least one semantic tag with at least one of the plurality of nodes. The association between the at least one sematic tag and the at least one of the plurality of nodes is stored.

Abstract: An apparatus in one embodiment comprises at least one processing platform accessible to a plurality of user devices over at least one network. The processing platform implements a hierarchical value-based governance system for data assets of an enterprise. The hierarchical value-based governance system comprises a data asset governance controller, a technical metadata hub, a business metadata hub and a data asset catalog. The data asset catalog is coupled to the technical metadata hub and the business metadata hub and provides integrated technical metadata and business metadata for each of a plurality of the data assets of the enterprise. The data asset governance controller is configured to generate analytics actions for one or more analytics workspaces based at least in part on the integrated technical metadata and business metadata of the data asset catalog. The analytics actions may comprise visualizations providing actionable insights into the corresponding data assets.

Abstract: Objects in a website of a dark web, which is accessible over an anonymous network, are searched for information associated with an entity. A threat level is determined based, at least in part, on, and a transaction initiated in a system associated with the entity is detected. The transaction is determined to be associated with an elevated degree of risk based, at least in part, on the threat level. Modifying an authentication requirement for the transaction is based, at least in part, on the elevated degree of risk.

Abstract: Methods and Systems to browse data items. There is provided a method and system to enable a buyer to browse listings that are listed, by sellers on a network-based marketplace and stored in a data resource. There is further provided a method to cancel characteristics used to identify listings that are listed by sellers on a network-based marketplace.

Abstract: This disclosure relates to knowledge generation and implementation. A knowledge graph system comprises at least one processor, at least one database communicatively connected to the at least one processor, and a memory storing executable instructions. When executed, the instructions cause the at least one processor to aggregate, from the at least one database, entity data for a plurality of homes. Attribute information identifying geographic locations of the plurality of homes and relationships between pairs of the plurality of homes is extracted from the aggregated data. Knowledge graph data structures are populated with the extracted attribute information. A home knowledge graph is built, having nodes corresponding to the plurality of homes and edges corresponding to the identified relationships. A hierarchical cluster tree structure of the plurality of homes is outputted, wherein levels of the hierarchical cluster tree correspond to clusters of homes determined based in part on the knowledge graph edges.

Abstract: According to a first aspect of the disclosure, there is provided a method for crediting a monetary amount to a beneficiary account from which payments are made, the method comprising: identifying, to a server administering the crediting of the beneficiary account, the beneficiary account to which the monetary amount is to be credited; receiving, at the server, an indication of the monetary amount to credit the beneficiary account; comparing the monetary amount against records of past amounts credited into other beneficiary accounts, the records being stored in a database of the server; generating a result of the comparison; and crediting the beneficiary account with the monetary amount.

Abstract: A method for detecting deviations between an event log and a process model includes converting the process model into a probability process model, the probability process model comprising multiple nodes in multiple hierarchies and probability distribution associated with the multiple nodes, a leaf node among the multiple nodes corresponding to an activity in the process model; detecting differences between at least one event sequence contained in the event log and the probability process model according to a correspondence relationship; and identifying the differences as the deviations in response to the differences exceeding a predefined threshold; wherein the correspondence relationship describes a correspondence relationship between an event in one event sequence of the at least one event sequence and a leaf node in the probability process model.

Abstract: A method for detecting deviations between an event log and a process model includes converting the process model into a probability process model, the probability process model comprising multiple nodes in multiple hierarchies and probability distribution associated with the multiple nodes, a leaf node among the multiple nodes corresponding to an activity in the process model; detecting differences between at least one event sequence contained in the event log and the probability process model according to a correspondence relationship; and identifying the differences as the deviations in response to the differences exceeding a predefined threshold; wherein the correspondence relationship describes a correspondence relationship between an event in one event sequence of the at least one event sequence and a leaf node in the probability process model.

Abstract: A method, system and computer program product for managing source annotation metadata. The metadata management technique may include maintaining a set of metadata, maintaining data/metadata relationships between individual units of the metadata and individual units of the source data, and maintaining metadata/metadata relationships between individual units of the metadata. The metadata/metadata relationships define two or more intersecting search pathways through the metadata that intersect at one or more metadata units belonging to more than one search domain.

Abstract: A system, method, and apparatus are provided for automatically establishing an inferred (‘follow’) relationship between a first member and a second member of a user community. Based on passive and/or active signals indicating affinity of the first member for the second member, the system determines whether an inferred connection from the first member to the second member would improve the first member's network within the user community. A potential improvement may be observed if the potential connection would improve some aspect or characteristic of a target or ideal network identified for the first member, and/or if there is more than a threshold level of affinity between the members. The first member's network may be pruned, if necessary, to accommodate a connection to the second member if, for example, the connection would violate a constraint associated with the target or ideal network.

Abstract: According to an aspect, automatically adding new concepts to a concept graph includes receiving a string of text, searching a corpus of data to locate additional text related to the string of text, and extracting concepts from the additional text. The extracted concepts include a subset of concepts in the concept graph. The adding new concepts also includes determining whether the string of text should be linked to an existing concept in the concept graph, performing the linking based on determining that the string of text should be linked to the existing concept in the concept graph and, based on determining that the string of text should not be linked to an existing concept in the concept graph, adding a new concept to the concept graph. The new concept is associated with the string of text.

Abstract: According to an aspect, automatically adding new concepts to a concept graph includes receiving a string of text, searching a corpus of data to locate additional text related to the string of text, and extracting concepts from the additional text. The extracted concepts include a subset of concepts in the concept graph. The adding new concepts also includes determining whether the string of text should be linked to an existing concept in the concept graph, performing the linking based on determining that the string of text should be linked to the existing concept in the concept graph and, based on determining that the string of text should not be linked to an existing concept in the concept graph, adding a new concept to the concept graph. The new concept is associated with the string of text.

Abstract: A method for detecting deviations between an event log and a process model includes converting the process model into a probability process model, the probability process model comprising multiple nodes in multiple hierarchies and probability distribution associated with the multiple nodes, a leaf node among the multiple nodes corresponding to an activity in the process model; detecting differences between at least one event sequence contained in the event log and the probability process model according to a correspondence relationship; and identifying the differences as the deviations in response to the differences exceeding a predefined threshold; wherein the correspondence relationship describes a correspondence relationship between an event in one event sequence of the at least one event sequence and a leaf node in the probability process model.

Abstract: At least one pertinent authority, in ordinary English language, is paraphrased into a series of intermediate forms. The at least one pertinent authority is at least one of a tax authority and an accounting authority. The series of intermediate forms are rendered into a corresponding series of logical statements. The series of logical statements are encoded into relations in a logic programming language.

Abstract: The LOCATION-CONSCIOUS SOCIAL NETWORKING APPARATUSES, METHODS, AND SYSTEMS (“LCSN”) transforms user personality and location inputs via LCSN components into match and transaction outputs. LSCN may be a processor-implemented method for location-conscious social networking, involving collecting personality details pertaining to a user, analyzing the personality details and constructing a personality profile for the user. The LCSN may also collect geolocation information from the user and compare it to geolocation data from other users, may use user personality profiles to calculate a compatibility rating between the user and other users, and may send an alert to users if the geolocation data indicates that the user is within a specified distance of another user, and/or if the users are matches for each other. Users may further be able to express anonymous interest in other users by anonymously rating potential matches.

Abstract: A system and method for rendering data points contained in a set of generic data into a graphics object of a particular visualization type. The generic data is fetched by the system from a data store using data retrieval logic. Additional data bearing connection information about how to structure the generic data during rendering is fetched by one or more data retrieval plugins. The data retrieval plugins are selected from among a plurality of data retrieval plugins available to the system. The generic and additional data are rendered into a graphics object either jointly or sequentially. Through provision of these data retrieval plugins, it is thus possible to add visualization types that require additional data in a structured manner, or to add logic on how to connect fetched data points, without having to modify the system's own inbuilt data retrieval logic.

Abstract: A computer implemented method of improving server coverage of a publish-subscribe cluster comprising using one or more hardware processors to execute one or more shared subscriptions hubs each adapted to retrieve shared subscriptions information from a cluster comprising multiple servers executing multiple messaging engines of a publish-subscribe service for forwarding messages to a plurality of subscribing clients, each message is associated with one or more of a plurality of topics, receive shared subscriptions requests for subscribing for one or more of the topics from distributed subscriptions client(s) applying shared subscriptions for the topic(s) through subscription group(s) comprising a subset of the subscribing clients, connect to preferred messaging engine(s) selected to improve server coverage of the subscription group(s) according to the shared subscriptions information to serve each of the plurality of shared subscriptions requests and forward messages associated with the topic(s) received from

Abstract: A system and method for rendering data points contained in a set of generic data into a graphics object of a particular visualization type. The generic data is fetched by the system from a data store using data retrieval logic. Additional data bearing connection information about how to structure the generic data during rendering is fetched by one or more data retrieval plugins. The data retrieval plugins are selected from among a plurality of data retrieval plugins available to the system. The generic and additional data are rendered into a graphics object either jointly or sequentially. Through provision of these data retrieval plugins, it is thus possible to add visualization types that require additional data in a structured manner, or to add logic on how to connect fetched data points, without having to modify the system's own inbuilt data retrieval logic.

Abstract: A system and method for facilitating graphically conveying information via a visualization. An example method includes accessing a first set of data characterized by hierarchically related data objects; representing a first object as a first central node in a visualization; displaying one or more additional second objects via one or more second nodes that are positioned on a first orbit path around the central node; determining if an additional object of the one or more second objects exhibits a superior hierarchical relationship relative to one or more third objects; and then illustrating the one or more third objects as petals that are circumferentially displayed about one or more outer edges of one or more nodes of the one or more second objects. The example method further includes enabling conversion of petals to planet nodes that orbit one of the second nodes.

Abstract: A social message monitoring method is implemented by receiving, from a social network server, a social message, and obtaining a theme probability vector of the social message, comparing the theme probability vector of the social message with a theme probability vector of each representative message to obtain a theme similarity, and acquiring a similarity between the social message and each representative message according to the theme similarity, and saving the social message in a message class that contains a representative message most similar to the social message, and outputting the message class to a social network client when a quantity of social messages in the message class reaches a first threshold or themes of social messages in the message class are consistent.

Abstract: A method, system, and non-transitory physical storage medium for rendering theme-based digital assets in a media-based project having one or more searchable templates searchable through a graphical user interface (GUI), the method including tagging each of the searchable templates with one or more tag words relative to each searchable template's content; automatically retrieving one or more tag words corresponding to a current template of a currently-active media-based project; automatically retrieving one or more related tag words that correspond to the tag words of the current template; automatically forming one or more tag groups for the current template, each tag group comprising one or more of the tag words and/or one or more of the related tag words; and automatically searching for one or more related templates from among the searchable templates using one or more of the tag groups as search terms in a search engine.

Abstract: The present invention relates to a network controlling apparatus including a node status sensing unit configured to sense at least one node operating at least two centers, a center module configured to define at least two closed curves having a common internal area without intersecting each other, to define a first area as the common internal area of the at least two closed curves and a second area as a space between the at least two closed curves and to display the at least two centers in the second area by dividing the at least two centers with a division line connecting the at least two closed curves in the second area; a connection module configured to display a connection line indicating a connection status of the at least one node; and a UI display unit configured to display the lines provided by the center module and the connection module.

Abstract: In various embodiments, a spectral graph partitioner (“SP”) of a graph partitioning system (“GPS”) may partition a data flow graph associated with a program into a plurality of subgraphs to be used to perform analysis or debugging. The SP may generate estimated eigenvectors for a matrix representing the graph through minimization of a function on the vectors. The SP may generate multiple eigenvectors to perform the clustering in a multi-dimensional space described by the eigenvectors. The SP may refine the clustering by repeating generation of eigenvectors to describe higher-dimensional spaces and perform further clustering. The SP may also determine quality metrics for the clusters and may stop refinement based on the quality metrics. The GPS may select between utilizing the SP or utilizing one or more other partitioners based on various factors such as, for example, graph size or quality metrics. Other embodiments may be described and/or claimed.