• Title/Summary/Keyword: 계수 탐색

Search Result 370, Processing Time 0.021 seconds

Bivariate skewness, kurtosis and surface plot (이변량 왜도, 첨도 그리고 표면그림)

  • Hong, Chong Sun;Sung, Jae Hyun
    • Journal of the Korean Data and Information Science Society
    • /
    • v.28 no.5
    • /
    • pp.959-970
    • /
    • 2017
  • In this study, we propose bivariate skewness and kurtosis statistics and suggest a surface plot that can visually implement bivariate data containing the correlation coefficient. The skewness statistic is expressed in the form of a paired real values because this represents the skewed directions and degrees of the bivariate random sample. The kurtosis has a positive value which can determine how thick the tail part of the data is compared to the bivariate normal distribution. Moreover, the surface plot implements bivariate data based on the quantile vectors. Skewness and kurtosis are obtained and surface plots are explored for various types of bivariate data. With these results, it has been found that the values of the skewness and kurtosis reflect the characteristics of the bivariate data implemented by the surface plots. Therefore, the skewness, kurtosis and surface plot proposed in this paper could be used as one of valuable descriptive statistical methods for analyzing bivariate distributions.

Firework Plot as a Graphical Exploratory Data Analysis Tool to Evaluate the Impact of Outliers in a Mixture Experiment (혼합물 실험에서 특이값의 영향을 평가하기 위한 그래픽 탐색적 자료분석 도구로서의 불꽃그림)

  • Jang, Dae-Heung;Ahn, SoJin;Kim, Youngil
    • The Korean Journal of Applied Statistics
    • /
    • v.27 no.4
    • /
    • pp.629-643
    • /
    • 2014
  • It is common to check the validity of an assumed model with the heavy use of diagnostics tools when conducting data analysis with regression techniques; however, outliers and influential data points often distort the regression output in undesired manner. Jang and Anderson-Cook (2013) proposed a graphical method called a firework plot for exploratory analysis that could visualize the trace of the impact of possible outlying and/or influential data points on individual regression coefficients and the overall residual sum of squares(SSE) measure. They developed 3-D plot as well as pair-wise plot for the appropriate measures of interest. In this paper, the approach was extended further to tell the strength of their approach; in addition, a more meaningful interpretation was possible by adding a measure not mentioned in their paper. This approach was applied to the mixture experiment because we felt that a detailed analysis of statistical measure sensitivity is required in a small experiment.

A Study on the Detection Range of Acoustic Instruments for Fisheries (수산음향계측장치의 탐지범위에 대한 연구)

  • Park, Ju-Sam
    • Journal of the Korean Society of Fisheries and Ocean Technology
    • /
    • v.41 no.1
    • /
    • pp.54-63
    • /
    • 2005
  • Detection ranges of acoustic instruments mainly used for fisheries and their research are derived as the range bordered by a certain signal-to-noise ration (SNR) thershold. The SNR is depicted by several factors on transmitting and receiving, sound propagation, scattering by objects, and mainly self-ship noise. The detection ranges are shown for several fisheries instrument, such as echo sounder, quantiative echo sounder, and bio-telemetry system. The results can be used for designing the instruments, examining the capability of user's own instruments, and interpreting obtained data or echograms. Increasing transmitting power is not as effective for high frequencies as for low frequencies to increase the detection range. Comparison of volume backscattering strengths obtained by the quantitative echo sounder at several frequencies should be done within the same detection range. By applying the concept of the detection range for the bio-telemetry receiver beams, the number of the beams and the beamwidths can be determined.

A Study on the Optimization for Brokering Between Cargos and Ships (선박을 이용한 화물 운송 중개 최적화 방안 연구)

  • Seo Sang-Koo
    • Journal of Internet Computing and Services
    • /
    • v.5 no.4
    • /
    • pp.53-62
    • /
    • 2004
  • This paper presents a study on the optimization for brokering between cargos and ships for future e-logistics. The primary contribution of this research is that we establish an optimization model by formalizing the criteria for the brokering such as time constraints, weight constraints, and preference values between cargos and ships. Another important contribution is that we not only investigate the complexity and the tractability of the optimal brokering problem but present how to evaluate the performance of the optimization program through an experiment. We first derive the preference values between cargos and ships using the time and the weight constraints. These preference values between each pair of cargos and ships are assigned to corresponding binary decision variables as coefficients in the objective function. The optimization model selects pairs of cargos and ships in a way that the sum of the preference values is maximized while satisfying given constraints. Experiment shows that the Davis-Putnam based optimization program finds optimal solutions in reasonable time for the problems with less than 90 decision variables.

  • PDF

A Genetic Algorithm for Trip Distribution and Traffic Assignment from Traffic Counts in a Stochastic User Equilibrium (사용자 평형을 이루는 통행분포와 통행배정을 위한 유전알고리즘)

  • Sung, Ki-Seok
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • pp.599-617
    • /
    • 2006
  • A network model and a Genetic Algorithm(GA) is proposed to solve the simultaneous estimation of the trip distribution and traffic assignment from traffic counts in the congested networks in a logit-based Stochastic User Equilibrium (SUE). The model is formulated as a problem of minimizing the non-linear objective functions with the linear constraints. In the model, the flow-conservation constraints of the network are utilized to restrict the solution space and to force the link flows meet the traffic counts. The objective of the model is to minimize the discrepancies between the link flows satisfying the constraints of flow-conservation, trip production from origin, trip attraction to destination and traffic counts at observed links and the link flows estimated through the traffic assignment using the path flow estimator in the legit-based SUE. In the proposed GA, a chromosome is defined as a vector representing a set of Origin-Destination Matrix (ODM), link flows and travel-cost coefficient. Each chromosome is evaluated from the corresponding discrepancy, and the population of the chromosome is evolved by the concurrent simplex crossover and random mutation. To maintain the feasibility of solutions, a bounded vector shipment is applied during the crossover and mutation.

  • PDF

A Training Algorithm for the Transform Trellis Code with Applications to Stationary Gaussian Sources and Speech (정상 가우시안 소오스와 음성 신호용 변환 격자 코드에 대한 훈련 알고리즘 개발)

  • Kim, Dong-Youn;Park, Yong-Seo;Whang, Keum-Chan;Pearlman, William A.
    • The Journal of the Acoustical Society of Korea
    • /
    • v.11 no.1
    • /
    • pp.22-34
    • /
    • 1992
  • There exists a transform trellis code that is optimal for stationary Gaussian sources and the squared-error distortion measure at all rates. In this paper, we train an asymptotically optimal version of such a code to obtain one which is matched better to the statistics of real world data. The training algorithm uses the M algorithm to search the trellis codebook and the LBG algorithm to update the trellis codebook. We investigate the trained transform trellis coding scheme for the first-order AR(autoregressive) Gaussian source whose correlation coefficient is 0.9 and actual speech sentences. For the first-order AR source, the achieved SNR for the test sequence is from 0.6 to 1.4 dB less than the maximum achievable SNR as given by Shannon's rate-distortion function for this source, depending on the rate and surpasses all previous known results for this source. For actual speech data, to achieve improved performance, we use window functions and gain adaptation at rate 1.0 bits/sample.

  • PDF

Premixture Composition Optimization for the Ram Accelerator Performance Enhancement (램 가속기 성능 향상을 위한 예 혼합기 조성비 최적화에 관한 연구)

  • 전용희;이재우;변영환
    • Journal of the Korean Society of Propulsion Engineers
    • /
    • v.4 no.2
    • /
    • pp.21-30
    • /
    • 2000
  • Numerical design optimization techniques are implemented for the improvement of the ram accelerator performance. The design object is to find the minimum ram tube length required to accelerate projectile from initial velocity $V_o$ to target velocity $V_e$. The premixture is composed of $H_2$, $O_2$, $N_2$ and the mole numbers of these species are selected as design variables. The objective function and the constraints are linearized during the optimization process and gradient-based Simplex method and SLP(Sequential Linear Programming) have been employed. With the assumption of two dimensional inviscid flow for internal flow field, the analyses of the nonequilibrium chemical reactions for 8 steps 7 species have been performed. To determined the tube length, ram tube internal flow field is assumed to be in a quasi-steady state and the flow velocity is divided into several subregions with equal interval. Hence the thrust coefficients and accelerations for corresponding subregions are obtained and integrated for the whole velocity region. With the proposed design optimization techniques, the total ram tube length had been reduced 19% within 7 design iterations. This optimization procedure can be directly applied to the multi-stage, multi-premixture ram accelerator design optimization problems.

  • PDF

Analyzing Problem Instance Space Based on Difficulty-distance Correlation (난이도-거리 상관관계 기반의 문제 인스턴스 공간 분석)

  • Jeon, So-Yeong;Kim, Yong-Hyuk
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.4
    • /
    • pp.414-424
    • /
    • 2012
  • Finding or automatically generating problem instance is useful for algorithm analysis/test. The topic has been of interest in the field of hardware/software engineering and theory of computation. We apply objective value-distance correlation analysis to problem spaces, as previous researchers applied it to solution spaces. According to problems, we define the objective function by (1) execution time of tested algorithm or (2) its optimality; this definition is interpreted as difficulty of the problem instance being solved. Our correlation analysis is based on the following aspects: (1) change of correlation when we use different algorithms or different distance functions for the same problem, (2) change of that when we improve the tested algorithm, (3) relation between a problem instance space and the solution space for the same problem. Our research demonstrates the way of problem instance space analysis and will accelerate the problem instance space analysis as an initiative research.

CTE with weighted portfolios (가중 포트폴리오에서의 CTE)

  • Hong, Chong Sun;Shin, Dong Sik;Kim, Jae Young
    • Journal of the Korean Data and Information Science Society
    • /
    • v.28 no.1
    • /
    • pp.119-130
    • /
    • 2017
  • In many literatures on VaR and CTE for multivariate distribution, these are estimated by using transformed univariate distribution with a specific ratio of many kinds of portfolios. Even though there are lots of works to define quantiles for multivariate distributions, there does not exist a quantile uniquely. Hence, it is not easy to define the VaR and CTE. In this paper, we propose the weighted CTE vectors corresponding to various ratio combinations of many kinds of portfolios by extending the researches on the alternative VaR and integrated multivariate CTE based on multivariate quantiles. We extend relation equations about univariate CTEs to multivariate CTE vectors and discuss their characteristics. The proposed weighted CTEs are explored with some data from multivariate normal distribution and illustrative examples.

On Representations of Linear Systems and Analysis for the Meaning of Elimination Method (연립일차방정식의 다양한 표현과 소거법의 의미에 관한 연구)

  • Kim, Jin Hwan;Park, Kyo Sik
    • School Mathematics
    • /
    • v.17 no.3
    • /
    • pp.407-421
    • /
    • 2015
  • Linear system is a basic subject matter of school mathematics courses. Even though elimination is a useful method to solve linear systems, its fundamental principles were not discussed pedagogically. The purpose of this study is to help the development of mathematical content knowledge on linear systems conceptions. To do this, various representations and translations among them were considered, and in particular, the basic principles for elimination method are analyzed geometrically. Rectangular representation is used to solve word problem treated in numbers of things in elementary mathematics and it is useful as a pre-stage to introduce elimination. Slopes and intercepts of lines associated linear equations are used to obtain the Cramer's formula and this solving method was showing the connection between algebraic and geometric procedures. Strategy deleting variables of linear systems by elementary operations is explored and associated with the movements of lines in the family of lines passing through a fixed point. The development of mathematical content knowledge is expected to enhance pedagogical content knowledges.