88 results about "Topological order" patented technology

A geographical information system and a method are disclosed for geospatially mapping a least one parcel polygon within a geographical region and for displaying at least one specific attribute of each parcel polygon, i.e. a topological area within the given geographical region, as an attached attribute of latitude and longitude coordinates. The centroid or center point of each of the parcel polygons is determined and stored into conventional computer storage means. The latitude and longitude point feature at the centroid of each parcel polygon is established and similarly stored. A unique tax identification number, e.g. the Assessor Parcel Number (APN) or Parcel Identifier Number (PIN), is assigned to each of the point features. A correlation is then made between the unique tax identification number of the point feature to a text list of at least one attribute, e.g., the physical address of the parcel polygon, of each of the point features. This attribute becomes attached to each point feature. The resulting parcel polygon map and point features with one or more of the attached attributes can then be displayed within a GIS or CAD system to provide the user, for example, accurate locations of street addresses for use in environments that require pinpoint accuracy, such as emergency response.

The invention discloses an indoor map building method for improving robot path planning efficiency. The method combines a topological map and a grid map, the planning problem happens in space represented by topological nodes, and planning of global space is avoided. In addition, laser is used for identifying a door in the indoor environment, a topological relationship between rooms is built, the process is merged in particle filter SLAM (simultaneous localization and mapping) algorithm, the grid map represented by the environment and the topological map based on the grid map can be obtained finally, and the path planning algorithm in robot navigation is simpler and more efficient.

Systems and methods for scheduling jobs in a multiprocessor machine are disclosed. The status of resources in the multiprocessor machine is periodically determined. The status indicates the resources available to execute jobs. This information is accumulated by the topology-monitoring unit and provided to the topology library. The topology library also receives a candidate host list which lists all resources available to execute the job being scheduled based on non-trivial scheduling. The topology library unit generates a free map F indicating the interconnection of the resources available to execute the job. The topology monitoring unit matches jobs to the resources available to execute the jobs, based on resource requirements including shape requirements indicative of interconnections of resources required to execute the job. The topology monitoring unit dispatches the job to the portion of the free map F which matches the shape requirements of the job.

A method of designing a telecommunications network, the method comprising the steps of A) for all working demand flows required to be routed in the telecommunications network, finding an initial topology of spans between nodes in the telecommunications network that is sufficient for routing all working demand flows, while attempting to minimize the cost of providing the spans; B) given the initial topology of spans identified in step A, finding a set of additional spans that ensures restorability of working demand flows that are required to be restored in case of failure of any span in the initial topology of spans, while attempting to minimize the cost of providing additional spans; and C) starting with the initial topology of spans and the additional spans identified in step B, finding a final topology of spans between nodes in the telecommunications network that attempts to minimize the total cost of the final topology of spans, while routing all working demand flows and ensuring restorability of working demand flows required to be restored in case of failure of any span in the final topology of spans. A network so designed may be implemented in whole or in part.

A system and method for inferring schematic and topological properties of an electrical distribution grid is provided. The system may include Remote Hubs, Subordinate Remotes, a Substation Receiver, and an associated Computing Platform and Concentrator. At least one intelligent edge transmitter, called a Remote Hub Edge Transmitter, may transmit messages on the electrical distribution grid by injecting a modulated current into a power main that supplies an electric meter. The Subordinate Remotes, Remote Hubs, the Substation Receiver, and the associated Computing Platform and Concentrator may contain processing units which execute stored instructions allowing each node in the network to implement methods for organizing the on-grid network and transmitting and receiving messages on the network. The Substation Receiver, Computing Platform and Concentrator may detect and infer schematic grid location attributes of the network and publish the detected and inferred attributes to other application systems including geospatial information systems maintaining the logical and physical network model.

The embodiment of the invention provides a system capable of realizing automatic layout of a flow chart. The system comprises the steps that the logical relationship of nodes is obtained; the logical relationship of the nodes is analyzed and the nodes are graded; the nodes in the same grade are optimized, and an optimal layout mode is computed; the coordinates of each optimized node in the flow chart are determined by adopting a topological order. The logical relationship of the nodes is analyzed, the nodes are graded, and a Randker iteration sorting algorithm is adopted for the nodes in the same grade to compute the internal optimal arrangement mode of each grade, so that the number of cross points of flow lines is guaranteed to be the minimum, the nodes are uniformly and linearly distributed in a plane in an equidistant manner by utilizing a symmetrical layout method, the disorder and complexity of manual flow charting can be effectively solved accordingly, the reasonable layout of the flow chart can be realized rapidly and efficiently, and the accuracy of the layout of the flow chart and the clearness of business logic are guaranteed. Besides, the other embodiment of the invention provides a device capable of realizing automatic layout of the flow chart.

The invention discloses a method for realizing dynamic topology. The method is used for realizing a corresponding topology structure change on the basis of a number change in a topological graph. According to the method, a no-refresh technology is adopted, the problem, which is caused by the addition or reduction of child nodes, about the real-time display of the topological graph can be solved, and the topological graph is dynamically displayed by comprehensively taking the resolution of a computer into account and calculating the coordinates of topological nodes. The topologic graph is specified according to the amount of equipment, a neighborhood relationship is acquired through connecting lines, a physical connection relationship between the equipment in a network is accurately reflected, and a logical hierarchical relationship is reflected to a certain extent. A changed network topological graph can be generated in real time, the automatic layout of the network topology is realized, and the definition of the topological structure of the network is improved; and the method is adapted to the topological display of a dynamic network.

The invention relates to a topology modeling method based on definitions of classes and relationships. The invention is characterized in comprising following steps: firstly, abstracting objects of same types into classes, and abstracting the relationships among objects into that among classes, and the topology model is created based on the relationships among the classes; according to the definitions of classes, relationships and the configuration data, topological data can be automatically generated by a topological data generator. As the modeling process is based on the definitions of classes as well as the in-between relationships, workload can be remarkably reduced. Particularly, the invention can be applied to topological modes with large data amount or high shiftiness, allowing for fast topology model creation according to customer demands, for topological data generation and management, as well as for information presentations by topology charts. Therefore, the invention has the advantages that not only the development time of software systems can be cut short greatly, but also the system flexibility can be highly improved, thereby facilitating topological data maintenance.

The invention discloses a topological method of a modular multilevel converter structure based on a loop nesting mechanism, and belongs to the technical field of power transmission and distribution. The topological method comprises the steps of firstly, selecting the number of loop nesting layers and the number of submodules at each layer according to the requirement of the amount of output levels; secondly, setting a capacitance rating and a voltage rating of the submodule at each layer according to the output direct-current bus voltage, the determined number of the loop nesting layers and the number of submodules at each layer; and thirdly, connecting all submodules which are classified at each layer in series, and connecting a communication reactance in series to serve as a conversion bridge arm of a modular multilevel converter, wherein the conversion bridge arm is a novel modular multilevel converter topological structure adopting the loop nesting mechanism. According to the topological method disclosed by the invention, the number of required submodules is obviously decreased under the condition that a certain output voltage level amount and a certain output of the direct-current voltage can be ensured; and moreover, the miscellaneous degree of a primary system is reduced, and the complexity of the system is controlled.

The present invention provides an improved method of identifying which electrical conductor is supplying a signaling-point that is located on that conductor, in the electrical grid. The present invention makes the identification by measuring currents flowing into and out of a common connection-point, such as a power bus, and analyzing concurrent portions of these currents to determine whether they are ingress-current or egress-current over the analysis-intervals, and by a subsequent intra-bus and inter-bus analysis of the ingress / egress patterns. This is in contrast to prior art systems that rely on the measurement of signal strength, an approach that does not take best advantage of information in the signal because it fails to consider polarity of instantaneous voltages, reflective of the direction of current flow, or the intra-bus and inter-bus ingress / egress current-relationships.

The invention relates to the technical field of image processing, in particular to an extraction method of image texture element feature a local shape mode based on a topological tree. The method comprises the steps of: carrying out Level Set layering on an image I according to a pixel gray value v, structuring a topological tree structure T, structuring an encoded concentric circle template, scaling node shapes to be equivalent to the size of the concentric circle template, overlapping the node shapes subjected to scaling with the concentric circle template and carrying out binary coding on the node shapes subjected to scaling with the overlapping relationship of each sector fnm, counting a frequency column diagram based on coded values of all the node shapes in all the M sectors of each circle and then splicing the frequency column diagrams of the N circles, and adding all the texture feature descriptions of the shapes subjected to coding in the image topological tree. The invention can avoid the loss of texture information in the process of filtering and transformation, carry out description on the image texture more comprehensively and completely, improve the accuracy of image processing applications based on the texture element features, such as retrieval, classification, partitioning and the like,.

The invention discloses a method and a system for measuring the number of the topological charges of a partially coherent vortex beam and whether the topological charges are positive or negative. Themethod includes the following steps: recording the light intensity of a to-be-measured partially coherent vortex beam; introducing three disturbances of different phase assignments to the to-be-measured partially coherent vortex beam; carrying out Fourier transformation on the to-be-measured partially coherent vortex beam after disturbance, and recording the light intensity of the Fourier plane after the three different phase assignments; getting a cross spectrum density function of the to-be-measured partially coherent vortex beam through inverse Fourier transformation according to the threedifferent phase assignments and the light intensity of the Fourier plane under the three different phase assignments; getting the complex coherent degree of the to-be-measured partially coherent vortex beam according to the cross spectrum density function and the light intensity of the to-be-measured partially coherent vortex beam; and drawing a phase distribution map of the complex coherent degree, wherein the number of coherent singular points in the phase distribution map is the number of topological charges, whether the topological charges are positive or negative is determined according to the rotation direction of phase change around the coherent singular points, the topological charges are positive if the rotation direction is anticlockwise, and the topological charges are negativeif the rotation direction is clockwise.

The invention discloses a method for generating a test case by using a flow chart. The method comprises the steps that : all graphic elements are read through in the flow chart after validity check is carried out for the flow chart to obtain graphic element IDs at both ends of connection lines; a directed graph adjacent matrix with start points and end points, start nodes and end nodes of all the connection lines is established; test units are generated by starting from a StartID in a topological order for every graphic element except connection line graphic elements and are added to the test case in order; subsequent node IDs are checked by utilizing the adjacent matrix till an end node EndID is checked; the test units are mapped to test steps; after the test steps are generated, the corresponding test step is carried out from the start nod in the test case by mapping each time when each test unit is obtained, thereby corresponding operation is run till the end nod is met. The method is characterized in that a program logic process and a program data flow direction are manifested in the form of a flowchart in the executing process of the text case; the method is easy for understanding and design.

The invention discloses a fully-automatic container wharf shipment scheduling method and a scheduling system. The method comprises steps: a dynamic structure pipeline is constructed, and a task priority is set; a shipment task order is calculated according to a topological method; according to a topological order, the slope of triangular pile containers is calculated; and according to working pathload, automatic guided vehicles are dynamically distributed. The work of moving a container from a container yard to the ship is set as a task, the current load of mechanical equipment is consideredcomprehensively, the conflict between the equipment execution efficiency and the task execution order is balanced, and a reasonable to-be-executed shipment task queue in the current time period is given at each execution period; and a task is issued according to the queue, corresponding equipment and wharf resources are called and configured, the working schedule is controlled, and wharf shipmentwork is executed correctly, orderly and efficiently.

The invention relates to a beam splitter prism and a method and device for detecting the topological charge of a vortex beam. The vortex beam is divided into two light beams through the beam splitter prism, and the beam splitter prism is used for carrying out interference so that the topological charge of the vortex beam can be measured; a cube prism is cut open in the direction parallel to a pair of edge opposite angles, after cut surfaces are ground and polished, one of the cut surface is plated with a metal film, and then the two prism bodies are bonded to form a cube again. The beam splitter prism and the method and device for detecting the topological charge of the vortex beam have the advantages that the method for measuring the topological charge of the vortex beam on the basis of a beam splitter prism self-interference technology is provided for overcoming the defects in an existing method for measuring the topological charge of the vortex beam; an optical path for measuring the vortex topological charge through the single beam splitter prism is compact and practical, and the measuring method is simple, fast and stable in experiment results.

The invention relates to a method for identifying and correcting distribution network data based on a topological tree. The method includes the steps of: firstly building a minimum distribution region model of a distribution network, then identifying and correcting current switch telemeasuring data according to the minimum distribution region model, each piece of switch telemeasuring historical data, and each switch rated capacity; secondly performing data identification and correction on each region switch according to the minimum distribution region model and a region balance principle; and finally performing data identification and correction on measurement information and un-supplement measurement information of a distribution transformer at an end node according to the capacity size of the distribution transformer. The method for identifying and correcting the distribution network data based on the topological tree has good measurement supplement and correction effects for the condition that part of measurement is missing in the current cable distribution network, provides a valid data source for further application of the distribution network, and has good practical significance for practical application of the distribution network.

The invention discloses a topological graph optimal route algorithm with constraint conditions. The algorithm includes the following steps that: telecommunication equipment is abstracted to topological nodes, and optical fiber connections are abstracted to topological links, and as a result a topological matrix can be formed; a source topological node and a destination topological node are selected; an include topological node list and an include topological link list are established according to the constraint conditions, and include topological links are converted into include topological nodes, and the include topological nodes are added into the include topological node list; an avoid topological node list and an avoid topological link list are established according to the constraint conditions, and the topological matrix is updated; and a starting topological node and a finishing topological node which are routed currently are set as Nt and Ne respectively; when Nt is connected with a topological link<t,e>, Nt, Ne and <t,e> are added into an overall route, otherwise, an optimal route between Nt and Ne is added into the overall route; if Ne is the destination topological node, the method terminates, otherwise, the topological matrix is updated according to the optimal route between Nt and Ne, and next iteration is started. With the topological graph optimal route algorithm of the invention adopted, the optimal route can be searched under the constraint conditions, and routing efficiency when the source topological node has a large degree can be improved through the improved Dijkstra algorithm.

The invention discloses a forward-looking multithreading partitioning method, comprising the following steps: constructing a corresponding expanding program correlogram for each loop statement basic block and each non loop statement basic block in a single threading application program; designing a corresponding directed acyclic graph for each expanding program correlogram; designing a forward-looking node for each directed acyclic graph, and removing the node from the directed acyclic graph; performing topological sorting for each directed acyclic graph; at last, partitioning forward-lookingmultithreading for a single-chip multi-core processor according to the sequence semantics in the single threading application program and the obtained topological order. The method performs forward-looking multithreading partitioning by the loop statement and the non loop statement, can fully dig control dependency and data dependency in the program, fully utilizes thread-level parallelism, reduces unnecessary delay waiting by forward-looking performing, increases the performing speed of the program on the multi-core processor and improves the utilization ratio of the processor.

The invention discloses an indoor mobile robot autonomous exploration method based on laser radar through establishment of topological nodes. According to the exploration object point extraction result, a topological map node is generated and the node is added in a topological map. The redundancy topological node treatment is carried out, all the topological nodes at the topological map are detected, the redundancy topological nodes are rejected, the topological map is subjected to closed loop processing, whether the current topological nodes and other topological nodes have closed loop can bedetected, if the closed loop exists, the closed loop is completed by adding a corresponding edge at the topological map, and when the environment has no unexplored node, the autonomous exploration iscompleted. The grid map is not required for extraction of the leading object point, the exploration object point is extracted through the laser data, the complex degree of the extraction algorithm isgreatly reduced, the accuracy and stability of the extraction result are guaranteed, the redundancy node rejecting and closed loop detection are carried out on the topological map, and the autonomousexploration efficiency of an indoor mobile robot can be greatly increased.

The invention discloses a method for detecting a topological charge by using a polarization modulation defocusing intensity, comprising the following steps of: modulating the vortex beam to be measured through a polarization modulation system; focusing the modulated vortex beam to be measured to its focal region by a high numerical aperture lens; imaging the spot of the focus on the CCD detectionsurface by the 4-f system;gradually increasing the polarization order P of the polarization modulation system, wherein the spot observed on the CCD detection surface exhibits a minimum solid shape when the topological charge of the vortex beam to be measured is equal to the absolute value of the polarization order P value of the polarization modulation system, so that the size of the topological charge l is known; observing the spiral direction of the spot on the CCD detection surface to obtain the direction of the topological charge of the vortex beam to be measured. The method for detectingtopological charge by using polarization modulation defocusing intensity can realize topological charge detection of any polarization vortex beam.

An efficient image retrieval method utilizing topological order distance (TOD) algorithm is disclosed. In one aspect, an image recognition method may include steps of receiving one or more input images; extracting one or more key features on the input images; determining an origin and one or more feature points on the key features on the input images; establishing a topological relationship in each dimension between the feature points on the key features; and utilizing the topological relationship in each dimension between the feature points to identify the input images in an image database. Comparing with the conventional image retrieval techniques, the TOD algorithm is advantageous because it is more efficient, scale and rotation invariant, and tolerant to affine and perspective transformation.

The computer aided circuit design and topological design method is used to design circuit design diagram and circuit layout for circuit board production. It is also used to check circuit design diagram in altering module layout mode. The method features that after completing the design of circuit design diagram, one list of the names, positions and attributes of the circuit modules is arranged. When the design diagram is altered, the lists before and after altering are compared to create one altered module report for the designer to refer.

Mode selection is optimized for video coding requiring sequencing of decisions with respect to a data block sequence. Each decision is selected from a mode set. The sequence is a directed acyclic dependency graph with depender blocks pointing to dependee blocks numbered in reverse topological order. A trellis state transition diagram is constructed from the reverse ordered graph. The least cost path through the trellis is determined to define the optimal decision modes selected from the set of modes at respective blocks. The number of trellis stages equals the number of decisions in the dependency graph from left to right. Each trellis stage has a varying number of states corresponding to cardinality of the mode set for the decision. The number of decisions to the left of a particular stage that the stage needs to remember equals the number of decisions to the right of the stage.

The invention provides an alternative path planning method and a navigation terminal. The method comprises the following steps of: acquiring a selected topological object of a planned path; multiplying a damping coefficient of the selected topological object by an initial weight of the selected topological object to obtain a dynamic weight thereof; acquiring an alternative topological object which is connected with the selected topological object and has a distance within a threshold away from the selected topological object, and multiplying a damping coefficient of the alternative topological object by an initial weight of the alternative topological object while acquiring one alternative topological object so as to obtain a dynamic weight thereof; and calculating an alternative path through a shortest path algorithm according to the dynamic weights of the alternative topological object and the selected topological object forming the planned path, and weights of other topological objects in a road transport network. The invention also provides a navigation terminal. The provided technical scheme guarantees that the alternative path consists of most of topological objects which are not overlapped with the selected topological object, and the alternative path is more reasonably planned.

The invention provides an energy consumption calculating and scheduling method of an urban rail traffic system. The method includes the steps of establishing a multi-layer network model of the urban rail traffic energy consumption system on the basis of the urban rail traffic system; calculating topological properties and data properties of nodes as input, wherein the topological properties include the degrees, betweenness and clustering coefficients of the nodes, and the data properties include the energy consumption and strength of the nodes; fusing the topological properties and data properties of the nodes through an OWA operator to obtain the weights of the nodes in the urban rail traffic system; calculating the energy efficiency emergence state, namely the energy efficiency representation parameter, of the urban rail traffic system in combination with the weights of the nodes through Choquet integrals on the basis of the emerging theory; regulating and controlling the energy efficiency of the urban rail operation system on the basis of the energy efficiency representation parameter of the urban rail system. For the complex-structure urban rail traffic system, the energy efficiency of the urban rail system can be calculated by means of the method, and the reasonable regulation and control of the energy efficiency of the urban rail operation system are realized in combination with the calculated energy efficiency.

The invention provides a dynamic allocation method for decoding iteration of a transmission block of a topological code of a third generation partnership project (3GPP) long term evolution (LTE) system. According to the method, within the maximum processing time delay of the transmission block, the remained iterative decoding time delay of encoding blocks which are decoded successfully in advanceis re-allocated to the encoding blocks which cannot be successfully decoded temporarily by effectively utilizing decoder hardware resources and the processing time delay allocated to the current transmission block, so that the decoding performance of the whole transmission block is improved. The method mainly comprises the following steps of: limiting the processing time delay of the transmissionblock by setting the maximum iterations of each encoding block, wherein the each encoding block of the transmission block in the LTE adopts an iterative decoding algorithm based on maximum posterior probability; firstly, carrying out iterative decoding on the encoding blocks sequentially, carrying out cyclic redundancy check simultaneously, and counting the iterations for dynamic allocation according to a check result; and when decoding of all of the encoding blocks is finished, averagely allocating the counted iterations to the encoding blocks which are not decoded successfully, and continuing carrying out the iterative decoding on the encoding blocks according to the iterations obtained by allocation.

A relational dependency transform is introduced as a way to exploit information redundancy in conditioning data in a relational database for better compressibility. An optimum relational dependency transform of the relational database is first computed. Fields of the relational database are then sorted topologically based on a weighted, directed graph having nodes representing predictor and predictee fields. For each predictee field in the topological order, a transformed field is then computed via the relationship between predictor and predictee in the optimum relational dependency transform.

The invention discloses a distribution network model topology connectivity verification method. The method comprises two aspects, the first including extracting a single line model through a distribution network feeder hierarchical relation, then clustering based on the connectivity of nodes, generating various connected clustering islands, and then determining the distance among the islands so as to preliminarily determine the connectivity of the single line model; and the second including extracting a single line model through a topological relation, then performing generalized dotted line graphic layout, generating a visualized distribution network topological graph, assisting in determining the model connectivity, or readjusting model extraction conditions, performing model re-extraction and re-layout, and conducting comparative analysis of the single line model connectivity. Based on the objective situation in the application of a distribution network model, the method is used for comparative analysis of the topological boundary and internal connectivity of the single feeder model from the two aspects of the hierarchical and topological relations, and provides calibration means for related applications based on the correctness of a topological model.

Methods are constructed for defining equivalence relations on embedded manifolds. A continuous path in the space of equivalence relations that spans from “homologous” to “diffeomorphic” and another similar path with endpoints “homologous” and “isometric” are given. Underlying the methodology is a convolution algebra of homology sampling functions. The methodology has applications for describing geometrical arrangements in material science, molecular biology, data science and physics. The methods are implemented in program code stored in a computer readable media and executable on a computer system to provide data analysis functions for a user.