163results about How to "Save computing resources" patented technology

High dynamic state multi- mode satellite navigation signal source analogue method and its device

The invention discloses a simulation method for high dynamic multi-mode satellite navigation signal source and a device thereof, wherein, the high dynamic multi-modal satellite navigation signal source can simulate satellite signals of the following three systems: Global Position Satellite system, global navigation satellite system and second-generation Beidou satellite navigation system in space, and the satellite signals are received by a dynamic navigation receiver; the signal resource can simulate the moving state of a user receiver, imitate the error of satellite signals caused in the course of transmission and produce three-mode satellite signals in real time. In the embodiment, the device consists of a user interface module, a control module, a satellite parameter calculation module, a satellite signal producing module, an output device and a data receiving and analysis module. The device simulates simultaneously three-mode satellite signals to accelerate the research of multi-mode navigation receiver. By using an inner fumitoshi interpolation method, the device saves calculation resources and improves interpolation accuracy. By using a parametric design, the device can improve the reusable ability of modules and aim at different satellite navigation systems to implement convenient transformation.

Constructing method and navigation method of global boundary map

ActiveCN108507578ASave computing resourcesImprove navigation efficiency and flexibilityInstruments for road network navigationNavigational calculation instrumentsData conversionGlobal coordinate system
The invention discloses a constructing method and a navigation method of a global boundary map. The constructing method comprises the following steps: firstly, determining a virtual cleaning zone in working space while a robot is started, labeling boundary characteristic information of a navigation boundary during a sweeping process of the virtual cleaning zone, and constructing a local boundary map; secondly, converting data of the local boundary map to a global coordinate system; moving to unswept zone after completing the sweeping of the virtual cleaning zone, determining a next virtual cleaning zone, continuously labeling the boundary characteristic information, repeatedly recycling, exiting the recycling after completing the sweeping of the whole working space, and completing construction of the global boundary map; finally, navigating by selecting the navigation boundary as a navigation path. According to the method for constructing the local boundary map and the global boundarymap, disclosed by the invention, rapid navigation of the robot is realized under a condition that the boundary characteristic information is reserved; meanwhile, system memory is saved, and the flexibility and high efficiency of navigation of the robot can be improved.

Positioning device and method based on depth vision and robot

The invention discloses a positioning device and method based on depth vision and a robot. The positioning device is a movable vision positioning device which comprises a rear image collection module,a depth recognition module, an image processing module, an inertia processing module and an integrating positioning module. The rear image collection module is used for collecting landmark images forachieving positioning, the depth recognition module is used for recognizing the ground and objects on the ground, the image processing module comprises an image preprocessing submodule and a featurematching submodule and is used for processing image information input by the rear image collection module and the depth recognition module, the inertia processing module is used for sensing displacement information of an inertia sensor in real time, and the integrating positioning module is used for integrating environment information obtained by sensor modules for achieving positioning. Comparedwith the prior art, a three-dimensional depth sensor installed on the front portion provides new address information for a camera with the face inclined backwards in real time to complete positioningin a matching mode, accordingly, computing resources in the positioning navigation process are reduced, and the synchronous positioning efficiency is improved.

Inverse kinematics calculation method for minimum base disturbance analysis of seven-degree-of-freedom space manipulator

The invention discloses an inverse kinematics calculation method for minimum base disturbance analysis of a seven-degree-of-freedom space manipulator. The inverse kinematics calculation method comprises the following steps: S1: carrying out geometric modeling on the seven-degree-of-freedom space manipulator, and adopting arm angles Psi to parameterize other joints except elbow joints; S2: analyzing the influence of joint extremity on the range of the arm angles Psi, analyzing the motion range of all other joints expect the elbow joints on the arm angles Psi, and determining the feasible region of one, two or three arm angles and restricting the search space of an algorithm; S3: analyzing three singularities of the manipulator such as kinematics singularity, algorithm singularity and half singularity, and eliminating the arm angles Psi not according with conditions; S4: establishing the generalized jacobian matrix of kinematical equation of the space manipulator; S5: carrying out optimizing calculation to obtain a manipulator position which can enable carrier satellite attitude change of the space manipulator to be minimum. According to the method, the base disturbance is reduced on the premise that small calculated amount is ensured, and the magnitude and calculated amount of the disturbance are balanced through the optimization algorithm.

Methods and devices for filtering and hiding webpage advertisement, and methods and devices for issuing filtering and hiding rules of webpage advertisement

Provided is a method for filtering webpage advertisements. The method comprises: obtaining a webpage logo of a to-be-opened webpage; requesting primary resources of the to-be-opened webpage from a webpage server corresponding to the webpage logo, receiving the primary resources of the to-be-opened webpage, the primary resources being returned from the webpage server; requesting an advertisement filtering rule corresponding to the webpage logo from a background server of a browser, receiving the advertisement filtering rule corresponding to the webpage logo, the advertisement filtering rule being returned from the background server; analyzing the primary resources to obtain URLs of to-be-loaded sub-resources; determining whether the URLs of to-be-loaded sub-resources are matched with the advertisement filtering rule, if yes, not requesting the sub-resources from the webpage server, if no, requesting the sub-resources from the webpage server. The above method can reduce computing resources consumed in filtering advertisements in webpage for a terminal where the browser is in. In addition, a device for filtering webpage advertisements, a method and a device for hiding webpage advertisements, a method and a device for issuing filtering rules of webpage advertisements, and a method and a device for issuing hiding rules of webpage advertisements are also provided.

Blockchain consensus method and system

The invention relates to a blockchain consensus method and system. The method comprises the steps: achieving a consensus mechanism by adopting a dual Byzantine fault-tolerant algorithm; enabling any node participating in the blockchain to have right to create a piece of request information; submitting a corresponding digital protocol; broadcasting the request information to a private chain where the request information is located, wherein a verification node in the private chain verifies the request information based on a Byzantine fault-tolerant algorithm; after consensus is reached, submitting the request information to a public chain, then randomly selecting corresponding participation nodes from different private chains based on a random algorithm to serve as second-layer verificationnodes to form a random block network, performing secondary verification on the request information, and if the secondary verification is based on a Byzantine fault-tolerant algorithm to reach the consensus, determining that the request is authenticated, wherein if any verification cannot reach the consensus, the request is rejected, and the request information and the digital protocol are cleared.By the adoption of the consensus algorithm, the defects that a PoW algorithm is large in calculated amount and low in processing speed are overcome, and the defect that a common Byzantine fault-tolerant algorithm is low in safety boundary is also overcome.

Parallel algorithm of computing convex hull based on multinuclear framework

The invention provides a parallel algorithm of computing a convex hull based on a multinuclear framework specific to the defect of an existing convex hull algorithm. The parallel algorithm of computing the convex hull based on the multinuclear framework comprises the following steps: (1), finding the initial incomplete convex hull of initial point assembly, indicating edges by counter clockwise direction directed edge; (2), classifying a point set based on the initial incomplete convex hull, finding out all of the outer points of directed edges; (3), iteratively and concurrently breeding each of the directed edge of the initial incomplete convex hull; (4), deleting final acquired non-convex-hull peak on the convex hull. The parallel algorithm of computing the convex hull based on the multinuclear framework effectively optimizes an original algorithm and plenarily saves calculation resources, parallelly expands the classification process of the point set and the iterative process to the original algorithm, and fully utilizes the parallel calculation resources of a multi-core processor; so that parallel speed-up ratio is controlled by controlling parallel mission grain size further by self-adaption selection of the parallel and serial, and possibly produced bottlenecks are eliminated.

Mobile terminal webpage advertisement filtering method, gateway GPRS support node and HTMLServer

ActiveCN108023867AAdvertisement filtering efficiency is highSave computing resourcesTransmissionSpecial data processing applicationsMobile endWeb page
The embodiment of the invention provides a mobile terminal webpage advertisement filtering method, a gateway GPRS support node and an HTMLServer. The method comprises the steps of receiving a webpageaccess request sent by a mobile terminal, and acquiring a user identity corresponding to the mobile terminal and a webpage identity corresponding to a to-be-accessed webpage according to the webpage access request; judging whether the user identity and the webpage identity satisfy a preset filtering policy or not and sending a webpage filtering request comprising the webpage identity to the HTMLServer if the preset filtering policy is satisfied, thereby enabling the HTMLServer to filter webpage advertisement of the to-be-accessed webpage according to a filtering rule; and receiving the filtered to-be-accessed webpage sent by the HTMLServer, and sending the filtered to-be-accessed webpage to the mobile terminal for display. The gateway GPRS support node and the HTMLServer are used for performing the method. According to the embodiment of the invention, the targeted advertisement filtering can be carried out on the mobile terminal webpage, computing resources are saved, the processing speed is fast, the access efficiency is high, and the embodiment of the invention has universality.

Lightweight end-to-end secure communication authentication method based on identification password

The invention provides a lightweight end-to-end secure communication authentication method based on an identification password. According to the method, the digital signature algorithm based on the identity label is integrated into the SSL/TLS handshake protocol and is applied to the industrial control system, so that the authentication process of the digital signature algorithm based on the identity label between the engineer station and the terminal equipment is completed. Meanwhile, when the terminal equipment is connected with the engineer station for the first time, identity authentication can be carried out in a challenge/response-based mode, so that the correctness of the identity of the engineer station is ensured. And while identity authentication is carried out, the two parties also realize exchange of symmetric encryption keys. The engineer station takes the identity label of the engineer station as the public key of the engineer station, a public key certificate is not needed any more, the complexity of public key certificate management and maintenance is greatly reduced, the industrial control system added with the authentication function can effectively block unauthorized access of illegal users to the industrial control system, terminal equipment is prevented from being invaded, and sensitive resources of the system are protected.

Pre-coded vector determination method, device, base station and user terminal

The invention discloses a pre-coded vector determination method, a pre-coded vector determination device, a base station and a user terminal, aiming at solving the problem that many computing resources are consumed by adopting the existing pre-coded vector determination method. The method comprises the steps of: determining equivalent channel matrixes T<j> of all user terminals, and aiming at each user terminal, executing the following steps of: according to the T<j> of other user terminals, determining an interference channel matrix and executing orthogonalization processing to all row vectors in the interference channel matrix to obtain a group of standard orthogonal bases B; determining an orthogonal projection matrix of a subspace which is formed from the equivalent channel matrix of the user terminal to the interference channel matrix in a spanning way, determining the quantity of receiving antennas of the user terminal, taking the orthogonal projection matrix as a matrix to be conducted with singular value decomposition (SVD), and according to a preset corresponding relation between the quantity of the receiving antennas and simplified SVD algorithms, determining a simplified SVD algorithm corresponding to the determined quantity of the receiving antennas; and according to a right singular vector corresponding to a singular value determined based on the determined simplified SVD algorithm, determining a pre-coded vector aiming at the user terminal.
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products