• Title/Summary/Keyword: covers

Search Result 2,374, Processing Time 0.031 seconds

Backlight for TFT LCD

  • Jeong, Jin-Man;Eom, Deok-Soo
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 2000.01a
    • /
    • pp.201-202
    • /
    • 2000
  • This seminar outlines the technology involved in the backlighting of TFT LCDs. It covers basic terminology, lighting requirements, lamp types and optical techniques. These will be reviewed and compared. Optical factors will be covered and related to space constraints. The spectral requirements, luminance levels, system efficacy, power requirements, lamp temperature, as well as other parameters affecting system performance will be discussed.

  • PDF

ON A NOTION OF PAIRWISE FUNCTIONAL COMPACTNESS IN BITOPOLOGICAL SPACES

  • Bella, Angelo;Gallo, Giovanni
    • Kyungpook Mathematical Journal
    • /
    • v.28 no.1
    • /
    • pp.83-90
    • /
    • 1988
  • In this paper we give a notion of pairwise functional compactness in bitopological spaces. We characterize this class of spaces in terms of continuous functions and covers. Also, a characterization in terms of multifuncions is stated.

  • PDF

INJECTIVE CONVERS UNDER CHANGE OF RINGS

  • Song, Yeong-Moo;Kim, Hae-Sik
    • Communications of the Korean Mathematical Society
    • /
    • v.16 no.4
    • /
    • pp.567-572
    • /
    • 2001
  • Wurful gave a characterization of those rings R which satisfy that for every ring extension $R{\subset}S$. Ho $m_{R}$(S, -) preserves injective envelopes. In this note, we consider an analogous problem concerning injective covers.

  • PDF

Updates in postural tachycardia syndrome

  • Moon, Jangsup
    • Annals of Clinical Neurophysiology
    • /
    • v.23 no.1
    • /
    • pp.1-6
    • /
    • 2021
  • Postural tachycardia syndrome (POTS) is the most common form of orthostatic intolerance in young people. However, it is still considered an underrecognized disorder and so deserves more attention from clinicians. This review covers the diagnostic challenges, correlations between the symptoms, evidence of autoimmune involvement in the pathogenesis, and treatment strategies in POTS.

Some Uses of Computing in Caving

  • Dibben, N.
    • Journal of the speleological society of Korea
    • /
    • no.8
    • /
    • pp.65-76
    • /
    • 1998
  • This article is based upon a talk given at the 1983 National Caving Conference explaining the types of personal computers available, their main features and how they could be used in connection with caving. There may be two groups of readers particularly interested in this subject, those covers with use of a computer who want some ideas on using it and others who want to know if getting a computer to use in connection with caving might be worth their while.

  • PDF

Landscape Planning of Duryu Street Park in Taegu City (대구직할시(大邱直轄市) 두류공원(頭流公園) 도로조경계획(道路造景計劃))

  • Kim, Yong Soo;Lee, Hyun Taek
    • Current Research on Agriculture and Life Sciences
    • /
    • v.1
    • /
    • pp.113-140
    • /
    • 1983
  • This is a study on a landscape planning along the street 1~4, which are gateways to Taegu city and an important scenery. Therefore, emphasis was given to provide a bright, clean and beautiful first impression to visitors and citizens. The area is being developed for education and athletic park. Plans to construct a fountain, pergolas and a pond were set up to complement the active and passive facilities to the existing a athletic facilities in the area. Since D part in the area have alkali soil (pH 8.1), soil amendment is necessary for successful growth of trees and ground covers. When the area is filled or added with new soil for soil amendment, it will be important to use fresh soil which can support plant growth. It will be ideal to use ground covers and shrubs on the existing retaining walls along the street for keeping natural vegetation and slope stability instead of further cutting and reconstruction. It is not reasonable in technical and economic sense to remove rocks of the slope for planting trees. In order to harmonize plant color distribute, tall needle and broad leaf trees in the background as a screen, flowering trees were arranged in groups at front, and annuals were mass-planted along the footway. Natural-form-trees will be planted because they not only serve as a greenbelt but also are more economics in maintenance than formative trees.

  • PDF

Algorithm and Implementation for Real-Time Intelligent Browsing of HD Bitstream in DTV PVR (DTV PVR에서 HD급 데이터의 실시간 지능형 검색을 위한 알고리즘 및 구현)

  • 정수운;장경훈;이동호
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.40 no.6
    • /
    • pp.118-126
    • /
    • 2003
  • This paper presents a low-complexity algorithm lot browsing a HD bit stream in DTV PVR according to its characteristics and also presents its implementation results. We propose an efficient algorithm which detects shots using some information after decoding MPEG-2 data, clusters them into scene and episode, and intelligently browses them according to some criteria after calculating their complexity. Some simulation results are presented to show the performance feasibility of the proposed algorithm. To implement it in real time, we propose an efficient hybrid architecture which partitions the algorithm into two parts of hardware and software. The hardware covers decoding process and extraction of some basic information which take most complexity in implementing the algorithm. The software covers the heuristic part of tile algorithm which has low complexity and needs to be expandable.

Conditions for Disjoint Path Coverability in Proper Interval Graphs (진구간 그래프의 서로소인 경로 커버에 대한 조건)

  • Park, Jung-Heum
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.10
    • /
    • pp.539-554
    • /
    • 2007
  • In this Paper, we investigate conditions for proper interval graphs to have k-disjoint path covers of three types each: one-to-one, one-to-many, and many-to-many. It was proved that for $k{\geq}2$, a proper interval graph is one-to-one k-disjoint path coverable if and only if the graph is k-connected, and is one-to-many k-disjoint path coverable if and only if the graph is k+1-connected. For $k{\geq}3$, a Proper interval graph is (paired) many-to-many k-disjoint path coverable if and only if the graph is 2k-1-connected.