71results about How to "Optimize data structure" patented technology

A method, mesh data structure and apparatus is disclosed for producing an improved / refined / derefined mesh of finite elements for a three-dimensional object showing boundaries and faces. The improvement / refinement method repeatedly searching, for consecutive sets of active target elements to be refined or improved, an associated submesh and set of terminal edges, the searching process not modifying the mesh data structure; then according to the point insertion method chosen, selection of the point or the points to be inserted between the midpoints of the terminal edges modified by some boundary considerations; inserting the selected point or points in the initial mesh; and then proceeding to the succeeding set of active target elements until an user-defined stopping criterion is achieved.The derefinement method, for each target vertex finding an associated set of neighbor vertices to be derefined; then eliminating each said vertex according an appropriate order such that the derefinement of said vertex allows to re-obtain a previous terminal edge whose bisection produced said vertex. The method, mesh data structure and apparatus of this invention allowing the parallel scaleable refinement / derefinement of the mesh by locally modifying sets of neighbor elements sharing the common longest-edge.

An image processing system processes image data in response to a sequence of image processing steps defined by a process tree data structure. The process tree comprises a plurality of interconnected nodes, including input nodes and at least one output node. Output rendering is performed a frame at a time, and each frame is rendered in a time determined by the amount of processing defined by the process tree. The process tree may comprise many branches of interconnected nodes, and the user can selectively cache intermediately rendered frames at nodes where the contributing process tree branches are relatively stable in their configuration. The user may then make modifications to processes in other parts of the process tree, without having to wait for image data to be rendered from unchanged parts of the process tree.

The invention discloses a method of automatically generating a power device monitoring information table. With the help of a standard data source end maintenance rule, a monitoring signal naming rule, and a signal type, number and acquisition agreement rule for different device types and wiring modes, a monitoring signal analysis expert database based on forward reasoning is built, each monitoring information access expert decision making database is built for each manufactor, each device type and each wiring mode, storage and association of power device monitoring information points are realized, and with the help of the expert decision making database, with a device ID as a radiation source, a substation three-remote information table and a final monitoring information table are generated automatically. Limitation on monitoring information compilation and auditor professional background and acquisition rule understanding deviation are solved, problems that monitoring information between different substrates is hard to standardize and unify, and repeated auditing reduces working efficiency are solved, fusion of primary equipment, protection, automation, communication, and direct current knowledge is realized, and correct and standard monitoring information acquisition can be ensured.

The invention discloses a system, a device and a method for real-time monitoring. The system for real-time monitoring comprises an acquisition front computer, a real-time computing server, a database server and a monitoring client, wherein the acquisition front computer is used for acquiring singling from a mobile network, generating a call detail record CDR and transmitting the generated CDR to the real-time computing server; the real-time computing server is used for counting the CDR within a monitoring time granularity according to events, obtaining corresponding index data of the events and transmitting the index data to the database server; the database server is used for storing the index data; and the monitoring client is used for constantly reading and displaying the index data in the database server according to indexes of the events needed to be detected. The system, the device and the method can realized the real-time control of the mobile network.

The invention relates to a rapid network packet classification method based on network traffic statistic information, which belongs to the technical field of filtration and monitoring of network traffic. The method comprises the steps of: determining the space partition of various domains of a header and a rule mapping table thereof according to a classification rule set, and establishing an address lookup table, a port lookup table and a rule lookup table; recording the times that the header of a network packet appears in the space partition of the domains and calculating prior distribution; establishing a letter search tree of the domains according to the prior distribution; performing continuous matching on the received header of the network packet according to the letter search tree and the lookup tables; and re-calculating the prior distribution and updating the letter search tree at update time, and continuing to match the received network traffic. The method uses the classification rule set and heuristic information of the network traffic from two different levels of network packet classification, strengthens the adaptability of the classification method, and improves average classification efficiency. The method has quick lookup speed and strong adaptability, can be realized on a plurality of platforms, and is applicable to the filtration and monitoring of high-performance network traffic.

A simple record query language (SRQL) is a generic record meta-data query solution that can natively describe the information contained in a record and search each against it to find records whose meta-data matches a particular set of criteria. SRQL includes both a record data structure that includes searchable SRQL attributes that describe the record, and queries that are able to search the attributes. The attributes are an XML node that exists in the record header itself. There are two types of queries, to wit local to find records in the local data store, and distributed to find records that may be stored in a neighbor's data store. As such, SRQL finds particular applicability to peer-to-peer networks.

The invention discloses a matrix data base system for distributed computing and a query method thereof. The matrix data base system comprises a mode swapping module, a metadata management module, a data storage system, a retrieval system and a workflow management module, wherein a relational database management system is served as an input source of the mode swapping module; a predetermined data base is decomposed into relatively independent parts through the mode swapping module and redundancy is stored into the data base storage system; the metadata management module and the workflow management module perform bidirectional data interaction to maintain a mapping relation between original relation modes and a new storage structure; and the workflow management module is used for analyzing SQL (Structured Query Language) statements and performing dispatching management on subtasks of the query processing. Compared with two existing data warehouse tools, namely Hive and Hadoop DB (Data Base), the matrix data base system and the query method thereof have good performance.

A method of encoding data structures using compressed object encodings during serialization. A compressed representation of the data is generated directly while encoding. Serialization means converting a data structure to a string of bytes for external storage or communication.

Disclosed are an index structure and a method of extending index which comprises: (a) performing indexing operations of generating inverted index for newly inserted data source in the memory; (b) if the number of source data involved in the indexing operations reaches a first threshold value k1, sequentially writing the generated inverted index into the first index subfile; (c) if the number of the smallest grids, or index groups, in the first index subfile reaches a second threshold value k2, merging the k2 grids into a larger grid and sequentially writing it into the second index subfile; and (d) if the number of the smallest grids in the second index subfile reaches a third threshold value k3, merging the k3 grids into a larger grid and sequentially writing it into the first index subfile. Because index updating mostly occurs in small grids, the number of I / O operations on large grids is reduced and thus the speed of index building and updating is increased. In addition, the threshold values k1, k2 and k3 may be automatically adjusted based on the usage of system resources.

The present disclosure is directed to enabling search and extraction of data stored in DNA with optimized data structures and functions. Accordingly, systems and methods are provided herein for performing certain functions on data stored in nucleic acid molecules. The present disclosure covers at least the following areas of interest: (1) data structures to provide efficient access and search of information stored in nucleic acid molecules, (2) accurate and quick reading of information stored in nucleic acid molecules, (3) targeted approaches to accessing subsets of information stored in nucleic acid molecules, (4) a rank function that determines a count of particular bit or symbol value in a set of information stored in nucleic acid molecules, (5) functions including counting, locating, and extracting occurrences of a specific pattern in a message of information stored in nucleic acid molecules, and (6) an if-then-else operation to sort data stored in nucleic acid molecules.

The invention discloses a flight recovery method considering passenger willingness. Flight operation of an airline company is narrated in a flight loop mode. A genetic algorithm is used for solving. An algorithm flow is optimized through a specific coding mode, and the processing steps and the data structure of the algorithm are optimized, so that the solution always runs in the feasible region inthe solving process, the punishment problem which is difficult to process in the algorithm corresponding to the traditional technical scheme and the search direction range selection problem of the solution are reduced, the efficiency of the algorithm is improved, and a flight recovery scheme which is excellent enough can be obtained more quickly. And meanwhile, in the flight recovery process, thebenefits of airlines and passengers are fully considered, so that the satisfaction ratio of the passengers to the recovery scheme is greatly improved, and the competitiveness of the airlines is enhanced.

Systems, program products, and methods to enhance financial budgeting of an organization having several departments are provided. A minimum budget assignor assigns to one of several departments a minimum budget amount of money. A strategy creator creates strategies for the department and a strategy assignor assigns a priority ranking determined by the department to each of the several of strategies to define several prioritized strategies. A strategy assignor assigns a priority ranking determined by the department to each of the strategies to define several prioritized strategies. A supplemental budget requestor submits several supplemental budget requests for the several prioritized strategies for a requested supplemental amount of money for each of the several supplemental budget requests of the department for review and approval by the organization. A supplemental budget assignor assigns to the department a supplemental budget amount of money determined by the organization for at least some of the several prioritized strategies.

Embodiments described herein provide a platform, device and process for storing transaction data from a point of sale device (e.g., at a merchant) or from an intermediary data store so a representation of the data can later be presented to a customer. The data is stored, relevant data extracted, and additional data is combined to enable reconstruction of transaction data in a form for presentation of transaction data as an e-receipt on an online platform or allowing transaction data to be used as security questions for a user to whom the transaction data relates.

The present disclosure provides an Internet teaching platform-based following teaching system. By using a recording and broadcasting system of an Internet teaching platform, recording class teaching of a standard teacher and then performing standardization segmentation processing on data of the recorded class teaching, a standard teaching recorded and broadcast course is formed, and after learning the standard teaching recorded and broadcast course, a following teacher can imitate the standard teacher to perform local class teaching, which is also recorded by means of the recording and broadcasting system. By using the system of the present disclosure to perform processing of relationship construction, statistics, analysis and comparison on a variety of collected data, the recording and guiding before, during and after a teaching process of the following teacher can be realized, so as to facilitate the following teacher in effectively completing the local class teaching.

The invention provides a data storage method. According to the method, a key of a key-value pair is converted into a hash value from an object, converting the value of the key-value pair from the object into instance data, the data structure of the key and the value is improved; an object head of the key and the value, alignment filling and other parts are removed, storage space occupied by the object head and the alignment filling is saved; therefore, the storage overhead of the object in the key value pair is reduced, the function of compressing and storing the key value pair is realized, the key value storage efficiency is improved, the probability of problems such as memory recovery triggered by overlarge memory space is reduced, and the performance of the storage system is improved.

A procedure is used to provide data structures that handle large numbers of active data entries and a high rate of additions and deletions of active entries. The procedure utilizes one or more of the following modifications. Timers are removed from individual session table entries and are linked via pointers. Bilateral links are established between the session table and the timer structure. Aging / timer checks are applied to the timer control block (TCB). A chain of TCBs, optionally including an excess of blocks, may be used along with packing of multiple TCBs into a single memory location. This excess of blocks permits a terminated session to continue to occupy a TCB until the timer process progresses to that block location in the chain of blocks.

The invention relates to arranging synchronization of data in an information system comprising at least two separate datasets to be synchronized and a data storage into which data in the datasets to be synchronized is stored and from which the data to be synchronized is delivered to the datasets. The solution comprises determining at least some of the fields of at least one data type as search settings. From a record stored or to be stored in the data storage, at least one character string is determined as a search key on the basis of at least one predetermined search setting, and the search key associated with the record is stored. In response to receiving a search expression corresponding to the search key, the data storage is searched for the data associated with the search key.

A method, system and program storage device are provided for extending an inverted index, which comprises first and second inverted index subfiles to increase the speed of establishing and updating inverted index files. The method includes performing ordered keyword indexing operations of generating an inverted index from data sources, in which a frequency of occurrence of keywords in each of the data sources is calculated, and writing each keyword, the data sources, and the frequency of occurrence of each keyword in the corresponding data sources to the inverted index. If a number of data sources involved in the indexing operations reaches a first threshold, then writing contents of the inverted index as a smallest grid into the first inverted index subfile. If a number of smallest grids in the first inverted index subfile reaches a second threshold, then merging the smallest grids into a merged grid and writing the merged grid into the second inverted index subfile. If the number of merged grids in the second inverted index subfile reaches a third threshold, then further merging the merged grids into a larger merged grid, and writing the larger merged grid back into the first inverted index subfile.

The invention discloses a human body hidden thing image segmentation method based on an X-ray back scattering image. The method comprises the steps of collecting the X-ray back scattering image, preprocessing the X-ray back scattering image, obtaining an image after preprocessing, carrying out statistics on the preprocessed image, extracting human body areas, gaining the average grey degree u0 of the human body areas, classifying the human body areas again through a K-mean algorithm and a Bayesian classification algorithm and extracting human body hidden things by using a zone marker method. According to the human body hidden thing image segmentation method based on the X-ray back scattering image, the data size is reduced to the greatest extent under the condition that an effect can not be affected, so that computing time is shortened, and the purpose of real-time performance is achieved. Objects which have the relatively low contrast ratio with the background can be well detected. Through two-time segmentation, the purposes that the objects and the background are distinguished and the hidden things are well detected are achieved by using the middle background of a human body, the hidden things are automatically marked, and manual marking is avoided.

The present invention discloses a visual shape model-based robot multi-target recognition method. According to the method, the shape feature vector of a target is generated by using a polar radius with the centroid of the outline of the target adopted as a reference; and the training of a sample feature model library is completed by using a Gaussian model; dynamic time warping (DTW) is used to solve the problem of matching between feature vector elements; the principal axis parameter of the shape of the target is obtained according to a moment of inertia; and the alignment method of the starting order of the feature vectors is given. The method of the invention can identify predetermined targets under relatively complicated environments without being affected by translation, scale and rotation geometric changes and has high robustness.

The invention discloses a method for merging GDSII layout data, applied to merging two or more pieces of GDSII data and comprising the following steps of: 1) establishing two layout libraries in a layout design tool; 2) exporting the two libraries into corresponding GDSII data, respectively; 3) reading in GDSII data to be merged in a binary manner, and finding out each element body in the two GDSII data files, respectively, thereby forming two sets: set A and set B; 4) comparing each element body in the set A with the corresponding one in the set B one by one; 5) forming a new set from the final set A' and the set B. The method is capable of automatically merging the GDSII data, and reduces the data redundancy and optimizes the data structure, so that the quick merging of various kinds ofclient data, IP data, mask scribing slot data becomes possible; and the design efficiency is greatly improved and the reliability is enhanced.

An illustrative embodiment provides a computer-implemented process for distributed management of native interface arrays. The computer-implemented process obtains an array type native interface call in a first system from a caller in a second system, identifies an array type of the array type native interface call to form an identified array type, and requests array elements associated with the identified array type to form requested array elements, wherein added metadata is associated with the requested array elements. The computer-implemented process builds an enhanced data structure using the requested array elements and the associated added metadata and returns a pointer within the enhanced data structure to the caller. The pointer can be used by the caller to manipulate array data of the array elements, and the first system can calculate an address of the added metadata in constant time from the pointer.

A procedure is used to provide data structures that handle large numbers of active data entries and a high rate of additions and deletions of active entries. The procedure utilizes one or more of the following modifications. Timers are removed from individual session table entries and are linked via pointers. Bilateral links are established between the session table and the timer structure. Aging / timer checks are applied to the timer control block (TCB). A chain of TCBs, optionally including an excess of blocks, may be used along with packing of multiple TCBs into a single memory location. This excess of blocks permits a terminated session to continue to occupy a TCB until the timer process progresses to that block location in the chain of blocks.

There is provided an Internet teaching platform-based following teaching system having a voice evaluation function. By using a recording and broadcasting system of an Internet teaching platform, recording class teaching of a standard teacher and then performing standardization segmentation processing on data of the recorded class teaching, a standard teaching recorded and broadcast course is formed, and after learning the standard teaching recorded and broadcast course, a following teacher can imitate the standard teacher to perform local class teaching, which is also recorded by the recording and broadcasting system. By using the system to perform processing of relationship construction, statistics, analysis and comparison on a variety of collected data, the recording and guiding before, during and after a teaching process of the following teacher can be realized, and a voice of the following teacher can be evaluated to facilitate the following teacher in effectively completing the local class teaching.

The invention discloses a sensor data classification method based on phase space reconstruction, and the method comprises the steps: 1), mapping a one-dimensional sensor time sequence to an m-dimensional phase space through the phase space reconstruction based on coordinate delay so that sensor data exposes implicit key information to acquire a phase space track matrix; 2) inputting the extracteddata of each sensor at the moment i into a long-short-term memory network module, and setting the time step length input by the long-short-term memory network to be the embedded dimension m of phase space reconstruction; and 3) inputting the RGB matrix of the state information analogy image output by each long-term and short-term memory network into a two-dimensional convolutional neural network module, and inputting features extracted by the two-dimensional convolutional neural network into a full connection layer to obtain a classification result. The problems of limitation of an original one-dimensional sensor data structure and limitation of sensor data classification accuracy are solved, and the sensor data at the time point can be accurately classified.

The invention discloses a door and window customized material information rapid configuration method, system and device and a medium. The method comprises: constructing a knowledge graph for all typesof doors and windows in a unified mode; analyzing each part of the door and window in the knowledge graph, and then constructing an incidence relation constraint model; receiving an input query statement, and searching a corresponding query result from the knowledge graph; outputting the query result as a to-be-configured material name; and a configuration step: receiving the input configurationinformation about the to-be-configured material, and completing the configuration of the door and window material information.

The invention discloses a firmware updating method and device, an Internet of Things system, electronic equipment and a storage medium. The method comprises the steps of obtaining equipment data of target equipment; carrying out format conversion on the equipment data to obtain equipment data in a target data format; and sending a firmware updating instruction to the target equipment, and sendingthe equipment data in the target data format to the server, the firmware updating instruction being used for indicating the target equipment to request the server to update the firmware and obtain theequipment data in the target data format. When the firmware is updated, the user terminal is used for carrying out format conversion on the equipment data, in this way, the firmware updating method and device not only can give consideration to various data formats, facilitate continuous optimization of the data structure of the Internet of Things device and realize firmware updating compatible with different data formats, but also reduce the code complexity and the code maintenance cost, save the code space and reduce the firmware updating cost.

The invention relates to a method for soft locking password setup for a touch screen mobile device and an unlocking method corresponding to the method for soft locking password setup. The method for soft locking password setup and the unlocking method are characterized in that hand input by a user is identified as a plurality of similar characters which are displayed from high to low according to similarity, and the character selected by the user can be stored via a corresponding character code; in password confirmation, the hand input is identified as the highest similar characters which are then converted into corresponding character codes, and the character codes are then compared with the stored character code; similarly, in unlocking, hand input by the user is recognized as the highest similar characters which are then converted into corresponding character codes, and the character codes are then compared with the stored character code. The invention further discloses a system for soft locking password setup and unlocking for the touch screen mobile device, which employs the methods and comprises a touch screen processing module, a recognition module, a comparison module, a storage and access module and a prompting module.

The invention provides an intelligent unlocking system, and a method. The intelligent unlocking system comprises a cloud large database used for storing user information registered by a guest at a relevant department, and providing the user information for local relevant information indexing, an identification module used for collecting voiceprint information and face information of guest, and comparing the collected information with indexed relevant information in the cloud large database, a sensing module used for sensing whether there is a guest in a preset region, and determining whether the identification module is activated according to the sensing results, and an unlocking module used for opening doors based on determination results of the identification module. In unlocking processof the intelligent unlocking system, only the voiceprint information and the related face information of guests are needed to be collected, comparison with the standard information in the cloud largedatabase is carried out, and unlocking can be realized after passing of identity authentication; carrying of room cards by guests or repeat information input in different hotels is avoided, and better convenience is provided.