52 results about "Ergodic process" patented technology

The present invention provides the method and system that redistribute the nodes of a sorted tree to enable faster data insertion. Further, the tree typically contains a fixed number of levels, each comprising a fixed number of nodes. Each node in the tree is indexed and each leaf node may comprise a number of data segments. An increment is empirically calculated as space redistributed among non-empty leaf nodes. Furthermore, when a data segment is inserted and certain conditions are met, a data structure with a marked head and tail effectively “traverses” the tree from one end to the other searching for empty leaf nodes. In cases where the data structure encounters an empty leaf node, the data structure continues traversing unless empirically determined conditions stipulate that the process halts until the next data segment insertion before continuing. Moreover, in cases where the data structure encounters a non-empty leaf node, the contents of the node are copied from the head to the tail of the data structure. When the node has been copied, the data structure updates the tree to ensure that a lookup operation on the copied node remains valid and that the invariants of the tree hold before and after the redistribution. Furthermore, the contents in the head of the data structure are then deleted and the tail advanced to leave an increment amount of empty spaces in the traveling direction. The traversal process may then follow one of two possible paths of action: either continue traversing the tree or halt for the next data insertion before continuing.

This invention provides one product cloud shape property analysis method based on data dynamic memory module, which comprises the following steps: reading the output data from digital device into memory and establishing linear memory structure for data; then adopting 3D R*-tree for rapid space polymer sorting on data and to establish data dynamic memory; then in the browsing process, using current data point as aim point to get the local reference data set by use of Bezier curve accuracy near to point set to estimate curve rate ; finally mapping the data curve rate as RGB color mode.

The invention relates to a mobile communication technology field, in particular to an abnormal index analysis method. The method is implemented according to the following steps of: (1) establishing policies and setting corresponding service rules and motions; (2) regularly or immediately calling out corresponding policies according to the external trigger event; (3) extracting service data through a data service interface module and converting the data into fact data objects which can be identified by a rule engine; (4) adjusting the rule engine for carrying out intelligent matching of service rules and calling corresponding motions; (5) calling out corresponding sub-policies if the motion is associated with sub-policies and repeating the step (4) until the motion of service rule matched with the fact data object in the sub-policy is not associated with the sub-policy any more; and (6) recording the ergodic process of a policy tree and the analysis results of intermediate nodes, forming the final abnormal index analysis report and carrying out pre-warning. The method can automatically, quickly and accurately position to the reasons of events causing abnormal index.

The invention discloses a video coding method based on skipping of a coding unit layer in advance. The method comprises the following steps: reading a video sequence, wherein the video sequence comprises an N-frame image, and a coding frame number counter i is arranged to meet the equation of i=1; and coding an ith frame, judging whether the i (N,) exists, if yes, the equation of i=i+1 is arranged, and the next frame is coded, and otherwise, the process is over. According to the video coding method based on skipping of the coding unit layer in advance, the unnecessary calculation of coding depth is skipped in advance in the quadtree depth ergodic process, and thus coding time is saved. In addition, the coded massage of the same position of a previous frame is adopted to judge whether coding of a coding unit at current depth is skipped or not, the pre-calculation of a skipping mode of the coding unit at the depth which needs to be skipped is reserved, and therefore the coding depth and the pre-calculation mode which are very unlikely to be selected can be skipped only.

The invention relates to a decision making technique for the events, in order to solve the problem of decision-making simply and rapidly under the condition of a large amount of knowledge. The invention, for each event, can group each condition and become one group for the condition with identical prior probability and identical ' and , or ' relation to form one condition group, the corresponding relation table can be established according to the mapping relation between events, conditions and condition group, then the knowledge base for decision making is established based on the information in the relation table. A decision making application system for the events, which includes a server providing with the knowledge base and a computer connected with the server, can be established based on the knowledge base; the computer may receive one or more conditions inputted by user, the server, for every condition received, can carry out special ergodic process in the knowledge base, and look up out all condition groups with the condition, and the relative decision probability for one or more events can be figured out based on the information such as maximum probability or value of condition group, the satisfied condition number.

The invention discloses a form quality dynamical identification and modification control method in machining process. The form quality dynamical identification and modification control method in the machining process comprises the steps of (1) quality information real-time tracking, (2) form quality dynamic identification and (3) unusual form modification control, wherein the quality information real-time tracking is used for meeting the requirement that a large amount of bottom-layer data can reflect a present quality state of a workpiece form in the process of dynamic identification and modification, the form quality dynamic identification is used for carrying out data processing on acquired form quality information to acquire a dynamical quality product form, searching a form which is matched with the dynamical quality product form through an ergodic process form set and determining a belonging form type of the dynamical quality product form through similarity analysis, and the unusual form modification control is used for adopting a modification strategy ' deciding+choosing+calling' mechanism, dynamically carrying out modification control on a process exception form through a motion control unit and a motion executing mechanism. By the adoption of the form quality dynamical identification and modification control method in the machining process, the improvement of machining quality is benefited, the defects of quality is overcome in advance, quality cost is reduced, the improvement of production efficiency is benefited, off-line detection is avoided, sub-quality products can be machined again, and the economic benefit of an enterprise is improved.

The invention provides a method for processing OFDMA distance signals and a system thereof, which are used to process the distance signals of a wireless communication system which uses the OFDMA technique to obtain a practical ranging code and timing offset in a present ranging time slot. A normal ranging method in an existing technique is a bi-dimensional ergodic process, the complexity of computation is high, and a frequency domain difference ranging method has the problem that the detecting performance of the ranging code and the timing estimating performance are worse due to multi-user disturbance. The processing method of the invention and the system thereof firstly calculate frequency domain difference cross-correlation functions of neighboring carriers in a range channel, then a first screening threshold is calculated, a candidate key set is screened according to the first screening threshold, estimated timing offset is calculated, then, the cross-correlation functions and a second screening threshold between a ranging code frequency domain sequence and a local ranging code are calculated, finally, the practical timing offset is calculated, and the practical ranging code is screened from the candidate key set. The method and the system of the invention can guarantee the ranging accuracy and also can guarantee lower complexity of computation.

The invention discloses a method for reducing decoding time delay of a polarization code. The method comprises that an initial value of a logarithm likelihood ratio is calculated; recursive traversal is carried out on a decoding tree; special nodes carry out decoding in the traversal process; non-special nodes use a verification matrix to reduce decoding time delay in the traversal process; and a final decoding result is selected according to cyclic redundancy check. In the process of recursive traversal of the decoding tree in polarization code decoding, the verification matrix of the polarization code is used for verification, recursive traversal is not carried out on sub-nodes any more when verification fails, the decoding time delay is reduced effectively, and determination via the verification matrix can be carried out with other steps simultaneously, so no extra decoding time delay is caused. The method of the invention can be used to reduce decoding time delay of a successive cancel method substantially; compared with a classic low-time-delay brief propagation decoding method, the time delay characteristic of the method in the invention can approach that of brief propagation decoding, and the method of the invention is better than brief propagation decoding in the aspects of error rate performance and computing complexity; and the higher the signal to noise ratio is, the more obviously the decoding time delay is reduced.

The invention relates to Java card system rubbish recovery method comprising the following steps: 1) invoking rubbish reclamation realization function by Java card system,2) initializing the rubbish reclamation realization function in place mat zone, 3) traversing and marking objects in the bitmap by the trace gatherer, 4) clearing the objects corresponded by initialized value's bite in bitmap zone. The Java card system rubbish recovery method efficiently cleans up the space occupied by the Java card system (that is the objects which can not arrive in objects ergodic process) to make more reasonably utilize the limit memory space and to provide more sufficient space for download of application programs.

The invention is a scanning method for a device, comprising: device controller uses binary tree structure to construct binary unique identification and mask, and firstly makes ergodic searching of the binary tree by ergodic process and executing the steps as follows for each searched node: the device controller broadcasts a scanning command comprising the binary unique identification and mask; the device receives the scanning command and making matching procession on the unique identification in the scanning command and its own sequence number: if matching, sending a response containing its sequence number to the device controller. And the scanning method can largely reduce number of repeated scanning times and largely raising scanning efficiency and rate of the device, and solving the problem that scanning by exhaustion process has many scanning times and spends long time.

A method and system are described for validating process models. A process semantic model including a semantic directed graph including nodes associated with tasks and edges associated with a direction of flow of execution of the tasks may be obtained. Edges entering nodes include annotations including precondition semantic indicators associated with the entering edges and edges exiting nodes include annotations including postcondition semantic indicators associated with the exiting edges. The process semantic model may be traversed to determine a flow of execution of activities associated with the tasks based on visiting the nodes based on a depth-first traversal. A validity of execution associated with a flow of execution of the activities associated with the tasks may be determined based on checking a validity of execution status based on a semantic processing of one or more semantic annotation indicators associated with the precondition semantic indicators and the postcondition semantic indicators.

The invention discloses a method of SAS domain change non-fully ergodic discovery process, comprising the followings: an expander apparatus detects that the SAS link itself is changed, SAS domain state change information is reported to an SAS initiator, the SAS initiator sends the request for obtaining changed phy information to corresponding expander apparatus according to the SAS domain state change information; after the corresponding expander apparatus returns a response containing changed phy information, whether the change is added for the apparatus is judged according to the type of the connecting apparatus of the phy information; if so, DISCOVER request is sent corresponding to the phy ID of the phy information. Moreover, the invention further discloses a system of SAS domain change non-fully ergodic discovery process. The technical proposal disclosed by the invention can improve the operation performance of SAS memory system.

The invention discloses a flickering real-time calculation method which is used in flickering measurement and calculation of an electric energy quality on-line monitoring device. The flickering real-time calculation method comprises the following steps of: measuring flickering transient visibility data, and setting the data to be floating point numbers which are more than zero to form a measured data floating point number set; multiplying each floating point number in the measured data floating point number set with a coefficient to obtain a group of measured data integer sets; setting a group of statistical numbers; zeroing every element in the statistical number group, traversing the measured data integer sets, and once an integer is obtained, adding 1 to corresponding variables in the statistical number group; and after a traversing process is finished, obtaining the probability of the flickering transient visibility data. By the quick flickering calculation method, real-time calculation of flickering measurement can be finished; flickering indexes can be mastered in real time; and the power supply quality of a power grid can be monitored in real time.

The invention provides a computational holographic occlusion processing algorithm based on ray tracing and belongs to the field of holographic stereoscopic display and virtual reality. Firstly, a KD-Tree structure is constructed by spatially dividing a bounding box, the size of KD-Tree leaf nodes is controlled, and an occlusion relationship between objects is transformed into an occlusion relationship between the KD-Tree leaf nodes to achieve a ray tracing process. A plurality of rays are used for tracing the KD-Tree structure, and a visible object point traced by each ray is obtained according to the leaf nodes the return values of which are non-zero; corresponding sub-holograms in different viewpoints are sequentially combined to obtain a final hologram, a moving parallax effect is achieved at the same time, and a three-dimensional stereoscopic image of a given object is obtained according to the final hologram. A correct object occlusion effect in holographic imaging is achieved, the redundancy calculation in a traversal process is reduced, the ray tracing efficiency is improved, and fast intersection calculation of ray tracing of a point cloud model is achieved.

The invention discloses an attribute-topology based form concept calculation method of blog data. The attribute-topology based form concept calculation method includes: subjecting format background of the blog data to attribute topology expression, and degrading the attribute topology of the blog data to a graph with a starting point and an ending point by adding a global starting point and a global ending point and relevant edges; repeatedly searching and recalling attribute nodes in inherent order to complete transversal of paths through limitation of conditional constraint and calculation rules; acquiring all the form concepts of the blog data during transversal of all the paths between the global starting point and the global ending point. The attribute topology is structured into a complete entirety, the decomposition process of the attribute topology is avoided, and completeness of the calculation method is embodied; meanwhile, intuitive calculation process of the form concepts is acquired during transversal of the attribute topology.

The invention relates to a regulation and control system. The regulation and control system is used for regulation and control of the amplitude of femto second laser pulse light beam, and includes a femto second laser pulse light source, an MEMS quick regulation mirror system, a light spot position sensor and a signal processing system. The regulation and control system is characterized in that the MEMS quick regulation mirror system is arranged in the regulation and control system to form the second space of the core space of the regulation and control system; the MEMS quick regulation mirrorsystem is provided with a coherent microlens matrix which is formed by single MEMS microlens being able to implement the ergodic process; the single MEMS microlens has insensitive attribute for wavenumber; the signal processing system controls the MEMS quick regulation mirror system to regulate and control the light beam amplitude; the MEMS quick regulation mirror system regulates the coherent microlens matrix through the information processing system parallel pulse signals; and each single MEMS microlens and the axial included angle in the coherent microlens matrix are controlled by the parallel pulse signal amplitude.

Provided is a method for bounded model checking of an interrupt-driven system based on partial order reduction. According to the method, the partial order reduction is adopted to reduce paths and states in the bounded model checking state traversing process of the interrupt-driven system. According to the properties of the interrupt-driven system, first dependency relations between interrupt handling routines are defined; interdependence relations between the interrupt handling routines are obtained through static analysis and expressed with a matrix; finally, in the state space traversing process, when in a global state, a plurality of interrupts simultaneously meet the trigger conditions, and the interrupts generate a partial order path according to the interdependence relations and are executed to a new global state according to the path. The purpose of the method is to omit redundant traversing paths, reduce a state space and shorten verification time. The method has wide applicability, can greatly reduce model test time of the interrupt-driven system and is suitable for the interrupt-driven system comprising a large number of interrupts.

The invention discloses a traversal generation method of a multi-circle APM digital modulation constellation in a spatial modulation system. The APM digital modulation constellation generated by use of the method has a multi-circle structure; the constellation points in each circle conform to a traditional PSK modulation constellation of equiphase interval distribution; the signal constellation points in adjacent circles satisfy the condition of maximization of the minimum phase difference. The traversal method comprises the specific steps of 1, traversing the number of circles, 2, traversing the number of points in each circle, and 3, traversing the radius of each circle; in the traversing process, constellation preference is realized according to a measurement formula, and meanwhile, the traversing process is accelerated effectively by use of the measurement formula. The traversal generation method is capable of effectively obtaining the multi-circle APM digital modulation constellation and guaranteeing that the new APM modulation constellation is superior to the traditional PSK and QAM digital modulation constellations in performance. The APM digital modulation constellation can be generated once at the initial configuration stage of the system without causing extra influence and overhead to the actual transmission process of the system, and has a higher practical value and a better positive effect.

The invention provides a hierarchical data acquisition algorithm based on network topology. The method includes following steps: a main node refreshes route topology information and calculates the aging time Ti of each level of nodes; the main node sends data acquisition information until each level of nodes receive acquisition result information and upload the information to the main node; and the main node receives the data acquisition result information. The beneficial effects of the algorithm are that based on the conventional data acquisition algorithm, the network topology information and a network hierarchical structure are fully utilized so that hierarchical data acquisition is realized; compared with conventional traversal type data acquisition, according to the algorithm, all parent nodes in each level can simultaneously perform data acquisition on the lower level of sub-nodes so that the traversal path is reduced, the repetition degree of the traversal process is reduced, and rapid data acquisition can be realized; and compared with the conventional question-and-answer communication method, data acquisition can be simultaneously performed on multiple nodes so that the communication frequency is reduced, the communication time is shortened, and the data acquisition efficiency is improved.

The invention discloses a single-round kernel value maintenance method for multilateral updating under a dynamic graph. The method comprises a vertex kernel value maintenance single-round algorithm when a point or an edge is inserted and a vertex kernel value maintenance single-round algorithm when the point or the edge is deleted. Before updating the graph, a globally ordered node order is maintained. All edges are added into a single round by an insert point or edge kernel value maintenance algorithm at a time, then the vertexes are traversed in sequence, and the influence of the vertexes with the increased kernel values is moved to the vertexes with the high order until the kernel values of the vertexes are not changed. All the edges in a single round are deleted by using the kernel value maintenance algorithm of the deletion point or edge, traversal is started from the vertexes of the deleted edges, and the continuous iteration is carried out until the kernel values of all the vertexes are in a stable state. According to the method, the kernel value maintenance of all vertexes is completed through the single round of algorithm, the redundant calculation on the vertexes during the graph traversing process is reduced, the kernel value maintenance time is shortened, and the method has the extremely good expansibility and stability especially for the large-scale graphs.

The invention discloses a time offset estimation method and device of an OFDM system, a storage medium and a terminal. The time offset estimation method comprises the steps that data are received in advance by taking OFDM system timing as a reference, the total receiving time length is data obtained by adding 2N*Tnt to one subframe, the Tnt is the preset unit offset time length, and N is the maximum number of supported preset unit offset time lengths; data with the length of one subframe is taken out from the received data, and decimal times of time offset Tf are calculated based on the data;the received data is traversed by taking the Tint as a step length, data of one sub-frame each time is taken out and CFI; a judgment is determined the offset number n according to the CFI obtained inthe traversal process, wherein n is an integer and N (n(N; total offset deviation Delta is calculated as T, wherein Delat T= n*Tint+Tf. According to the scheme of the invention, time offset estimationwith low complexity and high reliability can be realized, and the timing synchronization requirement of the OFDM system is met.