230 results about "Spatial partition" patented technology

A method, system, and computer-readable storage medium are disclosed for building ray tracing data structures for three-dimensional scenes. The methods may include accessing an initial data structure representing a coarse hierarchy of a scene geometry, e.g., a scene graph, and sorting elements of the initial data structure into multiple spatial partitions with respect to one or more splitting planes. The sorting may be dependent on spatial bounding ranges of non-leaf nodes of the initial data structure, which may be sorted without visiting the geometric primitives below. Sorting may be performed on pointers to elements of the initial data structure and may comprise a hierarchical quicksort. The resulting ray tracing data structure may comprise a k-dimensional tree, binary space partitioning tree, k-plane tree, bounding interval hierarchy, or fine-grained hierarchical bounding volume tree. The methods described herein may accelerate the building of ray tracing data structures for use in interactive graphics applications.

The present invention provides methods, systems and computer program code (software) products for terminating spatial partition hierarchies and other hierarchies by a priori bounding, thereby to provide, among other aspects, more efficient ray tracing in computer graphics systems.

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.

A method for designing the spatial partition of a filter module used in an aperture-multiplexed imaging system. The filter module is spatially partitioned into filter cells, and the spatial partition is designed by considering data captured at the sensor in light of an application-specific performance metric.

Disclosed herein is data replication and recovery method in an asymmetric clustered distributed file system, which divides the storage space of a data server into main partitions and sub-partitions, and separately manages main chunks and sub-chunks in the main partitions and the sub-partitions, thus efficiently processing chunk replication and recovery. In the disclosed method, when a failure occurs in a data server in an asymmetric clustered distributed file system, a failed partition is reported to all data servers including other partitions of a volume to which the partitions of the failed data server belong. Accordingly, other data servers can simultaneously perform the recovery of chunks using the information of their own main chunks and sub-chunks. As a result, when a failure occurs in a data server, all related data servers can simultaneously participate in data recovery, thus more promptly and efficiently coping with the failure.

The invention discloses a BootLoader architectural design method, which comprises the following steps of: dividing a Flash address space into five areas which are respectively a code area, a configuration area, a parameter area, an image area and a data area; starting the initiation in the code area being responsible for the hardware platform; storing the relevant configuration files of a processor and the configuration files of the peripheral hardware in the configuration area, which are called by the starting code; storing the parameters for transferring between the starting code and the operating system in the parameter area; storing the copy of an internal kernel image in the image area, which can be debugged, maintained and updated at any time; and storing application software and user data in the data area. The BootLoader architectural design method provided by the invention has clear structure, more powerful function, convenient maintenance and modification, strong expandability, and obvious advantage on the aspect of software update and functional expansion.

A method for influencing noise in a space, such as an open-space office, whereby active sound suppression and / or sound masking is / are undertaken. In order to advantageously undertake active sound suppression or sound masking in a larger space, for example an open-space office, a plurality of sound actuators are provided distributed over the surface area of the space, and at least one sound sensor is disposed in the space, and two or more of the sound actuators are acted on differently, with regard to sound values detected by the sound sensor and / or with regard to a desired sound-related space division and / or as the result of person signals or object signals that are detected.

A computer implemented method, apparatus, and computer usable program code for managing a table space for a database. The table space is searched to find available free space in a set of partitions in the table space in response to receiving a request to insert a record into a database table in the database. A new partition is created for the table space based on a size for the new partition in response to determining free space is unavailable for the record in the set of partitions. The record is inserted into the new partition.

The present invention relates to a method for connecting a base station and a repeater for a spatial division multiple access, and a repeating method thereof. In order to provide efficient spatial division by using a repeater, data streams are repeated by using a repeating system including at least one repeater for performing wireless communication with a terminal located in a repeating region controlled by using at least one repeating antenna and a base station including a plurality of base station antennas corresponding to the repeating antenna. In this instance, the terminal detects location information on the repeating region to which the terminal belongs by using the pilot signal transmitted by the base station or repeated by the repeater. Location information detected by the terminal is fed back to the base station so that the base station may use it for the spatial division multiple access for simultaneous transmission to many terminals. Therefore, the spatial division multiple access for increasing sector capacity by efficiently combining the base station including multiple antennas and the repeater is available.

This invention generally relates to methods, systems, data structures and computer program code for managing spatial data, in particular very large volumes of data such as map data for a region or country. Thus we describe a method of partitioning a database of spatial data, the database including a plurality of spatial feature objections, the method comprising: reading data from said database grid cell-by-grid cell, a said grid cell comprising a cell of a grid spatially subdividing a region of spatial coverage of said database, each said grid cell including spatial feature objects; and determining a set of spatial partitions for said database, each grid cell being allocated to a said partition, responsive to a number of said spatial feature objects in each said grid cell.

A method for designing a color filter module used in a plenoptic XYZ imaging system. In one approach, the color filter module is spatially partitioned into filter cells, and the spatial partition is designed by considering data captured at the sensor in light of variations in ΔE.

The present invention provides methods, systems and computer program code (software) products for terminating spatial partition hierarchies and other hierarchies by a priori bounding.

The invention discloses a lightweight visualization method of building information model based on Web3D. By parsing the EXPRESS language description file which defines the IFC standard, the method ofextracting all kinds of information from the IFC file is established, and the information for 3D visualization is extracted at the same time. Through the transformation of geometric expression and thecalculation of rotational position matrix, the original 3D visualization information is transformed into the rendering data which can be rendered by a WebGL graphics engine. Then, combined with the building shape characteristics, the original multi-branch tree algorithm is improved to create a hybrid index based on building indoor and outdoor space partition and multi-branch tree forest. Finally,based on the hybrid spatial index, using the technology of view elimination, occlusion elimination, multi-threading and cache management, in the WebGL-based three-dimensional interactive graphics application, the rapid scheduling of three-dimensional model data between the browser and the server is realized. This method has the advantages of good lightweight performance, cross-platform and high computational efficiency.

A copying garbage collector evacuates to a to space the objects in a from space that are referred to by references, including references in previously evacuated objects, that are located outside the from space. It divides the to space into local-allocation buffers (“LABs”), and it adopts one of these as a destination LAB, i.e., as the LAB into which it places the objects that it evacuates. When a destination LAB becomes full, the thread adopts a new LAB as its destination LAB. When a destination LAB's contents fill it to some predetermined fill threshold, that destination LAB becomes the source LAB, i.e., the LAB that the collector scans for references to the collection-set objects. If a previous source LAB's contents has not yet been completely scanned when the collector thus adopts a new source LAB, the previous source LAB is placed on a LAB stack. When no more references to unevacuated collection-set objects remain in its current source LAB, the collector then pops a LAB from its LAB stack on a last-in, first-out basis and adopts that LAB as the source LAB.

A copying-type garbage collector operates in multiple concurrent threads. Each thread evacuates potentially reachable objects from the from space to the to space in a depth-first manner: if a thread has evacuated an object containing references to any from-space objects, it evacuates all of that object's descendants before it evacuates any other reachable objects. To keep track of descendants that must be evacuated before non-descendants can be, the thread places objects containing references to non-evacuated objects into a linked list maintained by pointers that it installs in the from-space locations from which the objects on the list were evacuated. Additionally, it divides the to space into local-allocation buffers (“LABs”) to which respective threads exclusively evacuate objects, and each thread maintains a LAB stack representing all the LABs it has filled that still contain references to unevacuated from-space objects. When a thread has completed evacuating the descendants of evacuees in all of its LABs, it “steals” work from other threads. It may do so, for instance, by processing a reference in an object belonging to another thread's list, by transferring to its own list one or more objects from another thread's list, or by transferring to its own LAB stack one or more LABs from another thread's LAB stack.

The invention discloses a disk array system, which comprises n disks, wherein n is more than 4, and errors in less than or equal to t / 2 disks are allowed. The memory space of each disk is divided into sectors of 512 bytes or 4k bytes, the sectors with same numbers on each disk are organized into a stripe, the disk array system performs data reading and writing in stripes, the memory space of each sector is uniformly divided into n chunks, preliminary n-t chunks storing effective information are used as information blocks, and last t chunks storing parity information are used as parity blocks. Compared with the prior art, the invention provides the disk array system with non-stop service, high reliability and high fault tolerance, the fault tolerance reaches above 10, non-stop service can be supplied in case of less disk errors, and all data can be recovered in case of a great number of errors.

The invention relates to an automatic storing and fetching system of goods, comprising a storing and fetching device, a goods shelf, area code units and a warehousing conveyor and a delivering conveyor. The storing and fetching device comprises a vertical rod which can slide on a guide way, a lift table which can move up and down along the vertical rod, a manipulator positioned on the lift table and a scanner positioned on the manipulator; the goods shelf is positioned at one side or two sides of the guide way and comprises a beam and a vertical rod plate, and the storing space of the goods shelf is divided into a plurality of goods storing units; the area code units are arranged on the beam of the goods shelf or near the periphery of the goods storing units, the amount of the area code units corresponds to the amount of the goods storing units, and the area code units are used for scanning of the scanner; and the warehousing conveyor and the delivering conveyor are respectively positioned at one side or two sides of a ground way. The system can realize complete automation and unmanned operation of storing and fetching small size goods such as single books or compact discs and thelike, or similar goods, thereby being applicable to unmanned 24-hour libraries and the like.

The present invention relates to a method for multi-core processor based packet classification on multiple fields. The first step involved in this invention involves constructing a data structure of classification, which includes selecting a certain dimension such that the sum of the rules that fall into two rule sub-sets of two subspaces is as small as possible after spatial partition through a certain partition point in which the method to determine the partition point on the selected dimension is to select the partition point on the dimension such that the number of rules that fall into the two sub-spaces after partition by the point is equal to each other as much as possible. The invention specifically proposes three methods to select partition points, two associated methods to select dimensions, then receiving packet information after the data structure of classification is constructed, and searching the data structure of classification according to packet information to get matched results. The present invention can be implemented on many types of multi-core processor based platforms which ensure favorable performance and adaptive capabilities for different network applications, and significantly reduce the product cost of high-end routers and firewalls.

The invention discloses a bad block management method and a device for a Nand Flash, in which the memory space of the Nand Flash is divided into data areas and reserve areas. The bad block management method comprises the following steps: generated bad block information is obtained when data scrubbing or writing is operated in the data areas of the Nand Flash; available substitute blocks which correspond to the bad blocks are chosen in the reserve areas of the Nand Flash; data scrubbing or writing is carried out on the substitute blocks. The invention also discloses a bad block management device for Nand Flash, the substitute blocks are used for realizing scrubbing, writing and other operations of the bad blocks, the mapping relationship between the bad blocks and the substitute blocks is only needed to be established, and the substitute blocks can be found quickly on the premise of establishing; the substitute operation has no effect on other normal blocks. In addition, the invention can be applied into the firware upgrading of terminals, thus avoiding effects on firware upgrading caused by bad blocks and improving the efficiency of firware upgrading.

The present invention provides a wireless communication computer field, in particular relating to a spatial-temporal data fast index method, it is a high effect indexing mechanism, storing different time stamp space-time state using overlapping indexed structure, if the adjacent time slices have identical R-tree index branch, only one version is kept, this reduces the storage space. At the same time, data on one time slice adopts blocking index mechanism based on the four-fork tree no longer finding whole index space, the whole space is divided into n=sumd-1i=0(2k)i sub-index spaces (d is depth of the four-fork tree, k is dimensionality of the index space), only need find one subspace therein, greatly reduces the index time. Utilizing the index method is used for high efficient location of multiple wireless move node and data monitor management.

There are provided a mass storage system and a method of operating thereof. The method comprises: a) dividing the storage space into a first portion configured to be available to a client and a second portion configured to be unavailable to a client, thus giving rise, respectively to an available storage space and a spare storage space; b) distributing the available space and the spare space over the disk drives thus giving rise to available space and spare space allocated to each given disk drive; c) detecting underperformance of at least one disk drive among the plurality of disk drives; d) responsive to detecting underperformance, decreasing respective available space allocated to said at least one underperforming disk drive and respectively increasing spare space allocated to said at least one underperforming disk drive thus giving rise to a re-configured allocation of the available space; and e) transferring the stored data in accordance with said re-configured allocation of the available space.

The invention provides a subspace clustering method based on high-dimensional overlapping data analysis and relates to the technical field of machine learning. The method builds a weighted mixed normsubspace representation model for a data matrix that needs clustering; obtaining an optimized coefficient matrix in the weighted mixed norm subspace representation model by using a linear alternatingdirection method; establishing a similarity matrix based on the optimized coefficient matrix; dividing the similarity matrix into subspaces by using a spectral clustering algorithm to obtain an initial clustering results; establishing an overlapping probability model of the subspaces; applying the overlapping probability model to an initial subspace division result to determine the overlapping ofthe subspaces; verifying a subspace clustering result to obtain a final clustering result. The subspace clustering method based on high-dimensional overlapping data analysis can improve the density ofthe same subspace data and the sparsity of different subspace data, and improve the accuracy of clustering.

Provided is a system and method to perform dynamic state-space partitioning in external memory graph searching. The dynamic partitioning of the state-space search graph leading to substantial improvement of search performance.

The invention relates to a multi-level mixed three-dimensional space index method which comprises the following steps: 1, building a united three-dimensional space index framework; 2, dividing a large-scale city space into a plurality of small regions, and building a first level grid index; 3, in the first level grid index region, building a second level multi-type mixing index for three-dimensional space data with different types; and 4, based on the multi-level mixed three-dimensional space index, carrying out multi-level query search on a three-dimensional space database. The three-dimensional space index method improves the searching efficiency of the large-scale three-dimensional space database through multi-level filter and search.

The invention discloses a method for automatically positioning the characteristic points of a three-dimensional face, which comprises the following steps of: (1) positioning the pose of a three-dimensional face model; (2) dividing the subspace of a top point; (3) counting a histogram of the subspace; (4) acquiring the characteristic descriptor of the top point; (5) constructing a characteristic point template of the three-dimensional face; and (6) positioning the characteristic points of the three-dimensional face. The invention has the advantages of breaking through the limitation that only a few characteristics of the three-dimensional face can be automatically positioned through the description of partial curved surface and increasing the accuracy and the generality of the method for positioning the characteristic points of the three-dimensional face.

The two-dimensional image area positioning method based on the grating projection can determine the source and characteristic of image noise for noise inhibition. The method includes the following steps: taking the datum picture with CCD camera before projecting one coarse set or fine set of grating to the object before taking one image and obtaining coarse positioning image through threshold parting, image filtering, etc; filtering the image with fine grating image to obtain the fine grating grey image; non-interlaced traversing the pixels in the coarse positioning image and processing in compensation algorithm to divide the measured object space into narrow zonal areas and obtain the corresponding coarse positioning result image; and superposing the above boundary information onto all the fine grating grey images to be analyzed, non-interlaced traversing, performing quadratic curve fitting and final superposing the extreme points of all the fine grating grey images as the ultimate object space dividing result.

The invention provides a composite silicon-carbon electrode material with a shelly structure. The composite silicon-carbon electrode material is composed of reduced graphene oxide, silicon nanoparticles and carbon nanotubes, wherein the silicon nanoparticles are dispersed among multiple layers of the reduced graphene oxide; gaps are left between the silicon nanoparticles and the reduced graphene oxide; and the carbon nanotubes prop open the reduced graphene oxide and allow the reduced graphene oxide to include the silicon nanoparticles like shells. The invention also provides preparation and application of the composite silicon-carbon electrode material with the shelly structure. According to the invention, the shelly structure is formed among the layers of the reduced graphene oxide, thecarbon nanotubes provides support among the layers of the reduced graphene oxide and spatial partition for the silicon nanoparticles, so reserved space is left for the volume expansion of silicon during charging and discharging of a battery, and the structural integrity of an active material of a negative electrode can be better maintained; and thus, the battery is allowed to have high capacity which is hard to attenuate, good cyclicity and long service life.

The invention relates to a point cloud reduction method for reserving boundary points, belonging to the technical field of computer three-dimensional modeling. The concrete steps of the point cloud reduction method provided by the invention are as follows: 1, reading the original point cloud data; 2, Spatial partition of point cloud data and calculation of the nearest K-neighborhood of each data;3, estimating the unit normal vector of each data point; 4, acquiring boundary data points of point cloud data and reserving them; 5, juding the important characteristics of the point cloud data of non-boundary points; 6, reducing the non-boundary data points. Compared with other methods, this method not only simplifies the point cloud data effectively, but also preserves the boundary feature points of the point cloud model. The time consuming of curvature estimation is avoided and generation of a large area of holes in the flat area of point cloud is prevented. The invention is suitable for both closed point cloud model and single piece point cloud model.

The invention discloses a method of constructing a recycled concrete three-dimensional random spherical aggregate model based on Python, comprising: defining an array to store diameter, coordinate andvolume parameters; inputting basic parameters, including aggregate content, model dimensions, and aggregate microscopic size; building inside, a particle size distribution function and a random function; randomly generating a floating point number from particle sizes d1 to d2 to obtain a random number within a required range; grading the particle sizes; dividing a deployment space into uniform small cells, deploying from the large aggregate particle size to the small aggregate particle size, randomly generating deployment positions, and performing circulating deployment to obtain a satisfactory aggregate model; subjecting spherical aggregates to plane translation to obtain an outer interface region, old hardened mortar and an inner interface region. The model is a damage plasticity modelin ABAQUS software; the parameter values are stored in the array mat; the model is saved; the method that has higher speed and efficiency is provided for researches on numerical simulation of recycledconcrete.