• 제목/요약/키워드: variable-node

검색결과 255건 처리시간 0.023초

입.출력 버퍼방식을 이용한 대용량 케이블 점검 시스템 설계 및 구현 (Design and Implementation of Large Capacity Cable Checking System using an I/O Buffer Method)

  • 양종원
    • 한국군사과학기술학회지
    • /
    • 제5권2호
    • /
    • pp.103-115
    • /
    • 2002
  • This paper describes the results on the design and implementation of large capacity cable checking system using I/O buffer method. The I/O buffer module which has feedback loops with input and output buffers is designed with logic gate in the VME board and controlled by MPC860 microprocessor. So this system can check a lot of cable at the same time with less size and less processing time than that of relay matrix method with the A/D converter. The size of the I/O buffer module can be variable according to the number of cable. And any type of cable can be checked even if the pin assignment of cable is changed.

Effects of Aperture Densitv Distribution on the Flow Through a Rock Fracture with Line-Source and Line-Collection

  • Park, Chung-Kyun;Hahn, Pil-So
    • Nuclear Engineering and Technology
    • /
    • 제30권6호
    • /
    • pp.485-495
    • /
    • 1998
  • Migration characteristics of tracers in a rock fracture in a case of line-source and line-collection was studied. The fracture plane was discretized into a square mesh to which variable apertures were assigned. The spatially varying apertures of a fracture were generated using a geostatistical method, based on a given aperture probability density distribution and a specified spatial correlation length. The flow potential and pressure at each node were computed. Calculations showed that fluid flow occurs predominantly through a few preferred paths. Hence, the large range of apertures in the fracture gives rise to flow channeling. The solute transport was calculated using a particle tracking method. The migration plumes of tracer between injection line and withdrawal line are displayed in contour plots. The elution curves are shown to be controlled by the aperture density distribution and to be insensitive to statistical realization and spatial correlation length.

  • PDF

Comparison of tree-based ensemble models for regression

  • Park, Sangho;Kim, Chanmin
    • Communications for Statistical Applications and Methods
    • /
    • 제29권5호
    • /
    • pp.561-589
    • /
    • 2022
  • When multiple classifications and regression trees are combined, tree-based ensemble models, such as random forest (RF) and Bayesian additive regression trees (BART), are produced. We compare the model structures and performances of various ensemble models for regression settings in this study. RF learns bootstrapped samples and selects a splitting variable from predictors gathered at each node. The BART model is specified as the sum of trees and is calculated using the Bayesian backfitting algorithm. Throughout the extensive simulation studies, the strengths and drawbacks of the two methods in the presence of missing data, high-dimensional data, or highly correlated data are investigated. In the presence of missing data, BART performs well in general, whereas RF provides adequate coverage. The BART outperforms in high dimensional, highly correlated data. However, in all of the scenarios considered, the RF has a shorter computation time. The performance of the two methods is also compared using two real data sets that represent the aforementioned situations, and the same conclusion is reached.

ATM 네트워크의 폭주제어를 위한 극점 배치를 갖는 견실 $H_{\infty}$ 제어기 설계 (Design of Robust $H_{\infty}$ Controller with Regional Pole Placements for Congestion Control in ATM Networks)

  • 김준기;정상섭;박홍배
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 하계종합학술대회 논문집(1)
    • /
    • pp.127-130
    • /
    • 2000
  • In this paper, we design the robust H$_{\infty}$ controller for congestion control in ATM (asynchronous transfer mode) networks with the variation of other higher priority sources(e.g., constant bit rate, variable bit rate). Since ABR (available bit rate) sources share the bottleneck node with other higher priority sources, we design the controller which guarantees robustness against time delay and disturbance. The proposed robust H$_{\infty}$ controller with regional pole placements can minimize the variation of the queue size at the predefined desired level. And we also show its robustness through simulation for the ATM networks with time delay and disturbance.

  • PDF

Improving the TCP Retransmission Timer Adjustment Mechanism for Constrained IoT Networks

  • Chansook Lim
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제16권1호
    • /
    • pp.29-35
    • /
    • 2024
  • TCP is considered as one of the major candidate transport protocols even for constrained IoT networks..In our previous work, we investigated the congestion control mechanism of the uIP TCP. Since the uIP TCP sets the window size to one segment by default, managing the retransmission timer is the primary approach to congestion control. However, the original uIP TCP sets the retransmission timer based on the fixed RTO, it performs poorly when a radio duty cycling mechanism is enabled and the hidden terminal problem is severe. In our previous work, we proposed a TCP retransmission timer adjustment scheme for uIP TCP which adopts the notion of weak RTT estimation of CoCoA, exponential backoffs with variable limits, and dithering. Although our previous work showed that the proposed retransmission timer adjustment scheme can improve performance, we observe that the scheme often causes a node to set the retransmission timer for an excessively too long time period. In this work, we show that slightly modifying the dithering mechanism of the previous scheme is effective for improving TCP fairness.

고차 MIMO 시스템을 위한 저 복잡도 병렬 구형 검출 알고리즘 (A Parallel Sphere Decoder Algorithm for High-order MIMO System)

  • 구지훈;김재훈;김용석;김재석
    • 전자공학회논문지
    • /
    • 제51권5호
    • /
    • pp.11-19
    • /
    • 2014
  • 본 논문에서는 고차 MIMO 시스템을 위한 저 복잡도의 병렬 구형 검출 알고리즘을 제안하였다. 제안된 알고리즘에서는 정적 가지치기와 가변 가능한 다수의 노드연산기에 의한 동적 가지치기 기법을 통해서 종래의 Fixed-complexity sphere decoder(FSD) 알고리즘 대비 더 낮은 복잡도를 갖게 되며, quasi-maximum likelihood 검출 성능을 보인다. 알고리즘과 함께 제안된 노드연산기 또한, 기존 구형검출기의 순차적 연산 구조를 갖는 노드 연산을 고정된 복잡도를 갖도록 제안하여 하드웨어 구현의 용이성을 제공한다. 16QAM 복조를 하는 고차 MIMO 무선통신의 몬테카를로 모의실험을 통해서, 종래의 저 복잡도를 갖는 FSD 알고리즘 대비, 제안된 알고리즘이 평균적으로 단 6.3%의 검출 시간이 증가되면서 평균 55% 탐색노드가 감소하여 연산 복잡도가 낮아지는 것을 보여주었다.

IEEE 802.15.6 기반 CSMA/CA 성능 향상에 관한 연구 (A Study on the CSMA/CA Performance Improvement based IEEE 802.15.6)

  • 이정재;김인환
    • 한국전자통신학회논문지
    • /
    • 제10권11호
    • /
    • pp.1225-1230
    • /
    • 2015
  • WBAN을 위한 MAC 프로토콜은 의료용 센서 노드의 가변적인 데이터를 효율적으로 처리하기 위해서 응급상황에서 발생하는 트래픽을 가장 높은 우선순위로 처리하는 CSMA/CA(: Carrier Sense Multiple Access with Collision Avoidance) 알고리즘을 수행하게 된다. 노드가 전송하는 응급 메시지는 충돌이 발생하게 되고 응급 메시지 재전송으로 인한 전송 지연이 발생할 수 있으며 재전송으로 인한 에너지 낭비를 가져올 수 있다. 본 논문에서는 이러한 문제점들을 개선하기 위해서 우선순위 큐잉을 적용한 CSMA/CA 알고리즘의 경우 MAC 명령어 프레임과 데이터 프레임의 우선순위를 정하여 서로 다른 백오프 파라미터를 적용하고 충돌로 인한 프레임 손실을 최소화하는 알고리즘을 제안하였다. 성능평가 결과 제안한 MAC 프로토콜을 사용했을 때가 IEEE 802.15.6을 사용했을때 보다 충돌 확률이 감소하여 패킷 전송 처리율이 증가하고 패킷 손실량이 감소함을 보였다.

상관 계수를 이용한 다층퍼셉트론의 계층별 학습 (A Layer-by-Layer Learning Algorithm using Correlation Coefficient for Multilayer Perceptrons)

  • 곽영태
    • 한국컴퓨터정보학회논문지
    • /
    • 제16권8호
    • /
    • pp.39-47
    • /
    • 2011
  • 다층퍼셉트론의 계층별 학습 방법의 하나인 Ergezinger 방법은 출력 노드가 1개로 구성되어 있고, 출력층의 가중치를 최소자승법으로 학습하기 때문에 출력층의 가중치에 조기포화 현상이 발생할 수 있다. 이런 조기 포화현상은 학습 시간과 수렴 속도에 장애가 된다. 따라서, 본 논문은 Ergezinger의 학습 방법을 출력층에서 벡터 형태로 학습할 수 있는 알고리즘으로 확대하고 학습 시간과수렴 속도를 개선하기 위해서 학습 상수를 도입한다. 학습상수는 은닉층 가중치 조정 시, 새로이 계산된 가중치와 기존 가중치의 상관 관계를 계산하여 학습 상수에 반영하는 가변적인 방법이다. 실험은 제안된 방법과 기존 방법의 비교를 위해서 iris 문제와 비선형 근사화 문제를 대상으로 실험하였다. 실험에서, 제안 방법은 기존 Ergezinger 방법보다 학습 시간과 수렴 속도에서 우수한 결과를 얻었으며, 상관 관계를 고려한 CPU time 측정에서도 제안한 방법이 기존 방법보다 약 35%의 시간을 절약할 수 있었다.

가족형 폐유육종증 (Familial Sarcoidosis, The First Report in Korea)

  • 엄완식;임채만;김우성;김동순;김원동
    • Tuberculosis and Respiratory Diseases
    • /
    • 제41권6호
    • /
    • pp.644-650
    • /
    • 1994
  • 어머니가 Stage 2 폐유육종증으로 진단 받고 치료된 후 4년만에 친 딸에서 X선상 폐문종대와 전방 포도막염이 발생하여, 기관지 폐생검 및 종격동경으로 실시한 종격동 임파선 생검으로 유육종증으로 진단된 가족형 유육종증이 우리나라에서는 처음 발견되어 문헌 고찰과 함께 보고하는 바이다.

  • PDF

Study on Dimensionality Reduction for Sea-level Variations by Using Altimetry Data around the East Asia Coasts

  • Hwang, Do-Hyun;Bak, Suho;Jeong, Min-Ji;Kim, Na-Kyeong;Park, Mi-So;Kim, Bo-Ram;Yoon, Hong-Joo
    • 대한원격탐사학회지
    • /
    • 제37권1호
    • /
    • pp.85-95
    • /
    • 2021
  • Recently, as data mining and artificial neural network techniques are developed, analyzing large amounts of data is proposed to reduce the dimension of the data. In general, empirical orthogonal function (EOF) used to reduce the dimension in the ocean data and recently, Self-organizing maps (SOM) algorithm have been investigated to apply to the ocean field. In this study, both algorithms used the monthly Sea level anomaly (SLA) data from 1993 to 2018 around the East Asia Coasts. There was dominated by the influence of the Kuroshio Extension and eddy kinetic energy. It was able to find the maximum amount of variance of EOF modes. SOM algorithm summarized the characteristic of spatial distributions and periods in EOF mode 1 and 2. It was useful to find the change of SLA variable through the movement of nodes. Node 1 and 5 appeared in the early 2000s and the early 2010s when the sea level was high. On the other hand, node 2 and 6 appeared in the late 1990s and the late 2000s, when the sea level was relatively low. Therefore, it is considered that the application of the SOM algorithm around the East Asia Coasts is well distinguished. In addition, SOM results processed by SLA data, it is able to apply the other climate data to explain more clearly SLA variation mechanisms.