• Title/Summary/Keyword: modify

Search Result 2,575, Processing Time 0.026 seconds

The Acoustical Characteristics of an Interference-type Noise Barrier (간섭형 방음벽의 음향특성)

  • 이우섭;정성수;서상준;전오성
    • Journal of KSNVE
    • /
    • v.10 no.3
    • /
    • pp.517-522
    • /
    • 2000
  • This study is concerned with the acoustic characteristics for recently developed interference-type noise barrier (T-shaped). To modify the previous shape more conveniently the T-shaped noise barrier with tuning partitions was examined in detail by varying the number and the hight of tuning partitions. The 2-D boundary element method(BEM) analysis were compared with the experimental results of 1/10 reduced scale model.

  • PDF

The Characteristics of Fiber Optic Sensor on the Surface Roughness of Target (측정대상물의 표면조도에 따른 광파이버 센서 특성고찰)

  • 박한수;정택구;홍준희;이동주
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2002.05a
    • /
    • pp.283-286
    • /
    • 2002
  • In fiber optic sensor, the error of the measurement is influenced by the surface roughness of the target and surroundings, especially the outside light. To reduce or modify this error, the sensitivity of the fiber optic sensor and the noise change by the surface roughness of the target should be known. The purpose of this paper is to observe the sensitivity of the fiber optic sensor and the noise according to the surface roughness of the target.

  • PDF

A Note on the Median Control Chart

  • Park, Hyo-Il
    • Communications for Statistical Applications and Methods
    • /
    • v.20 no.2
    • /
    • pp.107-113
    • /
    • 2013
  • This study reviews several well-known control charts for the location parameter with a discussion of the relationship between the maintenance of the control chart and a series of hypotheses testing. As a by-product, we then propose a new median control chart with the sign test statistic. We also modify the nonparametric control charts to easily understand the relation. Then we illustrate the construction of several median control charts with the industrial data and compare the efficiency among several control charts. Finally, we discuss some interesting features for the median control charts as concluding remarks.

Modify of TCP Vegas for improvement of fairness (공정성 향상을 위한 TCP Vegas의 개선)

  • 이정재;채현석;최명렬
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.04a
    • /
    • pp.211-213
    • /
    • 2002
  • TCP Vegas는 TCP Reno에 비해 효율성과 안전성 측면에서 보다 나은 성능을 보이고 있으나, 두 버전이 같이 사용되는 경우 충분한 성능을 발휘하지 못하여 공정성에 문제점을 드러내고 있다. 본 논문에서는 TCP Vegas의 알고리즘에서 사용하는 상수 요소인 $\alpha$, $\beta$ 값의 변화에 의해 TCP Reno 버전과의 공정성이 향상되는 사실을 시뮬레이션을 통해 확인하였으며, 이에 따른 향후 연구과제를 제시하였다.

  • PDF

A Study on the Design of Compensated Fuzzy Controller (보상형 퍼지 제어기 설계에 관한 연구)

  • 추연규;탁한호
    • Journal of the Korean Institute of Navigation
    • /
    • v.24 no.3
    • /
    • pp.141-145
    • /
    • 2000
  • In servo-system which need fast response and accuracy, PID controller has a good steady-state performance, but has a poor transient response performance causing a load be changed. Compared to these features, FLC(Fuzzy Logic Controller) has a good transient response performance for changed load, but has a little Poor steady-state performance. In this paper, Compensated Fuzay Controller which consists of PID controller and FLC is proposed to modify these disadvantages and is examined through simulation to evaluate its functions.

  • PDF

Path based K-means Clustering for RFID Data Sets

  • Yun, Hong-Won
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.4
    • /
    • pp.434-438
    • /
    • 2008
  • Massive data are continuously produced with a data rate of over several terabytes every day. These applications need effective clustering algorithms to achieve an overall high performance computation. In this paper, we propose ancestor as cluster center based approach to clustering, the K-means algorithm using ancestor. We modify the K-means algorithm. We present a clustering architecture and a clustering algorithm that minimize of I/Os and show a performance with excellent. In our experimental performance evaluation, we present that our algorithm can improve the I/O speed and the query processing time.

Atopic dermatitis (아토피피부염)

  • Pyun, Bok Yang
    • Clinical and Experimental Pediatrics
    • /
    • v.49 no.6
    • /
    • pp.589-592
    • /
    • 2006
  • Atopic dermatitis is estimated to affect 15-20% of the childhood population and there id considerable evidence that the prevalence is increasing. But it is frequently under diagnosed and inappropriately treated yet. Atopic dermatitis can have a large social;. emotional and financial effect on the child and their family. Atopic dermatitis also commonly predated the development of asthma and allergic rhinitis. Therefore early diagnosis and proper treatment are the key for control the atopic dermatitis itself and modify the future repiratory allergies. This review will cover the new diagnostic criteria and treatment briefly.

A Study on Goodness-of-fit Test for Density with Unknown Parameters

  • Hang, Changkon;Lee, Minyoung
    • Communications for Statistical Applications and Methods
    • /
    • v.8 no.2
    • /
    • pp.483-497
    • /
    • 2001
  • When one fits a parametric density function to a data set, it is usually advisable to test the goodness of the postulated model. In this paper we study the nonparametric tests for testing the null hypothesis against general alternatives, when the null hypothesis specifies the density function up to unknown parameters. We modify the test statistic which was proposed by the first author and his colleagues. Asymptotic distribution of the modified statistic is derived and its performance is compared with some other tests through simulation.

  • PDF

INVERSE CONSTRAINED MINIMUM SPANNING TREE PROBLEM UNDER HAMMING DISTANCE

  • Jiao, Li;Tang, Heng-Young
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.1_2
    • /
    • pp.283-293
    • /
    • 2010
  • In this paper, inverse constrained minimum spanning tree problem under Hamming distance. Such an inverse problem is to modify the weights with bound constrains so that a given feasible solution becomes an optimal solution, and the deviation of the weights, measured by the weighted Hamming distance, is minimum. We present a strongly polynomial time algorithm to solve the inverse constrained minimum spanning tree problem under Hamming distance.