• Title/Summary/Keyword: 도드

Search Result 4, Processing Time 0.018 seconds

다국적 기업-크레오(creo)

  • Yun, Jae-Ho
    • 프린팅코리아
    • /
    • s.9
    • /
    • pp.102-105
    • /
    • 2003
  • 크레오는 프리프레스 솔루션 개발, 공급 업체로서 전문 디지털 카메라, 카피도드스캐닝 시스템, 잉크젯과 하프톤 디지털프루퍼, 워크플로우 관리 툴, 다양한 워크플로우 시스템, CTP, CTF 시스템과 초고속 컬러서버 및 POD 디지털 프린터에 이르기까지 총 300여개가 넘는 제품을 출시하고 있으며, 자체적으로 개발된 온 프레스 이미징 기술과 디지털 프리프레스 부품을 OEM으로 공급하고 있는 회사다.

  • PDF

On Identity Between Truth Bearer and Fact (진리담지자와 사실 사이의 동일성에 대하여)

  • Kim, Donghyun
    • Korean Journal of Logic
    • /
    • v.21 no.2
    • /
    • pp.207-231
    • /
    • 2018
  • The identity theory of truth insists that a truth bearer is identical with a fact. First, I will consider how we can make the thesis intelligible. For this, I classify the identity relation which the identity theory discusses into two kind; trivial and non-trivial relation. And I show that the trivial one is not adequate to be qualified to be applied to the identity theory. The non-trivial relation can be adopted in robust or modest way. I argue that the robust kind of identity theory is incoherent itself. Then, I explain why we should compare the modest identity theory with the deflationism. From this comparing, I will draw the consequence that two choices are left to the modest theory. If they choose one way, there is no reason for us to prefer the identity theory to deflationism. On the other hand, in case that they choose the other way, I argue what kinds of interesting problem is left to be solved by the modest theorists. Finally, I will evaluate the limit and prospect of the result of the problem in case that the identity theorists achieve their goal.

Effects of structural nonidealities on the lasing characteristics of $\lambda$/4 phase-shifted DFB lasers ($\lambda$/4 위상천이 DFB 레이저 다이도드에서 grating 구조상의 비이상성이 발진특성에 미치는 영향)

  • 조종섭;김상배
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.7
    • /
    • pp.245-252
    • /
    • 1996
  • $\lambda$/4 phase-shifted DFB lasers with nonideal grating structure have been studied by using an effective-index transfer matrix method where material dispersion, vwaveguide dispersion and waveguide-structuredependent loss are taken into consideration. Nonideal grating structure in the center phase-shift region does not incur serous degradation of laser characteristics. Phase-shift error from the ideal shift of $\pi$ causes a decrease in the threshold gain difference and lasing wavelength shift and should be less than $\pi$/4 when residual facet reflectivity is 0.7%. also, positional error of the phase-shift should be less than 9% of the cavity length in order for the threshold gain difference to be decreased less than 10%.

  • PDF

X-tree Diff: An Efficient Change Detection Algorithm for Tree-structured Data (X-tree Diff: 트리 기반 데이터를 위한 효율적인 변화 탐지 알고리즘)

  • Lee, Suk-Kyoon;Kim, Dong-Ah
    • The KIPS Transactions:PartC
    • /
    • v.10C no.6
    • /
    • pp.683-694
    • /
    • 2003
  • We present X-tree Diff, a change detection algorithm for tree-structured data. Our work is motivated by need to monitor massive volume of web documents and detect suspicious changes, called defacement attack on web sites. From this context, our algorithm should be very efficient in speed and use of memory space. X-tree Diff uses a special ordered labeled tree, X-tree, to represent XML/HTML documents. X-tree nodes have a special field, tMD, which stores a 128-bit hash value representing the structure and data of subtrees, so match identical subtrees form the old and new versions. During this process, X-tree Diff uses the Rule of Delaying Ambiguous Matchings, implying that it perform exact matching where a node in the old version has one-to one corrspondence with the corresponding node in the new, by delaying all the others. It drastically reduces the possibility of wrong matchings. X-tree Diff propagates such exact matchings upwards in Step 2, and obtain more matchings downwsards from roots in Step 3. In step 4, nodes to ve inserted or deleted are decided, We aldo show thst X-tree Diff runs on O(n), woere n is the number of noses in X-trees, in worst case as well as in average case, This result is even better than that of BULD Diff algorithm, which is O(n log(n)) in worst case, We experimented X-tree Diff on reat data, which are about 11,000 home pages from about 20 wev sites, instead of synthetic documets manipulated for experimented for ex[erimentation. Currently, X-treeDiff algorithm is being used in a commeercial hacking detection system, called the WIDS(Web-Document Intrusion Detection System), which is to find changes occured in registered websites, and report suspicious changes to users.