34results about How to "Reduce search space" patented technology

Improved timing synchronization and access control techniques for use in an orthogonal frequency division multiplexed (OFDM) wireless system or other type of wireless communication system. In accordance with the invention, an uplink synchronization and access control system is provided in which mobile stations transmit certain timing and access signals in dedicated intervals in an uplink stream. Access control is illustratively implemented as a two-stage process in which a given mobile first transmits a generic uplink access signal in one of the intervals. If this access is accepted, the base station transmits an access acknowledgment containing initial timing and power corrections, along with initial channel assignments on which the mobile can initiate a call set-up process. For re-synchronization, mobiles transmit timing synchronization signals in the dedicated timing and access intervals. The base station measures the arrival time of the signals, and sends back appropriate timing corrections. The invention thereby ensures that orthogonality between mobiles is maintained.

A global registration system and method identifies bronchoscope position without the need for significant bronchoscope maneuvers, technician intervention, or electromagnetic sensors. Virtual bronchoscopy (VB) renderings of a 3D airway tree are obtained including VB views of branch positions within the airway tree. At least one real bronchoscopic (RB) video frame is received from a bronchoscope inserted into the airway tree. An algorithm according to the invention is executed on a computer to identify the several most likely branch positions having a VB view closest to the received RB view, and the 3D position of the bronchoscope within the airway tree is determined in accordance with the branch position identified in the VB view. The preferred embodiment involves a fast local registration search over all the branches in a global airway-bifurcation search space, with the weighted normalized sum of squares distance metric used for finding the best match.

Provided are a method, system, and program for selecting a join order for tables subject to a join operation. An estimation is made of a join cost to perform joins on permutations of at least two of the tables, wherein each join permutation indicates an order of joining the tables. A determination is made as to whether sufficient computational resources are available to perform a join cost analysis of further join permutations of the tables. If sufficient computational resources are not available, then a determination is made of a restricted subset of remaining join permutations of at least two of the tables for which join costs have not been estimated that is less than all the remaining join permutations. The join costs of permutations of tables in the restricted subset is estimated and the estimated join costs are used to select one join permutation of all the tables having a lowest estimated join cost.

The invention discloses a distribution method for sub carriers in a cognitive OFDM network, and belongs to the technical field of cognitive radio resource management. The method comprises the steps of (1) coding scheme determining, (2) population initialization, (3) population intersection, (4) population variation, (5) population fitness evaluation, (6) population updating, and (7) iteration terminal condition judgment. According to the distribution method for the sub carriers in the cognitive OFDM network, the basic framework of a genetic algorithm is adopted, the coding scheme, mutation operation and population updating operation are redesigned aiming at the characteristics of distribution of the sub carriers in the cognitive OFDM network, the defects of resource allocation of cognitive radio networks in the prior art are overcome, the effectiveness for processing the resource allocation of the cognitive OFDM network is improved, and the spectrum efficiency is improved.

A method and apparatus for performing speech recognition using observable relationships between words. Results from a speech recognition pass can be combined with information about the observable word relationships to constrain or simplify subsequent recognition passes. This iterative process greatly reduces the search space required for each recognition pass, making the speech recognition process more efficient, faster and accurate.

An indexing method of punched element includes picking up character and inter-character constraint from 3-D model of punched element, obtaining thickness and intensity as well as hardness of material according to material information table of punched element and calculating out similarity of new and old punched elements based on process similar point of view.

The invention discloses a multi-point geostatistic stochastic inversion method based on image stitching and a device. Stochastic simulation is conducted through multi-point geostatistics, and thus theform of a target body can be better depicted; an image stitching technology is introduced, and thus multi-point geostatistic stochastic simulation results with good continuity can be obtained quicklyand efficiently; through a forward modeling method, the simulation results are synthesized into a seismic record to be compared with an actual seismic record, and a simulation result capable of beingcompared and matched with the actual seismic record is obtained firstly; then through a quantum annealing optimization algorithm, the simulation result is quickly optimized, the final stochastic inversion result is obtained under constraints of the seismic record, the precision of the inversion result of a cross-hole region is improved, the resolution ratio of the inversion result of the cross-hole region is increased, stochastic inversion is conducted for multiple times, thus the multiple different geostatistic stochastic inversion results can be obtained, the reliable basis is provided foruncertainty analysis, and then necessary reference information is provided for study of reservoir characterization, reservoir description and the like.

The invention discloses a state target based heuristic spacecraft mission planning method, relates to a spacecraft mission planning method, and belongs to the technical field of aerospace. According to the characteristics of spacecraft system constraint complexity and system state information intercoupling, multiple parallel subsystems of a spacecraft are depicted by the aid of multidimensional timelines; according subsystem constraint characteristics, timelines satisfying timeline parametrization screening conditions are subjected to timeline parametrization processing to reduce searching space of problems; meanwhile, state and defect selection heuristic design is performed according to target information of state, prioritized selection is performed on the state with the highest weight and the defect with the highest evaluation value to ensure realization of mission targets, and spacecraft mission planning efficiency is increased. Problem searching and solving rate in spacecraft mission planning can be increased, rational planning solutions are obtained within shorter time, and the problem of low planning efficiency caused by planning operation is solved.

The invention discloses a method and a system for acquiring answers of tax business questions based on semantic graphs, and belongs to the technical field of intelligent questions and answers. The method comprises the steps of defining a question Q and an answer of the question Q according to a state transition graph G, and mapping a semantic interpretation process of the question Q into a sub-graph sub-G query process of the state transition graph G; generating a logic expression; action transfer and conditions in the logic expression are repeated; and obtaining a tax business problem, inputting the tax business problem into the model, checking whether the tax business problem completes the logic expression X, and outputting a tax business problem answer when the tax business problem completes the logic expression X. The semantic parsing process is mapped into the retrieval process of the query graph, so that the retrieval space of problem parsing is reduced, the operation between entities is judged by using the deep convolutional neural network, and the predicate synonym ambiguity problem mentioned in the preamble is solved.

The invention discloses an optimal configuration method of breaker and fault current limiter in ring network type DC micro-grid. The ring network type DC micro-grid change condition after the short-circuit fault is sufficiently considered and analyzed, and a method for accurately and quickly obtaining the fault DC micro-grid network voltage and the branch current is provided. By adopting the NSGA-II algorithm with fast operation speed and good solution set convergence is adopted and improved to perform the optimal configuration analysis of the breaker and the fault current limiter, and the practicability is strong. The two economic indexes of the breaking capacity of the breaker and the inductive value of the fault current limiter are used as the target function, and the reliability indexcapable of reliably breaking the branch is used as a constraint condition, and the obtained optimal configuration scheme has good economy and reliability at the same time.

A database is configured to analyze user queries to dynamically partition the database according to a partition scheme. User queries can be rewritten based on the partition scheme so that, in response to queries, partitions including relevant data are read while partitions including irrelevant data can be skipped, reducing latency. Files can be named according to the partition scheme and stored on respective partitions so that low partition management can be implemented by underlying systems. Blocks within files can be sorted and statistics can be determined. The statistics can be used to find and read relevant blocks and skip irrelevant blocks.

The invention belongs to the technical field of wireless communication, and relates to the index modulation orthogonal frequency division multiplexing (OFDM-IM) technology, interleaving technology and the adaptive technology, and specifically relates to an adaptive modulation method based on index information. The invention provides a single-carrier adaptive modulation method based on index information and an adaptive modulation method joining a plurality of subcarrier blocks. Compared with the traditional ISIM-OFDM system, the adaptive technology can enable each subcarrier group to adjust the modulation mode according to the quality of the channel condition, and the influence of the channel on the system error rate can be greatly reduced. The complexity of the single-carrier adaptive modulation method is low, the adaptive modulation method joining a plurality of subcarrier blocks can be used for avoiding the locally optimal solution of the single-carrier adaptive modulation method, thereby greatly improving the minimum Euclidean distance between symbols and improving the system performance.

The invention provides for the evaluation of semantic closeness of a source data file relative to candidate data files. The system includes an artificial neural network and processing intelligence that derives a property vector from extractable measurable properties of a data file. The property vector is mapped to related semantic properties for that same data file and such that, during ANN training, pairwise similarity/dissimilarity in property is mapped, during towards corresponding pairwise semantic similarity/dissimilarity in semantic space to preserve semantic relationships. Based on comparisons between generated property vectors in continuous multi-dimensional property space, the system and method assess, rank, and then recommend and/or filter semantically close or semantically disparate candidate files from a query from a user that includes the data file. Applications apply to search and compilation tools and particularly to recommendation tools that provide a succession of logical progressive associations that link between disparate file content in source and destination files.

According to the ICD surgery and operation code automatic matching method based on deep learning, a modular modeling method is used. Each module only completes a relatively simple task, the search space of model parameters is greatly reduced, and the required data volume is reduced. The method comprises: using a two-way autoregressive language model to model a natural language sequence; combiningeach operation description with each ICD code; calculating a semantic space weight between the two; reconstructing the operation description by using the semantic space weight, performing ICD code classification matching by using the reconstructed operation description to solve the problem of concept splitting, performing bidirectional autoregression model modeling by using the inherent hierarchical structure of the ICD operation and the operation code in calculation, and fusing business priori knowledge. Problems encountered in clinic are solved, and ICD code matching can be rapidly and accurately carried out.

The invention discloses a novel method for protein O-GalNAc modification rapid library search and deep coverage. According to the novel method of the invention, on the basis of the extraction and classification strategies of the spectrograms of oxonium ions and sialic acid fragments in an O-GalNAc glycopeptide spectrogram, corresponding matched O-glycosyl glycoform database retrieval is carried out on different types of spectrograms, so that a database retrieval space is greatly reduced, and database search time is shortened; in order to solve the problem that a large number of missing valuesexist in the multi-sample detection of complete O-GalNAc glycopeptides under a mass spectrum DDA scanning mode, matching based on corrected retention time and a mass spectrum primary mass number is utilized to supplement the quantitative missing values of the complete O-GalNAc glycopeptides between different samples according to the complete O-GalNAc glycopeptides which have been identified in a multi-sample experiment, and therefore, the identification coverage of the O-GalNAc glycopeptides during multi-sample detection is substantially improved, and quantitative reproducibility is improved.

The invention discloses a harmony search-based mixed feature selection method. The advantages of a filter and harmony search are combined to form a mixed system. The system can select an optimal feature subset from an original feature set of a large amount of users, and the feature subset is used for classification and detection of junk users in a social network. At present, the performance of a classifier depends on the selection of the feature subset, a feature selection problem can be regarded as an optimization problem, and the goal is to select the optimal or approximately optimal feature subset. A method is proposed, and the purpose of realizing the selection of the optimal feature subset is achieved by utilizing the advantage of simple and quick calculation of a filtering method and a harmony algorithm. The shortcomings that the filtering method ignores a dependency relationship among features and a wrapper has relatively high calculation cost are overcome.

The invention discloses a method and a device for inquiring a path between two figure nodes in a family tree graph. The method comprises the steps of acquiring a family tree graph corresponding to a target family tree and two nodes of a to-be-queried path,wherein the family tree graph at least comprises character nodes and attribute information, and the two nodes comprise an initial node and an end node; searching a first precursor node set corresponding to the initial node and a second precursor node set corresponding to the end node, each precursor node set comprising: at least one precursornode for indicating preset attribute information, the precursor node being used for indicating a travelable next node in the path; when the same precursor nodes exist in the first precursor node setand the second precursor node set, sequentially reading the precursor nodes in the first precursor node set and the second precursor node set to obtain a path node set; and determining the shortest path between the two nodes according to the path node set.

The invention discloses a method for detecting cohesion subgraphs in a symbolic network based on a k truss and a balance theory. In order to find a group meeting density constraint and balance constraint at the same time, the invention provides a new cohesion sub-graph model on a symbolic network, i.e., a maximum symbol k truss, which meets three conditions: any one edge is contained in at least (k-2) triangles; any unbalanced triangle is not included; that is to say, any hypergraph is not provided with a symbol k truss. Considering the attributes of the balance triangle and the k truss, the invention provides a new pruning strategy, so that the search space is reduced more effectively. Meanwhile, an efficient SKT algorithm is developed in combination with a new pruning strategy, so that amaximum signed k truss can be quickly found in a large signed network. The application of the method provided by the invention has great benefits on the detection of the cohesion subgraph and the identification of the trust community.

The invention belongs to the technical field of relational databases, in particular to an aggregation summarization method for a keyword search result of hierarchical relation data. The method comprises the following steps of: giving a relational database D having a hierarchical relation H and a search Q and n search results S on the relational database D, wherein S contains result tuples t1, t2,..., and tn; according to the hierarchical relation H, aggregating the n search results, namely t1, t2, ..., and tn into a maximum lowest upper-layer minimum covering aggregate by using a sequenced connection method according to a principle of the lowest upper-layer minimum covering aggregate; iterating aggregation results to search maximum covering according to the principle of the maximum covering; and pruning in a searching process to find a greedy result I. In the method, connection operation is reduced according to the hierarchical relation in an aggregation process, and time cost is reduced by introducing a pruning method in a summarization process, so aggregation summarization efficiency is higher.

The invention discloses a data set frequent item set mining availability evaluation method, which comprises the following steps of: (1) setting C = {I1, I2,..., In} as a set of items, giving transaction data sets D1 and D2, and mining D1 and D2 by utilizing an Apriori algorithm to obtain maximum frequent item set sets, and recording the maximum frequent item set sets as FIS1 and FIS2; (2) any item set MIS1 of the FIS1 and any item set MIS2 of the FIS2 are matched through an item set matching algorithm F, a paired item set table Pairs is obtained, the Pairs is composed of item set pairs < MIS1, MIS2 and score1 >, score1 represents the item similarity of the MIS1 and the MIS2, and the item similarity of the MIS1 and the MIS2 is obtained through calculation in the matching process. (3) for each item < MIS1, MIS2, score 1 > in the Pairs, calculating the support degree similarity score 2 of the MIS1 and the MIS2, further calculating to obtain the composite similarity score of the MIS1 and the MIS2, and updating the pair to be < MIS1, MIS2, score >; and (4) accumulating the composite similarity score of each item in the Pairs, and dividing the accumulated composite similarity score by the number of the items in the Pairs to obtain a similarity score SCORE of the D1 and the D2, and the value range of the score is [0, 1].