259 results about "Interference graph" patented technology

Loop allocation for optimizing compilers includes the generation of a program dependence graph for a source code segment. Control dependence graph representations of the nested loops, from innermost to outermost, are generated and data dependence graph representations are generated for each level of nested loop as constrained by the control dependence graph. An interference graph is generated with the nodes of the data dependence graph. Weights are generated for the edges of the interference graph reflecting the affinity between statements represented by the nodes joined by the edges. Nodes in the interference graph are given weights reflecting resource usage by the statements associated with the nodes. The interference graph is partitioned using a profitability test based on the weights of edges and nodes and on a correctness test based on the reachability of nodes in the data dependence graph. Code is emitted based on the partitioned interference graph.

Methods and apparatus for allocating and using stack space are disclosed. According to one aspect of the present invention, a computer-implemented method for allocating stack space in an object-based system includes obtaining source code that is suitable for compilation and includes a definition associated with a variable. During register allocation, stack slots and machine registers are treated substantially similarly. This includes the steps of building an interference graph, copy coalescing, attempting to color the interference graph, and determining if the attempt to color the interference graph is successful. If the coloring attempt is not successful, then in lieu of normal spill code being inserted, register-to-register copies, e.g., "reg-reg" copies, are inserted in the source code. The "reg-reg" copies include copies associated with both stack slots and machine registers.

Embodiments of the present invention provide a method and system for optimizing processor register allocation. Variables from an acyclic call graph having a plurality of functions may be identified and a plurality of virtual registers may be created by assigning each of the identified variables to at least one virtual register. An interference graph may be constructed based on the plurality of virtual registers and may be colored with a plurality of physical registers. If the interference graph is not colorable, then at least one virtual register may be spilled from the interference graph.

The invention discloses a coal mine area surface deformation monitoring method based on a lifting rail time sequence InSAR. The coal mine area surface deformation monitoring method is characterized bycomprising the steps of acquiring a plurality of scene SAR images of C and X wave bands, generating a short baseline set, differentiating an interference pattern, acquiring a high coherence point, constructing an equation, acquiring surface deformation information and the like. Compared with the prior art, the coal mine area surface deformation monitoring method has the advantages of breaking through the limitation that a single SAR satellite platform InSAR technology can only obtain deformation information in a radar sight line direction, effectively weakens the influences of space-time incoherence, phase unwrapping errors, atmospheric delay errors and the like, improves the precision and reliability of the InSAR technology for monitoring surface deformation information, and promotes thewide application of the InSAR technology in the field of deformation monitoring.

A method and apparatus are described including scanning a channel, generating a report for the scanned channel, transmitting the channel report to an associated access point and receiving a channel assignment responsive to said channel report. Also described are a method and apparatus including scanning a channel, generating a first channel report, receiving a second channel report from an associated client, transmitting the first channel report and the second channel report to a server, receiving a channel assignment message from the server responsive to the first and second channel reports and transmitting the channel assignment message to the associated client. Further described are a method and apparatus including receiving a channel report from an associated access point, building an interference graph responsive to the channel report, determining channel assignments based on the interference graph and transmitting a channel assignment message to the associated access point.

The invention pertains to an optimization method for a compiler, comprising providing a model of inter-operand constraints of physical registers of a target-platform of a compilation; and a) providing an intermediate representation of a source code using virtual registers; b) grouping the virtual registers of the intermediate representation based on the model of inter-operand constraints into two or more groups, each group comprising at least one virtual register; c) if for at least one group at least one interference of virtual registers within the group occurs, amending the intermediate representation to resolve at least one interference and jumping to step b); otherwise d) providing a representation of a group interference graph of interferences between the groups; and e) allocating virtual registers to physical registers using a coloring scheme on the representation of the group interference graph. The invention also refers to a corresponding optimizer for a compiler and a computer-readable storage medium storing optimizing code.

A method allocates radio channel resources in an orthogonal frequency-division multiple access network including a set of base stations (BS) and a set of mobile stations (MS). For each BS, a diversity set is maintained for the sets of MS. Each BS determines possible interference at the MS based on the diversity set. A graph is constructed, in which nodes represent the sets of MS, mid each edge between a pair of nodes represents channel interference between the MS represented by the pair of nodes. A weight is assigned to each edge, which reflects interference between the two MSs connected by the edge. The interference graph is partitioned into non-overlapping clusters of nodes based on a structure of the interference graph, the potential interference, so that a sum of the weights of the edges between each cluster is maximized. Based upon the graph partitioning, the channel resources are allocated to the mobile stations in order to maximize the system capacity.

An improved method is provided for performing register allocation in a compiler. This method determines the allocation of a plurality R of registers of a processor for use during the execution of a software program. The register allocation process is treated as a graph-coloring problem, such that an interference graph is constructed for the software program, the graph is simplified, and an R-coloring the interference graph to the extent possible is attempted. Then, spill code is inserted in the software program each for each uncolored node of the graph, a new interference graph is constructed, and the process is repeated. During the simplification process, nodes with degree greater than or equal to R are removed from the graph in an order dictated by a spill cost metric. During the coloring process, these same nodes are reinserted in the graph in an order dictated by reapplying the spill cost metric.

The invention provides a point diffraction interferometer and comprises a light source module, a mask which can produce an ideal spherical wave, an optical diffraction component which can produce multi-level sub-diffraction light, an image sensor and an optical component. The measured optical component is arranged between the mask and the optical diffraction component and the diffraction light of some levels can permeate the optical component completely, wherein, the diffraction light of a certain level can permeate the optical component partly while being diffracted partly; the diffraction light of some levels can permeate the optical component completely, wherein, the diffraction light of a certain level can be diffracted or the optical component consists of a plurality of windows and a plurality of small holes; diffraction light of some levels can selectively permeate the window, however, the non-diffracted light can be diffracted through the small hole on the optical component. The point diffraction interferometer of the invention conducts measurement through a plurality of interference graphs which are produced at the same time and the sampling frequency is improved, moreover, the design and operation of the whole system is simplified and the motion error of a phase-shift component can be avoided.

The invention discloses a time sequence InSAR deformation monitoring method and system based on high resolution. The method comprises the steps of carrying out registration, differential interferenceprocessing and elevation removal processing on a surface SAR image; identifying PS points in the image; thinning the PS points of which the point density exceeds a set threshold value; constructing atriangulation network for the thinned PS points; differentiating the phases of the adjacent PS points in the triangulation network, obtaining a deformation rate difference and an elevation correctiondifference between the adjacent PS points through a solution space search method, and calculating the residual phase of each PS point according to the deformation rate difference and the elevation correction difference; separating an atmospheric delay phase from the residual phase, and carrying out interpolation processing on the atmospheric delay phase; removing the atmospheric delay phase from the differential interferogram, repeating the above steps for iteration, obtaining an image after the atmospheric delay phase is removed for many times, carrying out the phase unwrapping of the image,carrying out analysis on all PS points, and determining the deformation rate of the ground surface. According to the invention, the image processing rate is improved.

By decomposing (i.e., dividing) an interference graph into subgraphs, it becomes feasible to compute close approximations of an optimal channel allocation scheme within a reasonable amount of time. The channel allocation scheme may be used to allocate specific channels to access points (APs) in a wireless, local area network (WLAN).

The invention discloses a semi-structured transmission dispatching method orienting wireless sensor network data collection. The method is characterized by comprising the steps that 1, breadth-first search is carried out on a network communication graph, so that a slack semi-structured data collection route topological graph is constructed; 2, a link interference graph is constructed according to the main interference and subsidiary interference relation between transmission links in a network; 3, link weight interference factors are defined, so that the interference intensity caused to other links of the network from transmission loads of sending nodes and sending links is comprehensively weighed; 4, the dynamic link selection and time slot allocation strategy based on preference of the minimum weight is carried out; 5, a node dormant state is controlled in an explicit mode, and a data collection period is adjusted in a self-adaptive mode. According to the method, routing and dispatching are designed in a unified mode on the basis of a cross-layer design idea, the time slot utilization rate of dispatching is increased by fully utilizing the redundancy of a path, time delay of data collection is shortened, and the handling capacity of the network is improved. The method is applied to the wireless sensor network with the high requirement for the real-time property.

An improved register allocation technique is provided. An interference graph coloring is attempted multiple times prior to spilling one or more nodes. Each node has a spill cost derived from the time it takes to store and recall the variable's data combined with how often the compiler thinks the variable is needed. Similarly, each coloring failure has a spill cost which is the accumulation of the spill costs of the remaining un-colorable nodes. If any solutions are found, the process is complete. If only failures are found, the cheapest node(s) to spill is evaluated based on the multiple failures. In one embodiment, the cheapest node of the cheapest failure is spilled. In another embodiment, the cheapest node is evaluated across all failures. This process is repeated until a solution is found (all nodes are colored or spilled).

The invention discloses a foundational interference virtual aperture deformation monitoring radar system and a working method thereof. The foundational interference virtual aperture deformation monitoring radar system comprises a tripod, a two-dimensional turntable, a radar sub-system and a data display sub-system, wherein the radar sub-system is used for achieving scanning of a special region, and the two-dimensional turntable is used for global scanning. The working method comprises the steps of radiating broadband frequency modulation continuous wave signals at millimeter wave bands to a tunnel through uniform sparse linear arrays distributed at four edges of a rectangle by the radar sub-system, and receiving an echo signal to obtain initial radar echo data; performing first-time virtual aperture processing, namely MIMO processing, to achieve aperture expansion; executing distance to Fourier transform; performing second-time virtual aperture processing, namely forecast extrapolation, to further achieve aperture expansion; and obtaining a high-resolution three-dimensional radar complex image after two-dimensional digital wave beam formation, acquiring an interference map containing a differential phase from primary and secondary images, obtaining inner wall deformation condition of the tunnel after interference map unwrapping and correction, and transmitting the inner wall deformation condition to a data display sub-system.

Methods and apparatus for reducing the number of edges described by an interference graph are disclosed. According to one aspect of the present invention, a computer-implemented method for allocating memory space in an object-based computing system includes obtaining source code that includes a code segment associated with a first variable and a code segment associated with a second variable. The method also includes binding the first variable to a specific register, and obtaining a live range for the second variable. Once the live range for the second variable is obtained, a register allocation is performed. Performing the register allocation includes creating an interference graph that includes a representation of the second variable and does not to include a representation of the first variable. In one embodiment, obtaining source code that includes the code segment associated with the first variable includes obtaining a call to a subroutine which includes the first variable as an argument in the call.

The invention discloses an interference baseline estimation method based on SRTM DEM, which solves the problem of poor accuracy of real-time orbit rapid generation DEM. Realization steps: real-time trajectory fitting of two interferometric SAR images is carried out by Lagrange interpolation; the elevation value of SRTM DEM on the oblique plane is obtained; the unwrapped phase of two SAR interferometric images is used to perform phase-elevation conversion, to obtain the elevation value of the interference image in the oblique plane; The height error on the oblique plane is obtained by subtracting the height of SRTM DEM on the oblique plane from the height of the oblique plane obtained by interferometry of two SAR images; the baseline error in the scene is obtained by using the relationshipamong the fuzzy height, elevation error and baseline error; the real-time orbit error is corrected by the baseline error, and the DEM is reconstructed by the corrected orbit information; the baselineestimation results are verified by comparing the DEM with SRTM DEM. The invention obviously alleviates the precision loss of DEM reconstruction of real-time orbit, effectively observes topography andgeomorphology, and can be used for signal processing such as InSAR.

Exemplary systems, methods and computer-accessible mediums for encrypting at least one integrated circuit (IC) can include determining, using an interference graph, at least one location for a proposed insertion of at least one gate in or at the at least one IC, and inserting the gate(s) into the IC(s) at the location(s). The interference graph can be constructed based at least in part on an effect of the location(s) on at least one further location of the IC(s).

The invention discloses a channel resource coloring and distribution method based on a double-layer interference graph and relates to the mobile communication technology. It is assumed that cellular terminals use orthogonal channel resources, and short-distance terminals reuse the channel resources of the cellular terminals. The method includes the steps that all links are abstracted into vertexes in the graph; layering is conducted according to the types of the vertexes, and a weighted directed double-layer interference graph is established according to communication quality requirements; on the basis of the established weighted directed double-layer interference graph, the system queuing delay probability and terminal service grades are combined, and then the weighted directed double-layer interference graph is converted into a weighted undirected double-layer interference graph; the channel resources are colored and distributed in a layered mode on the basis of the weighted undirected double-layer interference graph. Through the method, the channel resources can be fully utilized when the channel resources are sufficient; when the channel resources are insufficient, resource requests of the terminals at higher service grades can be met preferentially on the premise of meeting communication quality, so that the communication quality of the terminals is guaranteed. Since the resources are distributed in a first layer according to the service grades in the layering and coloring process, the complexity is reduced.

The invention discloses a digital moire fringe phase extraction method combining wavelet analysis and low pass filtering and belongs to the optical measurement and image processing technology field. The method is characterized by using actual interference graph and phase-shift virtual interference graph moire synthesis to generate a phase shift moire composite graph, and using low pass filtering and combining a phase shift interferometry to extract a preliminary result of a moire fringe phase; according to a virtual interference wavefront acquired by a virtual interferometer, combining a filtering radius of a filter to determine a distribution center and a range of a low pass filtering error in the preliminary result of the moire fringe phase; after a low pass filtering error range and the center are positioned, carrying out wavelet decomposition on the preliminary result containing the low pass filtering error; and according to the positioned error center and the range, processing a wavelet coefficient so that the filtering error can be removed, according to an approximation coefficient and a processed wavelet coefficient, carrying out reconstruction and acquiring the moire fringe phase where the low pass filtering error is removed, which means that a measurement range of digital moire interference measurement is expanded.

The invention discloses an InSAR interference image phase unwrapping method based on U-net. The InSAR interference image phase unwrapping method comprises the following steps: S1, creating an InSAR analog data set; s2, creating a quasi-actual measurement data set; s3, putting the two types of data created in the S1 and the S2 into an improved U-net model for training; and S4, putting the to-be-unwound phase image into the trained U-net model to obtain an unwound real phase image. According to the invention, the U-net architecture, the ASPP network and the bottleneck residual error network arecombined, the expansion convolution features with different expansion rates are combined to capture rich context information, the feature receiving field can be expanded while the feature spatial resolution is not sacrificed, the feature information of the wrapping interferogram can be accurately obtained, and the robustness of the phase unwrapping algorithm is improved; the bottleneck residual error unit can prevent network degradation while reducing the parameter calculation amount of the network model, and improves the network training precision and efficiency. Compared with the prior art,the unwrapping precision is relatively high, and the anti-noise performance is relatively high.