679 results about "Direct acyclic graph" patented technology

A system, method, and computer readable storage medium for accessing a data file shared by all computing nodes participating in a system based on a blockchain protocol. The data file includes transactions and blocks. The transactions are data to be stored in the blockchain and the blocks are records that confirm when and in what sequence certain transaction became journaled as part of the blockchain. A request is received to include a plurality of transactions each with additional data as a new block on the blockchain. Criteria that includes a settable period of time or a settable number of transactions received is used to determine how many transactions go into a new block. A directed acyclic graph (DAG) is accessed that is constructed based on inter-dependencies among the transactions. The transactions for the new block are divided into a set of two or more independent tasks that can be executed in parallel based on the DAG. The independent tasks that can be managed independently are executed.

Each mobile router in an ad hoc mobile network is configured for concurrently attaching to multiple parents advertising respective parent depths relative to a clusterhead of the ad hoc mobile network. The mobile router selects an advertised depth relative to the clusterhead based on adding a prescribed increment to a maximum one of the parent depths, enabling the mobile routers to form a directed acyclic graph relative to the clusterhead. Each mobile router sends to each of its parents a neighbor advertisement message specifying at least one reachable prefix, a corresponding cost for reaching the reachable prefix, and a corresponding sequence identifier that enables the parents to validate the neighbor advertisement message relative to stored router entries. Hence, mobile routers automatically can form a directed acylic graph relative to the clusterhead, and can distribute routing information with minimal overhead.

The system has a collection of a plurality of objects. Each object defines a node in a k-partite graph, such that, the nodes can e divided into a number of mutually exclusive sets such that all of the nodes are in exactly one of the sets; further edges occur only between nodes in different sets; The system also has a simplification process that aggregates one or more of the nodes into one or more categories and identifies a category node corresponding to each category. The category node inherits the mode and the edges of all the nodes in the respective category. Further, the system contains Directed Acyclic Graphs Indices (DAGIs) whose nodes may have a 1-1 mapping with the nodes in the k-partite graph. These indices can be used to aggregate and hide nodes in the k-partite graph. Aggregation occurs by selecting one or more non-leaf nodes in the DAGI and aggregating all descendent nodes. Hiding occurs by selecting some set of DAGI nodes, thus selecting some corresponding set of nodes in the k-partite graph, and requesting this set of nodes be hidden which effectively removes them from further consideration until they are restored by explicit request.

Embodiments of the invention disclose a system and a method for determining a rank of a node in a multi-hop wireless network, wherein the network includes a gateway node, client nodes, and relay nodes, wherein a node p(i) is a default parent of the node i having a rank, and the network uses a directed acyclic graph (DAG) topology. The method comprises steps of transmitting at least one data packet from the node to the default parent node over a wireless link; counting a number of successful transmissions of most recent transmissions of data packets; determining an expected transmission time (ETX) for the wireless link based on the number of successful transmissions in the most recent transmissions; and assigning a rank R(i) to the node based on the rank of the parent node and the ETX.

Provided is a process that includes: traversing, with one or more processors, a constituency graph of a software asset and accessing corresponding trust records of a plurality of the software assets of the constituency graph visited by traversing the constituency graph, the trust records being published to a tamper-evident, immutable, decentralized data store; and for each respective constituent software asset among the plurality of constituent software assets visited by traversing, assessing, with one or more processors, trustworthiness of the respective software asset based on the corresponding trust record of the respective software asset.

The invention provides an ad hoc networks zone routing method. The method comprises an intra-domain routing work process and an inter-domain routing work process, a routing work process comprises an intra-domain routing discovery process and an intra-domain routing maintenance process, the intra-domain routing maintenance process is a recycling process, the intra-domain routing discovery process depends on the information maintained by the intra-domain routing maintenance process, the inter-domain routing work process comprises two steps: an inter-domain routing discovery process and an inter-domain routing maintenance process, the inter-domain routing maintenance process is a recycling process; the intra-domain routing maintenance process depends on a build process of an intra-domain directed acyclic graph, the intra-domain routing discovery process, the inter-domain routing discovery process, and the inter-domain routing maintenance process depends on a rapid extraction process of a shorter route in the directed acyclic graph. The invention is applicable to ad hoc network environment, can improve the reliability of the region route, can further reduce transmission delay and routing cost of the zone routing.

A system and method for assessing performance of a software application migrated to a grid infrastructure is provided. The system comprises a grid code analyzer for generating a directed acyclic graph (DAG) corresponding to the software application by performing static and dynamic analysis; a grid task generator for reducing the DAG generated by the grid code analyzer; and a grid simulator for simulating performance of the software application on one or more predetermined grid infrastructures. The grid simulator accepts the reduced DAG as input and produces performance data as output.

Each network node having at least one destination-oriented link toward a directed acyclic graph (DAG) destination can receive a corresponding set of path performance metrics via the destination-oriented link. The set of path performance metrics, initiated by the DAG destination outputting initial link metrics on each of its source-connecting links, identifies aggregate link metrics for a corresponding path to the DAG destination via the corresponding destination-oriented link. The network node outputs a corresponding updated set of path performance metrics on each of its source-connecting links based on the received set of path performance metrics and the corresponding link metric for the corresponding source-connecting link. Hence, each network node in the DAG can assess the performance of each connected path to the DAG destination, and forward a data packet via a selected destination-oriented link based on the corresponding path performance metrics and forwarding policies for the forwarded data packet.

The invention discloses a big data job scheduling system based on a directed acyclic graph. The system comprises a database, wherein the database is used to store job tasks and all the information of service noises. The big data job scheduling system also comprises a database management module, a DAG algorithm module, a scheduling module and a monitoring module, wherein the monitoring module is connected to the scheduling module and the job tasks; the monitoring module is used to monitor information fed back by all the operated job tasks and transmit the information fed back by the job tasks to the scheduling module. The big data job scheduling system based on the directed acyclic graph provided by the invention supports task scheduling and monitoring of assemblies between big data ecologic circles, satisfies future demands for extension assemblies, can be easily equipped with two sets of management modules including a vivid management module and a standby management module, and can achieve high usability of the scheduling system.

A heterogeneous multi-core energy-saving task schedule method based on improved genetic algorithm comprises the improved genetic algorithm used for determining task priority and energy-saving schedule algorithm based on zooming priority. The flow of the heterogeneous multi-core energy-saving task schedule method includes (1), initializing population information; (2), entering a loop body and determining the task priority by the aid of genetic algorithm; (3), determining schedule sequence of tasks on a processor according to a task DAG (directed acyclic graph) and division strategies; (4), realizing dynamic voltage zooming on the basis of feasible task schedule according to relation of saving energy of the tasks and prolonging time; (5), calculating fitness of a current population and sorting the current population; and (6), updating the population by the aid of the improved genetic algorithm, determining new task priority, quitting if termination conditions are met, and continuing iteration if the termination conditions are not met.

A system and a method are disclosed for transforming cluster computing resources of a target system to match a user defined logical data flow so data processing between the source and target are functionally equivalent. The source logical dataflow is compatibly mapped to a target directed acyclic graph that represents the cluster computing resources. A series of subgraph assertion and transform operations are applied iteratively until the logical data flow is isomorphic with a directed acyclic graph. The assertion and transform operations are comprised of rules and assertions, which are maintained in a rules registry.

A computer readable storage medium includes executable instructions to specify a set of database tables defining vertices and database joins defining oriented edges to form a graph. The oriented edges specify directionality characterizing dependent relationships between database tables. A query path in the graph is identified. The graph is split into a set of directed acyclic graphs. Each directed acyclic graph has a single root vertex that does not form a path to itself through oriented edges. Selected oriented edges are removed from each directed acyclic graph to form a tree corresponding to each directed acyclic graph. The tree is a sub-graph of a directed acyclic graph without loops and one list of joins relates any two database tables in the tree. A database query is generated for each tree. The database query is applied to database tables to form query results. The query results are displayed.

Decision trees are efficiently represented in a relational database. A computer-implemented method of representing a decision tree model in relational form comprises providing a directed acyclic graph comprising a plurality of nodes and a plurality of links, each link connecting a plurality of nodes, encoding a tree structure by including in each node a parent-child relationship of the node with other nodes, encoding in each node information relating to a split represented by the node, the split information including a splitting predictor and a split value, and encoding in each node a target histogram.

A configuration method and apparatus for a complex product or service that uses a reduced form of a prime rule indicative of valid and invalid configurations. The configurator applies user inputs parameters to an execution module that is constructed using directed acyclic graph, e.g., a zero-suppressed binary decision diagram, indicative of the valid or invalid product/service configurations. The results of execution may include conflict and selection advice to help guide the user to achieve a proper configuration. Elective events, such as but not limited to the display of messages or the performance of calculations, may optionally be packaged along with the prime rule or components thereof, and presented during execution to help guide the end user when choosing among possible configuration parameters. The apparatus and corresponding method automate determination of a complex configuration rule having a combinatorial exploded number of rule components, or a combinatorial number of possible outcomes, exceeding computational capacity of present day computing systems.

The invention relates to a mobile-robot route planning method based on an improved genetic algorithm. A raster model is adopted to preprocess a working space of a mobile robot, in a rasterized map, an improved rapid traversing random tree is adopted to generate connections of several clusters between a start point and a target point, portions for the mobile robot to freely walk on in the working space are converted into directed acyclic graphs, and a backtracking method is adopted to generate an initial population which is abundant in diversity and has no infeasible path on the basis of the directed acyclic graphs. Three genetic operators, namely a selection operator, a crossover operator and a mutation operator, are adopted to evolve the population, wherein the selection operator uses a tournament selection strategy, the crossover operator adopts a single-point crossover strategy, and the mutation operator adopts a mutation strategy which displaces an aberrance point with an optimal point in eight-neighbor points of the aberrance point. A quadratic b-spline curve is adopted to smooth an optimal route, and finally, a smooth optimal route is generated. According to the method, the route planning capability of the mobile robot under a complex dynamic environment is effectively improved.

A method for generating a representation of multimedia content by first segmenting the multimedia content spatially and temporally to extract objects. Feature extraction is applied to the objects to produce semantic and syntactic attributes, relations, and a containment set of content entities. The content entities are coded to produce directed acyclic graphs of the content entities, where each directed acyclic graph represents a particular interpretation of the multimedia content. Attributes of each content entity are measured and the measured attributes are assigned to each corresponding content entity in the directed acyclic graphs to rank order the multimedia content.