123 results about "Partial path" patented technology

A miniaturized temperature-zone flow reactor, used for thermally controlled biochemical or molecular-biological processes, especially polymerase chain reaction (PCR) enables more efficient reactions by providing at least one closed flow path which is divided into three partial paths (A1 . . . An; B1 . . . Bn and BB1 . . . BBn−1; C1 . . . Cn) with the reactor having three substrate chips (A; B; C) which are made of a material having a high heat conductivity, and which have defined channel sections that are spaced apart relative to each other, and are connected by a connecting chip (V) made of a poor heat-conductive material. The substrate chips (A; B; C) are maintained at different temperatures by various means, including the use of controlling heating elements in contact with the chips.

An electroacoustic transducer comprising a magnetic circuit of a magnetically conductive material with a pair of opposed surfaces defining a gap there between, the magnetic circuit comprising one magnet. The magnet can either be positioned in the center of the magnetically conductive material so as to form two gaps. In an alternative embodiment the magnet is attached to the magnetic conductive material forming only one gap. The transducer further comprises a diaphragm and a coil system having electrically conducting paths fastened to the diaphragm. The coil system has portions of its paths situated in the gap. The transducer may be supplied with an additional diaphragm and coil system positioned on the opposite side of the magnetic circuit. In a preferred embodiment the transducer is rectangular. The transducer is suited for integration into miniature components such as mobile communication equipment and hearing aids. Embodiments of the transducer are suited for side-firing or side-shooting applications such as in mobile phones.

A device and a process for processing and / or joining work pieces via laser radiation, with an effective power laser and a pilot target laser that emit laser beams of different wavelengths, with the laser beams being directed at the work pieces by laser optics. Regarding the laser beams, by the laser optics that comprise at least one diffractive optical element (DOE) as a masking system, the beam pattern of the pilot target laser is adjusted to match the beam pattern of the effective laser beam. This is accomplished preferably by removing the pilot laser beam from the effective laser beam for part of the path length by dichroic mirrors, and by expanding the diverging pilot laser beam on said part of the path length by deflecting mirrors whose distance from the dichroic mirrors is variable.

The invention relates to a planning method for a simulated path of a robot under a complex dynamic scene and a robot motion planning simulation platform for achieving the method. According to the method, path security evaluation criteria are established according to a collision possibility and an arrival possibility, an algorithm framework for planning two layers of interactive paths is adopted, motion planning is divided into an environment exploration layer and a partial path planning layer, the two layers perform information interaction by means of a self-adaptive path buffering area, and a security update search tree is taken as a top planner and applied to the environment exploration layer in the two-layer interactive framework. The simulation platform comprises a problem module, a planning module and an execution module. A safe and real-time path planning scheme is provided according to a path planning strategy selected by simulating a human path, the defect that only the feasibility of the path is considered but the continuity of the path is not concerned in the prior art is overcome, and the motion planning of the robot in a complex dynamic environment is realized.

A process for analyzing a traffic network uses a source file including edges and nodes representing the traffic network. The process generates partial routes from the source file, wherein each partial route comprises at least one edge and at least one of the partial routes comprises a plurality of adjoining ones of said edges. Route data can be transmitted between a vehicle and a traffic center by designating the partial route instead of each individual edge, thereby optimizing transmission of data via a transmission channel.

In a label transfer network, an ingress node positioned at an upstream side end of a partial section of a first data transfer path (old path) transmits a path modify request, and an egress node positioned at a downstream side end of the partial section returns a label allocation request on a detour path (new path) to the ingress node in response to reception of the path modify request for implementing partial path modification from the old path to the new path. This enables the partial path modification with only a node bearing relation to the path modification, thus shortening the time needed for the path modification and suppressing an increase in extra control traffic for a node having no relation to the path modification.

A method for setting up forwarding tables is described. A USAT part for a node is received. The USAT part includes glow definitions and a FGPL. Each glow describes network traffic flows and role instructions for the flows. Each FGP describes a role for the switching node; a validity rule; and relevant network topology. The method also includes determining a selected active FGP in the FGPL using the validity rule for the FGP, a network state and the ordering of the FGPs; initializing the glows, requesting a role identification to perform based on the selected FGP, determining the role instructions and instructing the TMS to update tables accordingly; and storing entries in software tables based on glows and the role instructions for the identified role, dynamically resolving conflicts among entries, and granting table updates to hardware tables. The tables include a software table for each hardware memory for forwarding packets.

In a label transfer network, an ingress node positioned at an upstream side end of a partial section of a first data transfer path (old path) transmits a path modify request, and an egress node positioned at a downstream side end of the partial section returns a label allocation request on a detour path (new path) to the ingress node in response to reception of the path modify request for implementing partial path modification from the old path to the new path. This enables the partial path modification with only a node bearing relation to the path modification, thus shortening the time needed for the path modification and suppressing an increase in extra control traffic for a node having no relation to the path modification.

The illustrative embodiments described herein provide a computer-implemented method, apparatus, and computer program product for managing variable assignments in a program. The process identifies a set of variable assignments that is live on a portion of paths to form a set of identified variable assignments. Each of the set of identified variable assignments assign a value to at least one variable of a set of variables. The process determines a set of program points at which the set of identified variable assignments is live on all paths. The process also moves the set of identified variable assignments to the set of program points in response to determining that the set of identified variable assignments is movable to the set of program points.

Message routing in a publish / subscribe system where messages are routed from one or more publishers to one or more subscribers according to respective defined paths through a topic tree. A pseudo-topic tree path comprised of a partial path definition and a selection function is specified by a subscriber or publisher. When executed, the selection function searches the topic tree to identify one or more path definition segments, which segments replace the selection function in the pseudo-topic tree path to generate one or more complete path definitions that are then usable for routing messages.

The invention relates to a method for steering a vehicle (1) around obstacles (7), from a starting position (2) to an end position (3). According to the method the vehicle is steered along a path, wherein the path comprises linear partial paths (4) defined by an increment [eta] and a steering angle [delta]. The method comprises the following steps: a) determining a maximum steering angle range and a maximum and a minimum increment range; b) determining the actual distance eP to the end position (3) and the target angle [theta]O, and the angle difference e[theta] between the current vehicle angle and the target angle; c) carrying out an optimization method for determining a partial path (4) by minimizing the value of a cost function lO assigned to the partial path, wherein (i) the cost function includes the current distance eP to the end position (3) and the current angle difference e[theta] to the target angle as optimization variables weighted independently of each other, and (ii) the maximum steering angle range, the maximum and the minimum increment range and a collision test are provided as boundary conditions; d) determining the new position by adding the detected partial path (4) to the current position; e) repeating the steps (b) to (d) until the end position (3) has been reached with sufficient accuracy.

A cost of a path may not be the only factor in searching for a path solution in a network. For example, some applications are delay sensitive and require finding a path that does not exceed a latency constraint for the entire path. Accordingly, a method and corresponding apparatus for searching for a path solution in a network is provided that identifies combinations of partial paths that satisfy an end-to-end path constraint, compares attributes of the combinations of partial paths, prunes the combinations of partial paths based on results of the comparing to identify candidate combinations of partial paths, and selects a candidate combination of partial paths as the path solution. By pruning combinations of partial paths, considerable is saved compared to exhaustive comparing of every possible combination of partial paths and scalability is achieved.

Path-based ranking of unvisited Web pages for WWW crawling is provided, via identifying all the paths beginning with a “seed” URL and leading to visited relevant web pages as “good-path set”, and for each unvisited web page, identifying the paths beginning from the “seed” URL leading to it as “partial-path set”; classifying all the visited web pages and labeling each web Page with the labels of a class or classes it belongs to; training a statistic model for generalizing the common patterns among all ones of “good-path set”; and evaluating the “partial-path set” with the statistic model and ranking the unvisited web pages with the evaluation results.

The invention provides a method and a system for determining a switchable route in a process of sending a message, which are used for guaranteeing that a network element can select the correct switchable route to ensure that a service can be normally performed when part of the route has a phenomenon of packet loss in SCTP single-address multi-routing networking. The determining method comprises the following steps that: a first network element transmits a measured message to a second network element through each first route of a plurality of next hop routers of which the current administrative distance is shortest respectively, and determines the packet loss rate of each first route according to a response message fed back by the second network element; and the first network element determines the switchable route of a transmitted message according to the difference of the packet loss rate between preferable first route and non-preferable first route, and according to the magnitude relationship of a switching threshold. The technical scheme provided by the invention designs a targeted indirect measurement method for the network packet loss rate according to the transmitting characteristic of the message in the SCTP single-address multi-routing networking; and when part of the route has the phenomenon of packet loss, the network element can select the correct switchable route to ensure that the service can be normally performed.

The present invention discloses a Bayesian OD matrix estimation method with multiple data types. The method comprises the following steps of: the step 1, obtaining four data types which are a road section flow, a flow of part of paths, a turning flow of an intersection and a road section vehicle travelling speed, performing layering and screening of the four data types, and obtaining relatively independent traffic data on a network; the step 2, respectively calculating likelihood functions corresponding to the road section flow, the flow of part of paths, the turning flow of the intersection and the road section vehicle travelling speed according to the relatively independent traffic data on the network obtained in the step S1, and obtaining a posterior distribution form of Bayesian OD matrix estimation; and the step S3, designing a Markov Chain Monte Carlo sampling method, and solving the posterior distribution form of the Bayesian OD matrix estimation in the step S2. The Bayesian ODmatrix estimation method with multiple data types is helpful for improvement of accuracy and a technology application range of the current OD estimation.

Data is encrypted onto an electromagnetic beam by providing an electromagnetic beam having a signal component having a modal state, wherein the signal component is susceptible to accumulation of a geometric phase, and a reference component, transmitted along a path over at least part of which the signal component accumulates a geometric phase by transformation of its modal state from a first to a second modal state, from the second to at least one further modal state, and then back to the first modal state; and modulating with the data the geometric phase so accumulated, by modulating the modal state transformations. Data is decrypted from a received electromagnetic beam by corresponding processing of the received electromagnetic beam and by comparing an overall phase of the signal component with an overall phase of the reference component so as to retrieve the modulation.

A push-pull switching power converter includes, between high and low output terminals of a DC power source, a series circuit having a first switching device, a primary winding of a first transformer, a primary winding of a second transformer, and a second switching device in this order, and a series circuit composed of two capacitors, as well as a partial path for current resonance. The partial path connects middle points of the two series circuits. Voltage resonance causes the waveform of a switching voltage, which corresponds to the difference in voltages between high potential terminal of a primary of the first transformer and low potential terminal of a primary of the second transformer, to be a sine wave. Current resonance causes the waveform of a switching current, which corresponds to a combined current of primary winding currents of the first transformer and the second transformer, to be a sine wave.

The invention discloses an ODN (Optical Distribution Network) system with capacity expansion adaptability, a line protection function and an annular feeder line structure. The ODN system is characterized by being partitioned into a framework feeder line network, a feeder line part and a wiring access part, wherein the framework feeder line network has an annular structure; total double-optical-fiber path protection is adopted for the feeder line part; and partial or total double-path protection is adopted for the wiring access part. In a switched protection scheme of an ODN, protections of the feeder line part and the wiring part are realized separately, and feeder line switched protection has the advantages of concentrated local end control and remote passive configuration, so that the increase in the cost of the ODN network caused by the realization of switched protection is greatly reduced; and moreover, the switched protection of the wiring part can be flexibly configured according to a user level and requirements based on the passive configuration structure of a remote node, and is mainly controlled by a user terminal.

The invention relates to a heuristic search method with exact solutions to shortest path problems based on place learning effect, in particular to a robot path planning method. In finding a shortest path, a robot interacts with an environment to acquire experiences through reinforcement learning, which means the robot may acquire a same path at very low cost; therefore, in such case, the shortest path may be different from a shortest path with no learning effect. In order to solve the problem, after the robot acquires external environmental information and determines a learning effect function according to priori knowledge, pruning operation and filtering operation satisfactory to this problem are designed through heuristic information to eliminate in advance part of the paths which are determined not likely to present on the shortest path, the search process is accelerated, and the robot may find an exact global shortest path within reasonable effective time to guide its travelling.

A device and a process for processing and / or joining work pieces via laser radiation, with an effective power laser and a pilot target laser that emit laser beams of different wavelengths, with the laser beams being directed at the work pieces by laser optics. Regarding the laser beams, by the laser optics that comprise at least one diffractive optical element (DOE) as a masking system, the beam pattern of the pilot target laser is adjusted to match the beam pattern of the effective laser beam. This is accomplished preferably by removing the pilot laser beam from the effective laser beam for part of the path length by dichroic mirrors, and by expanding the diverging pilot laser beam on said part of the path length by deflecting mirrors whose distance from the dichroic mirrors is variable.

The invention discloses a task scheduling-driven network navigation method, and relates to a wireless navigation method using GPS positioning information. The method comprises the processes that a scheduler issues a task to a performer, the performer receives and responds to the task, the performer performs the task and the performer feeds the performance situation of the task back to the scheduler, wherein in the process that the performer performs the task a management center plans a navigation path and issues part of path information and a map sheet by wireless communication according to a request of a PDA navigation terminal of the performer; the PDA navigation terminal receives the part of the path information and the part of the map sheet, goes into a navigation state, displays the map sheet corresponding to the current position and processes navigation events, and the management center continues to issue another part of the path information and the map sheet if the current position is beyond the issued part of the path range or the map sheet range; and the performer arrives at a destination based on the navigation prompt of the PDA navigation terminal and completes the task specified by the task command.

Path-based ranking of unvisited Web pages for WWW crawling is provided, via identifying all the paths beginning with a “seed” URL and leading to visited relevant web pages as “good-path set”, and for each unvisited web page, identifying the paths beginning from the “seed” URL leading to it as “partial-path set”; classifying all the visited web pages and labeling each web Page with the labels of a class or classes it belongs to; training a statistic model for generalizing the common patterns among all ones of “good-path set”; and evaluating the “partial-path set” with the statistic model and ranking the unvisited web pages with the evaluation results.

A computer implemented method for maintaining a program's calling context correct even when a monitoring of the program goes out of a scope of a program analysis by validating function call transitions and recovering partial paths before and after the violation of the program's control flow. The method includes detecting a violation of control flow invariants in the software system including validating a source and destination of a function call in the software system, interpreting a pre-violation partial path responsive to a failure of the validating, and interpreting a post violation path after a violation of program flow.

First and second paths of the primary-coil of the transformer are located at different sides of the symmetry-line. First terminals of the first and second paths are first and second ports of the primary-coil. Second terminals of the first and second paths are connected to each other. Two partial paths of the first path are connected to each other by TSV. Two partial paths of the second path are connected to each other by TSV. Third and fourth paths of the secondary-coil of the transformer are located on different sides of the symmetry-line. First terminals of the third and fourth paths are first and second ports of the secondary-coil. Second terminals of the third and fourth paths are connected to each other. Two partial paths of the third path are connected to each other by TSV. Two partial paths of the fourth path are connected to each other by TSV.

Disclosed is a method for finding a path in a navigation system. The method includes selecting a sectional path option for a specific section selected by a user from an entire section between a start point and an end point, and finding a path in the specific section according to the sectional path option and creating an entire path for an entire section by employing the path in the specific section. Accordingly, a sectional path option different from an entire path operation for an entire path is applied to a specific section desired by a user on an entire path to an end point from a start point, so that it is possible to efficiently apply an option desired by the user to path finding.

The present invention relates to a single-electron transistor (SET) operating at room temperature and a method of manufacturing the same, and to be specific, to a single-electron transistor operating at room temperature and a method of manufacturing the same, which are capable of minimizing influence of the gate voltage on tunneling barriers and effectively controlling the electric potential of a quantum dot (QD), by forming the quantum dot using a trenched nano-wire structure and forming the gate to wrap most of the way around the quantum dot.

A drive device (1) of the present invention includes a pair of drive switches (12, 14), a first diode (D1), a switching element (16), a current detection unit (R1, 18), a capacitor (C1), a second diode (D2), and a current control unit (20). The first diode (D1), the switching element (16), and the current detection unit (R1, 18) are arranged, in this order from one end of an armature (4) in a motor (2), on a braking current path that is formed of the armature (4) and a field winding (6, 8) in the motor (2) when the pair of drive switches (12, 14) is in a brake position. The second diode (D2) is adapted to keep allowing a braking current to flow through the field winding (6, 8) when the switching element (16) is in an off-state by directly connecting a partial path between the switching element (16) and the current detection unit (R1, 18) on the braking current path and the other end of the armature (4).

The invention discloses a quantum communication method and system for terminal delay selection, and the method comprises the steps: carrying out the measurement operation of particles of a sending terminal, and obtaining a first measurement result; performing unitary transformation corresponding to the first measurement result on the particles of the receiving edge node; sequentially performing Htransformation and measurement operation on the particles of the non-target receiving terminal to obtain a second measurement result; and carrying out unitary transformation corresponding to the second measurement result on the particles of the target receiving terminal, and recovering the to-be-transmitted information. Visibly, according to the scheme, under the condition that the receiving terminal is not completely determined, the particle state can start the transmission behavior, the receiving edge node can select the receiving terminal while the particle state is in channel transmission,and after the final receiving terminal is determined, the particles have transmitted most paths, so that the time delay is effectively reduced, and finally information receiving is completed. The quantum communication process of selecting the terminal is delayed under the condition that the terminal is uncertain, and the information transmission efficiency is improved.