953 results about "Relationship - Father" patented technology

The invention provides a method and a system for processing data in treelike structures. The method comprises the following steps that: the root nodes of all the treelike structures are numbered by increasing digitals, wherein the root nodes of each treelike structure are the first stage, and the leaf node having a depth of i is the i+1 stage, wherein i is an integer greater than or equal to 2; a plurality of nodes belonging to the nodes having a depth of i-1 in the nodes having the depth of i in the same treelike structure are numbered by increasing digitals, and a serial number field is configured for each node on the treelike structure, wherein the serial number of one node is formed by sequencing the serial numbers of all the father nodes of the node at the respective depths according to the order from small to large of the depths, and the serial numbers of two of the father nodes are spaced via a preset symbol; all the nodes of the treelike structures are stored in a database by means of sequential storage; and data corresponding to all the nodes of the treelike structures are processed according to the serial numbers of the nodes.

The invention provides a block chain block-building method based on the parallel PipeLine technology. The block chain block-building method is characterized by comprising following steps of (1) storing data in a bucketing manner; (2) establishing a temporary data index; (3) changing a trigger point of a new round of block building; (4) processing remaining business; and (5) carrying out father Hash assignment operation. By means of the block chain block-building method, the computer resource on each node can be utilized fully, the block-building efficiency and the system scalability can be improved, the capacity of the CPU and the memory of the node is increased, the response speed of the system is further increased, the block-building information integrity and the block sequence are guaranteed by means of the bucket model, and are not affected by network delay and the like, and the block chain block-building method has good portability and can be applied in different block-building schemes.

A method for picking up and gathering micro-content of web page includes inputting web page address at user end, transmitting legal content to micro-content analysis subsystem of web page at server end then labeling different micro-content block or column as per superchaining group, transmitting labeled html text content back to user end, selecting original micro-content or its father node and adding it on micro-content desk subsystem at user end for finalizing desk arrangement.

Process for managing the representation of at least one model of a scene including buildings intended to be transmitted by storage means to a client, said scene being modelled by a multi-scale tree-structured representation, in which different nodes are associated with the different levels of details of the scene, these different nodes being dependent on each other in a tree structure in which at least one son node is defined by informations known by a father node and by additional informations, the informations stored by the storage means in respect of the son node being these additional informations, characterised in that a processing operation to simplify the representation is applied to the modelling and in that priorities for implementing the simplification processing operations are determined by determining a cost function which takes account of the criterion of the difference in height of the merged buildings.

A monitoring method and system for process comprises sending designated signal to the father process of the said son process when the son process retracts, with the designated signal composed of process marker that corresponds to a son process, with the said father process identifying the retracted son process based on the received signal. The system comprises son process handling unit and father process handling unit. Using this said method and system, it can make timely monitoring to the process abnormal retracting, with all kinds of son process retracting circumstances and corresponding abnormal retracting reasons.

The invention is nerve net system which can realize heredity arithmetic. It is made up of computer nerve net model component and the interfaces. The character lies in: 1. after that the computer setsthe population size, coding type and length, heredity operation probability and the arithmetic ending condition of the arithmetic, the nerve net uses population size to realize the whole heredity operation including selection, crossing, mutation and personal adaptability value, and outputs the optimized calculation and result through computer; 2. designs the heredity operation nerve net model which can realize multi-father crossing operation and multi-gene mutation operation, realizes the two operation of two-value coding heredity arithmetic and real number coding heredity arithmetic.

The invention discloses a method for segmenting HMT images which is based on the nonsubsampled Contourlet transformation. The method mainly solves the problem that the prior segmentation method has poor area consistency and edge preservation, and comprises the following steps: (1) performing the nonsubsampled Contourlet transformation to images to be segmented and training images of all categories to obtain multi-scale transformation coefficients; (2) according to the nonsubsampled Contourlet transformation coefficients of the training images and the hidden markov tree which represents the one-to-one father and son state relationship, reckoning the model parameters; (3) calculating the corresponding likelihood values of the images to be segmented in all scale coefficient subbands, and classifying by examining possibility after integrating a labeled tree with a multi-scale likelihood function to obtain the maximum multi-scale; (4) updating category labels for each scale based on the context information context-5 model; and (5) with the consideration of the markov random field model and the information about correlation between two adjacent pixel spaces in the images to be segmented, updating the category labels to obtain the final segmentation results. The invention has the advantages of good area consistency and edge preservation, and can be applied to the segmentation for synthesizing grainy images.

An embodiment of the invention provides a data update method for a Key-Value storage system via distributed key values. Through replication of nodes requiring update, father nodes, ancestor nodes, and root nodes to a buffer layer of the Key-Value storage system, modification of key values and contents of the nodes requiring update, the father nodes, and the ancestor nodes, and modification of the contents of the root nodes, the nodes are made different from original nodes in the storage layer. The method is characterized in that, the nodes requiring update, the father nodes, and the ancestor nodes are first stored in the storage layer, and then the root nodes are stored in a key value pair system. Since the nodes requiring update in the buffer layer are stored in the storage layer prior to storage of the root nodes in the buffer layer in the storage layer, reading operation in the storage process of the nodes requiring update does not enable reading of the nodes requiring update, thereby preventing reading of dirty data. The invention also provides a corresponding method for reading index nodes and a server.

The invention applied to the field of computer graphics interface design provides a combination of the interface development system and the control methods. The system's basic interface elements as virtual window, which covers the virtual window attributes, including: size, compared to his father virtual window position for the virtual window marked by the other virtual window contains the attributes and labels used to produce the script callback events. Implementation of this invention virtual window through the use of the unique attributes, use scripting language description of the father and son relationship between virtual window, space and function call location, convenient, speedy realization of the existence of multiple virtual window splicing into a new, more functional powerful virtual window, thus enhancing the control of the expansion and reuse, an increase of the types of controls, making the development of the interface flexibility and development efficiency has been greatly increased.

Embodiments of the invention provide a directed acyclic graph type block chain generation method and system, and belong to the technical field of block chains. The method comprises the steps of collecting information from an information source and packaging the information to form first block body data of a new block; on a currently formed block chain, selecting at least one block as a father block of the new block; generating a character string with a fixed length by block body data and block head data in the determined father block through a non-invertible algorithm, and adding the character string to a block head of the new block; and cyclically executing the abovementioned operations to form a block chain in a form that the block chain adopts a directed acyclic graph structure as a whole, and at least one block has two or more father blocks. According to the scheme, based on an existing block chain, a public sub-block is derived at the back ends of any at least two blocks to meet a complex organization demand of the data.

The invention discloses a display method and a display device of a large-scale network node topological structure. The display method comprises the following steps of: loading node data and relational data of nodes in a network, wherein the node data comprises nodes of all levels and subordination relations among the nodes, and the relational data is used for indicating connection relations among the nodes; when a user selects a node as an attention node, displaying child nodes of the attention node, same-level nodes which have connection relations with the attention node and belong to the same father node and nodes which have connection relations with the attention node and the levels higher than that of the attention node according to the node data; and displaying connection relations among the displayed nodes according to the relational data. The invention can visually show the topological structure of the attention node, and enable the showing efficiency to improve.

The present invention provides an automatic recovery method for process. It uses the process must be monitored as father process, said father process can be used for producing several subprocesses, the several subprocesses are set into a working group process, and said father process can be used for monitoring the abnormality of subprocess in the working group by means of exchange semaphore module, and can make the subprocess be exited from the working group and can produce a group of subprocess again as working group process so as to implement the automatic recovery of the process.

The invention discloses a multiple page browsers window disassembling method, merging method and multiple page browsers. A multiple page browser windows disassembling method includes: acquiring the information of the father window that the sub-windows attribute to in the multiple page browser; setting the father window that the sub-windows attribute to as the system table, which makes the sub-windows separate from the multiple page browser. The invention can flexibly display the windows of the web page, and facilitate the management of users to the browser windows.

The invention discloses a method for locating a power distribution network 10kV feeder line fault based on matrix operation, and belongs to the technical field of power distribution network automation. The technical problem to be solved is the fault locating of a power distribution network medium voltage 10kV feeder line. The method comprises the steps that a power distribution network initial power supply path matrix H is formed according to the topological structure of the power distribution network feeder line, the H is amended to obtain an amended path matrix H' so as to solve the problem of repeated fault locating, fault information is obtained through an FTU, operation processing is carried out on the amended path matrix H' according to the fault information, then an initial judgment matrix P' is formed, a fault judgment matrix P is finally obtained, father nodes in a fault area can be judged effectively according to coherent elements in the P, and then the fault area is obtained. By means of the method, the power distribution network feeder line fault is located, the judgment principle is simple and effective, no complex matrix multiplication operation is required, and the aim of locating feeder line tail end faults can be well achieved.

A three-dimensional human body motion trace method based on a multi-camera in the computer vision technical field has the following steps: firstly, tissue data points on the human body surface are picked up and outmost points are obtained through processing the tissue data; secondly, a standard three-dimensional skeleton model which is used for dynamic posture adjustment of the model during the trace process is established before skeleton pick-up and human body motion trace, thereby realizing fitting of the model and an original three-dimensional image; thirdly, a skeleton observation method is established and the skeleton model posture is adjusted according to the status that whether the number of the tissue points in each section of bone sleeve is maximal; fourthly, an implementation approach of optimal matching skeleton is established and the state that whether the current skeleton pose has met the trace requirements or not is judged through changing the space positions of root nodes and the angle of rotation of each boot section winding around the father node. The invention can quickly get the human body three-dimensional skeleton based on the existing human body tissue data, thereby realizing the human body motion trace.

The invention provides a method for protecting Java program progress based on an inheritance relationship among the progresses, wherein the method is used for protecting the Java program (the program developed by the Java programming language, hereinafter referred to as Java program) in a windows system (a name of an operating system). The method is mainly used for solving the authentication and determination of the protected Java program progress, monitoring the operating state of the Java program, and preventing the unexpected ending of the operation. The method establishes a father and soninheritance relationship between the protected Java program progress and the protecting program progress, uniquely determines the protected Java program progress by the protecting program progress based on the inheritance relationship and determines the operating state of the protected Java progress based on the inner core object state of the protected Java program progress.

The invention provides an unmanned aerial vehicle three-dimensional airway planning method based on space compression and table-lookup calculation, and mainly relates to the field of airway planning, in particular to the field of unmanned aerial vehicle three-dimensional airway planning. Unmanned aerial vehicle online rapid three-dimensional airway planning is achieved. On the basis of the standard A* algorithm, jump extension of the similar sparse A * algorithm is adopted, child nodes are changed to plane discretization distribution, and by means of a way of optimal compression in the height direction, the relative relation between the child nodes and a father node is calculated in advance, tabulated and stored; the table is looked up to obtain a value for each time of extension, the search space data structure is improved, the planning space can be repeatedly used during repeated airway planning, and the reinitialization time is saved. According to the method, on the basis of reserving the advantages of an original algorithm, the number of the nodes is greatly reduced, the algorithm efficiency is improved, and the replanning ability of the algorithm is improved.

The invention discloses a storing and updating method of local page of browser, which comprises the following steps: recording the structure and version mark SV-ID of random node in the local page system of the browser; making the structure mark S-ID contain joint number of each node on the path from joint to joint; making local link contain directional successor node SV-ID; transmitting upward request with SV-ID of each node on the path from root node to local page node through browser after the user clicks the external linkage; returning SV-ID on the server of local page different from first version to the browser after the server receives the SV-ID; updating the version mark of local linkage in the father node of local page node after the browser receives SV-ID; judging whether the local page needs to be updated and finishes the updating according to the linked SV-ID when the user clicks the local linkage. The invention can finish the updating of local page automatically and reliably, which doesn't influence the browsing feel for users.

The invention belongs to the field of displaying and control of a terminal interface and provides a system and a method for generating an interface. The system comprises a user interface (UI), a configuration file resolver, a control generator and a control searcher, wherein the UI is used for sending an interface configuration instruction to the configuration file resolver; the interface configuration instruction comprises an interface configuration file name and a father control of a needed configuration interface; the configuration file resolver is used for reading and resolving a corresponding configuration file according to the interface configuration instruction so as to generate a control attribute linked list; the control generator is used for generating a control according to the control attribute linked list and storing the generated control into a control linked list; the control generator is used for searching an appointed control from the control linked list; and the UI acquires the corresponding control through the control searcher. By using the system and the method, the diversity of interface displaying is realized conveniently; and popularization of a display terminal is facilitated.

The invention discloses a wireless sensor network routing method and system based on a tree network. The method comprises the following steps: building a tree network structure based on backbone nodes and allocating address for each backbone node in the tree network structure; increasing non-tree paths among the backbone nodes to build a mesh network structure; a one-hop child node selecting a backbone node as own father node according to own position and energy and the father node allocating addresses with different low orders for the one-hop child node contained in the father node; searching for address blocks, forwarding the data packets and finding paths to build multiple backup paths; and starting a backup path when single point failure exists in the network. The invention well reduces the sensor network delay, improves the reliability and shortens the network restoration time.

The invention discloses a key derivation method and device applicable to digital currency and belongs to the field of information security. The key derivation method applicable to digital currency comprises the steps of splicing indexes of father public keys and sub-key indexes according to a sequence; using father chain codes as Hash keys, and calculating Hash values of spliced data based on a preset algorithm; obtaining sub-chain codes based on the Hash values; performing ECC (Elliptic Curve Cryptography) addition modular operation on captured residual data; if the operation results are not preset values, regarding the operation results as sub-private keys; and performing ECC point multiplication operation on the sub-private keys to obtain sub-public keys. The key derivation method and device applicable to digital currency have the beneficial effects that backup of key seeds rather than all the keys is required as all the keys can be derived based on the key seeds, the backup volume is small, and loss caused by key damage also can be avoided.

The embodiment of the invention relates to a method for preventing apparent death of a multi-page browser. A page window is taken as a top window, and the father-son relationship between the page window and a main-frame window is eliminated to lead the page window and the main-frame window to be at the same level; and the page window and the main-frame window with the father-son relationship eliminated are communicated with each other in an asynchronous mode. The embodiment of the invention also provides a device for preventing apparent death of the multi-page browser. In the embodiment of the invention, the main-frame window returns back immediately after sending out a massage without waiting for the processing of the page window through eliminating the father-son relationship between the main-frame window and the page window and adopting an asynchronous communication mode between the main-frame window and the page window, so that even if the page window can not respond, the main-frame window can not be affected, and the problem that apparent death of one page window results in apparent death of the whole browser is solved, therefore, the experience of a user is improved.

The invention relates to a processing method and a device of tree type data. The method includes obtaining a father node and child nodes of the tree type data; displaying the structure of the tree type data in a set mode according to the subjection relations between the father node and the child nodes and between the child nodes; and starting from one side of the boundary of the set at the outermost layer to number boundary points of each set sequentially, wherein the numbers at two sides of the boundary of each set are used for limiting the range of the set. According to the method and the device, the problem of insufficient structural management of the tree type data in the prior art is solved, the management of the tree type data is more efficient, the query performance is higher, simultaneously, limit of the tree type data hierarchy is eliminated, and the method and the device are particularly suitable for the management of mass tree type data such as a family tree, a gene spectrum and a bill of material (BOM).

The invention discloses an inter-frame module selecting method based on a three-dimensional wavelet video code, comprising the following steps of: step 1), utilizing mean absolute difference values MAD (Mean Absolute Difference), MADV (Vertical Mean Absolute Difference) and MADH (Horizontal Mean Absolute Difference) of a father block pixel as references of texture complexity; selecting one from child types including child1, child2 and child3; if selecting the child type child1, executing step 4); otherwise, executing step 2); step 2), calculating respective mean values of two sub-blocks of the corresponding child type and calculating the difference of the two mean values; step 3), selecting a specific binary tree dividing module according to the mean value differences; and step 4), finally, comparing a father block movement compensation value with the sum of child movement compensation values; if the father movement compensation value is small, not carrying out block division; and if the child movement compensation values are small, keeping the corresponding child type and carrying out the block division. According to the inter-frame module selecting method disclosed by the invention, a mixed quartic tree and binary tree dividing method is adopted, the flexibility of the block division is improved; and texture threshold value information is adopted so that an amount of time complexity of an algorithm can not be increased.

The invention discloses an IP address ownership information indexing and fast querying method. The method includes the first step that an ownership information configuration file is selected or built; the second step that CIDR block records in the configuration file are read and each record is built as a new node of a query tree; if a block belongs to an IPV4 address block or an IPV6 address block, and a head node corresponding to a query sub-tree of the IPV4 or a query sub-tree of the IPV6 is empty, then the new node is used as the head node, or the corresponding head nodes are selected to carry out transversal on the query sub-tree until conditions are met (the transversal is carried out to reach leaf nodes, or comparing bits of current nodes are larger than the new node and comprises CIDR block information), and joint network prefix length L of the current nodes and the new node is calculated, if the L is larger than the comparing bits of the current nodes, the L will return to father nodes and the father nodes are set as the current nodes; the insertion position of the new node is determined according to the L value and the current nodes and the ownership information of the L value is associated to the new node. The IP address ownership information indexing and fast querying method has higher querying efficiency.

The invention discloses a method and a system for creating and drawing an interface control tree and a mobile terminal. A specific control class derived from an interface control base class is created to generate animating nodes, interface container controls and interface control nodes, timer callback functions of the animating nodes are created, and the interface control tree and class objects are created and generated by combing father-son-brother relations of all control nodes by creating the interface control base class and operational functions of the interface control base class, animation control functions and tag status, the current frame animation content preparation functions and animating content functions. Only drawing preparation functions of root node animating nodes are interacted with the system to achieve the aim of animation effect of the drawn interface control tree. The drawing effects of the control tree are uniformed through the time cycle of an animation timer; the technical problems that interface controls are difficult to mutually contain so as to form complicated control systems are solved; and a complicated control layout is organized in a screen page to efficiently achieve the animation effects of the whole system.

The invention discloses a task processing method and a task processing device. The main technical scheme comprises: acquiring a pre-generated task list, wherein the task list internally comprises logic relationship among the tasks represented by the relationship of father and son nodes, task records corresponding to each node, and scanning priority information generated for nodes of father nodes as the lower layer nodes for each layer; and according to the scanning priority information, and aiming at each node corresponding to each priority, respectively executing: executing the tasks according to the task records corresponding to the current nodes if the current nodes corresponding to the current priority are root nodes, and executing the tasks according to the task records of the current nodes if the current nodes corresponding to the current priority are not root nodes, and executing the tasks according to the task records of the current nodes when the tasks corresponding to the father nodes of the current nodes are determined to be executed successfully. According to the technical scheme, the task processing method and the task processing device can be suitable for more task logic relationship structures, and the task executing process does not rely on the task executing procedure stipulated in task allocation.

The invention relates to a three-dimensional ring visualization method of a multi-branch tree data structure. The method comprises the following steps: 1) establishing the mapping relationship between the multi-branch tree data nodes and the nodes in the visualization methods to realize that the node information expressed by the visual nodes in each visualization method correspond to that of the corresponding multi-branch tree data nodes; 2) determining the node data of the multi-branch tree data structure and the information visual parameter; 3) determining the parameters of the visual nodes; 4) determining the expression way of the relationships of nodes (the relationship of brother nodes and the relationship of father and son nodes), modifying or adding the related parameters of the visual nodes with the expression demand; and 5) according to the parameters set by the step 2), 3) and 4), combining the information visualization of the multi-branch tree data nodes with the visual curved nodes to realize the three-dimensional visualization display of the multi-branch tree; and ensuring that the overall visual shape of the combined nodes still corresponds the characteristics of thearc body, and maintaining the characteristics of layers, clusters and other structures. The method is simple and has good application effect.