59 results about "BASIC DATA STRUCTURE" patented technology

A basic data structure in a lead-in area is made coincident with each other in all of a read only type, write once type, and a rewritable type. The lead-in area is divided into a system lead-in area and a data lead-in area. A track pit and a pit pitch of pits in the system lead-in area are made longer than those in the data lead-in area. In the system lead-in area, a reproduction signal from a bit is detected in accordance with a Level Slice technique, and, in the data lead-in area and data area, a signal is detected in accordance with a PRML technique. In this manner, in any of the read only type, write once type, and rewritable type, there can be provided an information recording medium and an information reproducing apparatus or information recording and reproducing apparatus therefor, capable of a stable reproduction signal from a lead-in area of the write once type recording medium while maintaining format compatibility.

The invention discloses a static detection method for privacy information disclosure in mobile applications. The method comprises the steps as follows: firstly, the completeness of codes is checked, if the codes are incomplete, preparatory work is performed on source codes, state machine description files corresponding to the privacy disclosure are loaded, related state machine information is obtained, the source codes are compiled to obtain detailed information of classes, functions and the like, pre-analysis is performed on the source codes, basic data structures such as abstract syntax trees and the like are generated, and call relations among the functions are obtained; and then detection and analysis is performed in units of the functions, state machine instances are created for all state machines with associated methods in the state machines, state machine instance iteration is performed on control flow diagrams corresponding to the functions, when the state machine instances are in error states, errors are reported, after detection is finished, the detected errors are checked manually, and detection results are confirmed. With the adoption of the method, the privacy disclosure codes existing in application programs of different operating system platforms can be effectively detected, so that the privacy information disclosure of users can be effectively prevented.

The invention provides a content name storage structure oriented design method in a content network. Layered nested structures of nested segmented hash tables are aggregated through content names with the same prefix and accordingly the overhead of storage space is reduced; the segmented thought is introduced to segmented hash tables based on hash tables and the segmented hash tables are utilized as basic data structure units in the nested segmented hash tables, a bloom filter and a bit map are added to be utilized as index structures, pre-processing is provided for data entering into corresponding sub-table hash calculation, and accordingly the times of direct operation on storage tables are reduced and the search efficiency is improved; meanwhile a content popularity parameter based chain table method is utilized to solve the hash conflict and reduce the search time of popular content names, the parallel relationship between nodes in the same layer of sub-tables of the segmented hash tables and the nested segmented hash tables is introduced, and accordingly the computing power of a multi-core CPU (Central Processing Unit) can be effectively utilized in the implementation, data insertion, search and deletion operation in the segmented hash tables can be efficiently achieved, and the processing capacity of a content name storage structure is improved.

The invention relates to a social network analysis method and provides a social network analysis method based on graph structure matching. The social network analysis method comprises the following steps that: firstly, a user builds a mode graph Q, selects graph data to be analyzed and sends out a matching query request of the mode graph Q; secondly, a system uses an orthogonal list as a basic data structure of the graph data to be analyzed and carries out data management operation on the graph data G of orthogonal list structure; thirdly, the system sends the matching query request of the mode graph Q to each data station of the graph data G of the orthogonal list structure, and counting the data stations as (S1, S2, ..., S<m>); fourthly, the system parallelly executes local calculation of each data station and calculates matching results; and finally, the system sorts the matching results and displays the sorted matching results. The social network analysis method is applicable for social network analysis based on graph structure matching.

The invention discloses a subgraph isomorphism-based web data automatic visualization method. The method comprises the following steps of: 1, constructing an architecture of a service data visualization modeling and matching method; 2, defining a metadata tree MDT; 3, reading JSON data returned by the called REST API, taking a JSON data set ds as input of a modeling algorithm, and carrying out tree structure modeling on ds; 4, reserving basic data structure information through a pruning method; 5, classifying the visualized graphs; 6, performing dimension reduction operation on the MDT by using a dimension reduction method; generating a meta-structure tree MST, performing matching query, calling a matching method based on subgraph isomorphism to search fragments, matched with each StructModel of the VT, in the MST, and performing data mapping according to the Mapping information to generate a visual graph. According to the invention, the model is automatically matched, so that automatic visualization of data is realized.

Method and system for incremental backup of data containers with fixed length records is provided. Initially, a backup application copies all stored data containers to create an initial backup container. A data structure corresponding to the first backup operation is also created. The data structure maintains unique file identifiers for each data container and information regarding when a record was added. The data structure is created and maintained by an application that also creates, updates, and modifies the fixed length records. The application updates the base data structure when records are added to a data container, after the initial backup. For a next backup operation, the initial data structure is compared to an updated data structure that is current at the next backup time. The comparison identifies the new records that were added (or updated) since the initial backup operation. The backup application then incrementally copies the new records.

The invention discloses an ontology-based knowledge map drawing system which comprises an ontology knowledge base, a knowledge map representation layer and a knowledge map management layer, wherein the ontology knowledge base is used for storing general knowledge and the relation between the knowledge; the knowledge map representation layer is connected with the ontology knowledge base and used for replacing specific knowledge concepts in the knowledge base with more abstract knowledge nodes and introducing compound operation for knowledge correlations; and the knowledge map management layer is connected with the knowledge map representation layer and used for managing the definitions of associations between the abstract knowledge nodes and complex knowledge, storing the definitions in anindependent database and receiving a knowledge map generation request so as to realize the dynamic creation of knowledge maps. The system disclosed by the invention needs to take the graph structure of ontology data as a basic data structure, meets the creation requests of various different knowledge maps through carrying out abstract representation on the knowledge concepts and knowledge associations, and outputs the abstract representation to a knowledge map display system in an XML (extensive makeup language) form.

The invention discloses a traffic information active push method based on LBS (Location Based Service). The traffic information active push method based on LBS includes the steps: acquiring traffic information; combining with the traffic information, establishing a basic data structure of a traffic information sequence; calculating the information sequence updating number; generating a traffic information recommending sequence; generating a traffic information playing sequence; and pushing and displaying the traffic information playing sequence. The invention also provides a traffic information active push system based on LBS. The traffic information active push method and system based on LBS are characterized in that according to the historical locus position data of a driver and the current GPS position, determining whether the driver is in the range of daily activity and whether different push strategies are taken after approaching the destination, and determining the playing priority and display intensity of information sequences; combining with the space condition, selecting the traffic information sequence on the front correlated road to form a traffic information recommending sequence MS; and according to the length of the road, the driving speed of the current target vehicle, the information updating time and the playing strategy, playing the traffic information playing sequence MS'.

The invention provides a technical framework using a data structure to control a data processing process and a data analysis process and belongs to the field of big data framework technology. The framework is named as Hyong. The business-based data analysis process is realized in the data processing process at the level of data operation, and meanwhile the data processing process and the data analysis process both need a series of standard control and protection mechanisms. Through high abstraction of the data processing process and the data analysis process, control and protection of the two processes are packaged in a data structure mode. By developing and implementing the Hyong technical framework, the data processing process and the data analysis process can be integrated in a systematic mode, and control is executed by use of the basic data structure mode, so that the technical framework has extremely high universality and excellent performance.

The invention provides a layout fast reading method. The layout fast reading method comprises the following steps: a GDSII file is read in, unit head information is read to build containers for units, an indexing relation between the units is built to find out a top-level unit, and pixel information of each unit is read. Correspondingly, the invention further provides a layout overall information storage device. The layout overall information storage device comprises a basic data structure for the units, containers storing unit basic structures, a linked list of subunits and a complete unit index. In this way, the operating efficiency of application programs is improved, the memory usage of the application programs is reduced, the flexibility of the application programs is improved, logic operations of the application programs are clearer, and the indexing relation is simpler.

The invention discloses a JSON data analysis and modeling method oriented to Web 2.0. The method comprises the following steps that 1, a metadata tree MDT is defined and comprises a root node Troot, an index node INode and a data node DNode, meanwhile, the number of layers of the nodes in a tree structure is expressed through a depth level, and the root node is defaulted to be a first layer, namely the level is equal to 1; secondly, JSON data returned by the called REST API is read, a JSON data set ds is used as input of a modeling algorithm, and tree structure modeling is conducted on ds; and3, through a pruning method, basic data structure information is reserved, the same repeated data structure is cut off, the volume of the model is reduced, but the basic data structure is still reserved, and the query overhead caused by the JSON data structure is reduced. The method is beneficial to accelerating retrieval and positioning of the data, enhancing the accuracy of judging the subordination relation, and improving the data utilization rate and usability.

Systems and methods for managing intellectual property are provided. These systems and methods may accept new pieces of intellectual property from creators of the intellectual property and then record the intellectual property, control access to the intellectual property, facilitate use and integration of the intellectual property, and track information relating to the intellectual property. Using five basic data structures, one embodiment of the present invention enables the tracking of IP elements (e.g., a single idea or a new combination of ideas), IP assets (e.g., one or more IP elements with recognized value), metadata elements (e.g., supplemental information), log elements (e.g., change information), and user records (e.g., user information). In an implementation of the invention, a “lab notebook page” paradigm may be used to facilitate the entry of information into an IP element.

The invention discloses a database query field generation method and apparatus, which relates to the technical field of databases and is invented for solving the problem that a user cannot freely define query fields. The method comprises the steps of receiving a field definition rule established based on a basic data structure, wherein the field definition rule contains one or more query fields in the basic data structure and an operational relationship among the one or more query fields; verifying whether the field definition rule conforms to a query rule of the basic data structure or not; and if the field definition rule conforms to the query rule of the basic data structure, generating a relationship table corresponding to the field definition rule in a database, generating self-defined query fields corresponding to the field definition rule, and storing the self-defined query fields. The method and the apparatus are mainly applied to a process of performing field self-definition on the relational database.

The invention discloses an image processing platform and an implement method thereof. The image processing platform and the implement method of the image processing platform provide a novel image processing scheme and improve the resource utilization rate and the image processing efficiency. The implement method includes utilizing a CXIMAGE tool to read the image data need to be processed, obtaining the image data of a BMP (Bitmap) structure; switching the image data of the BMP structure to the image data of a basic data structure IplImage in an OpenCV tool; utilizing the image data of the basic data structure IplImage to perform corresponding processing in the OpenCV tool and obtaining the result data of the IplImage structure.

The invention discloses a multi-core processor-oriented operating system noise control method, which belongs to the fields of operating systems and program analysis. The noise control method provided by the invention is implemented on a Linux kernel based on an isolation control method, and comprises the following steps of: setting a set of kernel control interface, dynamically setting a quiet central processing unit by using the interface and specifying a process onto the quiet central processing unit for running; and setting a kernel mechanism supporting quiet control, mainly comprising themodification of a kernel project, the setting of a new quiet central processing unit and prevention of influence on the quiet central processing unit. By the noise control method provided by the invention, the quiet processors required to be isolated are not required to be reset in a restarting way, and avoid the rebalancing of tasks, thereby realizing control over the noises of the operating system and providing good consistent experiences for the user of the operating system.

The invention discloses a maintenance equipment demand prediction and analysis system based on big data. The prediction analysis system is arranged on the inner side of the ship; a plurality of devices are arranged on the inner side of the ship; the predictive analysis system includes a server, the server is connected with artificial intelligence engine, the server is connected with a big data calculation engine; the artificial intelligence engine and the big data calculation engine are connected with a suggestion prompt module; the server is connected with a basic data structuralization module through a network. The basic data structuring module is connected with a big data center through a network; the big data center is connected with a data collector; the data collector is connected with a sensor set through a wire, the sensor set comprises but not limited to a temperature sensor, a gas sensor, a liquid level sensor, a pressure sensor and a vibration sensor, and the functions thatthe burden of spare parts carried by a ship can be greatly reduced, the warehouse space utilization rate is increased, the purchasing expenditure is saved, and the voyage rate is finally increased areachieved.

The method is suitable for the technical field of distributed systems. The invention provides a unique key generation method, device and terminal equipment, The method comprises the following steps of: Obtaining data to be generated, correspondingly generating a service instance code according to the service instance sequence of the to-be-generated data, correspondingly generating a year, a week,weekdays and a second according to actual time, correspondingly generating a serial number, an expansion bit and a version according to a preset rule, synthesizing the generated field into a unique key according to a unique key basic data structure, and labeling the unique key in the to-be-generated data; Wherein the generation field comprises service instance codes, years, weeks, weekdays and seconds, serial numbers, extension bits and versions. The method can ensure that the unique key data is not repeated in a single-machine scene, and meets the basic requirements of distributed global uniqueness, orderliness, inverse solvability, high performance, expandability, readability and the like.

The invention particularly relates to a Key-value separated storage method and a Key-value separated storage system. According to the Key-value separation storage method and system, an ART prefix tree is used as a basic data structure of a data index, spaces are distributed for a key value and a value value in a node Node of each piece of data for storage, corresponding Sequence Number and Value Type are stored in the node Node, separation of Key-value is achieved, coding is not carried out any more in the data storage process, the key, the Sequence Number, the Value Type and the value are directly stored and read, and the data storage efficiency is improved. And therefore, the IO throughput is reduced, the CPU cache hit rate is increased, and the read-write performance of the database is improved. According to the Key-value separated storage method and system, corresponding information does not need to be decoded during data read-write operation, and the information can be obtained by directly using the node Node, so that the I / O consumption of a disk is reduced, the IO throughput is reduced, the CPU cache hit rate is increased, and the read-write performance of a database is improved.

The invention provides a method for processing and displaying internet multi-source information. The method comprises the following steps of: requesting data to an outside-source server; analyzing structured data returned from the outside-source server; constructing internal data according to the analyzed structured data, wherein the data structure of the internal data comprises a basic data structure and a derivative data structure, the basic data structure is a logic basic data unit which is contained in order to satisfy business requirements, and the derivative data structure is a data unit which is formed by compositing the basic data structure and logically contains a plurality of components; storing the constructed internal data in a database; and repeatedly carrying out the steps timely or at an a randomly set time interval, acquiring the content from the database and displaying the content on a page. The invention also provides a device for processing and displaying the internet multi-source information, which uses the method. By the method and through the device, the effect of conjunctively displaying local static information and updatable dynamic information which is acquired from a plurality of information sources on the internet on a vocabulary entry page can be better achieved.

A basic data structure in a lead-in area is made coincident with each other in all of a read only type, write once type, and a rewritable type. The lead-in area is divided into a system lead-in area and a data lead-in area. A track pit and a pit pitch of pits in the system lead-in area are made longer than those in the data lead-in area. In the system lead-in area, a reproduction signal from a bit is detected in accordance with a Level Slice technique, and, in the data lead-in area and data area, a signal is detected in accordance with a PRML technique. In this manner, in any of the read only type, write once type, and rewritable type, there can be provided an information recording medium and an information reproducing apparatus or information recording and reproducing apparatus therefor, capable of a stable reproduction signal from a lead-in area of the write once type recording medium while maintaining format compatibility.

The invention provides a bandwidth optimization method and device. The bandwidth optimization method comprises the steps that parameter range information of an image is determined according to parameter information of the image and hardware parameter information of an image processing device, wherein the parameter range information comprises parallax error range, width of the image, memory digits and / or the weight of an abnormal parallax value; the weight of a normal parallax value is calculated out according to the parameter range information and a preset calculation rule; basic data structure information of the image is built according to the weight of the normal parallax value and the weight of the abnormal parallax value, wherein the basic data structure information is in an integral type. By means of the technical scheme, the bandwidth can be optimized.

The invention provides a processing method, a device, a server and a storage medium for authentication data. The method comprises: obtaining authentication data; converting the authentication data into an extensible serialized data structure, the extensible serialized data structure comprising a basic data structure and an extended data structure, and the basic data structure comprising at least authentication location information and authentication time information; verifying the extensible serialized data structure by a preset verification rule; sending verification results.

A method comprises providing a change to apply to video; dividing video into blocks; creating propagation map which captures only specific changes to blocks that would be changed by the application of the change; evaluating the change based on a luminance criterion as being a perceptible change or an imperceptible change; for propagation maps of an imperceptible change, storing the propagation map to a list, wherein the propagation map is the principle data structure to be applied to the video. The propagation map can be created by using motion vector changes associated with the change.

A traffic network simulation system including subnets, a section of road, junction, connector, detector, clock, Signal lights and vehicles, According to the entity relation of the objects in the traffic network, Objects are designed as abstract objects represented by a computer, the basic data structure of simulation system is established, and the parallel computing model and the orthogonal recursive bisection method are used to segment the large-scale road network efficiently, After dividing it into several subnets, each processor is responsible for processing one subnet. During each simulation step, if the generated vehicle exceeds the boundary of its own subnet, it needs to exchange vehicle information with its neighboring subnets and send the vehicle information to the main process. The traffic network simulation system of the invention divides the whole road network into a plurality of sub-networks, and each sub-network completes the simulation in a parallel execution mode, thereby improving the efficiency.

The invention provides a bandwidth optimization method and device. The bandwidth optimization method comprises the steps that parameter range information of an image is determined according to parameter information of the image and hardware parameter information of an image processing device, wherein the parameter range information comprises parallax error range, width of the image, memory digits and / or the weight of an abnormal parallax value; the weight of a normal parallax value is calculated out according to the parameter range information and a preset calculation rule; basic data structure information of the image is built according to the weight of the normal parallax value and the weight of the abnormal parallax value, wherein the basic data structure information is in an integral type. By means of the technical scheme, the bandwidth can be optimized.

The invention discloses a multi-core processor-oriented operating system noise control method, which belongs to the fields of operating systems and program analysis. The noise control method provided by the invention is implemented on a Linux kernel based on an isolation control method, and comprises the following steps of: setting a set of kernel control interface, dynamically setting a quiet central processing unit by using the interface and specifying a process onto the quiet central processing unit for running; and setting a kernel mechanism supporting quiet control, mainly comprising the modification of a kernel project, the setting of a new quiet central processing unit and prevention of influence on the quiet central processing unit. By the noise control method provided by the invention, the quiet processors required to be isolated are not required to be reset in a restarting way, and avoid the rebalancing of tasks, thereby realizing control over the noises of the operating system and providing good consistent experiences for the user of the operating system.

The invention provides a novel service-oriented internet of things system structure. A basic data structure of the network comprises seven tuples, namely application layer data, a source device identifier, a destination device identifier, a source service ID, a destination service ID, a source address identifier and a destination address identifier. A data packet is routed in a network through anaddress symbol and a service ID to realize service-to-service communication, a destination address symbol firstly sends a service request to a network device closest to a destination service ID, and then the network device sends the service request to a corresponding service process according to the destination service ID. The network architecture not only can be constructed independently, but also can be compatible with an existing TCP / IP network. According to the structure disclsosed in the invention, the service is taken as an object, the target of finding the service by the service is realized, the data structure of the routing protocol is reconstructed, the full separation of the equipment, the service and the address is realized, the security of the system is improved, and the identity and the attribute of the service carried by the equipment cannot be misjudged after the equipment moves.

The invention relates to the technical field of data structures, and discloses a script issuing scheduling method based on a time wheel. The method comprises the following steps: S1, receiving a scheduling task through the time wheel; S2, splitting the scheduling task into task queues according to time, and distributing the task queues into time slots corresponding to a time wheel; S3, storing the task queue into a time slot through a preset priority heap; S4, presetting a time wheel execution rule, and executing the task queue stored in the time wheel according to the time wheel execution rule. A time wheel is used as a scheduling basic data structure, a priority heap is added, and accurate scheduling of tasks is completed with small expenditure.