Abstract: Provided are a method and system for detecting an oil abrasive particle size. The method includes: acquiring a voltage signal of an oil abrasive particle in real time, where the voltage signal is generated in real time in a process that the oil abrasive particle passes through an electromagnetic abrasive particle sensor; establishing a voltage curve coordinate system with an amplitude of the voltage signal as a Y-axis and a time of the voltage signal as an X-axis, and obtaining a voltage curve; performing feature extraction on the voltage curve, and obtaining an area S defined by a voltage curve within a half voltage signal cycle T and the X-axis and a maximum absolute value A of a voltage signal value according to the voltage curve coordinate system; and inputting S and A to a trained back propagation neural network for prediction to obtain a predicted oil abrasive particle size.

Abstract: A method includes obtaining a plurality of representative vectors associated with face-related data. The method includes determining an encryption key based on a parameter stored in a record, generating an encrypted vector set by, for each respective vector of the plurality of representative vectors, encrypting the respective vector with a homomorphic encryption operation based on the encryption key, where the encrypted vector set includes a first encrypted vector that is linked to a subset of the face-related data associated with the first plurality of face vectors. The method further includes obtaining an encrypted face search vector using the encryption key to perform homomorphic encryption. The method further includes selecting a first encrypted vector based on the encrypted face search vector and retrieving the subset of the face-related data based on the first encrypted vector.

Abstract: A method includes obtaining a plurality of representative vectors associated with face-related data. The method includes determining an encryption key based on a parameter stored in a record, generating an encrypted vector set by, for each respective vector of the plurality of representative vectors, encrypting the respective vector with a homomorphic encryption operation based on the encryption key, where the encrypted vector set includes a first encrypted vector that is linked to a subset of the face-related data associated with the first plurality of face vectors. The method further includes obtaining an encrypted face search vector using the encryption key to perform homomorphic encryption. The method further includes selecting a first encrypted vector based on the encrypted face search vector and retrieving the subset of the face-related data based on the first encrypted vector.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for enhancing online user privacy. Methods can include receiving tag information specifying a given publisher identifier for a publisher and a given client identifier assigned to a user of the client device by the publisher. A given service identifier assigned to the user by the service apparatus is obtained. A mapping between the given service identifier to the given client identifier is created. A list of client identifiers assigned to a set of users by the publisher is received. A list of matched service identifiers corresponding to the list of client identifiers are stored. Multiple content requests are received from multiple different client devices accessing services provided by the service apparatus. Responses to the content requests are based on whether the client devices provide service identifiers that are included in the list of matched service identifiers.

Abstract: A method includes obtaining a plurality of representative vectors associated with face-related data. The method includes determining an encryption key based on a parameter stored in a record, generating an encrypted vector set by, for each respective vector of the plurality of representative vectors, encrypting the respective vector with a homomorphic encryption operation based on the encryption key, where the encrypted vector set includes a first encrypted vector that is linked to a subset of the face-related data associated with the first plurality of face vectors. The method further includes obtaining an encrypted face search vector using the encryption key to perform homomorphic encryption. The method further includes selecting a first encrypted vector based on the encrypted face search vector and retrieving the subset of the face-related data based on the first encrypted vector.

Abstract: A method includes generating a first representative vector based on a first vectors, wherein the first representative vector is associated with the first vectors in a collection of representative vectors, and the first vectors comprises a set of vector values within a latent space. The method further includes generating a second representative vector based on a second vectors, wherein the second representative vector is associated with the second vectors in the collection of representative vectors. The method further includes determining a latent space distance based on the first and second vectors. The method further includes determining whether the latent space distance satisfies a threshold. In response to a determination that the latent space distance satisfies the threshold, the method further includes associating a combined representative vector with the first vectors and the second vectors and removing the first and second representative vectors from the collection of representative vectors.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for enhancing online user privacy. Methods can include receiving tag information specifying a given publisher identifier for a publisher and a given client identifier assigned to a user of the client device by the publisher. A given service identifier assigned to the user by the service apparatus is obtained. A mapping between the given service identifier to the given client identifier is created. A list of client identifiers assigned to a set of users by the publisher is received. A list of matched service identifiers corresponding to the list of client identifiers are stored. Multiple content requests are received from multiple different client devices accessing services provided by the service apparatus. Responses to the content requests are based on whether the client devices provide service identifiers that are included in the list of matched service identifiers.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for enhancing online user privacy. Methods can include receiving tag information specifying a given publisher identifier for a publisher and a given client identifier assigned to a user of the client device by the publisher. A given service identifier assigned to the user by the service apparatus is obtained. A mapping between the given service identifier to the given client identifier is created. A list of client identifiers assigned to a set of users by the publisher is received. A list of matched service identifiers corresponding to the list of client identifiers are stored. Multiple content requests are received from multiple different client devices accessing services provided by the service apparatus. Responses to the content requests are based on whether the client devices provide service identifiers that are included in the list of matched service identifiers.

Abstract: A method includes generating a first representative vector based on a first vectors, wherein the first representative vector is associated with the first vectors in a collection of representative vectors, and the first vectors comprises a set of vector values within a latent space. The method further includes generating a second representative vector based on a second vectors, wherein the second representative vector is associated with the second vectors in the collection of representative vectors. The method further includes determining a latent space distance based on the first and second vectors. The method further includes determining whether the latent space distance satisfies a threshold. In response to a determination that the latent space distance satisfies the threshold, the method further includes associating a combined representative vector with the first vectors and the second vectors and removing the first and second representative vectors from the collection of representative vectors.

Abstract: A method includes obtaining a plurality of representative vectors associated with face-related data. The method includes determining an encryption key based on a parameter stored in a record, generating an encrypted vector set by, for each respective vector of the plurality of representative vectors, encrypting the respective vector with a homomorphic encryption operation based on the encryption key, where the encrypted vector set includes a first encrypted vector that is linked to a subset of the face-related data associated with the first plurality of face vectors. The method further includes obtaining an encrypted face search vector using the encryption key to perform homomorphic encryption. The method further includes selecting a first encrypted vector based on the encrypted face search vector and retrieving the subset of the face-related data based on the first encrypted vector.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for enhancing online user privacy. Methods can include receiving tag information specifying a given publisher identifier for a publisher and a given client identifier assigned to a user of the client device by the publisher. A given service identifier assigned to the user by the service apparatus is obtained. A mapping between the given service identifier to the given client identifier is created. A list of client identifiers assigned to a set of users by the publisher is received. A list of matched service identifiers corresponding to the list of client identifiers are stored. Multiple content requests are received from multiple different client devices accessing services provided by the service apparatus. Responses to the content requests are based on whether the client devices provide service identifiers that are included in the list of matched service identifiers.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for enhancing online user privacy. Methods can include receiving tag information specifying a given publisher identifier for a publisher and a given client identifier assigned to a user of the client device by the publisher. A given service identifier assigned to the user by the service apparatus is obtained. A mapping between the given service identifier to the given client identifier is created. A list of client identifiers assigned to a set of users by the publisher is received. A list of matched service identifiers corresponding to the list of client identifiers are stored. Multiple content requests are received from multiple different client devices accessing services provided by the service apparatus. Responses to the content requests are based on whether the client devices provide service identifiers that are included in the list of matched service identifiers.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for enhancing online user privacy. Methods can include receiving tag information specifying a given publisher identifier for a publisher and a given client identifier assigned to a user of the client device by the publisher. A given service identifier assigned to the user by the service apparatus is obtained. A mapping between the given service identifier to the given client identifier is created. A list of client identifiers assigned to a set of users by the publisher is received. A list of matched service identifiers corresponding to the list of client identifiers are stored. Multiple content requests are received from multiple different client devices accessing services provided by the service apparatus. Responses to the content requests are based on whether the client devices provide service identifiers that are included in the list of matched service identifiers.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for enhancing online user privacy. Methods can include receiving tag information specifying a given publisher identifier for a publisher and a given client identifier assigned to a user of the client device by the publisher. A given service identifier assigned to the user by the service apparatus is obtained. A mapping between the given service identifier to the given client identifier is created. A list of client identifiers assigned to a set of users by the publisher is received. A list of matched service identifiers corresponding to the list of client identifiers are stored. Multiple content requests are received from multiple different client devices accessing services provided by the service apparatus. Responses to the content requests are based on whether the client devices provide service identifiers that are included in the list of matched service identifiers.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for processing event data. In one aspect, a method includes assigning events to event bundles based on timestamps associated with the events. Each event bundle contains events having timestamps that are within a pre-specified period of time. Event batches are created, where each event batch includes a pre-specified number of event bundles. A first event batch is provided to a first computing group and a second computing group. The first computing group is configured to perform a first processing stage, and the second computing group is configured to perform a second processing stage. A determination is made that a threshold number of the event bundles in the first event batch have been processed by the first computing group. In response to the determination, a second event batch is provided to each of the computing groups.

Abstract: A system and method of generating an overall top N query result from multiple sets of sessionized network events that correspond to different time periods include identifying a subset within each set of network events whose event attributes satisfy a predefined query, generating an aggregation result table for each identified subset of network events in accordance with an aggregation attribute, identifying matching first and second entries in first and second aggregation result tables that have a same aggregation attribute value, generating a new entry in a query result table by merging the matching first and second entries together, and selecting entries in the query result table that have highest session counts as the overall top N query result.

Abstract: A system and method of generating an overall top N query result from multiple sets of sessionized network events that correspond to different time periods include identifying a subset within each set of network events whose event attributes satisfy a predefined query, generating an aggregation result table for each identified subset of network events in accordance with an aggregation attribute, identifying matching first and second entries in first and second aggregation result tables that have a same aggregation attribute value, generating a new entry in a query result table by merging the matching first and second entries together, and selecting entries in the query result table that have highest session counts as the overall top N query result.

Abstract: A global resource manager is provided for each node of a plurality of nodes of a distributed data processing system. Each node can be a coordinator node, an intermediate node, and a leaf node depending on the node at which a session arrives for global processing. In response to the arriving sessions, the global resource managers implement ripple scheduling by conducting a global QoS negotiation and adaptation, and preemption if necessary, in order to determine if the arriving session is supportable by the distributed data processing system. More specifically, the resource managers of all nodes determine whether their corresponding nodes can support the arriving session. The resource managers of the coordinator node and all intermediate nodes request their child nodes to indicate whether the child nodes can support the arriving session. The resource managers of all intermediate nodes and all leaf nodes respond to their coordinating or intermediate nodes with an indication of supportability.

Abstract: A global resource manager is provided for each node of a plurality of nodes of a distributed data processing system. Each node can be a coordinator node, an intermediate node, and a leaf node depending on the node at which a session arrives for global processing. In response to the arriving sessions, the global resource managers implement ripple scheduling by conducting a global QoS negotiation and adaptation, and preemption if necessary, in order to determine if the arriving session is supportable by the distributed data processing system. More specifically, the resource managers of all nodes determine whether their corresponding nodes can support the arriving session. The resource managers of the coordinator node and all intermediate nodes request their child nodes to indicate whether the child nodes can support the arriving session. The resource managers of all intermediate nodes and all leaf nodes respond to their coordinating or intermediate nodes with an indication of supportability.

Abstract: A global resource manager is provided for each node of a plurality of nodes of a distributed data processing system. Each node can be a coordinator node, an intermediate node, and a leaf node depending on the node at which a session arrives for global processing. In response to the arriving sessions, the global resource managers implement ripple scheduling by conducting a global QoS negotiation and adaptation, and preemption if necessary, in order to determine if the arriving session is supportable by the distributed data processing system. More specifically, the resource managers of all nodes determine whether their corresponding nodes can support the arriving session. The resource managers of the coordinator node and all intermediate nodes request their child nodes to indicate whether the child nodes can support the arriving session. The resource managers of all intermediate nodes and all leaf nodes respond to their coordinating or intermediate nodes with an indication of supportability.