Abstract:
A method and an apparatus for identifying a state of a user of a social network. The identification method includes acquiring a user-event similarity of a user regarding a new event; identifying whether the user is a silent user or a non-activated user according to the user-event similarity; and determining whether the silent user or the non-activated user on the social network is finally in an activated state or a non-activated state. In the foregoing manner, a novel user state model of a social network is designed in the present disclosure, the model includes an activated state, a non-activated state and an unstable silent state, and a final state of a user is inferred precisely under full and comprehensive consideration of factors that may affect the state of the user, such that the state of the user can be accurately and precisely monitored.
Abstract:
A deep neural network to which data category information is added is established locally, to-be-identified data is input to an input layer of the deep neural network generated based on the foregoing data category information, and information of a category to which the to-be-identified data belongs is acquired, where the information of the category is output by an output layer of the deep neural network. A deep neural network is established based on data category information, such that category information of to-be-identified data is conveniently and rapidly obtained using the deep neural network, thereby implementing a category identification function of the deep neural network, and facilitating discovery of an underlying law of the to-be-identified data according to the category information of the to-be-identified data.
Abstract:
A method, a micro base station, and a communications system for creating a microcell are disclosed in the present application. The method includes: configuring, by a micro base station, beam width and beam directions of high-gain directional antennas according to location information about hotspot areas in at least two macrocells; and using, by the micro base station, at least two beams formed by the high-gain directional antennas to form microcell coverage over the hotspot areas in the at least two macrocells. In the embodiments of the present application, the location of the micro base station may be kept unchanged when locations of hotspot areas in a plurality of macrocells change, and by adjusting the beam width and beam directions of high-gain directional antennas, the micro base station can provide microcell coverage over the changed hotspot areas, thereby making the networking flexible and reducing the network maintenance cost.
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 method for data filtering includes segmenting a to-be-detected vector to obtain k to-be-detected sub-vectors, respectively performing an inner product operation on the k to-be-detected sub-vectors and corresponding detection vectors among preset k detection vectors to obtain k first operation results, determining a first operation result whose value is the maximum among the k first operation results and obtaining an identifier of a detection vector corresponding to the first operation result, where a detection vector is in a one-to-one correspondence to an identifier, and mapping the to-be-detected vector to a preset data filter according to the obtained identifier of the detection vector corresponding to the first operation result whose value is the maximum, and determining, using the data filter, whether to filter out the to-be-detected vector.
Abstract:
A method for data filtering includes segmenting a to-be-detected vector to obtain k to-be-detected sub-vectors, respectively performing an inner product operation on the k to-be-detected sub-vectors and corresponding detection vectors among preset k detection vectors to obtain k first operation results, determining a first operation result whose value is the maximum among the k first operation results and obtaining an identifier of a detection vector corresponding to the first operation result, where a detection vector is in a one-to-one correspondence to an identifier, and mapping the to-be-detected vector to a preset data filter according to the obtained identifier of the detection vector corresponding to the first operation result whose value is the maximum, and determining, using the data filter, whether to filter out the to-be-detected vector.
Abstract:
A data storage method is used to improve storage consistency of a distributed storage system. The method includes: a primary storage node performs EC coding on a to-be-stored data segment to obtain a target EC stripe; determines in a storage node group to which the primary storage node belongs, m+k target storage nodes used to store m+k target EC blocks of the target EC stripe; sends a preparation message to the target storage nodes; receives a response message sent by a target storage node; and sends an execution message to the target storage nodes to instruct the target storage nodes to write target EC blocks that are in preparation logs.
Abstract:
A method for compressing flow data, including: constructing multiple line segments according to flow data and a predefined maximum error that are acquired; obtaining a target piecewise linear function according to the multiple line segments, where the target piecewise linear function includes multiple linear functions, and an intersection set of value ranges of independent variables of every two linear functions among the multiple linear functions includes a maximum of one value; and outputting a reference data point according to the target piecewise linear function, where the reference data point includes a point of continuity and a point of discontinuity of the target piecewise linear function. In this way, a maximum error, a target piecewise linear function is further determined according to the multiple line segments, and a point of continuity and a point of discontinuity of the target piecewise linear function are used to represent compressed flow data.
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:
A method for compressing flow data, including: generating multiple line segments according to flow data and a predefined maximum error that are acquired; obtaining a target piecewise linear function according to the multiple line segments, where the target piecewise linear function includes multiple linear functions, and an intersection set of value ranges of independent variables of every two linear functions among the multiple linear functions includes a maximum of one value; and outputting a reference data point according to the target piecewise linear function, where the reference data point includes a point of continuity and a point of discontinuity of the target piecewise linear function. In this way, a maximum error, a target piecewise linear function is further determined according to the multiple line segments, and a point of continuity and a point of discontinuity of the target piecewise linear function are used to represent compressed flow data.