Abstract: The present disclosure provides a movable electric device. The movable electric device includes a movable device body and a contact detection electrode. The movable device body has an electric drive means. The contact detection electrode is mounted on the movable device body. When the contact detection electrode _contacts diffusible dirt, a resistance, capacitance or impedance of the contact detection electrode varies.

Abstract: A contact-type detection electrode for detecting dispersible dirt and a movable electric device are provided. The contact-type detection electrode includes a support, and electrical conductors arranged on the support and being flexible.

Abstract: Provided is a sweeping robot. The sweeping robot includes a chassis and a jet dust raising structure, and the jet dust raising structure is installed on the chassis, the jet dust raising structure has an air inlet, an air outlet and a jet channel connected to the air inlet and the air outlet, the air inlet is configured for air flow into the jet channel, the air outlet is located on a front side of the brush suction port of the sweeping robot.

Abstract: A contact-type detection electrode for detecting dispersible dirt and a movable electric device are provided. The contact-type detection electrode includes a support, and electrical conductors arranged on the support and being flexible.

Abstract: The present disclosure provides a movable electric device. The movable electric device includes a movable device body and a contact detection electrode. The movable device body has an electric drive means. The contact detection electrode is mounted on the movable device body. When the contact detection electrode _contacts diffusible dirt, a resistance, capacitance or impedance of the contact detection electrode varies.

Abstract: A movable electronic apparatus includes a mobile apparatus body, a contact-type detection apparatus and a control circuit. The mobile apparatus body is provided with an electrical drive assembly that drives the mobile apparatus body to move; the contact-type detection apparatus is mounted on the mobile apparatus body, and the contact-type detection apparatus is configured and when the contact-type detection apparatus contacts dispersed dirt, an electrical signal outputted by the contact-type detection apparatus changes; the control circuit is mounted on the mobile apparatus body, and the control circuit is configured to determine whether the dispersed dirt is detected according to the magnitude of the amount by which the electrical signal outputted by the contact-type detection apparatus changes, and to control the electrical drive assembly to drive the mobile apparatus body to execute a dirt dispersion prevention action when determined that dirt that may be dispersed is detected.

Abstract: Provided is a sweeping robot. The sweeping robot includes a chassis and a jet dust raising structure, and the jet dust raising structure is installed on the chassis, the jet dust raising structure has an air inlet, an air outlet and a jet channel connected to the air inlet and the air outlet, the air inlet is configured for air flow into the jet channel, the air outlet is located on a front side of the brush suction port of the sweeping robot.

Abstract: A sweeping robot is described. The sweeping robot includes a base plate and a contact-type detection electrode, the contact-type detection electrode is mounted at a front portion of the base plate. When the contact-type detection electrode makes contact with dirt that may be dispersed, the resistance, capacitance or impedance of the contact-type detection electrode changes.

Abstract: The method of the present disclosure includes: after a graph partitioning apparatus extracts an edge, first determining whether an aggregation degree between a currently extracted edge and an allocated edge in a first device satisfies a preset condition; then, when the preset condition is satisfied, determining whether a quantity of allocated edges stored in the first device is less than a first preset threshold; and allocating the currently extracted edge to the first device when the quantity is less than the first preset threshold. In this way, an aggregation degree between allocated edges in each device is relatively high and each device has relatively balanced load. When an edge changes and an edge associated with the particular edge needs to be synchronized, a relatively small quantity of devices need to perform synchronization and update, so that costs of communication between devices are reduced, and distributed graph computing efficiency is improved.

Abstract: The present invention discloses a method and apparatus for querying a nondeterministic graph, which are used to implement quick query of a nondeterministic graph, reduce query complexity, and improve query efficiency. The method comprises receiving a query instruction, where the query instruction is used to query a nondeterministic graph for data that satisfies a query condition; determining two vertices in the nondeterministic graph according to the query instruction; determining all possible paths that use one vertex in the two vertices as a start point and the other vertex as an end point; calculate a probability of a first event or a second event corresponding to each of the paths; and obtaining, according to the probability of the first event or the probability of the second event, a query result corresponding to the query instruction.

Abstract: A similarity measurement method includes: obtaining a directional relationship between nodes in a network, and determining a transition matrix; calculating a constraint matrix according to the transition matrix and an obtained attenuation factor; constructing a system of linear equations, where a coefficient matrix of the system of linear equations is the constraint matrix, and a variable of the system of linear equations is a correction vector; solving the system of linear equations by means of iteration by using a Jacobi method, and determining the correction vector; and calculating similarities between the nodes according to the transition matrix, the attenuation factor, and a diagonal correction matrix that is generated according to the correction vector. In the method, the correction vector is determined by using the Jacobi method, and further the similarities between the nodes may be calculated.

Abstract: The method of the present disclosure includes: after a graph partitioning apparatus extracts an edge, first determining whether an aggregation degree between a currently extracted edge and an allocated edge in a first device satisfies a preset condition; then, when the preset condition is satisfied, determining whether a quantity of allocated edges stored in the first device is less than a first preset threshold; and allocating the currently extracted edge to the first device when the quantity is less than the first preset threshold. In this way, an aggregation degree between allocated edges in each device is relatively high and each device has relatively balanced load. When an edge changes and an edge associated with the particular edge needs to be synchronized, a relatively small quantity of devices need to perform synchronization and update, so that costs of communication between devices are reduced, and distributed graph computing efficiency is improved.

Abstract: A recommendation result generation method, where the method includes obtaining article content information of at least one article and user score information of at least one user, where user score information of a first user of the at least one user includes a historical score of the first user for the at least one article, encoding the article content information and the user score information using an article neural network and a user neural network respectively to obtain a target article latent vector of each of the at least one article and a target user latent vector of each of the at least one user, and calculating a recommendation result for each user according to the article latent vector and the user latent vector.

Abstract: A similarity measurement method includes: obtaining a directional relationship between nodes in a network, and determining a transition matrix; calculating a constraint matrix according to the transition matrix and an obtained attenuation factor; constructing a system of linear equations, where a coefficient matrix of the system of linear equations is the constraint matrix, and a variable of the system of linear equations is a correction vector; solving the system of linear equations by means of iteration by using a Jacobi method, and determining the correction vector; and calculating similarities between the nodes according to the transition matrix, the attenuation factor, and a diagonal correction matrix that is generated according to the correction vector. In the method, the correction vector is determined by using the Jacobi method, and further the similarities between the nodes may be calculated.

Abstract: The present invention discloses a method and apparatus for querying a nondeterministic graph, which are used to implement quick query of a nondeterministic graph, reduce query complexity, and improve query efficiency. The method comprises receiving a query instruction, where the query instruction is used to query a nondeterministic graph for data that satisfies a query condition; determining two vertices in the nondeterministic graph according to the query instruction; determining all possible paths that use one vertex in the two vertices as a start point and the other vertex as an end point; calculate a probability of a first event or a second event corresponding to each of the paths; and obtaining, according to the probability of the first event or the probability of the second event, a query result corresponding to the query instruction.