• 제목/요약/키워드: conditional pass

검색결과 10건 처리시간 0.021초

CONDITIONAL GENERALIZED WIENER MEASURES

  • Kang, Soon-Ja
    • 대한수학회보
    • /
    • 제28권2호
    • /
    • pp.147-161
    • /
    • 1991
  • In this paper we define the conditional generalized Wiener measure and then express the conditional generalized Wiener integral over this new measure. In particular we consider a conditional expectation of functionals of the generalized Brownian paths under the condition that the paths pass through the given points .xi.$_{1}$, .xi.$_{2}$, .., .xi.$_{n}$ at times t$_{1}$, t$_{2}$, .., t$_{n}$, respectively.ely.

  • PDF

승강기 안전관리제도의 문제점 분석에 관한 연구 (Analysis on Safety Management of Elevator)

  • 최기흥
    • 한국안전학회지
    • /
    • 제22권6호
    • /
    • pp.7-12
    • /
    • 2007
  • This study focuses on the statistical analysis on safety management of elevators. Specifically, frequency and severity of accidents in relation to conditional pass in periodic inspection, maintenance, market surveillance are analysed based on the statistical data and social loss due to poor management is estimated. The results of statistical analysis performed in this study will provide logical basis and future direction for improving the safety management system.

EEPL을 사용한 저 전력 108-bit 조건합 가산기의 설계 (Design of a Low Power 108-bit Conditional Sum Adder Using Energy Economized Pass-transistor Logic(EEPL))

  • 조기선;송민규
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1999년도 추계종합학술대회 논문집
    • /
    • pp.363-367
    • /
    • 1999
  • In this paper, a novel 108-bit conditional sum adder(CSA) with Energy Economized Pass-transistor Logic(EEPL) is proposed. A new architecture is adopted, in order to obtain a high speed operation, which is composed of seven modularized 16-bit CMS's and two separated carry generation block. Further a design technique based on EEPL is proposed to reduce the power consumption. With 0.65${\mu}{\textrm}{m}$ single poly, triple metal, 3.3V CMOS process, its operating speed is about 4.95㎱ and the power consumption is reduced in comparison with that of the conventional adder.

  • PDF

개선된 조건 합 가산기를 이용한 $54{\times}54$-bit 곱셈기의 설계 (Design of a $54{\times}54$-bit Multiplier Based on a Improved Conditional Sum Adder)

  • 이영철;송민규
    • 대한전자공학회논문지SD
    • /
    • 제37권1호
    • /
    • pp.67-74
    • /
    • 2000
  • 개선된 조건 합 가산기를 이용한 저전력 고속 $54{\times}54$-bit 곱셈기를 설계했다. 지연시간을 감소시키기 위해, Booth's Encoder 없이 높은 압축 율을 갖는 압축기들과 Carry 발생블록을 분리시킨 108-bit 조건 합 가산기를 제안하였다. 또한, 지연시간과 전력소모를 최적화하기 위해 패스 트랜지스터로직을 사용한 설계기법을 제안하였다. 제안된 곱셈기는 기존 곱셈기구조에 비해 약 12%의 지연시간과 5%의 전력소모가 감소하였으며, 0.65${\mu}m$ CMOS(Single-poly, triple-metal)공정을 사용하여 $6.60{\times}6.69mm^2$의 칩 크기와 공급전압 3.3V에서 13.5ns의 지연시간을 갖는다.

  • PDF

Trends and Issues in Safety Management of Elevators in Korea

  • Choi, Gi-Heung
    • International Journal of Safety
    • /
    • 제6권2호
    • /
    • pp.13-16
    • /
    • 2007
  • This study focuses on the trends and issues of improving safety management of elevators in Korea. Frequency and severity of accidents in relation to conditional pass in periodic inspection, maintenance, market surveillance are analyzed based on the statistical data and social cost due to a variety of related fields in managing elevator safety was estimated first. The results of statistical analysis performed in this study will provide logical basis and future direction for improving the safety management system. The role of certification and supervision is particularly addressed to reduce the related accidents and the social cost. The effectiveness of such procedures can be found from the results of simple statistical analysis.

Chinese-clinical-record Named Entity Recognition using IDCNN-BiLSTM-Highway Network

  • Tinglong Tang;Yunqiao Guo;Qixin Li;Mate Zhou;Wei Huang;Yirong Wu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권7호
    • /
    • pp.1759-1772
    • /
    • 2023
  • Chinese named entity recognition (NER) is a challenging work that seeks to find, recognize and classify various types of information elements in unstructured text. Due to the Chinese text has no natural boundary like the spaces in the English text, Chinese named entity identification is much more difficult. At present, most deep learning based NER models are developed using a bidirectional long short-term memory network (BiLSTM), yet the performance still has some space to improve. To further improve their performance in Chinese NER tasks, we propose a new NER model, IDCNN-BiLSTM-Highway, which is a combination of the BiLSTM, the iterated dilated convolutional neural network (IDCNN) and the highway network. In our model, IDCNN is used to achieve multiscale context aggregation from a long sequence of words. Highway network is used to effectively connect different layers of networks, allowing information to pass through network layers smoothly without attenuation. Finally, the global optimum tag result is obtained by introducing conditional random field (CRF). The experimental results show that compared with other popular deep learning-based NER models, our model shows superior performance on two Chinese NER data sets: Resume and Yidu-S4k, The F1-scores are 94.98 and 77.59, respectively.

새로운 복합모드로직과 사인선택 Booth 인코더를 이용한 고성능 32$\times$32-bit 곱셈기의 설계 (Design of a High Performance 32$\times$32-bit Multiplier Based on Novel Compound Mode Logic and Sign Select Booth Encoder)

  • 김진화;송민규
    • 대한전자공학회논문지SD
    • /
    • 제38권3호
    • /
    • pp.205-210
    • /
    • 2001
  • 본 논문에서는 CMOS 로직과 pass-transistor logic(PTL)의 장점만을 가진 새로운 복합모드로직(Compound Mode Logic)을 제안하였다. 제안된 로직은 VLSI설계에서 중요하게 부각되고 있는 저전력, 고속 동작이 가능하며 실제로 전가산기를 설계하여 측정 한 결과 복합모드 로직의 power-delay 곱은 일반적인 CMOS로직에 비해 약 22% 개선되었다 제안한 복합모드 로직을 이용하여 고성능 32×32-bit 곱셈기를 설계 제작하였다. 본 논문의 곱셈기는 개선된 사인선택(Sign Select) Booth 인코더, 4-2 및 9-2 압축기로 구성된 데이터 압축 블록, 그리고 carry 생성 블록을 분리한 64-bit 조건 합 가산기로 구성되어 있다. 0.6um 1-poly 3-metal CMOS 공정을 이용하여 제작된 32×32-bit 곱셈기는 28,732개의 트랜지스터와 1.59×l.68 ㎜2의 면적을 가졌다. 측정 결과 32×32-bit 곱셈기의 곱셈시간은 9.8㎱ 이었으며, 3.3V 전원 전압에서 186㎽의 전력 소모를 하였다.

  • PDF

Denoise of Astronomical Images with Deep Learning

  • Park, Youngjun;Choi, Yun-Young;Moon, Yong-Jae;Park, Eunsu;Lim, Beomdu;Kim, Taeyoung
    • 천문학회보
    • /
    • 제44권1호
    • /
    • pp.54.2-54.2
    • /
    • 2019
  • Removing noise which occurs inevitably when taking image data has been a big concern. There is a way to raise signal-to-noise ratio and it is regarded as the only way, image stacking. Image stacking is averaging or just adding all pixel values of multiple pictures taken of a specific area. Its performance and reliability are unquestioned, but its weaknesses are also evident. Object with fast proper motion can be vanished, and most of all, it takes too long time. So if we can handle single shot image well and achieve similar performance, we can overcome those weaknesses. Recent developments in deep learning have enabled things that were not possible with former algorithm-based programming. One of the things is generating data with more information from data with less information. As a part of that, we reproduced stacked image from single shot image using a kind of deep learning, conditional generative adversarial network (cGAN). r-band camcol2 south data were used from SDSS Stripe 82 data. From all fields, image data which is stacked with only 22 individual images and, as a pair of stacked image, single pass data which were included in all stacked image were used. All used fields are cut in $128{\times}128$ pixel size, so total number of image is 17930. 14234 pairs of all images were used for training cGAN and 3696 pairs were used for verify the result. As a result, RMS error of pixel values between generated data from the best condition and target data were $7.67{\times}10^{-4}$ compared to original input data, $1.24{\times}10^{-3}$. We also applied to a few test galaxy images and generated images were similar to stacked images qualitatively compared to other de-noising methods. In addition, with photometry, The number count of stacked-cGAN matched sources is larger than that of single pass-stacked one, especially for fainter objects. Also, magnitude completeness became better in fainter objects. With this work, it is possible to observe reliably 1 magnitude fainter object.

  • PDF

A Study on the Preprocessing Method Using Construction of Watershed for Character Image segmentation

  • Nam Sang Yep;Choi Young Kyoo;Kwon Yun Jung;Lee Sung Chang
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2004년도 학술대회지
    • /
    • pp.814-818
    • /
    • 2004
  • Off-line handwritten character recognition is in difficulty of incomplete preprocessing because it has not dynamic and timing information besides has various handwriting, extreme overlap of the consonant and vowel and many error image of stroke. Consequently off-line handwritten character recognition needs to study about preprocessing of various methods such as binarization and thinning. This paper considers running time of watershed algorithm and the quality of resulting image as preprocessing For off-line handwritten Korean character recognition. So it proposes application of effective watershed algorithm for segmentation of character region and background region in gray level character image and segmentation function for binarization image and segmentation function for binarization by extracted watershed image. Besides it proposes thinning methods which effectively extracts skeleton through conditional test mask considering running time and quality. of skeleton, estimates efficiency of existing methods and this paper's methods as running time and quality. Watershed image conversion uses prewitt operator for gradient image conversion, extracts local minima considering 8-neighborhood pixel. And methods by using difference of mean value is used in region merging step, Converted watershed image by means of this methods separates effectively character region and background region applying to segmentation function. Average execution time on the previous method was 2.16 second and on this paper method was 1.72 second. We prove that this paper's method removed noise effectively with overlap stroke as compared with the previous method.

  • PDF