71 results about "Range searching" patented technology

The invention provides a method and a device for improving the long-range deep search reasoning capability of a large language model. According to the method for improving the long-range deep search reasoning ability of the large language model, the long-range search reasoning ability of the large language model in cross-domain complex problems is remarkably improved, and the large language model is improved through high-difficulty data automatic generation driven by the knowledge graph and a three-layer difficulty screening mechanism. And by combining a two-stage training strategy of supervised fine tuning and GRPO reinforcement learning, the multi-hop reasoning depth of the model and the collaboration of external tool calling are effectively enhanced.

The invention provides a temperature modulation parameter optimization method for gas recognition based on a gas sensor, and belongs to the technical field of sensors. The method comprises the following steps: step S11, determining a plurality of classified gases; s12, building a data collection device; step S13, determining a search range and a search step length of modulation parameters; step S14, traversing the modulation parameter combination, and collecting sample data; step S21, projecting sample data of all gases of all modulation parameter combinations to a high-dimensional metric space; step S22, in a high-dimensional measurement space, measuring the similarity degree between the two samples by using Euclidean distance; s23, calculating a sample contour coefficient based on the cohesion degree and the separation degree of the sample; and S24, calculating a contour coefficient, and obtaining an optimization parameter according to the contour coefficient. By using the method, parameter tuning is performed, the required data is less, and the collection speed is high. Scientific basis and technical support are provided for parameter optimization.

One embodiment of the invention is directed to a method for performing efficient key range searches in a distributed computing system. The method may comprise, receiving a first key (e.g., an alphanumeric identifier). A key range tree map associated with the first key may be identified from a plurality of key range tree maps. In some embodiments, individual key range tree maps map a set of minimum range values to a set of index values. The method may further comprise determining an index value associated with a second key using the determined key range tree map. Transaction processing data associated with the first key may be determined using the index value and provided to the requesting source. Utilizing the plurality of key range tree maps as described herein enables a key range search to be performed using on-board memory of an electronic device.

The invention relates to the technical field of path planning, in particular to a global path planning method for a robot in a complex static environment, and the method comprises the steps: constructing a static environment model; setting parameters; initializing a population position; calculating the fitness; adjusting the position of the sparrow to avoid static obstacles; after each iteration, carrying out local optimization by using cubic spline interpolation; and repeating the steps until the maximum number of iterations or path convergence is achieved, and outputting the optimal path. Compared with the prior art, the method has the advantages that the nonlinear attenuation factor mu is introduced into the discoverer algorithm, so that the discoverer can perform wide exploration in the early stage and can perform accurate exploration on the developed area in the later stage, the early-stage search speed of the discoverer is increased, and the convergence speed is increased; and different search paths are determined according to the alarm value, and large-range search is performed when the alarm value is low, so that the optimal path is quickly searched, and the convergence speed is further improved.

The invention belongs to the technical field of thermal power generating unit valve flow characteristic optimization. According to the thermal power generating unit valve flow characteristic optimization method and system based on the particle swarm optimization algorithm, the excellent optimization searching capability, the global searching capability and the local jumping-out capability of a PSO-CS-SOA fusion searching method are comprehensively utilized, the particle activity is increased, particles jump out of the local part to conduct larger-range searching, then a global optimal solution is obtained through searching, and therefore the optimization efficiency of the thermal power generating unit valve flow characteristic is improved. Further optimizing the optimization model; the PSO algorithm is improved by adopting a nonlinear dynamic updating inertia weight, so that the convergence speed of an inertia weight value can be stabilized, and the global search capability and the local search capability of particles can be well balanced; an initial population position is processed into a collision avoidance position by introducing a CS algorithm additional variable A, particles are classified, the particles with high fitting degree are updated according to a PSO algorithm position updating formula, the convergence speed of the algorithm is ensured, the particles with low fitting degree are added into a CS algorithm spiral attack behavior to perform local spiral search, and the local spiral search efficiency is improved. The local search capability of the algorithm is enhanced, and the algorithm is effectively prevented from falling into local optimum.

The invention relates to the field of binocular stereo vision, and discloses a binocular stereo matching method and system based on multi-scale iterative optimization and related equipment. The method comprises the steps of performing semantic structure feature extraction on a corrected left view and a corrected right view through a feature extraction network; determining a cost space pyramid and a probability matrix according to the left view feature map and the right view feature map output by the feature extraction network; extracting a multi-scale context feature of the left view through a context sensing network, and initializing the multi-scale context feature to obtain a hidden state and input of a recursive network; during recursive network iteration, according to the probability matrix, a multi-range search strategy is adopted to index local cost from the cost space pyramid; and inputting the local cost into the recursive network, combining the hidden state obtained by the context features and the input, and carrying out iterative updating on the parallax value to obtain a parallax map, thereby improving the accuracy of parallax calculation.

A method includes employing a plurality of container controllers to receive a plurality of container requests, scheduling containers onto nodes that are available for container creation, storing information pertaining to each of the nodes in a node score database, the information including at least a single score value computed by using space-filling curves (SFCs), and finding a node with an optimal score by performing a range search to schedule a container of the containers to the node with the optimal score.

The invention discloses a strabismus mode ground interference source positioning method and system based on a satellite platform, a storage medium and electronic equipment, and the method comprises the following steps: firstly, carrying out the range pulse compression of a received interference signal according to the related parameters estimated by the prior information of an orbit and the time-frequency relation; constructing a matched filter, realizing linear range migration correction, and eliminating a first-order component of range migration in a range frequency domain-azimuth time domain; a CTF search algorithm is used, and under different search distances, distance direction search is achieved through a cooperation mechanism of global search and step length constraint local optimization; constructing matched filters at different distances to realize quadratic term range migration correction, and eliminating a range migration quadratic term in a two-dimensional frequency domain; azimuth distance compression is carried out at different distances, so that signals are focused; and obtaining a two-dimensional positioning position opposite to the interference source through coordinate transformation. According to the invention, the problem of signal defocusing caused by the distance-orientation strong coupling effect is solved in the squint mode, and the interference source positioning precision is significantly improved.

The present invention discloses a method and device for searching spatial data range based on radix tree. Aiming at the problems of low query and update efficiency, large computational overhead and low security of existing solutions, the present invention first generates a radix-tree index structure based on the file location, which narrows the query range during query, and is conducive to improving query efficiency. In addition, the dual cloud server architecture is used to reduce the number of interactions between the server and the query user in an encrypted environment, thereby alleviating the computational burden of the query user. In addition, the tree structure can be used to achieve efficient spatial data update; the present invention uses an efficient public key homomorphic encryption mechanism to hide the search mode and resist chosen plaintext attacks.

The present invention relates to a system and a method for multidimensional range searching for encrypted data, and an apparatus for the same. A method for multidimensional range searching for encrypted data according to an aspect of the present invention may include: generating an order revealing encryption (ORE) index table for a plurality of record data, wherein each of the plurality of record data includes data for a plurality of attributes; receiving a query for multidimensional range searching for the first attribute and the second attribute for the plurality of record data; determining one or more ORE indexes that satisfies all of the multidimensional range in the ORE index table for any one of the first attribute and the second attribute; and determining a response to the query based on the one or more ORE indexes.

To support efficient derivation of an optimum facility capacity.SOLUTION: The information processor 10A includes a processing unit 20. The facility-capacity optimizing unit 20A of the processing unit 20 searches for the provisional facility capacities of the supplying facilities 32 in descending order of priority from a narrower search range as the priority becomes lower, based on the priority of the supplying facilities 32 that are included in the energy system 30 and supply energy, the input search range of the facility capacities, the number of searches, and the target energy introduction ratio of the energy system 30. The simulation execution unit 20B of the processing unit 20 derives the introduction cost of the supply facility 32 having the searched temporary facility volume and the energy introduction ratio of the energy system 30 including the supply facility 32 having the temporary facility volume every time the temporary facility volume is searched. The processing unit 20 repeatedly executes the search for the provisional facility capacity and the derivation of the introduction cost and the energy introduction rate every time the target energy introduction rate is changed.SELECTED DRAWING: Figure 1

A method in a data processing system and apparatus for organizing electronic data, structured or unstructured, of one or more users stored across one or more server computers into structures on a recordable medium of a data processing system. The data items are structured in a heterogeneous string structure, and one or more embedded n-dimensional range structure within the heterogeneous string structure. Searching the plurality of string structures can then be done with a query including at least one term and a range threshold. Each data item is associated with a scoring function that is used to filter and rank the matched results.

The invention discloses an implicit generation method for a thin-wall lattice sandwich structure, which belongs to the technical field of lightweight design and comprises the following steps of: dividing hexahedral grids in a to-be-filled area of a thin-wall model, constructing a shape follow-up distance field in hexahedral unit cells, and constructing a shape follow-up distance field in combination with the lattice type of the current hexahedron, design parameters and lattice information of adjacent hexahedrons. Generating a conformal dot matrix distance field; meanwhile, voxelization processing is conducted on the thin-wall grid model, boundary voxels are extracted, corresponding patch information is stored, a boundary hexahedron searches for the nearest boundary voxel patch information by expanding the search range, a model boundary distance field is generated through implicit bias, and finally Boolean fusion is achieved with a dot matrix distance field. According to the thin-wall interior filling method, the dot matrix microstructure serves as the center, high-quality parallel filling of the cross-scale microstructure of the large-size thin-wall model interlayer can be efficiently achieved, and the problems that an existing mainstream implicit filling method is insufficient in precision, and an explicit filling method is difficult to fuse and sharp in transition can be solved.

Methods and apparatus for sparse column-aware encodings for numeric data types, including integer data and floating-point data (float, double, etc.). The encoding schemes are tailored to take advantage of column addressable memories such as stochastic associative memories (SAM) to enable Stochastic Associative Search (SAS), which is a highly efficient and fast way of searching through a very large database of records (order of Billions) and finding similar records to a given query record (search key). Techniques are also disclosed for performing range searches for both integer and floating-point data types. The integer or float data is converted to Hexadecimal form and encoded using an m-of-n constant weight encoding. Only the columns with set bits in search keys need to be read, which significantly reduces the number of reads required for searches.

The application relates to a focusing method and device, a computer device and a storage medium. The method comprises the following steps: obtaining an estimated object distance of a target object; obtaining a corresponding focus value curve based on the estimated object distance, and determining a plurality of first focusing positions based on a peak point of the focus value curve; obtaining a corresponding farthest object distance curve and a nearest object distance curve based on the estimated object distance, and determining a focusing range based on a real-time zoom ratio, the farthest object distance curve and the nearest object distance curve; searching for a second focusing position based on the plurality of first focusing positions and the focusing range, wherein a focus value of the second focusing position for imaging the target object satisfies a preset condition. Through the application, the technical problem of low focusing efficiency in the related art is solved, the search process is shortened, the computing resource overhead is reduced, and the focusing efficiency is improved.

The present invention discloses a multi-server-based traffic planning statistics data linkage retrieval system and method, which relates to the technical field of traffic planning management. The system includes a collection client, a collection service cluster, a linkage distribution server, a storage service cluster, a search service cluster and a retrieval terminal. By separating the storage and retrieval of big data and constructing a composite word segmentation of traffic planning statistics data, the performance and speed of big data range search and accurate search are improved; by linking the distribution server dimension extraction, spatiotemporal convergence and control forwarding, data linkage is achieved between the two, and the characteristics of the two types of databases are fully combined, which greatly improves the system retrieval performance and enhances the user experience. The present invention constructs a connection relationship between multiple hardware servers, that is, constructs a hardware carrier of a statistical data linkage retrieval system, so that the hardware carrier assists the relevant software function to achieve the purpose of rapid retrieval, providing convenience for relevant staff.

Techniques are disclosed pertaining to layered filtering. A computer system may store records in a hierarchy of levels. The computer system may receive a request to perform a key range search to locate records that fall within a key range and satisfy selection criteria. The computer system may perform the key range search. As part of processing a particular level, the computer system may receive a first set of records associated with another level and select a second set of records from the particular level that fall within the key range and satisfy the selection criteria. The computer system may merge the first and second sets of records into a third set of records, which may include not inserting, into the third set, any record of the first set of records for which there is a newer version in the particular level that does not satisfy the selection criteria.

This invention provides a digital measurement method and system for aircraft skin depression areas based on point cloud scanning, relating to the field of parts inspection technology. The method includes: acquiring point clouds of the skin surface; locating feature regions based on local curvature; extracting and fitting feature contour lines using projection and envelope methods; selecting measurement points on the contour lines; determining the search range on the opposite side; searching and calculating the shortest geodesic length between the two contour lines; establishing a cross-section at the geodesic endpoint and projecting the local point cloud; fitting a linear segment and determining the theoretical contour points based on a deviation threshold; calculating the projection compensation distance; and obtaining the final size of the depression area by combining the geodesic length. The advantages are: acquiring point clouds through 3D scanning eliminates the need for dedicated molds, reducing costs and improving inspection accuracy and efficiency; the feature extraction method based on local curvature perception accurately extracts the required feature contour lines; and the use of the shortest geodesic and projection distance compensation effectively reduces contour recognition errors, achieving accurate measurement of the depression area.

The invention discloses an aircraft maintenance task allocation and scheduling method based on a cutting strategy and time constraint, and relates to the technical field of aviation maintenance management and operation planning optimization. The method comprises the following steps: determining a maintenance opportunity that each airplane stays on the ground and meets a maintenance resource condition according to a known flight timetable; according to the technical scheme, a mathematical heuristic solving algorithm is designed, a hybrid algorithm combining a constructive heuristic algorithm and an accurate solving technology is developed, an infeasible solution is dynamically repaired through two core processes of resource monitoring and airworthiness monitoring, and an approximate optimal solution is quickly found in a large-range search space; a maintenance task is decomposed into feasible parts through a cutting strategy to adapt to a limited time box, and the problem of infeasibility caused by resource conflicts is solved; and meanwhile, solving is performed through a mathematical heuristic algorithm, so that the total cost including direct maintenance cost and extra waste cost caused by advanced maintenance is minimized while the calculation efficiency is ensured.

A method in a data processing system and apparatus for organizing electronic data, structured or unstructured, with associated metalabels, on a recordable medium of a data processing system. The data items are structured in a heterogeneous metalabel search structure. Searching the plurality of metalabel search structures can then be done with a heterogenous-range query including at least one term and one range query. The query can also be specified in a natural language which is converted to the specific heterogenous-range query. Also provided is a method for searching using geometric shapes that are mapped into range-string queries where the ranges are d-dimensional hyper-rectangles or cubes that cover the geometric shape. A method to aid the selection of the appropriate shape is provided as well as a method to cost-efficiently select the hyper-rectangles and cubes to cover the shape.

The invention relates to trimming search space for nearest neighbor determination in point cloud compression. A search space for performing a nearest neighbor search for encoding point cloud data may be tailored. Points to be excluded from the search space may be identified using a range of space filling curves. In addition, neighboring voxels may be searched based on the ranges of the space filling curve to identify any neighboring points that are lost during the tailored search.

Aiming at the problems of unbalanced energy and low coverage efficiency of the existing WSN, the invention provides a WSN energy efficient coverage method and device for improving a bacterial foraging algorithm (EABFO). According to the method, an adaptive variation method is adopted during position updating, before a predicted peak value is reached, the variation probability is increased along with the increase of the number of iterations, the randomness of bacteria is increased, global large-range search is realized, omission of an optimal solution is avoided, local optimum is tended, after the predicted peak value is reached, the variation probability is reduced, and local detail search is realized; time and space waste is reduced, and algorithm efficiency is improved. In addition, an elite breeding strategy is innovatively provided, the optimal fitness value is reserved, reverse growth of the fitness value is avoided, and the whole flora is evolved in a better direction. Compared with a genetic algorithm, the method has the advantages that the service life of the sensor matrix is prolonged by 200%, the method is suitable for energy-limited scenes such as large-scale static monitoring and dynamic target tracking, and the life cycle of the WSN is effectively prolonged.

The present invention relates to a method for reconstructing a quadratic delay model of a radio source for space-based VLBI, comprising: determining parameter information for space-based VLBI according to a preset observation plan, and obtaining radio source baseband signal sequences from a first station and a second station; determining a search range and a search step size within a two-dimensional time delay-delay rate space, and dividing the two-dimensional time delay-delay rate space into a grid according to the search range and the search step size; segmenting the radio source baseband signal sequences from the first station and the second station for each grid point, obtaining the maximum correlation amplitude mean corresponding to each grid point; finding the grid point with the largest maximum correlation amplitude mean; and reconstructing a quadratic delay model of the radio source for space-based VLBI based on the grid point with the largest maximum correlation amplitude mean. The present invention can obtain a high-precision radio source delay model while maintaining an order of magnitude increase in computational complexity.

This application relates to a method and apparatus for re-acquiring a lost-lock signal based on a short-time burst synchronization signal. The method includes: designing a short-time burst synchronization signal based on a short-time burst system; reading a certain length of baseband received signal from the starting position of the short-time burst synchronization signal and generating a corresponding local modulation sequence; calculating a carrier signal; performing coherent integration on the carrier signal to obtain the amplitude; determining whether the carrier Doppler frequency range search is complete; if not, recalculating the amplitude according to the Doppler search step; if complete, determining whether the phase search in the time domain is complete; if not, shifting the starting position forward by a certain distance and calculating a new amplitude; if complete, finding the maximum amplitude; and determining whether the maximum amplitude of the acquisition search is greater than a preset threshold; if greater, the signal is considered successfully acquired; otherwise, the signal is considered not acquired. This method can improve the success rate of acquisition.

The invention relates to a fault interval positioning method and system based on distribution network fault characteristics and instantaneous power characteristics, and the method comprises the steps: extracting fault signals in feedback signals in response to the obtained feedback signals of a monitoring node of a distribution network, and the number of the feedback signals is multiple; positioning the fault signal and determining a fault position range according to a positioning result; the method comprises the following steps: analyzing the direction of instantaneous power in a fault signal, positioning in a fault position range according to the direction of the instantaneous power, determining a fault position point, and normalizing the instantaneous power in the fault signal according to the value of the instantaneous power when positioning in the fault position range according to the direction of the instantaneous power. According to the fault interval positioning method and system based on the distribution network fault characteristics and the instantaneous power characteristics, range searching is carried out in a mode of signal extraction and direction determination, and the fault can be quickly positioned in the mode.

The present application relates to the technical field of sharing management. The present application relates to a sharing resource management terminal service platform based on the Internet of Things. It comprises a user connection unit, a range searching unit, a vehicle connection unit, a vehicle management unit, a management background unit and a sharing resource management terminal management unit; the user connection unit opens the operation authority of the sharing resource management terminal to the user with accurate information; the range searching unit detects the shaking of the vehicle, and when the shaking is detected, the shaking vehicle and the nearby vehicle are synchronously started to search the equipment, and the sharing resource management terminal to be matched within the effective range of the shaking vehicle is screened; through the collaborative design of the range searching unit and the vehicle connection unit, the present application optimizes the equipment matching logic; when the shaking of the vehicle is detected, the distance threshold screening and the real-time position tracking dynamically update the list of the equipment to be matched, so as to ensure the effectiveness of the candidate equipment; this dynamic screening combined with the priority matching mechanism reduces the probability of invalid matching.

The invention discloses a multi-user encrypted data cross-domain search method based on a constant-level query token, and relates to the field of encrypted data range search. A system model is composed of a user group, data owners of different search domains, a block chain and a cloud server. The method comprises an initialization stage, a key distribution stage, an index construction stage, a token generation stage and an authorization query stage. A data owner constructs a sequence weighted inverted index to realize a randomized constant-level query token, and a binary tree sorting tree is used for storing different values to determine a search range, so that the query overhead is reduced, and the security of a query process is improved; a request chain and an authorization chain are introduced to store key information related to a user and a data owner and carry out index construction and search, so that safe search is realized. According to the method, the overhead of multiple users in the range search process is reduced, the security in the query process is improved, and the security and integrity of query information during multi-data-field range search are ensured.

The present invention discloses a multi-user encrypted data cross-domain search method based on constant-level query tokens, which relates to the field of encrypted data range search. The system model consists of a user group, data owners in different search domains, a blockchain, and a cloud server. The method includes: an initialization phase, a key distribution phase, an index construction phase, a token generation phase, and an authorization query phase. The data owner constructs a sequential weighted inverted index to implement a randomized constant-level query token, uses a binary tree sorting tree to store different values to determine the search range, reduces the query overhead and improves the security of the query process; introduces a request chain and an authorization chain to save the key information related to the user and the data owner and to construct and search the index, thereby achieving a secure search. The present invention reduces the overhead of multiple users in the range search process, improves the security of the query process, and ensures the security and integrity of the query information during multi-data domain range search.

The application discloses a DEM sunshine duration method and system based on GPU and terrain entropy optimization, and belongs to the field of geographic information science and spatial computing technology. The method firstly calculates terrain information entropy by using digital elevation model data to quantize the terrain complexity of different regions; and then dynamically adjusts the solar visibility range search radius and search step length by taking the terrain information entropy as an adaptive driving factor, so that the terrain shielding relationship is finely simulated in the mountainous or complex terrain area while the unobstruction is quickly determined in the flat terrain area. In addition, the application is realized by using a CUDA parallel architecture, and the GPU parallel strategy of block partitioning is combined, so that the calculation load of high-resolution data is effectively reduced, and the overall operation efficiency and memory utilization are improved.

The invention belongs to the technical field of scene matching, and particularly relates to a rapid scene matching method for a large-range search area, which greatly improves the scene matching speed during large-range search and solves the problem of high time consumption in initial positioning of current scene matching. According to the method, a four-dimensional descriptor is firstly designed, so that the robustness of a back-end matching strategy can be greatly improved; furthermore, on the basis of the multi-dimensional reference descriptor and the multi-dimensional real-time descriptor, a convolution coarse matching and fine matching strategy is designed, firstly, the multi-dimensional reference descriptor is segmented to perform software acceleration, coarse matching is performed on the obtained nine regions by using convolution, and fine matching is performed on the obtained nine regions; cutting an image with the same size as the real-time image on the original reference image according to the matching position for accurate matching, and finally designing a matching judgment rule to judge a matching result. According to the method, a mode of combining segmentation rough matching and fine matching is adopted for a large-range search region, so that the matching speed of the large-range region is greatly improved.