49 results about "Dynamic data structures" patented technology

When a dynamic data structure is used for managing sparsely accessed data stored in memory of a digital computer, pages of the memory are dynamically allocated and de-allocated to respective portions of the dynamic data structure so that the pages become distributed over the portions of the dynamic data structure and the de-allocated pages include free pages that are mapped in the dynamic data structure and free pages that are not mapped in the dynamic data structure. To reduce memory fragmentation and recover memory, upon de-allocating a page of memory from a portion of the data structure, a determination is made whether or not to un-map the de-allocated page from the portion of the dynamic data structure so that un-mapping of the de-allocated page has a probability that is the inverse of a superlinear function of the number of allocated pages in the portion of the dynamic data structure.

Validating a computer system. An integrity check program is declared during booting of the computer system. It is determined whether the integrity check program quasi-periodically validates dynamic data structures of an operating system within a time interval.

The invention provides a device for building dynamic data structures and relationships based on condition rules. The device comprises a dynamic entity object model building module, a dynamic entity object deploying module and a dynamic entity object accessing module, wherein the dynamic entity object model building module has a function of enabling a user to define variable properties and relationships of entity objects; the dynamic entity object model building module is used for outputting an entity define file; the dynamic entity object deploying module is used for mapping an entity object model to a database physical storage structure by taking the entity define file as input to realize physical deploy of the dynamic entity objects; and the dynamic entity object accessing module is used for providing access service of the dynamic entity objects and enabling a user application program to create, use and store object instances. The invention also provides a method for building dynamic data structures and relationships based on condition rules. Through the device and method for building dynamic data structures and relationships based on condition rules, static data structures and relationships, commonly used for building systems, are broken through; and due to adoption of dynamic data structures and relationships, software developers can solve more complex business problems.

A method for generating a changing authentication input or password generation input for a user is provided. The method allows access to a computing device such as a smartphone or computer or using the computing device to communicate over a network to a server. Using recognizable objects displayed in positions on a graphic display, and input strings of text or alphanumeric characters the user has identified as related information relating to each recognizable object, a password or authentication can be generated by combining the input strings relating recognizable objects to paired related objects. Authentication can be varied easily for each access attempt by changing the recognizable objects displayed and/or the sequence of responses.

A method for generating a changing authentication input or password for a user is provided for accessing a computing device such as a smartphone or computer. Using objects displayed in sequential positions on a graphic display, and input strings of text or alphanumeric characters the user has related to each object, a password can be generated by placing the input strings in an order the same as the sequence. The password can be varied easily for each access attempt by changing the objects displayed and/or the sequence.

Exemplary embodiments described in this disclosure provide methods for managing a dynamic data structure in an electronic environment. The dynamic data structure can be created with at least one customizable field, at least one customizable headline, and at least one customizable entry. Embodiments of the method include prompting a user to input data related to at least one customizable field associated with at least one customizable entry in the data structure and prompting the user to input data related to at least one customizable headline associated with at least one customizable entry in the data structure. Embodiments also include receiving user input to update at least a portion of the data structure and receiving user input to save the data structure.

An Active User Registry system includes a database which is integrated with the POTS network and a packet network to exploit the outstanding strengths of both of its constituents. The Active User Registry database is a dynamic data structure of all the ways in which one or more users can be reached via some type of communication network. A key feature of the Active User Registry is the ability to broker between a subscriber's request for communications contact information corresponding to a user and the user's preferences of being reached by various communications alternatives.

The present invention relates to a network node, method and computer program product for processing a data flow based on a context information, wherein a dynamic data structure (DIF) associated with an active data flow is created, when a data packet belonging to said active data flow is received. At least a portion of a determined secondary context information of the received data packet is stored in said dynamic data structure and subsequent data packets of the active data flow are processed based on the content of the dynamic data structure. Accordingly, secondary PDP context can be supported when differential processing is applied.

The invention discloses a dynamic invoice template based invoice issuing system. The dynamic invoice template based invoice issuing system comprises a data receiving module which is used for receiving source data and verifying the validity of the source data, a data analysis module which is connected with the data receiving module and used for extracting verified source data from the data receiving module and analyzing the source data to data which can be recognized by the system and be stored, a dynamic establishment module which is connected with the data analysis module, dynamically establishes an invoice issuing template, user interface elements and logical function elements according to contents of the data which can be recognized by the system. The dynamic invoice template based invoice issuing system, dynamic generation of the invoice issuing template serves as a core, user procedures related to invoice issuing are performed through a mode of dynamic data structure generation, repeat labor of developers during processing of different invoice categories are greatly reduced, the code compiling amount is reduced, and accordingly the software development efficiency is improved and the error risks are reduced.

A computer system is provided for retrospectively processing a data structure that includes a plurality of entries. The computer system determines if certain data transactions requests that have been recorded in the data structure could have been executed differently (e.g., by being processed at an earlier point in time). For a given entry in the data structure, the system determines if data transaction quest could have at least partly succeeded against a prior recorded state of at least one of two ordered lists of pending data transaction requests. Another entry is then found that caused the initial entry to fail in execution and a time delta is stored between the timestamp of the another entry and the timestamp of the initial entry.

In one embodiment, a set of lock and unlock instructions in a read phase of a computer-readable program is replaced with a first set of tracking instructions, wherein the first set of tracking instructions track a set of locked objects identifying objects that would have been locked by executing the set of lock and unlock instructions. A second set of tracking instructions is inserted into the read phase of the computer-readable program, wherein the second set of tracking instructions track a set of read objects indicating versions of objects that are read. Validation instructions are inserted into the computer-readable program, wherein the validation instructions validate that the versions of objects in the set of read objects have not changed since they were last read and lock the set of locked objects that would have been locked upon completing execution of the set of lock and unlock instructions. Update instructions are added to an update phase of the computer-readable program, where the update instructions increment a current version of an object each time a value of the object is updated or a lock of the object is released.

The invention provides an adaptive cardinal number tree dynamic indexing method based on GPU parallelism. Firstly, an adaptive cardinal number tree data structure is constructed; the first two layerscreate tree nodes of the Node256 type; a cardinal number sequencing method based on high-order priority is created for the third layer and the fourth layer; tree nodes capable of accommodating corresponding sizes are created according to the number of the branches; the creation of a dynamic data structure is realized; it can be ensured that the latest update in the original batch of data is stillbehind the old update after sorting; and de-duplication is performed, redundant old updates are removed, latest updates are reserved, each section of sequence without duplicate data is inserted into anode corresponding to the section after duplicate removal to finish the establishment of the whole self-adaptive cardinal number tree, and secondly, data insertion, query and deletion operations canbe performed in parallel based on GPU parallel computing capability.

A method of producing dynamic controllable data composites from two or more data segments includes: building or training one or more function mappers to map between one or more extracted feature envelopes sets from the original data and one or more general parametric representations of the data; combining the extracted feature envelopes or the function mappers using two or more audio segments; and feeding the extracted feature envelopes or combined feature envelopes to the function mappers to obtain synthesis parameters to drive a synthesis process.

The invention discloses an OpenCV-based automatic face recognition book sorting and shelving robot system. The invention relates to a library book automatic sorting and shelving robot which integratesthe work of borrowing, returning, checking, classifying, shelving and the like of books. An OpenCV-based face recognition technology is introduced for a reader to borrow or return books. The full name of OpenCV is an Open Source Computer Vision Library. OpenCV can easily process image output and input, memory allocation and conversion, matrix operation, linear operation, support for multiple dynamic data structures, basic image processing work, structure analysis algorithm, camera calibration algorithm, motion analysis of target objects, visualization, image labeling and the like of images.

An embodiment of the invention provides a multi-business interactive processing method and network equipment and solves the problems that the network equipment is high in time resource consumption during multi-business processing and high in management resource expense. The method includes: mounting a predefined dynamic data structure on a message entering the network equipment; acquiring the information required by executing the tasks corresponding to the current business processing module passed by the message from the dynamic data structure; executing the tasks corresponding to the current business processing module passed by the message according to the information; updating the data obtained after the tasks are executed to the dynamic data structure.

The invention discloses an edge computing data auditing system and an auditing method based on a hash binary tree, and belongs to the field of information security. According to the characteristics ofthe MEC, a new public auditing protocol is provided, the protocol not only can resist replay attacks, forgery attacks and substitution attacks which are easily suffered by a traditional auditing protocol, but also can resist intrusion attacks in an MEC environment, and the safety requirement of the MEC is met. The invention further provides a new dynamic data structure, the height of an MHT (Merkle Hash Tree) in a traditional auditing protocol can be reduced, and auditing efficiency is improved.

The invention discloses a personalized dynamic data structure design method applied to a SaaS (Software as a Service) cloud system. The method comprises the following steps of: S1, designing a data table dyn-struct; S2, designing a data table dyn-data; S3, performing personalized data storage. According to the invention, by design of a dynamic data structure, a function of providing personalized services for different SAAS system users is realized, and the problem of design and storage of the personalized data structure in a SaaS mode is solved well.