41 results about "Flow mapping" patented technology

A system and a method are disclosed for transforming cluster computing resources of a target system to match a user defined logical data flow so data processing between the source and target are functionally equivalent. The source logical dataflow is compatibly mapped to a target directed acyclic graph that represents the cluster computing resources. A series of subgraph assertion and transform operations are applied iteratively until the logical data flow is isomorphic with a directed acyclic graph. The assertion and transform operations are comprised of rules and assertions, which are maintained in a rules registry.

The invention provides an ultrasonic imaging device, comprising a central processing unit, a storage cell, an ultrasonic probe, a display module and an operating module, wherein the operating module comprises an artery and vein distinguishing button, a B / pulse wave Doppler (B / PWD) dual-mode scanning program, a pulse wave Doppler (PWD) frequency spectrum wave analysis program and / or B / colour flow mapping / pulse wave Doppler (B / CFM / PWD) three-mode scanning program are stored in the storage cell. When the artery and vein distinguishing button is pressed down, the central processing unit receives an artery and vein distinguishing instruction, the display module is controlled to display a tracking range, the tracking range is moved to select a blood vessel to be captured, the central processing unit calls a corresponding frequency spectrum wave analysis program from the storage cell to analyze the captured blood vessel according to the received artery and vein distinguishing instruction and a captured blood vessel echo signal, whether the capture blood vessel is an artery or vein is judged, an identification is marked on the capture blood vessel according to the judging result, and the identification is displayed by virtue of the display module.

A system and a method are disclosed for transforming cluster computing resources of a target system to match a user defined logical data flow so data processing between the source and target are functionally equivalent. The source logical dataflow is compatibly mapped to a target directed acyclic graph that represents the cluster computing resources. A series of subgraph assertion and transform operations are applied iteratively until the logical data flow is isomorphic with a directed acyclic graph. The assertion and transform operations are comprised of rules and assertions, which are maintained in a rules registry.

Mapping schemes of data flows to radio bearers in flow-based QoS control are disclosed. One aspect of the present invention relates to a base station including a data flow reception unit configured to receive a data flow having a flow identifier and a flow priority via one or more tunnels and a data flow mapping unit configured to map the received data flow to a radio bearer in accordance with mapping based on one or more of the flow identifier, the flow priority and the tunnels.

This invention teaches a system and methods of detecting software vulnerabilities in a computer program by analyzing the compiled code and optionally the source code of the computer program. The invention models compiled software to examine both control flow and data flow properties of the target program. A comprehensive instruction model is used for each instruction of the compiled code, and is complemented by a control flow graph that includes all potential control flow paths of the instruction. A data flow model is used to record the flow of unsafe data during the execution of the program. The system analyzes the data flow model and creates a security finding corresponding to each instruction that calls an unsafe function on unsafe data. The security findings are aggregated in a security report. The system further uses precomputation to improve performance by caching 1-to-many data flow mapping for each basic block in the code.

The invention provides an intersection vehicle trajectory reconstruction method based on data fusion from the electric police and a fixed-point detector. The method comprises: long queuing identification is carried out, wherein the long queuing means that the queuing length exceeds the detector position; upstream-downstream lane flow mapping is carried out; and intersection vehicle trajectory reconstruction is carried out based on a traffic wave theory. When the queuing length is close to the detector, the detector occupancy rate increases and the passing vehicle number is reduced; and the long queue is identified based on fixed-point detection data of the section based on changing characteristics of the flow and occupation rate. According to the invention, the intersection vehicle trajectory reconstruction method has the following beneficial effects: the method is based on detection conditions of most of cities in the country and the 60s-aggregate flowing density and speed data and detection frequency are provided, so that the dependence on the high-frequency floating car trajectory data is eliminated.

System and method for generating a data flow diagram. A data flow diagram is provided that includes one or more non-input bound data flow (NIBDF) nodes, each with a respective functionality, and at least one of which is a subsystem node representing a non-input bound data flow sub-diagram comprising a plurality of interconnected nodes. All non-input bound data flow nodes in the data flow diagram are converted into input bound data flow (IBDF) nodes to produce an IBDF diagram, including: for each NIBDF subsystem node in the data flow diagram: partitioning the NIBDF sub-diagram into a plurality of IBDF sub-diagrams that operate according to input bound data flow semantics without changing data dependencies of the NIBDF sub-diagram, and including a plurality of IBDF nodes respectively representing the plurality of IBDF sub-diagrams in the IBDF diagram in lieu of the NIBDF subsystem node. The IBDF diagram is then stored.

The invention discloses a high speed network data flow load balancing scheduling method based on a field programmable gate array (FPGA). According to the method, parallel computing of the FPGA is given full play. The method comprises the steps that the front end concurrently executes Hash operation and selects an output port in probability according to a jam degree of array groups, wherein the strategy that an flow mapping port is preferential is adopted, and the rear end concurrently sends a data packet out from a corresponding physical layer (PHY) port according to the output port, enables corresponding information of the data packet to be written into the PHY port in a first in first out (FIFO) mode, feeds back a current maximum remaining data size by periods, counts and feeds back a port with the smallest flow quantity in the period, simultaneously regulates the period for next counting according to rate feedback trends, enables the period for next counting to be suitable for burst flow quantity, and achieves instantaneous balance of high speed network data flows under the premise that flow particle sizes are guaranteed.

The invention provides a data flow diagram mapping method and device, wherein the method comprises: acquiring a data flow diaphragm to be mapped; acquiring a computing array including multiple processing units; according to a pre-trained mapping quality model, a mapping priority, a data flow diaphragm matrix and the computing array, sequentially determining quality information of a mapping state of the data flow diagram when each operator node is mapped to at least one processing unit; according to the quality information of the mapping state of each operator node, determining the target mapping processing unit which the operator node maps to the computing array. Quality of a mapping intermediate state corresponding to the processing unit that each operator node maps to is quickly predicted through the pre-trained mapping quality model, the target mapping processing unit of each operator node can be determined quickly according to the quality, the quantity of search branches is decreased, data flow diaphragm mapping time is shortened, and data flow diaphragm mapping efficiency is improved.

An original packet flow mapping apparatus and method based on an overlay network. The original packet flow mapping apparatus may include a packet-in message receiver, a flow controller, an overlay tunnel controller, and an interface, whereby flows can be identified even in a physical network segment on which an overlay link is implemented and then the flow can be mapped to an original flow.

The invention discloses a transmission device used for an orthogonal frequency-division multiplexing system, comprising a code layer mapping unit, a coding modulation unit, a flow mapping unit, a multi-input multi-output processing unit and a source mapping unit, wherein the code layer mapping unit divides a transmitted transmission block into a common data packet and a reinforced data packet, divides the common data packet and then divides the reinforced data packet; the coding modulation unit is used for carrying out coding modulation processing to every division result of the common data packet and every division result of the reinforced data packet; the flow mapping unit is used for regrouping every coding modulation result of the common data packet and every coding modulation result of the reinforced data packet; the multi-input multi-output processing unit is used for carrying out multi-input multi-output processing to every coding modulation result of the common data packet after being regrouped and every coding modulation result of the reinforced data packet after being regrouped; and the source mapping unit is used for inserting pilot frequency into every multi-input multi-output processing result of the common data packet and every multi-input multi-output processing result of the reinforced data packet according to a preset pilot frequency pattern and transmitting the multi-input multi-output processing results by a subcarrier source.

Systems and methods for an end-to-end bidirectional symmetric data flow mapping in a LAG system are provided. According to one embodiment, a forward flow from a first end of the LAG system is received by a second end. The forward flow is from a first device connected to the first end and directed to a second device connected to the second end. The forward flow is transmitted by the second end to the second device. A corresponding backward flow is received by the second end that is from the second device and directed to the first device. The backward flow is assigned by the second end to a member link of multiple member links connecting the first and second end on which the forward flow was received by the second end. The backward flow is transmitted by the second end to the first end through the assigned member link.

The invention provides a service processing method by multiflow mapping technique, for processing service request of source user to object user, comprising: according to service request of source user, issuing multiflow mapping information of the service to the routers corresponding to the source and object users by resources management server, respectively; and the routers complete flow mapping installation according to the multiflow mapping information, open and execute policy switches and make message classification, QoS action and bandwidth preservation for flows; and the routers make united management and computation on multiple flows of the service.

In example implementations of the present disclosure, processing of a specification and / or other parameters generates a NoC with flows that meet specification requirements. In example implementations, the specification is processed to determine the characteristics of the NoC to be generated, the characteristics of flow (e.g. number of hops, bandwidth requirements, type of flow such as request / response, etc.), flow mapping decision strategy (e.g., limit on number of new virtual channels to be constructed, using of existing VCs, yx / xy mapping), and desired strategy to be used for how the flows are to be mapped to the network. In such processing, the machine learning algorithm can provide a determination as to if a flow is acceptable or not in view of the specification (e.g., via a Q score). In example implementations, the machine learning decisions can be applied on a flow by flow basis, and can involve supervised learning and unsupervised learning algorithms.

The invention discloses a data flow instruction mapping method. The method includes the substep of data flow diagram traversing and the substep of instruction mapping. The substep of data flow diagramtraversing is used for traversing each node in a data flow diagram, and the substep of instruction mapping is used for mapping multiple data flow instructions to computing cell arrays of a network onchip respectively. According to the data flow instruction mapping method, an existing data flow instruction mapping method is optimized, PEs (processing elements) corresponding to multiple addressesin a multi-address shared data routing packet during running are located on the same straight line as much as possible according to the topological structure condition of the network on chip and the characteristics of a routing algorithm, the network on chip jam condition caused by splitting of the routing packet is reduced accordingly, and the executing efficiency of data flow programs is improved.

A method for mapping flow rate in passive optical network system includes configuring flow rate link of each user data stream to port then to virtual transmission container T-CONT, carrying flow rate link information in each user data stream, mapping received user data stream onto port in corresponding flow rate link first and then mapping received user data stream from port to T-CONT in flow rate link for sending out according to flow rate link information in user data stream after said user data stream is received optical fiber access terminal unit ONU / T.

The invention provides a policy-and-charging-control (PCC) rule processing method and apparatus. The method comprises: first IP flow mapping information that is sent by terminal UE and is used for requesting processing on an internet protocol IP flow is received; according to the first IP flow mapping information, first routing rule information including a first PCC rule identifier of a first PCC rule corresponding to the IP flow or first filter identifier information of a first filter corresponding to the IP flow us determined, wherein the first filter is a filter included by the first PCC rule; and the first routing rule information is sent to a policy and charging rules function (PCRF) entity to instruct the PCRF to process the first PCC rule according to the first routing rule information. Therefore, a problem that the PCC rule can not be changed by the PCRF according to correlated techniques can be solved; and thus an effect of modifying the PCC rule by the PCRF can be realized.

The invention discloses a method and a device for displaying a general artificial social situation based on data flow mapping. The method comprises the steps of initializing a configuration file and configuring a situation display manner and a data display manner according to the configuration file; controlling a plurality of artificial social models to promote artificial social evolution under support of an artificial social parallel computing engine; obtaining situation data of the artificial social parallel computing engine and generating a situation data pocket, analyzing the situation data pocket to generate a situation symbol pocket and a situation statistic pocket, updating a display manner of a data map and updating statistic data on a situation display base map. The device comprises a file configuring module, a display setting module, an artificial social evolution module, a data receiving module, a data processing module, a data displaying module and a situation displaying module. The method and the device have the advantages of strong user customization capability, good universality and adaptability of situation display, high flexibility of overall situation expression and capability of better making aid decision and providing feedback support.

The present invention discloses a method for establishing connections in IP flow mapping update in a HRPD network, comprising steps of: (1) when a PCF receives a request for establishing A8 connections that need to be re-mapped, if determining that there is A8 connection supported, sending an A11-registration request to a PDSN; (2) when the PDSN receives the information on A10 connections in the A11-registration request, if determining that there is A10 connection supported, establishing those A10 connections and sending an A11-registration reply; (3) when the PCF receives the reply message, establishing all the A8 connections corresponding to the A10 connections and sending an A9-connect-A8 to the AN; (4) an AT and the AN releasing and removing the IP flow that can not be mapped to any of the A8 connections or resource reserved by the IP flow according to the A9-connect-A8 received.

The present invention discloses a signalling exchange method for guaranteeing Internet Protocol (IP) Quality of Service (QoS), including: after a Call Agent (CA) receives a request from a source User Agent (UA) for transferring a user service stream, sending a QoS resource request from the CA to the bearer control layer; allocating resources for the user service stream on the bearer control layer, and carrying out flow mapping for an Edge Router (ER) according to the resource allocation result; after receiving a flow mapping command, the ER allocating a bearer path for the user service stream based on the allocated resources, and transferring an execution result to the CA via the bearer control layer. The invention provides a secure and reliable IP QoS signalling process for determining a bearer path of a user service stream, which is of convenience to allocate bearer paths for the network with an independent bearer control layer.

The related method for signal flow graph comprises: taking regular distribution firstly, then adjusting according to inner cable information. This invention combines the advantages of rule and longest path distributions, eliminates effect from new added unit to original graph, and can ensure the graph integrality.

The invention discloses a burst data flow mapping load capacity optimization method in a sensing cloud environment, which is characterized by comprising the following steps: (1) dividing all sensors into sensor clusters according to signal intensity; (2) carrying out time slot allocation according to the principle that the larger the received signal strength is, the less the time slots allocatedin one polling period are; (3) in a specific time slot, enabling the sensors to establish connections with the edge nodes as many as possible; when a burst data stream request which is large enough occurs, estimating a channel resource allocation interval, optimizing the updated channel resource allocation strategy by adopting a Q-learning algorithm, and updating channel resource allocation of thecorresponding sensor cluster at the next moment; and mapping the idle channel resources to the burst data stream. According to the method, an optimization strategy is learned by using a Q-learning algorithm, and load resources are dynamically configured in real time, so that data packet mapping conflicts are effectively reduced, and the mapping capacity of data streams is improved.

Techniques and systems are provided for segmenting one or more frames. For example, incremental optical flow maps can be determined between adjacent frames of a plurality of frames. Using the incremental optical flow maps, a cumulative optical flow map can be determined between a first frame of the plurality of frames and a last frame of the plurality of frames. A segmentation mask can be determined using the first frame of the plurality of frames. Foreground pixels of the segmentation mask for the last frame of the plurality of frames can then be adjusted relative to corresponding foreground pixels for the first frame. The foreground pixels can be adjusted using the cumulative optical flow map between the first frame and the last frame of the plurality of frames.

In example implementations of the present disclosure, there is a processing of a specification and / or other parameters to generate a NoC with traffic flows that meet the specification requirements. In example implementations, the specification is processed to determine the characteristics of the NoC to be generated, the characteristics of the traffic flow (e.g. number of hops, bandwidth requirements, type of flow such as request / response, quality of service, traffic type, etc.), flow mapping decision strategy (e.g., limit on number of new virtual channels to be constructed, using of existing VCs, or generation of new, yx / xy mapping, other routing types, traffic flow isolation by layer or by VC depending of the type of traffic, and / or the presence of single or multi-beat traffic, etc.) to be used for how the flows are to be mapped to the network.

In example implementations of the present disclosure, there is a processing of a specification and / or other parameters to generate a NoC with traffic flows that meet the specification requirements. In example implementations, the specification is processed to determine the characteristics of the NoC to be generated, the characteristics of the traffic flow (e.g. number of hops, bandwidth requirements, type of flow such as request / response, quality of service, traffic type, etc.), flow mapping decision strategy (e.g., limit on number of new virtual channels to be constructed, using of existing VCs, or generation of new, yx / xy mapping, other routing types, traffic flow isolation by layer or by VC depending of the type of traffic, and / or the presence of single or multi-beat traffic, etc.) to be used for how the flows are to be mapped to the network.

The invention discloses a row fixed data stream mapping method based on graph segmentation, and mainly solves the problems of limited application scene and low utilization rate of a processing array in the existing row fixed data stream mapping method. The method comprises the following implementation steps: 1, acquiring relevant parameters of a convolutional neural network convolutional layer anda processing array; 2, generating a mapping graph according to the parameters of the convolutional layer, and determining relevant parameters of the mapping graph; 3, performing mapping graph segmentation according to the mapping graph parameters and the processing array related parameters; and 4, generating corresponding data flow mapping according to a graph segmentation result. According to the invention, the mapping graph based on the row fixed data flow is segmented and mapped according to the processing array scale; while the high data reusability characteristic of the line fixed data flow is kept, the convolutional layer of any scale can be mapped into the processing array of any scale, and the method has the advantages of being high in flexibility, high in applicability, high in processing unit utilization rate and high in processing performance, and can be used for accelerating the data processing process of the convolutional neural network.

Described here are systems and methods for generating quantitative flow mapping from medical flow data (e.g., medical images, patient-specific computational flow models, particle image velocimetry data, in vitro flow phantom) over a virtual volume representative of a catheter or other medical device. As such, quantitative flow mapping is provided with reduced computational burdens. Quantitative flow maps can also be generated and displayed in a manner that is similar to catheter-based or other medical device-based mapping, without requiring an interventional procedure to place the catheter or medical device.