134results about How to "Avoid traversal" patented technology

Systems and methods relate to, inter alia, calculating a number of expected collisions in an area over a time period. The systems and methods may further determine a number of observed collisions in the area over the time period. The systems and methods may further calculate a risk index for the area based upon a comparison between the number of expected collisions and the number of observed collisions. The systems and methods may further select a travel route for a vehicle based upon the risk index.

The invention provides a creating method of catalogue-grade computer file system snapshot, which comprises: the catalogue that needs to create snap is confirmed; when the catalogue creates the snap firstly, the root index node information of the catalogue work version is added to the snap index list and update the last time point of creating or deleting the snap; a new index node is distributed as the root index node of the creating snap version, and the content of the root index node of the work version is copied to the new distributed index node; the write copy chain list of the work version is copied to the root index node of the new creating snap, and then the write copy chain list content of the work version is deleted; the creating time of snap of the root index node of snap version is set as the present time of the computer system; the root index node of the snap version is linked to the snap chain list of the catalogue. The invention also provides the deleting method of the catalogue-grade computer file system snap and the modifying method of the catalogue work version.

The invention discloses a 3D virtual set ray tracking method for accelerating back light source irradiation, belonging to the technical field of realistic 3D virtual set drawing. Currently, the Monte Carlo ray tracking method is usually used for drawing the 3D virtual set irradiated by back light source. According to the Monte Carlo ray tracking method, as multiple light source sampling point visibility calculations need to be carried out, computational efficiency is not high. In the invention, data concerning depth of a geometric surface patch irradiated by an area light source is obtained by a precomputation process; and in the process of ray tracing process, the depth data are used for calculating light source sampling point visibility at each scene point, computations such as creation, ergodic and intersection test of visibility testing light rays are avoided and light ray tracking efficiency is improved. Compared with the Monte Carlo ray tracking method, the method in the invention can increase ray tracking speed by 3-4 times.

The invention discloses an optimized SSD data updating method. For a character type of data stored on an SSD, and with combined use of the two data structures of a line segment tree and a B tree, space occupied by an index structure is reduced with query efficiency being ensured; when character data is updated, different values of a same key in two data blocks are updated by using of a characteristic of a set union-intersection calculation, and other data is written back as original; and random updating of the character data on the SSD is converted to a sequential writing of data by using an LSM method based on a line segment B tree. The method disclosed by the invention effectively avoids a writing amplification problem of the SSD, increases a data writing speed of the SSD, and improves the operation efficiency of a database.

The invention relates to the technical field of robot control, and especially relates to a robot control method and device and electronic equipment. The robot control method comprises the steps of predicting whether an expected moving trajectory divides a region to be traversed into a first closed sub-region to be traversed a second closed sub-region to be traversed or not when the region to be traversed is traversed; if so, reserving a way-out to be traversed, wherein the way-out to be traversed is used for connecting the first sub-region to be traversed and the second sub-region to be traversed; and moving to the second sub-region to be traversed through the way-out to be traversed after traversing the first sub-region to be traversed. Therefore, a robot moves from the traversed first sub-region to be traversed to the second sub-region to be traversed through the way-out to be traversed after traversing the first sub-region to be traversed, so that the robot can avoid traversing thesame traversed region repeatedly, and thus the traversing efficiency of the robot is improved.

The invention discloses an online detecting method for a quality safety accident of agricultural products. The method comprises the steps of crawling a Web page related to the agricultural product quality safety field from a system specified website; preprocessing to obtain an initial document set; performing characteristics extract for the initial document set; performing text characteristics expression through an improved incremental TF-IDF model; clustering the initial document set; treating a plurality of clustered subject events as the known events of the system; performing Single-Pass incremental clustering for the new webpage set to obtain a plurality of candidate events; calculating the similarity of the candidate events and known events; marking the candidate events of which the similarity is more than the threshold as the new events. According to the method, the Web information is analyzed to automatically recognize the agricultural product quality safety events, so as to detect the agricultural product quality safety event line; the method is applied to dynamic detection of agricultural product quality safety risk information.

The invention discloses a coding optimization method for a high-definition video, and the method comprises the steps: prejudging the size of a current prediction unit: obtaining candidate prediction modes through steps 1)-3) for the coding of the prediction unit if the size of the current prediction unit is greater than a threshold value, or else obtaining candidate modes of the prediction unit through employing a sobel operator for the coding of the prediction unit; 1), dividing direction modes in prediction modes into a plurality of groups, selecting one representative mode from each group, taking the non-direction modes as one group and selecting one representative mode; 2), carrying out the rough mode selection cost value calculation of each representative mode, and obtaining a rough mode selection cost value HSAD of each representative mode; 3), selecting a plurality of representative modes with the minimum HSAD, carrying out the rough mode selection cost calculation of other prediction modes in a group where each representative mode is located, obtaining the HSAD of the corresponding prediction mode, and selecting a plurality of prediction modes with the minimum HSAD as the candidate prediction mode.

The invention provides a drainage network encoding method and system. The method comprises the steps of receiving a drainage network encoding request, obtaining drainage network information according to the drainage network encoding request, obtaining a drainage network information encoding mode corresponding to the drainage network information, encoding the drainage network information according to the drainage network information encoding mode corresponding to the drainage network information, recording drainage network information codes according to a certain sequence to obtain a complete code which is the drainage network code, and searching for the drainage network information and / or obtaining drainage network spatial topological attributes and / or inquiring drainage network auxiliary information according to the drainage network code. The drainage network encoding method and system can solve the problem that drainage network codes are not uniform within the global range, and promote sharing of global drainage network information and development of the global water management informationization process.

The invention discloses a method for acquiring network topology, which comprises the following steps that: A, a first port of a first network element in a PTP network transmits a management information request message including a request port identifier and a request clock mode identifier; B, after receiving the management information request message, a first port of a second network element of the PTP network transmits a management information response message at the first port, wherein the request port identifier and the request clock mode identifier in the management information response message are the request port identifier and the request clock mode identifier in the management information request message respectively, and a response port identifier and a response clock identifier in the management information response message are the port identifier of the first port of the second network element and the clock mode of the second network element respectively; and C, the first network element receives the management information response message and acquires the corresponding relation between the request port identifier and the response port identifier according to the management information response message. The invention also discloses a PTP network element.

The invention belongs to the technical field of multichannel clutter suppression, and particularly relates to a multichannel clutter suppression method based on robust principal component analysis. The multichannel clutter suppression method based on the robust principal component analysis comprises the following steps of obtaining a distance-Doppler image corresponding to each reception channel of radar; obtaining corresponding distance-Doppler data according to each distance-Doppler image; conducting column vectorization on distance-Doppler data matrices, and combining all column vectors into a matrix X; decomposing the matrix X through the robust principal component analysis so as to obtain a corresponding sparse matrix S0; according to the sparse matrix S0, obtaining 1 to m, wherein 1 to m are submatrices of X1 to Xm; according to 1 to m, obtaining the optimal weight wopt,j corresponding to a jth Doppler unit; conducting clutter suppression according to the optimal weight corresponding to each Doppler unit, and obtaining a result Xout after clutter suppression.

A braking mechanism for a retractable safety syringe is disclosed herein. In a first embodiment, the braking mechanism is disposed about the distal end of a piston. The braking mechanism may comprise a friction material about a post attached to a piston. The friction material is displaced from a seat to a landing when the piston is traversed to a fully extended position to disengage the braking mechanism. In a second embodiment, the braking mechanism is disposed at a proximal end of a syringe body. The braking mechanism has a friction member which engages an outer surface of a rigid shaft of a plunger. The friction member is selectively pivotable to disengage the braking mechanism.

The invention belongs to the technical field of human face detection, and particularly relates to a human face detecting method and device based on selective searching. The human face detecting method based on selective searching comprises the following steps: extracting human face features according to positive and negative sample sets of a human face, and training to obtain a human face classifier; dividing a to-be-detected image on the basis of selective searching to obtain a to-be-detected region set; expanding a to-be-detected region set according to preset parameters; detecting the to-be-detected region set by using the human face classifier to obtain a human face region set; and filtering out overlapped human faces to obtain a final human face region set. By the technical scheme, the to-be-detected image is divided, characteristics of the to-be-detected image are judged, regions which are human faces possibly are screened out to filter out meaningless regions, and the human face detecting efficiency is improved greatly.

The invention provides compositions, methods and systems for the ex vivo co-culture of renal cells, more specifically, for the co-culture of glomerulus-derived vascular endothelial cells and podocyte cells using apparatus that mimics the in vivo cellular architecture of the renal corpuscle. The invention described herein finds a variety of uses, for example, as a model system for the study of renal corpuscle function, including the filtration of the blood supply that occurs at the interface of the glomerulus and Bowman's capsule, normal physiology of those cell types, and as a model system for the study of renal disease, including the study of drug effects on the functioning of these cell types.

The invention discloses a low-complexity video coding method based on time-space correlation. The quadtree depth range of a current coding CTU is effectively predicted through quadtree depth information of a time-space adjacent CTU of the current coding CTU; therefore, complete quadtree traversal is avoided; and, the calculation time that a coder obtains the optimal quadtree depth can be reduced. By means of the technical scheme in the invention, 34% of coding time can be averagely saved under random access configuration; furthermore, a little code rate is increased; and the subjective quality of a reconstructed image is good.

The present invention relates to an analyzing and processing method of network resource utilization, which comprises collecting resource utilization parameters. If the maximum utilization rate of the time slot of the single multiplexing section and / or the maximum utilization rate of each group of end-to-end circuits are higher than the resource utilization rate, the alarming threshold activates the capacity-expanding alarm. The present invention also relates to a testing method of the network resource utilization, which comprises the following steps: collecting the resource utilization parameters; extracting the top N utilization rates of the time slot of single multiplexing section; finding out the link and / or circuit with utilization rate of the time slot of single multiplexing section and / or the utilization rate of each group of end-to-end circuits, which is higher than the alarming threshold of the resource utilization rate. If the business can be distributed, the link fault is restored and the business of the restored link fault is configured. The analyzing and processing method and the testing method can objectively describe the bottleneck of the network resources and the reasonableness of the resource utilization, prevent the traversal and comprehensive analysis of the network, analyze the bottleneck of the network and the utilization of the resources in an optimized method, and determine the optimal alarming time.

The present technology comprises a method and apparatus for a routing protocol for a router including an apparatus and method for distance vector multicast routing. The method and apparatus as disclosed and claimed offers a new interpretation of the routing information stored in a DVMRP routing table. This interpretation relates to the knowledge of the locations of a multicast source router and the routers connected to hosts with group members in a DVMRP domain. The methodology exploits this knowledge to create two conditional packet forwarding checks, based on pseudo-diameter and super-pseudo-diameter respectively, and used these conditions to extend the two phases of the existing DVMRP to improve its performance from the viewpoint of much better utilization of bandwidth.

A braking mechanism for a retractable safety syringe is disclosed herein. In a first embodiment, the braking mechanism is disposed about the distal end of a piston. The braking mechanism may comprise a friction material about a post attached to a piston. The friction material is displaced from a seat to a landing when the piston is traversed to a fully extended position to disengage the braking mechanism. In a second embodiment, the braking mechanism is disposed at a proximal end of a syringe body. The braking mechanism has a friction member which engages an outer surface of a rigid shaft of a plunger. The friction member is selectively pivotable to disengage the braking mechanism.

The invention provides a processing method and device and a reading method and device for Docker image cache information. The processing method for the Docker image cache information comprises the steps that images in an image warehouse are grouped, and image labels with image names being identifiers and containing all the images, image cache information of cache information of the image labels and image group cache information with the image names being the identifiers and containing image group cache information are generated. Based on the method, by processing the cache information of the images in advance, a basis is provided for directly reading image cache content corresponding to an image cache request from the image cache information and the image group cache information subsequently, in this way, redundant research, traversing and calculation processes are avoided, and the purpose of quickly processing the request is achieved.

The invention discloses a data storage method and apparatus. The method comprises the steps of presetting the number of storable rows of each page in a disk to be N, wherein N is a natural number; for each to-be-stored column in a data table, allocating a column block containing a group of pages to the column, and storing data in the column to each page in the column block in sequence, wherein each page stores N rows of data in the column; when a data query request is received, determining a to-be-queried column block according to the column corresponding to the query request, and determining a target page in the column block according to the rows in the corresponding column hit by the query request; and reading data in the target page to a memory and performing a query according to the data query request. According to the technical scheme, by improving column storage, a data address is quickly located when the row in which the to-be-queried data is located is determined, so that a large amount of unnecessary data is prevented from being read and traversed, and the query speed is increased.

Systems and methods relate to, inter alia, calculating a number of expected collisions in an area over a time period. The systems and methods may further determine a number of observed collisions in the area over the time period. The systems and methods may further calculate a risk index for the area based upon a comparison between the number of expected collisions and the number of observed collisions. The systems and methods may further generate a notification of a travel route for a vehicle based on the risk index.

The invention relates to a knowledge graph searching and positioning method and a system, electronic equipment and a storage medium. The searching and positioning method comprises the following stepsof obtaining a searching request of a user; extracting one or more keywords from the search request of the user; selecting a node keyword from the one or more keywords; searching in the knowledge graph according to the node keyword, and positioning to a sub-graph corresponding to the node keyword; and searching in the sub-graph according to other keywords, positioning to a node corresponding to the search request, and generating an instruction according to the node. According to the method, traversal of all nodes of the whole knowledge graph in the searching and positioning process is avoided,the situation that the calculation and processing speed is reduced due to the huge and complex structure of the knowledge graph is avoided, and the operation efficiency of the knowledge graph is improved.

The invention belongs to the field of video compression coding, and discloses a low-complexity video coding method based on quadtree probability prediction. A root node and the tree depth of a coding frame quadtree are predicted based on an internal parameter of a coder; furthermore, the root node and the tree depth of the prediction quadtree are regularly updated; and thus, the prediction precision of a following coding frame is ensured. By means of the technical scheme disclosed by the invention, coding time saving in different degrees can be realized under lossy compression configuration, such as full intra-frame, low delay and random access; furthermore, code rate increasing is reduced; and the subjective quality of a reconstructed image is better.

The invention relates to a fast real-time lip gloss makeup method. A mask image is reduced. Gaussian filtering is carried out, and then the original dimension is restored, so that the calculation timeis shortened and the calculation efficiency is improved. The enlarged mask image has the edge part with the better emergency effect; and thus the setting dimension can be reduced when Gaussian filterkernel setting is carried out, so that the execution efficiency is ensured. Meanwhile, the insufficient emergency is optimized after enlargement, so that the effect realization is ensured. Accordingto the invention, local part calculation of the image is carried out by using a minimum enclosing rectangle, thereby improving the execution efficiency, avoiding traversing of the original image pixelduring the calculation process, and saving the rest of calculation time. Multiplication is carried out on a weight value directly in an RGB channels in terms of lip gloss color changing; and the color adjustment and controlling become visual and clear. The actual represented color effect provided by the method is close to the color effect observed by the human eyes by adjusting the value of the RGB channel directly.

The embodiment of the invention provides a word segmentation method and device, a terminal and a computer readable storage medium. The method comprises the following steps: determining text information of a to-be-segmented word; performing word segmentation on the text information according to a preset matching algorithm, a unitary word bank in a pre-constructed word segmentation model and a wordindex table corresponding to the unitary word bank; wherein the words in the unitary lexicon are sorted according to the number of characters contained in each word; wherein the word index table is used for indexing the position of each character number of words in the unitary word bank; And obtaining a word segmentation result of the text information. Therefore, in the process of carrying out word segmentation on the text information by utilizing the preset matching algorithm, the position interval corresponding to the character number of the word to be queried can be determined by utilizingthe word index table, and then whether the word exists in the position interval or not can be searched. In this way, traversing of the unitary word bank is avoided, the searching time is shortened, and therefore the word segmentation speed is increased.

The invention provides a Java-based exception handling method, which comprises the following steps of: establishing a CAP (competitive access provider) file index record module used for recording index information of CAP files; and finding a corresponding CAP file according to the index information recorded in the CAP file index record module, and traversing an exception information handling group of the CAP file and capturing the exception. In the Java-based exception handling method, the CAP file index record module is established for recording the index information of the CAP files, when the exception happens, the corresponding CAP file is searched according to the index information, the exception information handling group of the CAP file is traversed, and the exception is captured; therefore, the time delay for capturing and processing the exception of a master card is reduced and the operating efficiency is improved. The invention also provides a Java-based exception handling mechanism.

The invention discloses a device for dragging part data management in large-screen data visual development, and relates to the technical field of information. The device consists of a global data management module and a part data management module, the global data management module is composed of a global data memory, a global data display updater, a global data bidirectional binding module and aglobal data broadcaster; the part data management module is composed of a part global data receiver, a part interaction data receiver, a part data privatization module, a part data tangent plane module and a part data globalization module. According to the method, the traversal problem of data transmission in the parts is avoided, data processing between the parts is concentrated on a sender and areceiver of the data, and no matter which position the parts are in the DOM tree, the data processing operation is consistent. The display of the part and the change response of the data are processed in the part nearby, so that the readability and maintainability of the code are greatly enhanced, and the method is easy to grasp by developers and is suitable for popularization and application.

The invention discloses a search engine index construction method and apparatus. The search engine index construction method comprises the steps of performing segmentation processing on a text string in a document to obtain corresponding text substrings; according to a preset feature extraction rule, determining a feature of each text substring; and for any text substring, writing index information of the text substring in an index file taking the feature of the text substring as an identifier. By applying the scheme, the search efficiency can be effectively improved.

The invention discloses a non-structural matrix grid and crack connectivity detection method and device, and a medium. The method comprises the steps of: generating a spatial index structure of a non-structural matrix grid, wherein the spatial index structure comprises a grid tree based on a grid surface index, a grid surface adjacency list and a grid edge adjacency list; searching a spatial position of a crack vertex on the grid tree, searching and storing intersection points of crack edges and a grid surface by using the grid surface adjacency list, and searching and storing intersection points of a crack surface and grid edges by using the grid edge adjacency list; and performing spatial sorting on the intersection points stored in each grid to generate a connection relationship between a crack and the grid. In this way, the calculation complexity can be effectively reduced, the calculation process can be accelerated, the grids which may intersect around the crack can be rapidly selected by using the generated connection relation, the intersection detection operation is reduced, grid traversal is avoided, and then the efficiency of matrix grid and crack connectivity detection is effectively improved.