67 results about "Spatial data structure" patented technology

An object-oriented system for building and maintaining a spatial data structure for use in topological applications. The data is organized in a database which incorporates spatial feature location, attributes, and metadata information in a relational framework across a hierarchy. The system provides for the instantiation of the objects and levels that make up the database and for spatially indexing the data among the objects across hierarchical levels. The data can be updated while preserving the spatial linking among objects and levels, and the data can be exported to a relational vector product format database.

Methods for establishing a location-based leaderboard by a computer game system are disclosed. The world may be partitioned into a set of regions and sub-regions by the computer game system using a hierarchical spatial data structure, wherein the regions and sub-regions are arranged according to a hierarchy, each sub-region being encompassed by a higher-level sub-region or region, and two or more highest-level sub-regions being encompassed by a region. A location of a user of the computer game system along with one or more statistics associated with the user may be assigned to a smallest sub-region created by the hierarchical spatial data structure. A rank of the user may then be determined within a region or sub-region encompassing the smallest sub-region to which the user's location was assigned, wherein the rank is determined using the one or more statistics associated with the user. One or more users may then be notified of the rank.

Methods for establishing a location-based leaderboard by a computer game system are disclosed. The world may be partitioned into a set of regions and sub-regions by the computer game system using a hierarchical spatial data structure, wherein the regions and sub-regions are arranged according to a hierarchy, each sub-region being encompassed by a higher-level sub-region or region, and two or more highest-level sub-regions being encompassed by a region. A location of a user of the computer game system along with one or more statistics associated with the user may be assigned to a smallest sub-region created by the hierarchical spatial data structure. A rank of the user may then be determined within a region or sub-region encompassing the smallest sub-region to which the user's location was assigned, wherein the rank is determined using the one or more statistics associated with the user. One or more users may then be notified of the rank.

An object-oriented system for building and maintaining a spatial data structure for use in topological applications. The data is organized in a database which incorporates spatial feature location, attributes, and metadata information in a relational framework across a hierarchy. The system provides for the instantiation of the objects and levels that make up the database and for spatially indexing the data among the objects across hierarchical levels. The data can be updated while preserving the spatial linking among objects and levels, and the data can be exported to a relational vector product format database.

A system and methods for maintaining or optimising a mobile phone network by spatially correlating geolocated radio access network (RAN) performance measurement data and geolocated subscriber account data, which in embodiments provides additional technical information on the RAN performance. These data are integrated in a spatial data structure and provided with a spatial querying and data correlation system for identifying, and addressing problem areas of the RAN.

A computer performed method models a spatial index having n spatial regions defined in a multidimensional space using a tree-based model representing an infinite number of arrangements of n spatial regions in the multidimensional space allowable by the spatial index using a finite number of tree representations, computes an average retrieval complexity measure for content retrieval using the spatial index based on the tree based model, and provides a spatial index recommendation based on the average retrieval complexity measure. In some embodiments a spatial index selection module selects the spatial index based on average retrieval complexity measures for candidate spatial indices that are functionally dependent upon a number of spatial regions to be defined by the spatial index.

The invention belongs to the field of virtual geographical environment research of a geographic information system, particularly relates to an outburst flood routing simulation and analysis technique, and relates to a cellular automata based rapid outburst flood routing simulation and analysis method. By the method, the problem that an error between a final numerical analysis result and actual water regimen is large due to randomness of cellular scale partitioning at present can be solved; meanwhile, accurate and rapid comprehensive simulation and analysis can be performed on dam-break flood routing and influences by means of reasonable setting of a cellular neighborhood range and combination of spatial analysis capacity of a GIS (geographic information system) and spatial-temporal modeling capacity of cellular automata simulation. The method includes construction of a two-dimensional cellular automata simulation model, optimization of a cellular spatial data structure and virtual geographical environment based visual simulation and analysis.

One embodiment of the present invention provides a recommendation system. During operation, the system receives context information associated with the user, updates a plurality of user models based on the received context information, and identifies at least one spatial data structure that stores a plurality of items. A respective item is stored within the spatial data structure based on a vector value associated with the item. The system then queries the spatial data structure to obtain a first set of recommendable items that have vector values within a predetermined range, calculates a score for each item within the set of recommendable items based on the plurality of the user models and a characterization vector associated with each item, ranks the items within the set of recommendable items based on calculated scores, and recommends one or more top-ranked items to the user.

Remote desktop servers include a display encoder that maintains a secondary framebuffer that contains display data to be encoded and transmitted to a remote client display. The display encoder submits requests to update the display data in the secondary framebuffer to a video adapter driver that has access to a primary framebuffer whose display data is updated according to drawing commands received from applications running on the remote desktop servers. The video adapter driver utilizes a spatial data structure to track changes made to the display data located in regions of the primary framebuffer and copies the display data in those regions of the primary framebuffer to corresponding regions in the secondary framebuffer.

The invention discloses a three-dimensional geological tunnel modeling method based on a spatial data structure system. The method mainly comprises the following steps of: measuring the three-dimensional coordinate value of points on a top central line of the mine tunnel and the section shape parameter of the mine tunnel; reading the acquired three-dimensional coordinate values (namely vertex three-dimensional coordinate values) of points on the top central line of the tunnel from a database, to obtain the relation between the nodes and segmental arcs of the crossed tunnels according to the vertex three-dimensional coordinate values of multiple tunnels; calculating the feature point coordinate value of a three-dimensional surface model of a tunnel body according to the tunnel section shape parameter and the relation between the nodes and the segmental arcs and by using the top-bottom central line of the tunnel as a benchmark; and constructing the surface triangulation networks of the tunnel body according to the feature point coordinate value of the three-dimensional surface model of the tunnel body so as to establish the three-dimensional surface model of the whole tunnel body. By providing the 'section-node-segmental arc' spatial data structure, the effects that the curve of the tunnel is smooth and the crossed tunnels are through are achieved.

The invention provides a method for manufacturing a building digital line map based on vehicle-mounted laser radar point cloud. The method comprises steps of 1: initializing original vehicle-mounted laser radar point cloud data and arranging all laser foot points as to-be-distinguished points; 2: identifying building vertical faces; 3: extracting building vertical face profiles; 4: correcting the building vertical face profiles where vertical or parallel relations exist; and 5: outputting a building digital line map. According to the invention, scattered point cloud data is organized into a space data structure via a point cloud segmentation method, wherein the space data structure is easy to understand by human beings, obeys natural laws and is provided with the topology relation. A building vertical face detection and extraction method based on prior knowledge is suitable for vehicle-amounted laser radar data with disordered point cloud data and complex distribution of region scene targets. By use of normal vector quantity of fitting panels of the building vertical faces, vertical and parallel topology relations of the building vertical faces are corrected, so precision of topology relations among the building vertical faces is effectively improved.

Reference feature vectors are constructed representing reference genetic data sets of a reference population. The reference feature vectors are transformed using a linear transformation to generate reduced dimensionality vector representations of the reference genetic data sets of the reference population. A tree-based spatial data structure is constructed to index the reference genetic data sets as data points defined by at least some dimensions of the reduced dimensionality vector representations of the reference genetic data sets of the reference population. The linear transform may be generated by performing feature reduction on the reference feature vectors. A feature vector representing a proband genetic data set is transformed using the linear transformation to generate a reduced-dimensionality vector representation that is located in the tree-based spatial data structure to perform population assignment for the proband genetic data set.

A method for releasing storage space in asynchronously mirrored space-efficient secondary volumes is disclosed. In one embodiment, such a method includes reading a first copy of a free-space data structure stored on a space-efficient secondary volume. The free-space data structure tracks the usage status of storage elements in the space-efficient secondary volume. The method analyzes the first copy to determine which storage elements in the space-efficient secondary volume are not being used. Upon completion of a consistency group on the space-efficient secondary volume, the method reads a second copy of the free-space data structure and compares the first copy to the second copy to determine which storage elements had their usage status change during analysis of the first copy. The method releases storage elements in the space-efficient secondary volume that are not being used. A corresponding system and computer program product are also disclosed.

The invention relates to an electrocardiogram classification method based on convolutional neural network and long-term and short-term memory network. An arrhythmia automatic classification method isrealized by multi-lead electrocardiogram data and a convolutional neural network and long-term and short-term memory network (CNN-LSTM) combined model. On one hand, compared with single-lead electrocardiogram, the multi-lead electrocardiogram contains more information, and on the other hand, the CNN-LSTM combined model combines the advantages of CNN and the advantages of LSTM. The electrocardiogram classification method has unique advantages in the respect of studying the spatial data structure and the time sequential structure. The multi-lead electrocardiogram data is used for training the CNN-LSTM, so that the learning efficiency of the network and the electrocardiogram recognizing precision can be improved.

A computer performed method models a spatial index having n spatial regions defined in a multidimensional space using a tree-based model representing an infinite number of arrangements of n spatial regions in the multidimensional space allowable by the spatial index using a finite number of tree representations, computes an average retrieval complexity measure for content retrieval using the spatial index based on the tree based model, and provides a spatial index recommendation based on the average retrieval complexity measure. In some embodiments a spatial index selection module selects the spatial index based on average retrieval complexity measures for candidate spatial indices that are functionally dependent upon a number of spatial regions to be defined by the spatial index.

A method for publishing vector map based on Internet includes redefining data structure of mass vector space data and adding type, profession, important stratification, space index and / or peripheral space density of culture features on mass space data structure; unblocking said data structure according to said relevant parameters then setting up a networked mathematical matrix based on longitude and latitude and calculating geographic data for each space as well as indexing space data to corresponding matrix for being stored.

Provided are a system and method for managing location information for a home network. The system includes a device management means for collecting information of home network devices to form a device table, a location management means for generating a space data structure including a gridded home floor plan, and associating the device table with the space data structure on the basis of a location of the home network device, and a user interface module for receiving a location of the home network device to transfer the input location information to the location management means. Since location information of the home network devices is directly input, accurate location-based home network services can be provided.

The invention provides an SPH fluid surface reconstruction method based on a second-layer regular grid. The method is achieved in parallel on the basis of a CUDA platform, L1-layer coarse-grained grid dividing with the grid side length of 2r is performed on a whole simulating area, and after grids of an area nearby the surface of fluid in the L1 layer are determined, the area is further divided into L2-layer fine grids. The method particularly comprises the following steps that 1, the grid vertex points of the surface of the simulating area are determined; 2, scalar values are calculated; 3, grid triangulation is performed. According to the method, through the second-layer regular grid spatial data structure, the spatial locality of the grid vertex points stored in a video memory is improved, the overall calculation efficiency of the surface reconstruction algorithm is greatly improved by decreasing the transmission frequency of data in the video memory and a calculating unit, and the purpose of real-time and efficient rendering is achieved.

The invention provides a visibility judgment method of a virtual dynamic crowd, which is used for judging visibility of each individual in the virtual dynamic crowd based on crowd simulation data; wherein, the crowd simulation data comprises individuals, locations of the individuals at a certain time and IDs of scene nodes corresponding to the individuals at a certain time; the visibility judgment method comprises the following steps: visibility eliminating is carried out for a static scene, a visibility result of each frame is updated to the visibility information array of the nodes in time; the individuals in the simulation data are combined with the scene nodes corresponding to the IDs of the scene nodes, and then the visibility eliminating of each individual is realized according to the visibility of the scene nodes in the visibility information array of the nodes. The method of the invention takes an individual in the crowd as one part of the corresponding scene node of the individual, and directly attaches the scene visibility to the individual, which avoids solely judging the visibility of a great quantity of individuals, and greatly reduces consumption caused by spatial data structure update and individual shading query.

The invention discloses a software collision detection method. The method specifically comprises the following steps: establishing a Sphere bounding box for a moving object and a static object in a virtual environment; when the moving object gets close to the static object, determining a collision direction vector; respectively establishing space cutting planes according to the central point and the collision direction vector of the static object or the moving object, and determining the estimated collision range of the static object and the moving object; constructing a spatial hierarchical body model for the estimated collision range, then establishing two structure trees, judging collision intersection, and performing spatial segmentation on an overlapping part in an intersection bounding box; performing intersection testing on basic geometric elements in the obtained small cubes containing the common point set of the two models, and spotting collision points; and determining a deformation area according to the collision points. According to the software collision detection method, the software collision detection efficiency is improved by pre-estimating the collision range andthen constructing the spatial data structure model for software collision detection, the software collision detection accuracy is improved, and the bottleneck problem of software detection is solved.

The invention discloses a MapX-based GIS bus information visualization method, belongs to the technical field of bus information visualization and solves the problems that in the prior art, the regulating intensity of bus operation is poor, and operating efficiency is low. The method includes acquiring dynamic bus IC card data and static station information and line information, and establishing a data warehouse; preprocessing the data in the data warehouse, and retaining the required data; analyzing the preprocessed bus IC card data by the data analysis method, and acquiring the passenger flow distribution information; establishing a data model by GIS through the MapX spatial data structure, and implementing visualization display of the passenger flow distribution information through a program. The method has the advantages that bus information visualization can be implemented, bus station planning can be benefited, public traffic information management service level can be raised, the bus line network can be arranged reasonably, bus operation plan can be made scientifically, and the sustainable operation of the public traffic can be guaranteed.

A method for creating a multi-namespace includes steps of: returning information of a namespace data structure according to a query command from, wherein the information of the namespace data structure comprises a maximum number and a total capacity of supportable namespace; receiving and determining whether a create command for creating a plurality of namespaces is correct, wherein the create command comprises a number of a namespace and a capacity of the namespace; and if the determination is correct, creating a global host logical-flash physical address (H2F) mapping table according to the create command, wherein a number of the global H2F mapping tables is independent of the maximum number of the supportable namespaces and the number of namespace. A method for accessing data in a multi-namespace is also provided.

The invention relates to a multi-source map data processing method, which comprises the following steps of (1) forming a map request path by using splicing parameters comprising token parameters, map range parameters, multi-source map parameters, image size parameters and image format parameters; (2) calculating ground resolution comprising slices or image maps, determining geographical range coordinates of a finally returned map in combination with the image size parameters, and adding generated service images to a multi-source map set; (3) traversing and fusing all images in the multi-source map set to obtain a finally returned master service image. According to the method, a bottom layer space-isolated data structure is adopted, various images are directly fused, multi-source map images or service image data are integrated, and static images and dynamic images are accurately fused.

A method for releasing storage space in a space-efficient secondary volume includes placing a first lock on a free-space data structure stored on the space-efficient secondary volume. The method reads a copy of the free-space data structure into memory while the first lock is in place, and releases the first lock. The method then analyzes the copy to determine which storage elements in the space-efficient secondary volume are not being used. The method then places a second lock on the free-space data structure and, while the second lock is in place, analyzes the free-space data structure to determine which storage elements had their usage status change during analysis of the copy. The method then releases storage elements in the space-efficient secondary volume that are not being used and releases the second lock. A corresponding system and computer program product are also disclosed.

Methods and systems for calibrating devices reproducing high dimensional data, such as calibrating High Dynamic Range (HDR) displays that reproduce chromatic data. Methods include mapping input data into calibrated data using calibration information retrieved from spatial data structures that encode a calibration function. The calibration function may be represented by any multidimensional scattered data interpolation methods such as Thin-Plate Splines. To efficiently represent and access the calibration information in runtime, the calibration function is recursively sampled based on guidance dataset. In an embodiment, an HDR display may be adaptively calibrated using a dynamic color guidance dataset and dynamic spatial data structures.

The invention provides a behavior analysis method, apparatus and system, and a readable storage medium, and relates to the technical field of data processing. It is proposed that internet access behavior data of staffs is abstracted as a multidimensional spatial data structure similar to an oil painting, so that the multidimensional spatial data structure can be intelligently analyzed by using a convolutional neural network. The work finished by the staffs and the social internet access behavior data are analyzed by using a most advanced convolutional neural network method in an artificial intelligence technology, so that the professional quality of all the staffs can be quantitatively described objectively, efficiently and accurately in real time.

Structure of the system includes unit for finding spatial data, unit for asynchronous calling, load-balancing unit, fault-tolerance unit, unit of compression transmission and safe transmission, unit of safety authentication and userí»s authority etc. The unit for finding spatial data is divided to node container and door container for application. Unit for asynchronous calling sorts data information and calls the sorted data respectively. The load-balancing unit transfers data process to multiple servers to carry out jointly. Fault-tolerance unit manages service life cycle of Web service. The unit of compression transmission and safe transmission is in use for reducing network transmission flux and raising transmission efficiency. Unit of safety authentication and userí»s authority is in use for determining userí»s ID and authority etc. Advantages are: collecting and sharing special data resources geographical distributed, and synergistic treating requests of multiple data processed.

A data processing apparatus for a collision check with respect to a plurality of rays. A control unit may generate a plurality of packets with respect to a plurality of rays associated with a first node in a spatial data structure. At least one of the plurality of packets may include information about k rays, and k may be a natural number. A processor may sequentially receive the plurality of packets and determine which child node of the first node is associated with each of the plurality of rays associated with the first node.

A method includes receiving at a master processing element primitive data that includes properties of a primitive. The method includes partially traversing a spatial data structure that represents a three-dimensional image to identify an internal node of the spatial data structure. The internal node represents a portion of the three-dimensional image. The method also includes selecting a slave processing element from a plurality of slave processing elements. The selected processing element is associated with the internal node. The method further includes sending the primitive data to the selected slave processing element to traverse a portion of the spatial data structure to identify a leaf node of the spatial data structure.

A method, system and program product are provided for facilitating scheduling of computer jobs of a computing environment having a plurality of resources. The method includes decoupling a job scheduling algorithm from responsibility for maintaining data structures for tracking recorded usage of the plurality of resources by computer jobs. The decoupling includes (i) providing resource space data structures separate from the job scheduling algorithm for recording usage of the plurality of resources by computer jobs; and (ii) providing operators for facilitating manipulation of values within the resource space data structures by the job scheduling algorithm and by one or more functions external to and independent of the job scheduling algorithm.