The following operators can be used to better focus your queries.
( ) , AND, OR, NOT, W/#
? single char wildcard, not at start
* multi char wildcard, not at start
(Cat? OR feline) AND NOT dog?
Cat? W/5 behavior
(Cat? OR feline) AND traits
Cat AND charact*
This guide provides a more detailed description of the syntax that is supported along with examples.
This search box also supports the look-up of an IP.com Digital Signature (also referred to as Fingerprint); enter the 72-, 48-, or 32-character code to retrieve details of the associated file or submission.
Concept Search - What can I type?
For a concept search, you can enter phrases, sentences, or full paragraphs in English. For example, copy and paste the abstract of a patent application or paragraphs from an article.
Concept search eliminates the need for complex Boolean syntax to inform retrieval. Our Semantic Gist engine uses advanced cognitive semantic analysis to extract the meaning of data. This reduces the chances of missing valuable information, that may result from traditional keyword searching.
A method is described which provides for a reduction of execution time proportional to one power of the locus point count involved in procedure application of in-circuit probe plate wirelength minimization.
English (United States)
This text was extracted from a PDF file.
This is the abbreviated version, containing approximately
92% of the total text.
Page 1 of 1
Linearization of Execution Vs. Number of Locus Points for Constrained
Distance Minimization, Assignment Procedure
A method is described which provides for a reduction of execution time
proportional to one power of the locus point count involved in procedure
application of in-circuit probe plate wirelength minimization.
Assume a rectangle as a uniformly distributed finite number of distinct points
and the constraint that the assignments of locus points to rectangle points is
distributed approximately uniformly within the rectangle boundary.
The new method, through the use of sectoring the locus and the
rectangle boundary, reduces the procedure execution time, which is
proportional to the number of instructions or calculations executed,
from quadratic to near linear dependence on the locus point count.
Define N,K = whole numbers N=K N = Number of locus points K
= Number of rectangle points M = Number of sectors N L = M =
number of locus points/sector
For the standard minimization procedure, one would have to calculate all
possible distances for minimization or: number of calculations = N.K = N2
If the locus and rectangle are sectored before minimization, the number of
distance calculations is: ***** SEE ORIGINAL FOR MATHEMATICAL
EQUATIONS IN DOCUMENT *****
Since N = ML, as N, the number of locus points is increased,
the number of sectors can be increased proportionally to compensate
for the quadratic dependency. This may be demonstrated by