• Title/Summary/Keyword: matrix-crossings

Search Result 7, Processing Time 0.018 seconds

Fast Calculation of Capacitance Matrix for Strip-Line Crossings and Other Interconnects (교차되는 스트립 라인구조에서의 빠른 커패시턴스 계산기법)

  • Srinivasan Jegannathan;Lee Dong-Jun;Shim Duk-Sun;Yang Cheol-Kwan;Kim Hyung-Kyu;Kim Hyeong-Seok
    • The Transactions of the Korean Institute of Electrical Engineers C
    • /
    • v.53 no.10
    • /
    • pp.539-545
    • /
    • 2004
  • In this paper, we consider the problem of capacitance matrix calculation for strip-line and other interconnects crossings. The problem is formulated in the spectral domain using the method of moments. Sinc-functions are employed as basis functions. Conventionally, such a formulation leads to a large, non-sparse system of linear equations in which the calculation of each of the coefficient requires the evaluation of a Fourier-Bessel integral. Such calculations are computationally very intensive. In the method proposed here, we provide simplified expressions for the coefficients in the moment method matrix. Using these simplified expressions, the coefficients can be calculated very efficiently. This leads to a fast evaluation of the capacitance matrix of the structure. Computer simulations are provided illustrating the validity of the method proposed.

ALEXANDER POLYNOMIAL FOR LINK CROSSINGS

  • Lee, Youn W.
    • Bulletin of the Korean Mathematical Society
    • /
    • v.35 no.2
    • /
    • pp.235-258
    • /
    • 1998
  • We define a crossing of a link without referring to a specific projection of the link and describe a construction of a non-normalized Alexander polynomial associated to collections of such crossings of oriented links under an equivalence relation, called homology relation. The polynomial is computed from a special Seifert surface of the link. We prove that the polynomial is well-defined for the homology equivalence classes, investigate its relationship with the combinatorially defined Alexander polynomials and study some of its properties.

  • PDF

PRIME KNOTS WITH ARC INDEX 12 UP TO 16 CROSSINGS

  • Jin, Gyo Taek;Kim, Hyuntae;Lee, Seungwoo;Myung, Hun Joo
    • Journal of the Korean Mathematical Society
    • /
    • v.58 no.4
    • /
    • pp.967-976
    • /
    • 2021
  • We obtain the list of prime knots with arc index 12 up to 16 crossings and their minimal grid diagrams. This is a continuation of the works [5] and [8] in which Cromwell matrices were generated to obtain minimal grid diagrams of all prime knots up to arc index 11. We provide minimal grid diagrams of the prime alternating knots with arc index 12. They are the 10 crossing prime alternating knots. The full list of 19,513 prime knots of arc index 12 up to 16 crossings and their minimal grid diagrams can be found in the arXiv [6].

ON KRAMER-MESNER MATRIX PARTITIONING CONJECTURE

  • Rho, Yoo-Mi
    • Journal of the Korean Mathematical Society
    • /
    • v.42 no.4
    • /
    • pp.871-881
    • /
    • 2005
  • In 1977, Ganter and Teirlinck proved that any $2t\;\times\;2t$ matrix with 2t nonzero elements can be partitioned into four sub-matrices of order t of which at most two contain nonzero elements. In 1978, Kramer and Mesner conjectured that any $mt{\times}nt$ matrix with kt nonzero elements can be partitioned into mn submatrices of order t of which at most k contain nonzero elements. In 1995, Brualdi et al. showed that this conjecture is true if $m = 2,\;k\;\leq\;3\;or\;k\geq\;mn-2$. They also found a counterexample of this conjecture when m = 4, n = 4, k = 6 and t = 2. When t = 2, we show that this conjecture is true if $k{\leq}5$.

The Placement Algorithm of the Shuffle-Exchange Graph Using Matrix (매트릭스를 이용한 혼합교환도의 배치 알고리즘)

  • Hah, Ki Jong;Choi, Young Kyoo;Hwang, Ho Jung
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.24 no.2
    • /
    • pp.355-361
    • /
    • 1987
  • The shuffle-exchange graph is known as a structure to perform the parallel algorithms like Discrete Fourier Transform(DFT), matrix multiplication and sorting. In this paper, the layout for the shuffle-exchange graph is described and this layout places emphasis on the placement of nodes that has the capability to have as small area as possible, have as a small number of crossings as possible, and have as short wires as possible. The algorithm corrdsponding these conditions is proposed and each evaluation factor and the placement of the N-node shuffle-exchange graph is performed with FORTRAN and BASIC program, and these results are calcualted.

  • PDF

Colourings and the Alexander Polynomial

  • Camacho, Luis;Dionisio, Francisco Miguel;Picken, Roger
    • Kyungpook Mathematical Journal
    • /
    • v.56 no.3
    • /
    • pp.1017-1045
    • /
    • 2016
  • Using a combination of calculational and theoretical approaches, we establish results that relate two knot invariants, the Alexander polynomial, and the number of quandle colourings using any finite linear Alexander quandle. Given such a quandle, specified by two coprime integers n and m, the number of colourings of a knot diagram is given by counting the solutions of a matrix equation of the form AX = 0 mod n, where A is the m-dependent colouring matrix. We devised an algorithm to reduce A to echelon form, and applied this to the colouring matrices for all prime knots with up to 10 crossings, finding just three distinct reduced types. For two of these types, both upper triangular, we found general formulae for the number of colourings. This enables us to prove that in some cases the number of such quandle colourings cannot distinguish knots with the same Alexander polynomial, whilst in other cases knots with the same Alexander polynomial can be distinguished by colourings with a specific quandle. When two knots have different Alexander polynomials, and their reduced colouring matrices are upper triangular, we find a specific quandle for which we prove that it distinguishes them by colourings.

Predicting Carbon Dioxide Emissions of Incoming Traffic Flow at Signalized Intersections by Using Image Detector Data (영상검지자료를 활용한 신호교차로 접근차량의 탄소배출량 추정)

  • Taekyung Han;Joonho Ko;Daejin Kim;Jonghan Park
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.21 no.6
    • /
    • pp.115-131
    • /
    • 2022
  • Carbon dioxide (CO2) emissions from the transportation sector in South Korea accounts for 16.5% of all CO2 emissions, and road transportation accounts for 96.5% of this sector's emissions in South Korea. Hence, constant research is being carried out on methods to reduce CO2 emissions from this sector. With the emerging use of smart crossings, attempts to monitor individual vehicles are increasing. Moreover, the potential commercial deployment of autonomous vehicles increases the possibility of obtaining individual vehicle data. As such, CO2 emission research was conducted at five signalized intersections in the Gangnam District, Seoul, using data such as vehicle type, speed, acceleration, etc., obtained from image detectors located at each intersection. The collected data were then applied to the MOtor Vehicle Emission Simulator (MOVES)-Matrix model-which was developed to obtain second-by-second vehicle activity data and analyze daily CO2 emissions from the studied intersections. After analyzing two large and three small intersections, the results indicated that 3.1 metric tons of CO2 were emitted per day at each intersection. This study reveals a new possibility of analyzing CO2 emissions using actual individual vehicle data using an improved analysis model. This study also emphasizes the importance of more accurate CO2 emission analyses.