• 제목/요약/키워드: binary model

검색결과 1,081건 처리시간 0.027초

다중 패턴 분류를 위한 Import Vector Voting 모델 (Import Vector Voting Model for Multi-pattern Classification)

  • 최준혁;김대수;임기욱
    • 한국지능시스템학회논문지
    • /
    • 제13권6호
    • /
    • pp.655-660
    • /
    • 2003
  • 일반적으로 Support Vector Machine은 이진 분류 모형에 있어 우수한 성능을 보이지만 모델의 한계로 인하여 다중 패턴의 분류 문제에는 쉽게 적용하기가 어렵다. 본 논문에서는 이진 분류를 포함한 다중 레이블을 갖는 데이터의 정확한 패턴 분류를 위하여 Zhu가 제안한 Import Vector Machine에 커널 Bagging 전략을 적용하여 분류의 정확성을 향상시키기 위한 Import Vector Voting 모형을 제안한다. 이러한 Import Vector Voting 모형은 다수의 커널함수를 적용한 결과 중에서 가장 성능이 우수한 커널함수를 이용하여 최종 분류를 수행하기 위한 voting 전략으로 사용한다. 본 논문에서 제안하는 Import Vector Voting 모형은 이진 분류를 포함한 3개 이상의 다중 패턴 데이터에 대한 분류 문제에 있어 매우 정확한 분류 성능을 보임을 실험을 통해 입증한다.

The Confidence Intervals for Logistic Model in Contingency Table

  • Cho, Tae-Kyoung
    • Communications for Statistical Applications and Methods
    • /
    • 제10권3호
    • /
    • pp.997-1005
    • /
    • 2003
  • We can use the logistic model for categorical data when the response variables are binary data. In this paper we consider the problem of constructing the confidence intervals for logistic model in I${\times}$J${\times}$2 contingency table. These constructions are simplified by applying logit transformation. This transforms the problem to consider linear form which called the logit model. After obtaining the confidence intervals for the logit model, the reverse transform is applied to obtain the confidence intervals for the logistic model.

접촉형 쌍성의 진화 검증을 위한 TY UMa의 CCD 측광관측 (CCD PHOTOMETRY OF W UMa TYPE BINARY TY UMa)

  • 강영운;황창덕;이희원;김천휘
    • Journal of Astronomy and Space Sciences
    • /
    • 제18권1호
    • /
    • pp.55-62
    • /
    • 2001
  • W UMa 형 쌍성 TY UMa를 소백산천문대 61cm 반사망원경과 PM512 CCD 카메라를 이용하여 2001년 3월 19일부터 21일까지 3일간 측광관측하여 광도곡선을 완성하였다. 광도곡선의 형태는 제 2극심이 제 1극심보다 더 깊고, 식 바같부분의 max 1은 max II에 비하여 평균 $0.^m023$밝게 나타나는 비대칭이다. 비대칭 광도곡선을 분석하기 위하여 흑점 모델을 도입하고, Wilson & Devinney의 차등보정법을 이용하여 측광학적인 해를 구하였다.

  • PDF

셀 룰라 발진기 네트웍을 이용한 새로운 2진 주파수 편이 변조 기법 (A New Binary Frequency Shift Keying Technique Using Cellular Oscillator Networks)

  • 원은주;강성묵;최종호;문규
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 하계종합학술대회 논문집(2)
    • /
    • pp.258-261
    • /
    • 2000
  • In this paper, the design of Binary FSK Using Cellular Oscillator Network architecture is newly introduced and analyzed. With its easy frequency controllability and MHz range of quadrature signals, the Cellular Oscillator Network can be used in RF communication systems. Binary Frequency Shift Keying can also be implemented through digital loop-path switching. This FSK model is simulated and proved with typical 3V, 0.5$\mu\textrm{m}$ CMOS N-well process parameters.

  • PDF

III-V족 반도체에서 계단형 pn 접합의 해석적 항복전압 모델 (Analytical Model of Breakdown Voltages for Abrupt pn Junctions in III-V Binary Semiconductors)

  • 정용성
    • 대한전자공학회논문지SD
    • /
    • 제41권9호
    • /
    • pp.1-9
    • /
    • 2004
  • III-V족 반도체 GaP GaAs 및 InP의 계단형 pn 접합에서의 항복전압을 위한 해석적 식을 유도하였다. 해석적 항복전압을 위해 각 물질에 대한 이온화계수 파라미터를 이용하여 유효 이온화계수를 추출하였고, 이의 이온화 적분을 통해 얻은 해석적 항복전압 결과는 수치적 결과 및 실험 결과와 10% 오차 범위 이내로 잘 일치하였다.

환자 우선순위를 고려한 수술실 예약 : 이진검색을 활용한 수정 평가치반복법 (Operating Room Reservation Problem Considering Patient Priority : Modified Value Iteration Method with Binary Search)

  • 민대기
    • 산업공학
    • /
    • 제24권4호
    • /
    • pp.274-280
    • /
    • 2011
  • Delayed access to surgery may lead to deterioration in the patient condition, poor clinical outcomes, increase in the probability of emergency admission, or even death. The purpose of this work is to decide the number of patients selected from a waiting list and to schedule them in accordance with the operating room capacity in the next period. We formulate the problem as an infinite horizon Markov Decision Process (MDP), which attempts to strike a balance between the patient waiting times and overtime works. Structural properties of the proposed model are investigated to facilitate the solution procedure. The proposed procedure modifies the conventional value iteration method along with the binary search technique. An example of the optimal policy is provided, and computational results are given to show that the proposed procedure improves computational efficiency.

Comparison of Haseman-Elston Linkage Tests with Age-of-Onset or Affection Trait

  • Jung, Kyoung-Hee;Song, Hae-Hiang
    • Communications for Statistical Applications and Methods
    • /
    • 제13권3호
    • /
    • pp.635-649
    • /
    • 2006
  • In this paper, we perform a simulation study of genetic model-free age-of-onset methods in linkage tests which has been proposed by Zhu et al. (1997). They performe. Haseman-Elston regression on a set of bipolar pedigree data using each of three dependent variables: a binary trait indicating disease concordance or discordance, a binary trait adjusted for age-of-onset, and the residuals from a survival analysis. We compare the powers of the proposed test statistics for various situations. Simulations that we have carried out show that the gains in power are observed when the residuals from a survival analysis are used in linkage tests.

이진 페트리 네트의 메모리-베이스 구현을 기본으로 하는 프로그래머블 제어기에 관한 연구 (A programmable controller based on the memory-based implementation of a binary-petri net)

  • 장래혁;박재현;노갑선;권욱현
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
    • /
    • pp.342-347
    • /
    • 1993
  • For a fast evolution, a memory-based implementation of a petri net is discussed. A sub-class petri net model called B-petri net is suggested to make a memory-based implementation feasible in a large size application. The suggested B-petri net is a binary-petri net since only a binary-typed decision, fork and join are allowed. The application of a B-petri nt is focused to a SFC(sequential function chart) program. The memory requirement, speed and computational load are compared with a petri net when they are implementated by a memory-based method.

  • PDF

PC카메라와 일반광학현미경을 이용한 빵효모 배양액의 효모세포 자동계수 (Automatic Counting of Yeast Cells in Baker's Yeast Culture Using PC Camera and Conventional Light Microscope)

  • 이형춘
    • KSBB Journal
    • /
    • 제26권1호
    • /
    • pp.87-91
    • /
    • 2011
  • Automatic counting of yeast cells in baker's yeast culture was tried using a conventional light microscope equipped with a pc camera. Relatively good binary image was obtained by using white LED as microscope light source, but uneven brightness distribution in original image hindered counting accuracy. A block binarization method using local thresholds proportional to local brightnesses was used to get improved binary images. The brightnesses of the blocks were expressed as the value component in HSV color model. Good quality binary images were obtained by binarization on $8{\times}6$ blocks of original images and connected-component labelling of the binarized images produced reliable counting results in the concentration range $1.4{\times}10^5/mL{\sim}1.4{\times}10^7\;cells/mL$.

무인차량의 주행성능을 고려한 장애물 격자지도 기반의 지역경로계획 (A Local Path Planning Algorithm considering the Mobility of UGV based on the Binary Map)

  • 이영일;이호주;고정호
    • 한국군사과학기술학회지
    • /
    • 제13권2호
    • /
    • pp.171-179
    • /
    • 2010
  • A fundamental technology of UGV(Unmanned Ground Vehicle) to perform a given mission with success in various environment is a path planning method which generates a safe and optimal path to the goal. In this paper, we suggest a local path-planning method of UGV based on the binary map using world model data which is gathered from terrain perception sensors. In specially, we present three core algorithms such as shortest path computation algorithm, path optimization algorithm and path smoothing algorithm those are used in the each composition module of LPP component. A simulation is conducted with M&S(Modeling & Simulation) system in order to verify the performance of each core algorithm and the performance of LPP component with scenarios.