Abstract: A method, system and computer-readable storage medium for social network grouping are provided. The method includes: acquiring friend relation data of a first user, the friend relation data comprising one or more friend nodes; determining a weight of each of the friend nodes based on the friend relation data acquired; forming a first friend circle with a first friend node having a greatest weight among the friend nodes; traversing the friend nodes to find an optimum friend of the first friend circle; adding the optimum friend into the first friend circle; and repeating the traversing and adding until all optimum friends of the first friend circle are added into the first friend circle. The method determines the weight of each friend node based on the friend relation data and performs grouping by the weights, which is able to conduct a smart grouping with high speed, low throughput, and high efficiency.

Abstract: According to an embodiment, a candidate node having a potential association relationship with a target node, an association node having an association relationship with the target node, and a grouping identifier of the association node are obtained. A relevance degree between the association node and the target node and a relevance degree between the candidate node and the target node within each grouping identifier are obtained. Based on the relevance degrees, the association node and the candidate node in each grouping identifier are combined for outputting.

Abstract: The current application describes adding a friend in a social network. A friend adding request corresponding to a first user identification is obtained. Further, a second user identification is obtained according to the friend adding request. The invention then obtains a group that includes the first user identification and the second user identification. A verification request is generated according to information corresponding to the first user identification and sent to a terminal corresponding to the second user identification. After a friend adding confirmation request corresponding to the second user identification is obtained, the second user identification is added to a friend list corresponding to the first user identification. The current application also describes a device and a storage medium for adding a friend in a social network. The invention of the current application improves the operation convenience of adding a friend.

Abstract: According to an embodiment, a candidate node having a potential association relationship with a target node, an association node having an association relationship with the target node, and a grouping identifier of the association node are obtained. A relevance degree between the association node and the target node and a relevance degree between the candidate node and the target node within each grouping identifier are obtained. Based on the relevance degrees, the association node and the candidate node in each grouping identifier are combined for outputting.

Abstract: A natural person information setting method, an account information providing method, and electronic devices include: an associated set of each account is determined according to a degree of association and an exclusion index of another account with the each account; convergence processing is performed on all associated sets, such that after the convergence processing, no associated account in any one associated set appears in another associated set; and identical natural person information is set for any associated account in a same associated set having gone through the convergence processing, and a same natural person is set for any associated account in the same associated set according to the identical natural person information.

Abstract: Disclosed are a natural person information setting method, an account information providing method, and electronic devices. The natural person information setting method includes the following steps: an associated set of each account is determined according to a degree of association and an exclusion index of another account with the each account; convergence processing is performed on all associated sets, such that after the convergence processing, no associated account in any one associated set appears in another associated set; and identical natural person information is set for any associated account in a same associated set having gone through the convergence processing, and a same natural person is set for any associated account in the same associated set according to the identical natural person information. Also disclosed are an account information providing method and electronic devices.

Abstract: The present invention relates to a large-range-first cross-camera visual target re-identification method. The method comprises: step S1, obtaining initial single-camera tracks of targets; step S2, calculating a piecewise major color spectrum histogram feature of each track, and obtaining a track feature representation; step S3, obtaining a calculation formula of the similarity between any two tracks by using a minimum uncertainty method, so as to obtain the similarity between any two tracks; and step S4, performing global data association on all the tracks by using a maximum posterior probability method, so as to obtain a cross-camera tracking result. The target re-identification method of the present invention achieves high correct identification accuracy.

Abstract: A nuclear instrumentation system and method for locating the same are disclosed. The nuclear instrumentation system includes a source range channel, an intermediate range channel and a power range channel, wherein each channel includes one detector installed around the pressure vessel, the detectors of the power range channel and the intermediate range channel both include several fission chambers, the detectors of the intermediate range channel and power range channel share several fission chambers. Some detectors employ fission chambers, so the Gamma radiation resistance property, anti-noise property and anti-electromagnetic interference property are improved. Sharing fission chambers reduces the number of detectors to be installed, thus relieving the workload of the installation and positioning of the follow-up detector. Further, the present application increases the number of some channels, which increases the redundancy, improves system reliability.

Abstract: The present invention relates to a large-range-first cross-camera visual target re-identification method. The method comprises: step S1, obtaining initial single-camera tracks of targets; step S2, calculating a piecewise major color spectrum histogram feature of each track, and obtaining a track feature representation; step S3, obtaining a calculation formula of the similarity between any two tracks by using a minimum uncertainty method, so as to obtain the similarity between any two tracks; and step S4, performing global data association on all the tracks by using a maximum posterior probability method, so as to obtain a cross-camera tracking result. The target re-identification method of the present invention achieves high correct identification accuracy.

Abstract: An inductive proximity sensor is disclosed. The proximity sensor includes a source circuit with an inductive element configured to deliver energy to a resonator when a source current is changed. In various embodiments, the source current is provided a step current source. In various embodiments, the source current is provided by constant current source coupled to the inductive element by a switch. Apparatus and methods for operating the inductive proximity sensor are disclosed.

Abstract: Reducing signal dependence for a reference voltage of a CDAC includes: splitting a decoupling capacitor into a plurality of capacitors smaller in size than a size of the decoupling capacitor; isolating at least one of the plurality of capacitors from a sampling buffer coupled to the reference voltage during a conversion phase; and supplying an appropriate amount of charge needed to replenish charge drawn by capacitors in the CDAC at each conversion step using a charge pump to pump in a dummy charge to the CDAC so that resulting configurations of the CDAC draw substantially similar amount of charge for each code change of the each conversion step.

Abstract: Reducing signal dependence for a reference voltage of a CDAC includes: splitting a decoupling capacitor into a plurality of capacitors smaller in size than a size of the decoupling capacitor; isolating at least one of the plurality of capacitors from a sampling buffer coupled to the reference voltage during a conversion phase; and supplying an appropriate amount of charge needed to replenish charge drawn by capacitors in the CDAC at each conversion step using a charge pump to pump in a dummy charge to the CDAC so that resulting configurations of the CDAC draw substantially similar amount of charge for each code change of the each conversion step.

Abstract: Disclosed are a natural person information setting method, an account information providing method, and electronic devices. The natural person information setting method includes the following steps: an associated set of each account is determined according to a degree of association and an exclusion index of another account with the each account; convergence processing is performed on all associated sets, such that after the convergence processing, no associated account in any one associated set appears in another associated set; and identical natural person information is set for any associated account in a same associated set having gone through the convergence processing, and a same natural person is set for any associated account in the same associated set according to the identical natural person information. Also disclosed are an account information providing method and electronic devices.

Abstract: The present invention applies to an internet technology field. A method and apparatus for dividing contacts into groups are provided according to embodiments of the present invention. In the method, a contact list of a user is obtained. At least one first contact group is obtained according to the obtained contact list. A clustering operation for each of the at least one first contact group is performed to obtain at least one core contact corresponding to the first contact group. At least one recommendation contact corresponding to each of the at least one core contact is determined. A second contact group is established, wherein the second contact group comprises the at least one core contact corresponding to the first contact group and the at least one recommendation contact corresponding to each of the at least one core contact.

Abstract: It is described a communication method and system, and a computer storage medium. The method includes that: a communication account is allocated for a subscriber, personal information registered by the subscriber is received, an account of the subscriber on each communication platform is associated with the communication account; and a friend association is established for the subscriber according to the communication account and the personal information of the subscriber, and friend information of the subscriber is maintained. With the method, it is possible to facilitate friend information management by a subscriber, enhance efficiency in communication, and save communication resources.

Abstract: Disclosed are a method, system and computer storage medium for processing relationship circle. The method includes: acquiring subgroups from a relationship circle; extracting subgroup attributes shared between members of the relationship circle from the subgroups; obtaining at least one recognition result from the subgroup attributes shared between members of the relationship circle; and mapping the at least one recognition result to the relationship circle. The system includes: a subgroup acquisition module, configured to acquire subgroups within a relationship circle; an extraction module, configured to extract subgroup attributes shared between members of the relationship circle from the subgroups; and a mapping module, configured to obtain at least one recognition result by analyzing the subgroup attributes shared between members of the relationship circle and map the at least one attribute recognition result to the relationship circle.

Abstract: According to an embodiment, a candidate node having a potential association relationship with a target node, an association node having an association relationship with the target node, and a grouping identifier of the association node are obtained. A relevance degree between the association node and the target node and a relevance degree between the candidate node and the target node within each grouping identifier are obtained. Based on the relevance degrees, the association node and the candidate node in each grouping identifier are combined for outputting.

Abstract: A dinuclear zinc complex PPi sensor is provided, that may be represented by the formula where X is hydrogen, —COOEt, —CH?CH2, —OR, or —NR2, wherein X is a monovalent organic group having from 1 to about 20 carbon atoms. A method of preparing the dinuclear zinc complex PPi sensor is also provided. Methods for detecting PPi in an aqueous solution and methods for pyrosequencing by using the dinuclear zinc complex are described.

Abstract: A method, system and computer-readable storage medium for social network grouping are provided. The method includes: acquiring friend relation data of a first user, the friend relation data comprising one or more friend nodes; determining a weight of each of the friend nodes based on the friend relation data acquired; forming a first friend circle with a first friend node having a greatest weight among the friend nodes; traversing the friend nodes to find an optimum friend of the first friend circle; adding the optimum friend into the first friend circle; and repeating the traversing and adding until all optimum friends of the first friend circle are added into the first friend circle. The method determines the weight of each friend node based on the friend relation data and performs grouping by the weights, which is able to conduct a smart grouping with high speed, low throughput, and high efficiency.

Abstract: A distributed data storage system and method are disclosed. The distributed data storage system includes: an interface machine process module; at least one service process module; and at least one storage module. The interface machine process module is configured to receive a storage request containing data to be stored from a storage requester and distribute the storage request to one of the at least one service process module; the service process module is configured to receive the storage request from the interface machine process module and assign a storage identifier for the date contained in the storage request; the at least one storage module is configured to store the data according to the storage identifier assigned by the service process module. The distributed data storage system and method of the present invention can provide stable, simple, highly efficient, and low cost mass data storage and read/write services for users.