Abstract: Computer-implemented methods, apparatuses and systems for obtaining data authorization are described. In an example method, a first computing node in a trusted computing center receives an authentication request from a first provider. Authentication information is returned to the first provider, where the authentication information comprises a first code hash of a first computing logic running in the first computing node. A channel establishment request sent by the first provider is received after determining that the first computing node passes trusted authentication and the first code hash passes correctness verification. A first trusted channel is established between the first provider and the first computing node according to the channel establishment request. A target encryption key is received through the first trusted channel, thereby authorization to perform computation on a target encrypted shard corresponding to the target encryption key based on the first computing logic is obtained.

Abstract: Embodiments of this specification provide multi-party data query methods and apparatuses for data privacy protection. One implementation of the methods includes obtaining, from each of a plurality of data owners, attribute value ciphertexts of N target objects to form a ciphertext table, disordering the ciphertext table in units of rows to obtain a disordered table, sorting, in response to a query instruction of querying sorting-related data for a target attribute item in the plurality of attribute items, attribute value ciphertexts corresponding to the target attribute item in the disordered table to obtain a target sorted table, and obtaining the sorting-related data as a query result based on the target sorted table.

Abstract: Embodiments of this specification provide methods and apparatuses for data privacy protection. An embodiment of the methods comprises receiving, by a first party from a second party, an encrypted integrated vector, determining an encrypted result vector based on the original matrix and the encrypted integrated vector, determining a data processing result based on the encrypted result vector, and sending the data processing result to the second party for the second party to obtain a multiplication calculation result of the original matrix and the n original vectors based on the data processing result.

Abstract: The present application relates to novel compounds that have modulating or activating effect on the activity of adenosine A3 receptor, preparation methods for the series of compounds, pharmaceutical compositions of the series of compounds, and pharmaceutical uses of the series of compounds.

Abstract: The present application relates to use of a triazolotriazine derivative or a pharmaceutically acceptable solvate or salt thereof in the preparation of a drug for treating diseases, and a method for treating diseases.

Abstract: An integrated circuit includes two N wells from two different devices in close proximity to each other with each N well biased by two different terminals. The N wells are at least partially surrounded by P type regions that are biased by a terminal. The integrated circuit includes conductivity reduction features that increase the resistivity of current paths to a P type regions of one device on a side closest the other device. The integrated circuit includes two conductive tie biasing structures each located directly over an N type region of the substrate and directly over a P type region of the substrate. The two conductive tie biasing structures are not electrically connected to each other and are not electrically coupled to each other by a conductive biasing structure.

Abstract: A wireless router deployment method for determining deployment positions of wireless routers in a spatial area includes: acquiring first position information on a plurality of candidate nodes distributed in the spatial area for deploying the wireless routers; determining, based on the first position information, a network coverage probability and a network energy efficiency value for each of the candidate nodes presuming a to-be-deployed wireless router is deployed at the candidate node; determining network quality scores for respective candidate nodes according to the network coverage probability and the network energy efficiency value; and selecting a candidate node with the highest network quality score as a deployment position for the to-be-deployed wireless router.

Abstract: The present invention relates to robots and discloses a seven-degrees-of-freedom humanoid robotic arm, including an upper arm component and a forearm component. One end of the upper arm component is provided with a shoulder pitching joint, a shoulder yawing joint and a shoulder rolling joint for connecting with a shoulder. One end of the forearm component is provided with an elbow pitching joint and an elbow rolling joint for connecting with the upper arm component, and the other end of the forearm component is provided with a wrist pitching joint and a wrist yawing joint for connecting with a robotic hand. The seven-degrees-of-freedom humanoid robotic arm of the present invention achieves a highly bionic design of a spherical joint of human shoulder, elbow and wrist joints.

Abstract: A wireless router deployment method for determining deployment positions of wireless routers in a spatial area includes: acquiring first position information on a plurality of candidate nodes distributed in the spatial area for deploying the wireless routers; determining, based on the first position information, a network coverage probability and a network energy efficiency value for each of the candidate nodes presuming a to-be-deployed wireless router is deployed at the candidate node; determining network quality scores for respective candidate nodes according to the network coverage probability and the network energy efficiency value; and selecting a candidate node with the highest network quality score as a deployment position for the to-be-deployed wireless router.

Abstract: A robot joint space point-to-point movement trajectory planning method. Joint space trajectory planning is performed according to the displacement of a robot from a start point to a target point during PTP movement and a limitation condition of a preset movement parameter physical quantity of each axis in a robot control system. An n-dimensional space is constructed by taking each axis of the robot as a vector, wherein n?2, and the movement parameter physical quantity of each axis of the robot is verified according to a vector relationship between the n axes of the robot, so that a trajectory planning curve of each axis of the robot satisfies the limitation condition of the preset movement parameter physical quantity. The method has a small amount of calculations and strong real-time performance, the movement curves are mild, the control time is optimal, and the algorithm execution effect is good.

Abstract: The present invention relates to robots and discloses a seven-degrees-of-freedom humanoid robotic arm, including an upper arm component and a forearm component. One end of the upper arm component is provided with a shoulder pitching joint, a shoulder yawing joint and a shoulder rolling joint for connecting with a shoulder. One end of the forearm component is provided with an elbow pitching joint and an elbow rolling joint for connecting with the upper arm component, and the other end of the forearm component is provided with a wrist pitching joint and a wrist yawing joint for connecting with a robotic hand. The seven-degrees-of-freedom humanoid robotic arm of the present invention achieves a highly bionic design of a spherical joint of human shoulder, elbow and wrist joints.

Abstract: A robot joint space point-to-point movement trajectory planning method. Joint space trajectory planning is performed according to the displacement of a robot from a start point to a target point during PTP movement and a limitation condition of a preset movement parameter physical quantity of each axis in a robot control system. An n-dimensional space is constructed by taking each axis of the robot as a vector, wherein n ?2, and the movement parameter physical quantity of each axis of the robot is verified according to a vector relationship between the n axes of the robot, so that a trajectory planning curve of each axis of the robot satisfies the limitation condition of the preset movement parameter physical quantity. The method has a small amount of calculations and strong real-time performance, the movement curves are mild, the control time is optimal, and the algorithm execution effect is good.