scholarly journals Verification of connectivity of electrical connections in topology of radio electronic equipment products

2019 ◽  
pp. 21-25
Author(s):  
G. N. Brusnikin
Keyword(s):  
Time Complexity ◽  
Undirected Graph ◽  
Electronic Equipment ◽  
Large Dimension ◽  
Complexity Of Algorithms ◽  
Colored Graphs ◽  
Straight Line ◽  
Effective Use ◽  
Electrical Connections

The solution of the problem of verifying the connectivity of electrical connections in the VLSI topology is considered. Effective use of computing resources is based on the use of quasi‑linear computational (temporal and capacitive) complexity of algorithms: sweeping the plane of a straight line for constructing a graph of electrical connections; allocation of subsets of connected vertices in the components of the connection of an undirected graph of large dimension for the determination of electrically connected contacts; establish isomorphism of component‑full colored graphs for comparing the restored list with the original list of electrical connections The proposed solution has a time complexity O(N + N log2 N ) and the capacitive complexity O(s + N ), where N is the number of elements in the topology and s is the number of contacts in the source circuit.

Duplex Spread Blade Method for Cutting Hypoid Gears with Modified Tooth Surface

1998 ◽  
Vol 120 (3) ◽  
pp. 441-447 ◽  
Author(s):  
K. Kawasaki ◽  
H. Tamura
Keyword(s):  
Cutting Edge ◽  
Tooth Surface ◽  
Radius Of Curvature ◽  
Large Radius ◽  
Ring Gear ◽  
Circular Arc ◽  
Hypoid Gears ◽  
Manufacturing Method ◽  
Straight Line

In this paper, a duplex spread blade method for cutting hypoid gears with modified tooth surface is proposed. The duplex spread blade method provides a rapid and economical manufacturing method because both the ring gear and pinion are cut by a spread blade method. In the proposed method, the nongenerated ring gear is manufactured with cutting edge that is altered from the usual straight line to a circular arc with a large radius of curvature and the circular arc cutting edge produces a modified tooth surface. The pinion is generated by a cutter with straight cutting edges as usual. The main procedure of this method is the determination of the cutter specifications and machine settings. The proposed method was validated by gear manufacture.

scholarly journals Simple and Exact Closed-Form Expression for Determination of a Penetrated Ray Path in a Ray Tracing

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Hyun Wook Moon ◽  
Woojoong Kim ◽  
Sewoong Kwon ◽  
Jaeheung Kim ◽  
Young Joong Yoon
Keyword(s):  
Closed Form ◽  
Approximate Method ◽  
Ray Tracing ◽  
Conventional Method ◽  
Closed Form Expression ◽  
Indoor Environments ◽  
Straight Line ◽  
Ray Path ◽  
Ray Tracing Simulation

A simple and exact closed-form equation to determine a penetrated ray path in a ray tracing is proposed for an accurate channel prediction in indoor environments. Whereas the penetrated ray path in a conventional ray tracing is treated as a straight line without refraction, the proposed method is able to consider refraction through the wall in the penetrated ray path. Hence, it improves the accuracy in ray tracing simulation. To verify the validation of the proposed method, the simulated results of conventional method, approximate method, and proposed method are compared with the measured results. The comparison shows that the proposed method is in better agreement with the measured results than the conventional method and approximate method, especially in high frequency bands.

scholarly journals A New Method for the Extraction of Diode Parameters Using a Single Exponential Model

2000 ◽  
Vol 22 (3) ◽  
pp. 157-163 ◽  
Author(s):  
S. Dib ◽  
M. De La Bardonnie ◽  
A. Khoury ◽  
F. Pelanchon ◽  
P. Mialhe
Keyword(s):  
Least Squares Method ◽  
Exponential Model ◽  
New Method ◽  
Ordinate Axis ◽  
Straight Line ◽  
Current Voltage ◽  
Method Approach ◽  
Single Exponential

A new method for extracting junction parameters of the single diode model is presented. A least squares method approach considers the deviation ∆V=f(I) between the experimental current-voltage (I-V) characteristic and a theoretical arbitrary characteristic. A specific case- the ∆V graph reducing to a straight line–is identified and the knowledge of the slope and of the intercept with the ordinate axis leads to the determination of the junction parameters. The method is applied to the characterization of the emitter-base junction of transistors and the results are discussed.

scholarly journals On paths, trails and closed trails in edge-colored graphs

2012 ◽  
Vol Vol. 14 no. 2 (Graph Theory) ◽  
Author(s):  
Laurent Gourvès ◽  
Adria Lyra ◽  
Carlos A. Martinhon ◽  
Jérôme Monnot
Keyword(s):  
Polynomial Time ◽  
Optimal Solution ◽  
Colored Graph ◽  
Edge Disjoint ◽  
Colored Graphs ◽  
International Audience ◽  
Np Complete ◽  
T Path ◽  
Vertex Disjoint

Graph Theory International audience In this paper we deal from an algorithmic perspective with different questions regarding properly edge-colored (or PEC) paths, trails and closed trails. Given a c-edge-colored graph G(c), we show how to polynomially determine, if any, a PEC closed trail subgraph whose number of visits at each vertex is specified before hand. As a consequence, we solve a number of interesting related problems. For instance, given subset S of vertices in G(c), we show how to maximize in polynomial time the number of S-restricted vertex (resp., edge) disjoint PEC paths (resp., trails) in G(c) with endpoints in S. Further, if G(c) contains no PEC closed trails, we show that the problem of finding a PEC s-t trail visiting a given subset of vertices can be solved in polynomial time and prove that it becomes NP-complete if we are restricted to graphs with no PEC cycles. We also deal with graphs G(c) containing no (almost) PEC cycles or closed trails through s or t. We prove that finding 2 PEC s-t paths (resp., trails) with length at most L > 0 is NP-complete in the strong sense even for graphs with maximum degree equal to 3 and present an approximation algorithm for computing k vertex (resp., edge) disjoint PEC s-t paths (resp., trails) so that the maximum path (resp., trail) length is no more than k times the PEC path (resp., trail) length in an optimal solution. Further, we prove that finding 2 vertex disjoint s-t paths with exactly one PEC s-t path is NP-complete. This result is interesting since as proved in Abouelaoualim et. al.(2008), the determination of two or more vertex disjoint PEC s-t paths can be done in polynomial time. Finally, if G(c) is an arbitrary c-edge-colored graph with maximum vertex degree equal to four, we prove that finding two monochromatic vertex disjoint s-t paths with different colors is NP-complete. We also propose some related problems.

On Line Distributions of Kelvin Sources

1964 ◽  
Vol 8 (04) ◽  
pp. 45-52
Author(s):  
E. O. Tuck
Keyword(s):  
Free Surface ◽  
Physical Properties ◽  
Velocity Potential ◽  
Fourier Transforms ◽  
Point Sources ◽  
Straight Line ◽  
On Line ◽  
New Form ◽  
Line Of Singularities

The velocity potential for the flow due to point sources distributed arbitrarily along a straight line near to or at a linearized gravitational free surface is obtained in a new form by use of Fourier transforms. Such a method of representing the potential facilitates the determination of its behavior near to the line of singularities; this behavior is derived formally and its physical properties discussed. A brief illustration is given of a method of using this result in o theory for the motion of a slender ship.

Determination of oxygenated, mixed venous blood CO2 tension by a breath-holding method

1960 ◽  
Vol 15 (2) ◽  
pp. 225-228 ◽  
Author(s):  
John H. Knowles ◽  
William Newman ◽  
Wallace O. Fenn
Keyword(s):  
Venous Blood ◽  
Mean Value ◽  
Rate Of Change ◽  
Breath Holding ◽  
Mixed Venous Blood ◽  
Clinical Method ◽  
Straight Line ◽  
Zero Rate ◽  
The Mean

At the end of a normal expiration the subject inhaled a given volume of gas mixtures containing different concentrations of CO2 in O2 from 5 to 17%. These were held in the lung for 3 and then again for 12 seconds and were then expired and analyzed. Analyses were made with an infrared analyzer and times were obtained from the graphical record. If the rate of change of CO2 tension is plotted against the mean CO2 tension a straight line results which passes through zero rate at the tension which equals the tension of CO2 in the mixed oxygenated venous blood. From the slope of this straight line it is possible to calculate the cardiac output if the lung volume and slope of the CO2 dissociation curve of the blood are known. Data are presented from 37 experiments on 10 subjects. The method is believed to be theoretically sound but has not been validated as a practical clinical method. Occasional erratic points were obtained, especially in untrained subjects. The standard error of the mean value for venous CO2 tension was 1.9 mm Hg. Submitted on July 13, 1959

On the General Class of Models of Adiabatic Evolution

2016 ◽  
Vol 23 (03) ◽  
pp. 1650016 ◽  
Author(s):  
Jie Sun ◽  
Songfeng Lu ◽  
Fang Liu
Keyword(s):  
Ground State ◽  
General Class ◽  
Time Complexity ◽  
State Energy ◽  
Search Problem ◽  
Quantum Search ◽  
Final States ◽  
Adiabatic Evolution ◽  
Speed Up ◽  
Effective Use

The general class of models of adiabatic evolution was proposed to speed up the usual adiabatic computation in the case of quantum search problem. It was shown [8] that, by temporarily increasing the ground state energy of a time-dependent Hamiltonian to a suitable quantity, the quantum computation can perform the calculation in time complexity O(1). But it is also known that if the overlap between the initial and final states of the system is zero, then the computation based on the generalized models of adiabatic evolution can break down completely. In this paper, we find another severe limitation for this class of adiabatic evolution-based algorithms, which should be taken into account in applications. That is, it is still possible that this kind of evolution designed to deal with the quantum search problem fails completely if the interpolating paths in the system Hamiltonian are chosen inappropriately, while the usual adiabatic evolutions can do the same job relatively effectively. This implies that it is not always recommendable to use nonlinear paths in adiabatic computation. On the contrary, the usual simple adiabatic evolution may be sufficient for effective use.

Sign in / Sign up

Export Citation Format

Share Document