632 results about "Index method" patented technology

A visual index method provides graphical output from search engine results or other URL lists. Search engine results or a list of URLs are passed to a web crawler that retrieves the web page and other media information present at the associated URL. The web crawler then passes this information to a page renderer which also receives image scale and format information regarding the web pages present at the URLs. The graphical information as well as other media information is then rendered into a reduced graphical form so that the page may be summarily reviewed by the user. Media, visual, or other information may also be downwardly scaled as appropriate or rendered in its original as appropriate (such as with audio data streams). A variety of convenient formats allows the user to quickly and readily scan the presentation at the URL web pages or other data present. Image maps associated with the reduced images may also provide hyperlink access to the linked web page and / or multimedia allowing the links present on the web page in its original to be accessed through the reduced image provided by the web page renderer.

An improved method of partitioning and indexing multi-dimensional data that maps the data to one-dimensional values according to the sequence in which an approximation of a Hilbert space-filling curve passes through all of the points corresponding to potential multi-dimensional data in a data space. Data is partitioned into pages, each corresponding to a length of Hilbert curve. A page identifier is the sequence of the first point on its corresponding Hilbert curve section. The mapping orders data and also orders the data pages that contain data within a database. Mapping multi-dimensional data to one-dimensional values enables the data to be indexed using any one-dimensional index structure. The practical application of the indexing method is made viable and useful by the provision of a querying algorithm enabling data to be selectively retrieved in response to queries wherein all or some of the data that lies within a rectangular space within multi-dimensional space is required to be retrieved. The querying algorithm identifies pages whose corresponding curve sections intersect with a query region. The first intersecting page is found by calculating the lowest one-dimensional value corresponding to a possible multi-dimensional data value or point within the query region, and looking up in the index to find which page may contain this point. The next intersecting page, if it exists, is found by calculating the lowest one-dimensional value equal to or greater than the identifier of the next page to the one just identified. This new lowest one-dimensional, if found, is used to look up in the index and find the next page intersecting with the query region. Subsequent pages to be found, if any, are determined in a similar manner until no more are found. Pages found to intersect the query region can be searched for data lying within the query region.

An indexing method for allowing a viewer to control the mode of delivery of program material. By mapping from time to data position, data delivery can begin at any selected time in the program material. The indexing method also provides for controlling data delivery to begin at the beginning of a frame of data. A synchronizing method is provided to minimize a time offset between audio and video data, particularly in environments using groups of pictures.

Events in a first data stream are correlated with events in a second data stream based on a method of indexing. As information of a first and second data stream are stored to a data file, the data streams are monitored for certain trigger events. An informational data set is generated and stored in an index file for each detected trigger event. Preferably, each informational data set includes the type of detected event, a time-stamp indicating when the event occurred and a data pointer indicating where the data associated with the event is stored in a corresponding data file. When time-stamps of detected trigger events in both data streams are generated based on a common system clock, data in one data stream is correlated with data in another data stream based on the time-stamps.

The present invention provides a new method for indexing a given text objects, using text parsing module and words indexing databases. According to this method each word is assigned a first index code according to words meaning, a second index code according to each word syntax category and a third index code according to word syntactical role. The words indices are arranged according to hierarchical order based on syntactical relations between the text words. At the last stage, differentiating symbols, which represent indices hierarchical order, are assigned between adjacent words indices. The indexing process may be implemented as automatic computerized program or as wizard application enabling human intervention in the indexing process. The indexing method can be utilized for enabling text search utilities based on matching between The query indices and source text indices.

Methods, systems and computer program code (software) products for generating a software quality index descriptive of quality of a given body of software code include identifying, by analysis of the body of software code, fault-prone files in the body of software code; constructing and training, by analysis of the body of software code, a model derived from analysis of the body of software code; and generating, based on the model, an index score representative of the quality of the body of software code.

An architecture for a digital pixel sensor is disclosed in which the dynamic range of the sensor is increased by taking samples of a subject to be recorded, where each sample is taken over an interval of a different duration than the other samples. In the preferred embodiment of the invention, an array of pixel elements is fabricated in an integrated circuit. Each of the pixel elements outputs a digital signal and comprises a photodetector and an analog to digital converter. The photodetector is integrated with the analog to digital converter. An array of threshold memory cells, each corresponding to one of the pixel elements, is also provided. An array of time memory cells, each corresponding to one of the pixel elements, establishes a different sampling time for each of the pixel elements for each of multiple samples. An array of memory elements, each coupled to one of the pixel elements, is also provided. The memory elements are also fabricated in the integrated circuit. The memory elements only receive a value from a corresponding one of the pixel elements when the content in a corresponding one of the threshold memory cells permits. In this way, multiple samples may be collected for a subject to be recorded to thereby extend the dynamic range of a photodetector. Integration of the photodetector and the memory that implements this mechanism into the same integrated circuit avoids the latency that would be experienced if an external memory was used.

Movement through multi-dimensional space is simulated using a series of panoramic images which are projected or displayed in sequence. The user's direction of view, that is the selected view window, is maintained as the series of images is projected or displayed. Motion in directions other than forward or reverse is simulated by utilizing "branch" points in the sequence. Each path from a branch point simulates motion in a different direction. Branch points are generally indicated to a viewer by visual indicators called "hot spots"; however, branch points may also be hidden and activated in response to the viewer's selected direction of view. If a branch point is indicated by a visual indicator, a user can select motion in a desired direction by clicking on a "hot spot". In order to conserve storage space, the image representing each panorama can be stored in a compressed format. Only the portion of the panorama necessary to create a "view window" that is, the portion of the image displayed in response to the user's direction of view, is decompressed at view time. An index methodology is used to store the panoramic images. Use of the indexing methodology allows the images to be retrieved in both the forward and backward direction to simulate movement in either direction. Sound is provided in a special format, so that special effects can be provided based on the user's point of view and dependent upon the direction of motion selected by the user.

A system is described for displaying images of a virtual three-dimensional book having one or more virtual pages. The system comprises a display system capable of executing a display program wherein images of the virtual three-dimensional book are produced on the display system. The display system may include a folding function, whereby a segment of a virtual page is displayed as at least partially folding backward form a surface of the display system. Additionally, based on one or more search terms, the display system may include an indexing function for creating a customized index and / or a table of contents function for creating a customized table of contents. Moreover, a dynamic bookmark function may be provided for displaying one or more dynamic bookmarks to a virtual three-dimensional book. Also disclosed is a computer program product comprising a computer usable medium having computer readable code embodied therein for producing images of a virtual three-dimensional book.

In an indexation method, an average color or a statistical distribution of colors in an image is determined by providing a set of coordinates in a multidimensional color space (80). The set of coordinates of each color is reduced to a level of Hue if the color verifies a first condition, i.e. the color is considered a true color (81), and to a level of Brightness if the color verifies a second condition, i.e. the color is considered a gray color (82). Indexation data for indexing the image includes the level of Hue or Brightness resulting from each color. The indexation method is used in a search method for searching a collection of graphic elements. An input specifies a desired color. A corresponding search query pertains to a level of Hue or a level of Brightness if the desired color includes a true color, or a gray color respectively.

The invention discloses a high-availability distribution type full-text index method. The method comprises the following steps of: firstly, starting a basic service system, and then starting an index cluster service and an inquiry cluster service on each node; establishing, updating and deleting an index on full-text data; and finally, inquiring the index. According to the high-availability distribution type full-text index method, an inquiring and indexing process can be separated and the increment or batch type establishment of existing indexes can be simultaneously supported; the batch type indexes can be used for establishing an index for large-scale data in short time; and the increment type indexes avoid reestablishing the index. Index files can be divided into three layers of structures comprising an index file, an index fragment and an index sub-fragment, thus enhancing the expandability and the availability of the index file. According to the high-availability distribution type full-text index method, a dynamic index task configuration task is provided; and parameters in the index task are arranged to dynamically meet requirements of establishing the index by a user through different types of data.

The invention relates to a method for rapidly detecting the content of index components of Chinese medicinal materials by using near-infrared spectroscopy technology, which can realize the rapid detection of the comprehensive quality of Chinese medicinal materials. Collect the sample, collect the near-infrared diffuse reflectance spectrum of the sample, and preprocess the obtained spectrum, then use the detection method corresponding to the sample in the conventional method to measure the content of its index components, and combine the spectrum with the content of the index components, The quantitative analysis model is established by adopting the chemometrics method suitable for the analysis of the components of traditional Chinese medicine, the sample to be tested is crushed, and its near-infrared spectrum is scanned, and the spectrum is input into the quantitative analysis model to measure the content of the index components in the Chinese medicinal material. The whole process takes a short time, is fast and accurate, can be measured online, improves production efficiency, greatly saves manpower and material resources, and can generate huge economic and social benefits.

The embodiment of the invention provides a block chain data indexing method and device. The method comprises the following steps: receiving transaction information and an index identifier associated with the transaction information; determining whether an index list associated with the index identifier exists in an index list set of a block chain; and in response to the result that the index list associated with the index identifier exists in the index list set of the block chain, adding a new item associated with the transaction information to the index list. By means of this manner, the inquiry efficiency of the block chain can be greatly improved, and meanwhile the effective support of complex inquiry (for example, range inquiry or condition inquiry) can be provided at the same time.

The invention discloses a data buffering method and a system to solve the problems of the mutual collision of the memory consumption and the visiting speed of the existing report forms buffering method. The method comprises that: the invention divides the storing space into an index district and a data district; the data is partitioned; each block of data is sequentially written into the data district of the storing space and the initial position of each block is sequentially written into the index district according to the partitioning result; and the data is read according to the partitioning result and the initial position of each block. The buffering technique reduces the occupation of the memory, because of reading the data from the fixed disk every time, can greatly save the use of the memory space and elevate concurrent processing ability of the system under the status of multiple concurrent and big data quantity; besides, the invention greatly improves the efficiency of the document reading by the index method to read the report forms from fixed disk. Therefore, the method of the invention gets a balance between the memory space and the visiting speed.

Methods and systems for automatically generating a severity index for images of anatomical features of a patient are provided. In an exemplary embodiment, an image of an anatomical feature of a patient is compared with a normal, standardized image of the same anatomical feature. Based on this comparison, a deviation image for the anatomical feature is generated that represents the degree and manner the acquired image deviates from normal for that anatomical feature. The deviation image is automatically pattern matched against multiple images of known disease severity for the anatomical feature. Based on the automated pattern match, a known disease severity, such as in the form of a severity index, is provided as corresponding anatomical feature for the patient.

The present invention provides a ViST (or “virtual suffix tree”), which is a novel index structure for searching XML documents. By representing both XML documents and XML queries in structure-encoded sequences, it is shown that querying XML data is equivalent to finding (non-contiguous) subsequence matches. A variety of XML queries, including those with branches, or wild-cards (‘*’ and ‘ / / ’), can be expressed by structure-encoded sequences. Unlike index methods that disassemble a query into multiple sub-queries, and then join the results of these sub-queries to provide the final answers, ViST uses tree structures as the basic unit of query to avoid expensive join operations. Furthermore, ViST provides a unified index on both content and structure of the XML documents, hence it has a performance advantage over methods indexing either just content or structure. ViST supports dynamic index update, and it relies solely on B+Trees without using any specialized data structures that are not well supported by common database management systems (hereinafter referred to as “DBMSs”).

The invention discloses a historical data storage and indexing method and belongs to the field of real-time historical databases. According to the characteristics of industrial historical data storage formats, a simple and efficient historical data storage method and an efficient indexing mechanism are given. According to the historical data storage method, on the one hand, the I / O of a magnetic disk is reduced as much as possible by performing compression and cache on historical data and optimizing the data archiving sorting process; on the other hand, the I / O load of the magnetic disk in the data archiving sorting process is distributed to all time points in a balanced mode, and thus it is guaranteed that the requirement for storage of current historical data is met, and meanwhile the storage method has the dynamic extension characteristic. Through the indexing mechanism, the historical data can be fast accessed, and when a database is dynamically extended, the system can be not influenced by data access by dynamically modifying indexing files.

The invention relates to extraction method and index establishment method of movie video scene clips. The extraction method comprises the following steps: (1) obtaining the subtitle information of a movie video, including the text content of the subtitle and the appearing and disappearing time of the subtitle; (2) extracting the structural information of each scene from the script text of the movie video, including dialogues; (3) matching the dialogue information with the text content of the subtitle and obtaining the beginning and ending time of scenes in the video according to the appearingand disappearing time of the matched subtitle; (4) segmenting the movie video according to the final beginning and ending time of scenes in the video, which is obtained in step (3), to obtain the video segments of all scenes. In the index establishment method, the structural information obtained from the step (2) is used for establishing the index of the extracted video segments on the basis of the steps from (1) to (4). The invention has the advantages of low time consumption, high precision, and the like.

The invention discloses an image retrieval method based on color and shape features. The method comprises that: a sample image is converted and quantized on color and space, the quantized image is divided into blocks, the color complexity of each pixel point of each subblock image is calculated and vision weight is obtained, the percentage of the vision weight of different colors in the vision weight of the subblock image is calculated for each subblock image and a weighting color histogram is obtained. The color feature of each subblock is obtained according to the weighting color histogram. Contour extraction is carried out on the sample image through grey processing. Curvature scale space is adopted to describe the image shape feature of operator extraction after the contour extraction. The extracted color feature and shape feature are normalized and the normalized image feature is obtained. The normalized image feature is matched in an image feature database through an index according to a similarity measurement formula and an index result is obtained. The index method of the invention is more accurate.

The invention aims at the problem that a traditional data structure cannot support the network multidimensional space data expression and provides a MDDRQ-Tree index structure for the network multidimensional space data expression. The MDDRQ-Tree index structure is characterized in that: (1) a primary tree is transformed from an area quadtree index structure divided through a rule of a pyramid hierarchy structure, (2) an overlapping sub-tree structure for supporting the multidimensional data is provided, (3) the change of spatial resolution is reflected by the depth of the tree, and (4) all the nodes of the tree are space object carriers. The invention organically integrates the multidimensional space data such as frequently-used vector data, gridded data, process data, three-dimensional landscape map data, and the like. In the manner of data organization, scheduling and searching fit for the network conditions, the invention can efficiently and rapidly support the web publishing of the multidimensional data for mass data. Compared with the traditional method, the index method of the invention can efficiently express and search the scale of the mass multidimensional data. The more the data volume is, the more obvious the promoted efficiency is.

The invention relates to a remote sensing assessment method and system for ecosystem vulnerability. The method comprises the steps of performing ecosystem vulnerability zoning in a target area range, determining ecosystem vulnerability assessment indexes of different zones according to the zoning result, establishing a corresponding ecosystem vulnerability assessment system in each zone, determining the weights of the ecosystem vulnerability assessment indexes in the different zones by using a hierarchical analysis method, and establishing an ecosystem vulnerability remote sensing assessment model based on a comprehensive index method to assess the ecosystem vulnerability. According to the method, a reasonable ecological environment zoning scheme is formed in the target area range, and a scientific and normative ecosystem vulnerability assessment system, a weight assignment scheme and an assessment model are respectively constructed according to the ecological environment characteristics of the zones to realize intelligent remote sensing assessment of the ecosystem vulnerability, so that the assessment result is accurate and reliable and repeated operation can be implemented.

The invention discloses a method for storing and indexing mass historical data, which belongs to the field of a real-time historical database. By the method according to the characteristic that the partitioning storage of big files is carried out by a distributed type file system, a simple high-efficiency method for storing mass historical data files and a high-efficiency distributed type indexing mechanism are provided. According to the storing method, the condition of meeting the requirement of storage of the current mass historical data files can be ensured, and the characteristic of on-line expansion is further ensured; the quick access of the mass historical data can be realized by the indexing mechanism; and meanwhile, after the resource expansion of the system is carried out, i.e. when the change of the physical storage of a bottom layer occurs, the searching function of the data still can be realized by an index under the condition of no need for modification.

The invention discloses a three-dimensional space index method aiming at massive laser radar point cloud models. Aiming at characteristics of massive data and high spatial resolution of point cloud models, the method indexes data to a single three-dimensional space point by adopting a multi-level hybrid index strategy; aiming at an integrity characteristic of point cloud models, the method continuously subdivides massive cloud points from a minimum bounding rectangle (MBB) of an overall point cloud model by adopting a cotree index, and three-dimensional points in cotree index nodes are distributed uniformly in space; and aiming at a scattered characteristic and the data post-processing requirement of large-scale point cloud models, the method indexes a single three-dimensional space point by adopting a three-dimensional K-D tree, and the quick inquiry and processing of a single point coordinate and the attribute data of the single point coordinate can be achieved. On the basis of above integrated space index construction, the method adopts a three-dimensional R tree to manage the MBBs of a plurality of point cloud models in three-dimensional scenes, and a multi-level hybrid space index mode is formed finally.

A computer program product embodied on a non-transitory computer readable storage medium, comprising non-transitory computer executable program code configured to perform the steps of: receiving a representation of an unlabeled event; labeling the unlabeled event according to a unitary relative event ontology; and storing the labeled event in the computer readable storage medium. The unitary relative event ontology can comprise an information description vector comprising a plurality of ontological primitives, and the plurality of ontological primitives can comprise a point description element, a reference-body description element, an observer description element, a position description element, a scene description element, and a specification description element.

This invention belongs to VLSI physical design technique field and relates to one computer aid design method facing analogue circuit board graph, which is characterized by the following: totally according to analogue integration circuit multi-line wide binding for design to satisfy analogue circuit load current status complexity requirement. This invention comprises shortest path index method with multiple line width binding conditions and adopts starting index method to realize automatic line distribution process on network mode.

The invention relates to an LSH (Locality Sensitive Hashing)-based clustering and indexing method and an LSH-based clustering and indexing system. The LSH-based clustering and indexing method comprises the steps of step 1, carrying out clustering analysis on a data set, dividing the data set into a plurality of categories, and determining and ensuring a clustering center of each category; step 2, establishing a hashing table in each category by adopting an LSH method; step 3, calculating Euclidean distance between each clustering center and a query point, and selecting multiple categories in minimum Euclidean distances as candidate categories; step 4, calculating a hashing value of the query point in each candidate category, and selecting data points of which the hashing values are the same as that of the query point in the candidate categories as candidate points according to the hashing table established in step 2; step 5, calculating the Euclidean distances between the candidate points and the query point, and taking the candidate point in minimum Euclidean distance as a nearest adjacent point to the query point. According to the LSH-based clustering and indexing method and the LSH-based clustering and indexing system, disclosed by the invention, great increasing of query efficiency and relative stability of query performance can be obtained under the situation of less sacrificing the accuracy rate.

A multistage organizing and indexing method oriented to massive remote sensing images comprises the following steps that A, wide image grid data is acquired and preprocessed; B, a cache pyramid of disk space is built, a two-stage indexing structure of a quadtree is divided through a scene pyramid and sub-scene rule, and ID and an attribute database are connected; C, a data recognizing mode is combined, attribute data bearing is achieved, partitioning recognizing is carried out, and multistage storage and index building are completed in a HBase database; D, a storage pool integrating virtualization, expansibility and sharing capacity is used for distributing resources according to needs at any time and in any place.