• Title/Summary/Keyword: Weighting value

Search Result 351, Processing Time 0.043 seconds

Applicability of Preconsolidation Pressure Interpretations of Korean Marine Clays (국내 해성점토 지반에 대한 선행압밀압력 평가방법의 적용성)

  • Jeong, Sang-Guk
    • Journal of the Korean Geosynthetics Society
    • /
    • v.16 no.4
    • /
    • pp.93-101
    • /
    • 2017
  • In this study, a subjective weighting factors were awarded based on some indication of the difficulty of assessing the preconsolidation stress using traditional methods (Casagrande, Onitsuka et al., Silva, Becker et al., Janbu and Karlsrud methods) such as those proposed by Casagrande and Janbu using undisturbed sample obtained from Gwangyang dredged clay with high plasticity located in the southern area of Korean peninsular. These numbers only assess the relative ease of finding preconsolidation stress and say nothing regarding the accuracy of the value. The data were compared with measurements of undrained shear strength using strength incremental ratio, checking where or not the values are in the range of 0.25 to 0.35 (typical values of Korean marine clay) and analyzing standard deviation(degree of variability). The measurements of undrained shear strength were obtained from unconfined compression tests (UCT). When determining preconsolidation stress of Korean marine clay, at first, the work method proposed by Becker et al. and the bilogarithmic method proposed by Onitsuka et al. should be used. In addition, preconsolidation pressure should be estimated using the traditional Casagrande method as a basic of comparison.

Analysis of Parameters for the Off-Site Dose Calculation Due to HTO, oBT, and Radioactive Carbon Ingestion (국내 원자력발전소 주변 삼중수소 및 $^14C$ 섭취선량 평가 경로인자 분석)

  • 이갑복;정양근;방선영;엄희문
    • Proceedings of the Korean Radioactive Waste Society Conference
    • /
    • 2004.06a
    • /
    • pp.361-367
    • /
    • 2004
  • For assessment of tritium and radiocarbon ingestion dose to off site individuals, water, hydrogen, and carbon content of main farm produce of Korea were investigated to replace the existing data in K-DOSE60, the Offsite Dose Calculation Manual (ODCM) of Korea Hydro & Nuclear Power Co. Ltd, (KHNP). Main items and weighting factors of farm produce were determined with the nationwide food intake data in 2001, 2002. Main farm produce were sampled around Kori, Wolsong, Ulchin, Younggwang nuclear power sites, Content of each produce was multiplied by weighting factor and summed up to make the weighted mean group value For grains, water, hydrogen, and carbon content was not much different from the existing data currently used in K-DOSE60, but root vegetables had 3.5 times more hydrogen, and leafy vegetables and fruits had 0.7∼1.3 times more or less water, hydrogen, and carbon contents than K-DOSE60.

  • PDF

The Asymptotic Worst-Case Ratio of the Bin Packing Problem by Maximum Occupied Space Technique

  • Ongkunaruk, Pornthipa
    • Industrial Engineering and Management Systems
    • /
    • v.7 no.2
    • /
    • pp.126-132
    • /
    • 2008
  • The bin packing problem (BPP) is an NP-Complete Problem. The problem can be described as there are $N=\{1,2,{\cdots},n\}$ which is a set of item indices and $L=\{s1,s2,{\cdots},sn\}$ be a set of item sizes sj, where $0<sj{\leq}1$, ${\forall}j{\in}N$. The objective is to minimize the number of bins used for packing items in N into a bin such that the total size of items in a bin does not exceed the bin capacity. Assume that the bins have capacity equal to one. In the past, many researchers put on effort to find the heuristic algorithms instead of solving the problem to optimality. Then, the quality of solution may be measured by the asymptotic worst-case ratio or the average-case ratio. The First Fit Decreasing (FFD) is one of the algorithms that its asymptotic worst-case ratio equals to 11/9. Many researchers prove the asymptotic worst-case ratio by using the weighting function and the proof is in a lengthy format. In this study, we found an easier way to prove that the asymptotic worst-case ratio of the First Fit Decreasing (FFD) is not more than 11/9. The proof comes from two ideas which are the occupied space in a bin is more than the size of the item and the occupied space in the optimal solution is less than occupied space in the FFD solution. The occupied space is later called the weighting function. The objective is to determine the maximum occupied space of the heuristics by using integer programming. The maximum value is the key to the asymptotic worst-case ratio.

A study on a fast measuring algorithm of wavefront for an adaptive optics system (적응광학시스템의 고속 파면측정 알고리즘에 대한 연구)

  • 박승규;백성훈;서영석;김철중;박준식;나성웅
    • Korean Journal of Optics and Photonics
    • /
    • v.13 no.3
    • /
    • pp.251-257
    • /
    • 2002
  • The measuring resolution and speed for wavefronts are important to improve the performance of an adaptive optics system. In this paper, we propose a fast measuring algorithm with high resolution in the Shack-Hartmann wavefront sensor for an adaptive optics system. We designed ground isolated electrical devices whose differential data signals are used to control the deformable mirror and tip/tilt mirror for robust control. The conventional mass centroid algorithm in the Shack-Hartmann sensor to measure wavefront has been widely used and provided good measurement results. In this paper, the proposed fast measuring algorithm for measuring the wavefront combines the conventional mass centroid algorithm with a weighting factor. The weighting factor is a real value estimating the real center of mass in a wavefront spot image. This proposed wavefront measuring algorithm provided fast measurement results with high resolution from experimental tests.

An Improved Synthesis Method of Parametric Stereo Coding Based on Tonality Information (토널리티 정보를 기반으로 한 파라메트릭 스테레오 부호화의 개선된 합성 기법)

  • Lee, Tung chin;Park, Young-Cheol;Youn, Dae Hee
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.6
    • /
    • pp.221-227
    • /
    • 2014
  • In this paper, we propose a synthesis method that can effectively suppress the ambience which affects tonal components in the PS decoder. Ambience component was obtained by using decorrelation filter and the weighting of the ambience in the decoder was determined through IC parameter. However, since the parameters are extracted in the sub-band domain, a low IC value could be analyzed even if the tonal component is dominant. The quality of the output signal may be degraded. To prevent this problem, the tonality was measured in the downmixed signal and the weighting of the ambience components were adjusted appropriately according to the measured tonality index. The performance of the proposed method was evaluated by simulations. Furthermore, the subjective test was performed and the results confirmed that the proposed method offers improved quality.

OFDM Communication System Based on the IMD Reduction Method (IMD 저감 방식을 기반으로 하는 OFDM 통신 시스템)

  • Ryu, Heung-Gyoon
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.18 no.10
    • /
    • pp.1172-1180
    • /
    • 2007
  • OFDM system has very good high spectral efficiency and the robustness to the frequency-selective fading. Because of the high PAPR, OFDM signals can be distorted in nonlinear HPA(High Power Amplifier). So, to overcome the nonlinear distortion, it is very important to reduce the IMD value. With respect to the BER performance, IMD reduction method is better than the PAPR reduction method. However, IMD reduction method has much more system complexity because of the additional FFT processor in transmitter. In this paper, we study the OFDM communication system based on the IMD reduction method using SPW method. A new IMD reduction method is proposed to reduce the computational complexity. SPW method is to divide the input OFDM data into several sub-blocks and to multiply phase weighting values with each sub-blocks for the reduction of PAPR or IMD. Unlike the conventional method, the system size and computational complexity can be reduced.

Design of Lazy Classifier based on Fuzzy k-Nearest Neighbors and Reconstruction Error (퍼지 k-Nearest Neighbors 와 Reconstruction Error 기반 Lazy Classifier 설계)

  • Roh, Seok-Beom;Ahn, Tae-Chon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.1
    • /
    • pp.101-108
    • /
    • 2010
  • In this paper, we proposed a new lazy classifier with fuzzy k-nearest neighbors approach and feature selection which is based on reconstruction error. Reconstruction error is the performance index for locally linear reconstruction. When a new query point is given, fuzzy k-nearest neighbors approach defines the local area where the local classifier is available and assigns the weighting values to the data patterns which are involved within the local area. After defining the local area and assigning the weighting value, the feature selection is carried out to reduce the dimension of the feature space. When some features are selected in terms of the reconstruction error, the local classifier which is a sort of polynomial is developed using weighted least square estimation. In addition, the experimental application covers a comparative analysis including several previously commonly encountered methods such as standard neural networks, support vector machine, linear discriminant analysis, and C4.5 trees.

Correlation-based Automatic Image Captioning (상호 관계 기반 자동 이미지 주석 생성)

  • Hyungjeong, Yang;Pinar, Duygulu;Christos, Falout
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.10
    • /
    • pp.1386-1399
    • /
    • 2004
  • This paper presents correlation-based automatic image captioning. Given a training set of annotated images, we want to discover correlations between visual features and textual features, so that we can automatically generate descriptive textual features for a new unseen image. We develop models with multiple design alternatives such as 1) adaptively clustering visual features, 2) weighting visual features and textual features, and 3) reducing dimensionality for noise sup-Pression. We experiment thoroughly on 10 data sets of various content styles from the Corel image database, about 680MB. The major contributions of this work are: (a) we show that careful weighting visual and textual features, as well as clustering visual features adaptively leads to consistent performance improvements, and (b) our proposed methods achieve a relative improvement of up to 45% on annotation accuracy over the state-of-the-art, EM approach.

PTS Technique Based on Micro-Genetic Algorithm with Low Computational Complexity (낮은 계산 복잡도를 갖는 마이크로 유전자 알고리즘 기반의 PTS 기법)

  • Kong, Min-Han;Song, Moon-Kyou
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.6C
    • /
    • pp.480-486
    • /
    • 2008
  • The high peak-to-average power ratio (PAPR) of the transmitted signals is one of major drawbacks of the orthogonal frequency division multiplexing (OFDM). A partial transmit sequences (PTS) technique can improve the PAPR statistics of OFDM signals. However, in a PTS technique, the search complexity to select phase weighting factors increases exponentially with the number of sub-blocks. In this paper, a PTS technique with low computational complexity is presented, which adopts micro-genetic algorithm(${\mu}$-GA) as a search algorithm. A search on the phase weighting factors starts with a population of five randomly generated individuals. An elite having the largest fitness value and the other four individuals selected through the tournament selection strategy are determined, and then the next generation members are generated through the crossover operations among those. If the new generation converges, all the four individuals except the elite are randomly generated again. The search terminates when there has been no improvements on the PAPR during the predefined number of generations, or the maximum number of generations has been reached. To evaluate the performance of the proposed PTS technique, the complementary cumulative distribution functions (CCDF) of the PAPR are compared with those of the conventional PTS techniques.

Robust Lane Detection Method in Varying Road Conditions (도로 환경 변화에 강인한 차선 검출 방법)

  • Kim, Byeoung-Su;Kim, Whoi-Yul
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.49 no.1
    • /
    • pp.88-93
    • /
    • 2012
  • Lane detection methods using camera, which are part of the driver assistance system, have been developed due to the growth of the vehicle technologies. However, lane detection methods are often failed by varying road conditions such as rainy weather and degraded lanes. This paper proposes a method for lane detection which is robust in varying road condition. Lane candidates are extracted by intensity comparison and lane detection filter. Hough transform is applied to compute the lane pair using lane candidates which is straight line in image. Then, a curved lane is calculated by using B-Snake algorithm. Also, weighting value is computed using previous lane detection result to detect the lanes even in varying road conditions such as degraded/missed lanes. Experimental results proved that the proposed method can detect the lane even in challenging road conditions because of weighting process.