• Title/Summary/Keyword: Row-by-Row

Search Result 1,055, Processing Time 0.03 seconds

Analysis of Row and Column Lines in TFT-LCD panels with a Distributed Electrical Model

  • Park, Hyun-Woo;Kim, Soo-Hwan;Kim, Gyoung-Bum;Hwang, Sung-Woo;Kim, Su-Ki;McCartney, Richard I.
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 2005.07b
    • /
    • pp.882-886
    • /
    • 2005
  • As the TFT-LCD panels become larger and provide higher resolution, the distributed capacitive and resistive lines induce the propagation delay, reduce the TFT-on time and deteriorate the pixel chargingratio. A number of the compensation methods, like the H-LDC (Horizontal Line Delay Compensation), have been proposed to compensate the propagation delay of the large and high resolution panels [1]. These methods, however, require the comparatively accurate gate propagation delay estimates at each column driver. In this paper, by observing the actual gate and data waveform from 15-inch XGA TFT-LCD panels, we could predict the propagation delay along the row and column line.

  • PDF

Memory Circuit of Nonvolatile Single Transistor Ferroelectric Field Effect Transistor (비휘발성 단일트랜지스터 강유전체 메모리 회로)

  • 양일석;유병곤;유인규;이원재
    • Proceedings of the IEEK Conference
    • /
    • 2000.11b
    • /
    • pp.55-58
    • /
    • 2000
  • This paper describes a single transistor type ferroelectric field effect transistor (1T FeFET) memory celt scheme which can select one unit memory cell and program/read it. To solve the selection problem of 1T FeEET memory cell array, the row direction common well is electrically isolated from different adjacent row direction column. So, we can control voltage of common well line. By applying bias voltage to Gate and Well, respectively, we can implant IT FeEET memory cell scheme which no interface problem and can bit operation. The results of HSPICE simulations showed the successful operations of the proposed cell scheme.

  • PDF

Construction of Web-based Structural Design Environment for Mid and Row-Rise Buildings (웹기반 중저층건물 구조설계 시스템 및 환경 구축)

  • Hwang Young-Chul;Kim Chee-Kyeong
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2006.04a
    • /
    • pp.500-507
    • /
    • 2006
  • Recently, the structural design code has been changed and every buildings, which have more than three floors or wider area than 1,000m2, should be designed to be able to resist earthquakes. However, most structural engineers are working in some big cities and this physical distance would set a barrier between structural engineers and architects. As a result, most row-rise buildings in small cities are designed and constructed without structural design or the consulting by structural engineers. The purpose of this research is to develop an web-based structural design environment in which structural design and consulting can be performed efficiently through on-line communication without off-line meetings or documents. In addition to the on-line communication, the system has a integrated structural design module which supports all the process of structural design and can increases the productivity of structural design work.

  • PDF

15 Park Row New York City - 120 Years Later, Still Relevant in Contextualism and Sustainability

  • Karahan, Beyhan
    • International Journal of High-Rise Buildings
    • /
    • v.9 no.1
    • /
    • pp.61-70
    • /
    • 2020
  • After the 1884 Home Insurance building in Chicago and 1889 Tower building in New York, 15 Park Row became the tallest building in the USA in 1899 and it held this record for nine years. Completed just before the arrival of the 20th century, this building deserves to be recognized for the sophistication of its architecture with respect to contextual understanding of the 19th century historic texture in Lower Manhattan, its uniquely economical floor plans, and its use of natural ventilation and daylight. The compositional techniques using the proportional analysis of its context reflect the highest level of architectural education of its time by its architect Robert H. Robinson. In addition, it also offers a unique glimpse to the state-of-the-art technology of its time regarding its structure, its use of movement systems that was capable of serving 4000 users.

A Study on the Dwelling Sites of the Bronze Age - focused on the Relic of Seoktan-Ri - (청동기시대(靑銅器時代) 주거지(住居址)에 관한 연구(硏究) -석탄리유적(石灘里遺蹟)을 중심(中心)으로-)

  • Shin, Sang-Hyo;Cheon, Deuk-Youm
    • Journal of architectural history
    • /
    • v.4 no.1
    • /
    • pp.29-42
    • /
    • 1995
  • This study aims at examinating the change of architectural technique in the residential district of Seoktanri(石灘里), and then extracting the restorable types from it. The constructive technique was advanced in the composition of walls and the use of footing. The arrangement of columns was developed to standing them in a row and three rows in the center of interior space. In the light of excavated relics and the position of furnace, the interior space is seperated into cooking-heating, working and storing space. By the difference of height and the slope, the floor is divided into two parts which are low and high. According to the arrangement of column-holes, the types of roofs to be restored are as follows; the gable roof without column-hole, the hipped roof with center-column-holes(中央柱孔) in a row and the gable roof with center-column-holes in three rows.

  • PDF

Consecutive Operand-Caching Method for Multiprecision Multiplication, Revisited

  • Seo, Hwajeong;Kim, Howon
    • Journal of information and communication convergence engineering
    • /
    • v.13 no.1
    • /
    • pp.27-35
    • /
    • 2015
  • Multiprecision multiplication is the most expensive operation in public key-based cryptography. Therefore, many multiplication methods have been studied intensively for several decades. In Workshop on Cryptographic Hardware and Embedded Systems 2011 (CHES2011), a novel multiplication method called 'operand caching' was proposed. This method reduces the number of required load instructions by caching the operands. However, it does not provide full operand caching when changing the row of partial products. To overcome this problem, a novel method, that is, 'consecutive operand caching' was proposed in Workshop on Information Security Applications 2012 (WISA2012). It divides a multiplication structure into partial products and reconstructs them to share common operands between previous and next partial products. However, there is still room for improvement; therefore, we propose a finely designed operand-caching mode to minimize useless memory accesses when the first row is changed. Finally, we reduce the number of memory access instructions and boost the speed of the overall multiprecision multiplication for public key cryptography.

An Linear Bottleneck Assignment Problem (LBAP) Algorithm Using the Improving Method of Solution for Linear Minsum Assignment Problem (LSAP)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.1
    • /
    • pp.131-138
    • /
    • 2016
  • In this paper, we propose a simple linear bottleneck assignment problems (LBAP) algorithm to find the optimal solution. Generally, the LBAP has been solved by threshold or augmenting path algorithm. The primary characteristic of proposed algorithm is derived the optimal solution of LBAP from linear sum assignment problem (LSAP). Firstly, we obtains the solution for LSAP from the selected minimum cost of rows and moves the duplicated costs in row to unselected row with minimum increasing cost in direct and indirect paths. Then, we obtain the optimal solution of LBAP according to the maximum cost of LSAP can be move to less cost. For the 29 balanced and 7 unbalanced problem, this algorithm finds optimal solution as simple.

CONSTRUCTIONS OF REGULAR SPARSE ANTI-MAGIC SQUARES

  • Chen, Guangzhou;Li, Wen;Xin, Bangying;Zhong, Ming
    • Bulletin of the Korean Mathematical Society
    • /
    • v.59 no.3
    • /
    • pp.617-642
    • /
    • 2022
  • For positive integers n and d with d < n, an n × n array A based on 𝒳 = {0, 1, …, nd} is called a sparse anti-magic square of order n with density d, denoted by SAMS(n, d), if each non-zero element of X occurs exactly once in A, and its row-sums, column-sums and two main diagonal-sums constitute a set of 2n + 2 consecutive integers. An SAMS(n, d) is called regular if there are exactly d non-zero elements in each row, each column and each main diagonal. In this paper, we investigate the existence of regular sparse anti-magic squares of order n ≡ 1, 5 (mod 6), and prove that there exists a regular SAMS(n, d) for any n ≥ 5, n ≡ 1, 5 (mod 6) and d with 2 ≤ d ≤ n - 1.

Redescription of Gonostomum algicola and G. gonostomoida (Ciliophora: Spirotrichea: Sporadotrichida) Unknown from Korea

  • Kim, Yeon-Uk;Shin, Mann-Kyoon
    • Animal Systematics, Evolution and Diversity
    • /
    • v.22 no.2
    • /
    • pp.209-215
    • /
    • 2006
  • Two rare ciliates from soil under the oak tree and mosses in the top of mountain in Korea were identified as Gonostomum algicola Gellert, 1942 and G. gonostomoida (Hemberger, 1985), respectively. There is little information on their morphological features, therefore their detailed redescriptions are needed. The description was based on the observation of living and protargol impregnated specimens, and biometric analysis. Their diagnostic characteristics are as follows. Gonostomum algicola; $88-113\times30-40{\mu}m$ in vivo, colourless cortical granules, 20-31 adoral membranelles, two fronto-terminal cirri, five fronto-ventral cirri, no mid-ventral cirri, two transverse cirri, two to three micronuceli. Gonostomum gonostomoida; $60-121\times21-40{\mu}m$ in vivo, no cortical granules, 27-34 adoral membranelles, no fronto-terminal cirri, two fronto-ventral cirral rows with each row bearing three cirri, midventral cirral row with 11-14 cirri, two to three transverse cirri, one to six micronuceli. So far, total three species within the genus Gonostomum have been recorded from Korea by the present study.

SIMPLE FORMULATIONS ON CIRCULANT MATRICES WITH ALTERNATING FIBONACCI

  • Sugi Guritman
    • Communications of the Korean Mathematical Society
    • /
    • v.38 no.2
    • /
    • pp.341-354
    • /
    • 2023
  • In this article, an alternating Fibonacci sequence is defined from a second-order linear homogeneous recurrence relation with constant coefficients. Then, the determinant, inverse, and eigenvalues of the circulant matrices with entries in the first row having the formation of the sequence are formulated explicitly in a simple way. In this study, the method for deriving the formulation of the determinant and inverse is simply using traditional elementary row or column operations. For the eigenvalues, the known formulation from the case of general circulant matrices is simplified by considering the specialty of the sequence and using cyclic group properties. We also propose algorithms for the formulation to show how efficient the computations are.