121 results about "Partial path" patented technology

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.

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.

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.

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 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 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 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.