19 results about "Linear search" patented technology

The invention discloses a coherent radial velocity spectrum target detection method based on a backtracking filter. The method comprises the following steps: constructing a sea surface echo model and a multi-frame joint detection problem; the method comprises the following steps: based on a sea surface echo model and a multi-frame joint detection problem, performing coherent accumulation on a radar receiving pulse sequence, and calculating test statistics of intra-frame coherent accumulation under each frame, each distance unit and each radial speed; based on the inconsistency of the sea clutter structural texture between the slow time Doppler velocity and the frame time radial velocity and the velocity consistency of the target on two time scales, inter-frame accumulation is carried out on the test statistics of each frame, each distance unit and each radial velocity in a distance-frame time plane along the radial velocity direction; constructing a coherent radial velocity spectrum; and in an inter-frame accumulation process, replacing a linear search accumulation mode of the coherent radial velocity spectrum between scanning by using the backtracking filter bank to obtain a coherent radial velocity spectrum based on the backtracking filter bank, and carrying out target detection by using the coherent radial velocity spectrum.

The invention relates to the technical field of meteorological data assimilation, discloses an assimilation method suitable for a nonlinear problem, and aims to solve the problem that an incremental variation assimilation method has no trust region constraint and may not converge in practical application. A scheme for solving convergence and calculation efficiency of non-linear cloud radiance assimilation in theoretical and practical application is discussed. According to the method, the comparison of the total variation assimilation method and the increment variation assimilation method is realized under the same framework, the comparison of the multi-grid method and the multi-external circulation method is realized under the same framework, the problem that direct comparison is difficult to realize in different platforms due to complex parameters in different methods is solved, and the system operation complexity is greatly simplified through unified model configuration. Experiments show that by adopting the linear search total variation assimilation method under the multi-grid framework, the accuracy of an analysis field is stably improved, and the minimization process of a nonlinear total variation objective function is accelerated.

The application belongs to the technical field of communication and provides an ACL optimization method, system, electronic device and computer storage medium. The application aims to solve the technical problems that the linear search mode becomes slower and slower with the increase of the number of rules, affecting the data packet processing speed and overall network performance, and that the original rules are temporarily invalid during the renumbering process, causing temporary service interruption. The application comprises the following steps: constructing a matching hash table and an action hash table; when a data packet arrives, obtaining all matching fields of the data packet; matching all matching fields with the matching hash table to obtain all rule codes; merging all rule codes into a bitmap; performing priority processing on the bitmap to obtain the rule code with the highest priority; taking the rule code with the highest priority as a key to find the corresponding action in the action hash table; and processing the data packet according to the action.

The invention relates to a multi-robot cooperative gas leakage tracing method and system based on particle swarm optimization and multi-dimensional constraint, and the method comprises the steps: initializing a plurality of mobile robots to carry out divergent linear search, and collecting the gas concentration data in real time; when the concentration exceeds a preset threshold value, switching to a smoke plume tracking mode; a target position is calculated in combination with a particle swarm optimization algorithm, a grid map constraint mechanism is introduced to verify the effectiveness of the position, and invalid points are removed; the robot plans a path according to a verification result, and utilizes a laser radar to avoid obstacles in real time; and finally, by monitoring the global concentration change trend, locking the leakage source and terminating traceability when the convergence condition is met. Compared with the prior art, the method provided by the invention solves the problems that the traditional method is easy to fall into local optimum, collide with obstacles or lose efficacy in navigation in a complex and limited space.

The invention discloses a delay search method and system for a delay phase-locked loop, a computer and a medium, and the method comprises the following steps: enabling a signal to activate a finite-state machine, and jumping to a search state; based on the preset configuration of the finite-state machine, linear step length search is carried out in the guard band range to locate a target phase, if the target phase is not found in the guard band range, linear step length search is carried out again after the guard band range is expanded, and when the real-time phase is equal to the target phase, a symbol state is entered; in the symbol state, the slope of real-time phase change is calculated, and symbol matching is verified; and if the symbols are matched, entering a phase-locked state, fixing a real-time delay change value in the phase-locked state, and pulling up a phase-locked loop activation signal. According to the invention, the digital code which is output by the phase discriminator and represents the phase relationship between the reference clock and the input clock can be received, the delay is searched in a linear search mode, the control signal is sent to the delay line, and the clock delay is changed until the clock meeting the requirement is generated.

The invention discloses a spanning frame structure size optimization method and system based on a firefly algorithm, and relates to the technical field of electric power engineering construction, and the method comprises the steps: firstly building a parameterized finite element model, implementing normalized hierarchical loading, obtaining a tangent stiffness matrix evolved along with a load, calculating the modal participation degree of a component, and constructing a dynamic participation degree track; and according to the quantitative trajectory smoothing index, the modal dominance and the key component suppression index, constructing a brightness function with coupled rigidity and trajectory features. The firefly attraction degree is corrected by means of trajectory similarity based on modal energy fingerprints, and nonlinear search is executed through a characteristic resonance mechanism. The method solves the problem that traditional static optimization neglects geometric nonlinear evolution to cause modal abrupt change, and the dynamic stability and evolution robustness of the spanning frame in the full stress process are remarkably improved while the structural light weight is achieved.

The present application relates to the technical field of computer interaction, and particularly relates to a method for quickly switching parameters by using a two-dimensional graph, comprising the following steps: S1: an application system acquires all parameter group data; S2: a two-dimensional mapping data structure is constructed with the first dimension and the second dimension parameter values as keys; S3: a user interface is generated according to the structure, and a two-dimensional coordinate axis and an intersection control are rendered; S4: in response to the user's click on the intersection, target data is obtained by querying the mapping structure, and a display area is dynamically refreshed. The present application directly presents parameter groups in the form of two-dimensional coordinates, and the user can instantly switch parameter details by clicking on the intersection, thereby innovating the navigation mode from linear search to two-dimensional positioning, effectively solving the problems of low positioning efficiency, poor global overview and difficult comparison and analysis existing in the traditional paging interface, and significantly improving the experience and efficiency of the user when browsing and comparing a large number of parameter groups.

The calibration method and the test equipment for the detection chip provided by the embodiments of the present disclosure comprise the following steps: controlling a target detection chip to continuously generate a trigger signal according to a preset rule; and controlling the target detection chip to output a logic test signal until the logic test signal flips between a high level and a low level; determining the value of the trigger signal; calibrating the target detection chip by using a calibration algorithm according to the determined value of the trigger signal; wherein an internal calibration circuit is configured to provide a calibration channel between the detection chip and a sampling element in the internal calibration circuit; and the internal calibration circuit is configured to establish a target calibration channel according to a control instruction. The embodiments of the present disclosure adopt a linear search method to find the value of the trigger signal, and then calibrate the level comparator of the detection chip by using a preset calibration algorithm according to the value of the trigger signal. Thus, the problem that the level comparator cannot be calibrated in the related art is solved. The integration of the ATE equipment is improved, and the dependence on external equipment is reduced.

A broadband signal rapid angle measurement method based on a partial calibration array adopts mathematical characteristics of a covariance matrix to carry out channel calibration on the partial calibration broadband array, adopts a method of combining broadband focusing with linear search to carry out accurate estimation on a signal incoming wave direction, and is suitable for a broadband array signal processing system. The direction finding method comprises a channel calibration module, an angle rough estimation module and an angle estimation module. According to the method, firstly, a broadband array receiving signal model in an amplitude-phase error environment is established, secondly, a self-calibration method for partially calibrating a broadband array is put forward, the array amplitude-phase error is compensated by using mathematical characteristics of a covariance matrix, and finally, a new broadband signal rapid direction finding method is put forward. A focusing algorithm is used to carry out angle coarse estimation on a broadband array signal, and a linear search method is used to carry out rapid fine estimation on an angle.

The application provides a rock elastic parameter calculation method and device based on a full stress-strain curve, equipment and a storage medium, comprising: filtering original full stress-strain curve data, determining a data calculation interval, and obtaining pretreated data; determining a constraint limit of a rock physical significance parameter, and obtaining Poisson's ratio processing data; adopting a locally optimal adaptive seed search method to perform linear search segment optimization on the pretreated data, and obtaining search method processing data; determining the data range of the linear segment of the full stress-strain curve according to the obtained Poisson's ratio processing data and the search method processing data; and calculating the rock elastic parameter. Through the pretreatment filtering and other operations on the curve, noise interference is reduced. At the same time, the determination of the linear segment through the constructed Poisson's ratio constraint method and the locally optimal adaptive seed search method greatly reduces the human selection error and improves the calculation accuracy of the rock elastic parameter.

The invention discloses a resistivity three-dimensional inversion method based on underground water seepage parameter constraint, and relates to resistivity inversion, and the method comprises the following steps: building a three-dimensional model, and determining model parameters; inputting an initial model and observation data; performing forward numerical calculation by adopting finite difference to obtain a model electric field value, and comparing the electric field value obtained by forward modeling with observation data to obtain a data error; calculating a cross gradient term of the model resistance and the hydrological parameters in a physical property space; establishing an objective function, calculating the gradient of the objective function, taking a nonlinear conjugate gradient method as an inversion method, and obtaining a search step length and a search direction through a quasi-forward modeling mode; judging whether the linear search convergence condition converges or not, if yes, entering the next step, otherwise, updating the model, and returning to forward calculation; and calculating a data root mean square error, if convergence occurs, ending iteration, otherwise, updating the step length and the search direction, calculating a model update amount, and returning to forward calculation.

This application provides a method, apparatus, storage medium, and computing device for constructing a security policy tree. It employs a two-stage bit selection mechanism: in the coarse selection stage, the partitioning performance of each candidate bit is evaluated by calculating policy similarity and difference parameters, and high-quality candidate bits are selected; in the fine selection stage, candidate bit combinations are generated by dynamically adjusting the combination upper limit through sequential or full combination, and the optimal target bit combination is selected based on partitioning cost, maximizing the effective partitioning of node policies. By reasonably setting the leaf node policy threshold, multiple policy trees with controllable depth are constructed, ensuring that the vast majority of policies are concentrated in the preorder tree, reducing the total number of trees. During matching, the target bits stored in the node are used to quickly locate the leaf node, requiring only a linear search of a small number of policies to complete the matching, significantly reducing traversal and search latency and improving matching performance in large-scale dynamic policy scenarios.

The disclosed computer-implemented method for selecting locations of mandibular relocation features (MRFs) on oral appliances may include determining candidate locations for placing an MRF on a first oral appliance for a first stage of mandibular relocation (MR) treatment and determining candidate locations for placing an MRF on a second oral appliance for a second stage. The method may include selecting from the candidate locations for the first stage and the second stage based on decreasing a distance between the selected pair of candidate locations. The method may further include processing multiple MRFs in parallel. The method may also include increasing a number of initial candidate locations. Locations for intermediate stages may be selected based on interpolating between the first and second stages or based on decreasing a distance between the selected pair if the interpolation fails. The intermediate stages may be processed using a binary search or a linear search.

The application relates to a DOA estimation method based on segmented beam scanning in a hybrid analog-digital structure. Firstly, candidate scanning weight vectors are configured in the full angle domain, and average power observations of a single radio frequency chain output are collected to form a full angle domain power sequence. Then, the power sequence is normalized and threshold judged to obtain potential angle intervals and complete angle domain segmentation, and DOA coarse estimation values of each segment are determined. In each segment, a local window linear search is performed with the DOA coarse estimation value as a priori, a local optimal scanning angle set is screened, and an extended scanning matrix is constructed. A linear mapping relationship between segmented power observations and subspace covariance submatrices is established, diagonal loading regularization is adopted to realize stable inversion reconstruction, and finally, eigenvalue decomposition of the reconstructed covariance is completed to detect the number of segmented sources, extract a noise subspace, and obtain DOA fine estimation values only in the segmented angle domain. The application still has good estimation precision and calculation efficiency in scenes such as low signal-to-noise ratio, coherent sources and underdetermined multiple sources.

The invention discloses a phase locking method based on binary search, a delay phase-locked loop and a storage medium, and the method comprises the following steps: S1, initializing a digital-to-analog converter code into a minimum delay corresponding value of a differential voltage-controlled delay line, and setting an initial search step length; s2, in each control clock period, adjusting a current digital-to-analog converter code according to a polarity signal output by a phase discriminator, increasing or decreasing the current digital-to-analog converter code by a current search step length, and halving the search step length; and S3, the step S2 is repeated until the search step length is reduced to 1, and a phase locking state is achieved. According to the invention, the digital code which is output by the phase discriminator and represents the phase relationship between the reference clock and the input clock can be received, the delay is searched in a linear search mode, the control signal is sent to the delay line, and the clock delay is changed until the clock meeting the requirement is generated.

The invention discloses an incomplete constraint vehicle path planning method based on a computing resource constrained environment, and solves the problems of computing resource waste, easy local optimum and insufficient scene adaptation of an existing grid sampling method. The method is applied to a qualified area scene with a tolerance range, and comprises the following steps of: defining a fuzzy target domain and a linear search interval which are formed by an ideal center point and the tolerance range, constructing a cost evaluation function containing factors such as path length and gear shifting times, generating a tentative path by adopting interval binary search iteration, and reducing the interval according to a cost trend, so as to obtain a tentative path; after the optimal target point is locked, a Reed-Shepp path is generated; and the search precision is dynamically adjusted through the processor load rate. The method does not need full sampling, reduces calculation overhead, adapts to resource-limited environments such as a vehicle-mounted low-end chip and embedded teaching equipment, and is especially suitable for low-speed close-range path planning such as back-up parking and side parking in a driving training scene.

This obstacle recognition method comprises the steps of: receiving a captured image from a camera; distinguishing a floor area from an obstacle on the captured image; generating a top-view image by removing the perspective of the captured image; designating a plurality of closest datum points on the top-view image; extracting a front surface of the obstacle by performing a linear search while rotating at each of the plurality of datum points; and selecting only an overlapping portion from the front surface of the obstacle extracted from the plurality of datum points as a final front surface of the obstacle. According to the obstacle recognition method, obstacles can be searched for at low cost.

A storage device may comprise a data buffer, a linear search engine, and a device controller. The data buffer may store data to be received from or transmitted to a host. The linear search engine may store a plurality of entries access-requested by the host. The device controller may provide the host with a read fail response when it is determined that a read operation on data stored in a memory block fails, and search for recovery data to substitute the data stored at a read fail address of the memory block from at least one of the data buffer and the linear search engine in response to a recovery data search command received from the host.

The invention provides a security policy tree construction method and device, a storage medium and computing equipment, and adopts a two-stage bit selection mechanism: in a rough selection stage, the division performance of each to-be-selected bit is evaluated through computing policy similarities and similarities parameters, and high-quality candidate bits are screened; in the selection stage, candidate bit combinations are generated through sequential combination or full combination according to a dynamic adjustment combination upper limit, and an optimal target bit combination is selected based on the division cost, so that node strategy maximization effective division is realized. A plurality of strategy trees with controllable depth are constructed by reasonably setting a leaf node strategy threshold, so that most strategies are concentrated in a preorder tree, and the total number of the trees is reduced. During matching, leaf nodes are quickly positioned by using target bits stored by the nodes, and matching can be completed only by linearly searching a small number of strategies, so that traversal and search delay is remarkably reduced, and matching performance in a large-scale dynamic strategy scene is improved.